Remark on Algorithm 405: Roots of Matrix Pencils: The Generalized Eigenvalue Problem [F2]
References
Recommendations
Algorithm 405: roots of matrix pencils: the generalized eigenvalue problem [F2]
* This work was supported by the US National Aeronautics and Space Administration, by the National Science Foundation under Grant GS-2703 to the University of Chicago, and by the US Office of Naval Research under Grant NONR 760(24) NR 047-048 to ...
Computing the Roots of Complex Orthogonal and Kernel Polynomials
A method is presented to compute the roots of complex orthogonal and kernel polynomials. An important application of complex kernel polynomials is the acceleration of iterative methods for the solution of nonsymmetric linear equations.In the real case, ...
Eigenvalue condition numbers and pseudospectra of Fiedler matrices
The aim of the present paper is to analyze the behavior of Fiedler companion matrices in the polynomial root-finding problem from the point of view of conditioning of eigenvalues. More precisely, we compare: (a) the condition number of a given root $${\...
Comments
Information & Contributors
Information
Published In
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Check for updates
Author Tags
Qualifiers
- Article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 260Total Downloads
- Downloads (Last 12 months)34
- Downloads (Last 6 weeks)6
Other Metrics
Citations
View Options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in