Pseudozeros of polynomials and pseudospectra of companion matrices
From MaRDI portal
Publication:1338813
DOI10.1007/s002110050069zbMath0808.65053OpenAlexW2024786759MaRDI QIDQ1338813
Kim-Chuan Toh, Lloyd N. Threfethen
Publication date: 21 November 1994
Published in: Numerische Mathematik (Search for Journal in Brave)
Full work available at URL: https://hdl.handle.net/1813/6130
Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Numerical computation of matrix norms, conditioning, scaling (65F35) Numerical computation of solutions to single equations (65H05) Numerical solution of nonlinear eigenvalue and eigenvector problems (65H17)
Related Items
Eigenvalue condition numbers and pseudospectra of Fiedler matrices, Pseudozeros of multivariate polynomials, Robust plotting of generalized lemniscates, Polynomial root computation by means of the LR algorithm, A composite polynomial zerofinding matrix algorithm, Accurate solution of polynomial equations using Macaulay resultant matrices, A verified method for bounding clusters of zeros of analytic functions, Computing the zeros, maxima and inflection points of Chebyshev, Legendre and Fourier series: solving transcendental equations by spectral interpolation and polynomial rootfinding, Bounds for the zeros of polynomials from eigenvalues and singular values of some companion matrices, Error analysis of signal zeros: A projected companion matrix approach, A real QZ algorithm for structured companion pencils, On generating Sobolev orthogonal polynomials, Chebyshev rootfinding via computing eigenvalues of colleague matrices: when is it stable?, Computing the topology of a real algebraic plane curve whose defining equations are available only ``by values, Inverse power and Durand-Kerner iterations for univariate polynomial root-finding, Stability of rootfinding for barycentric Lagrange interpolants, The equivalence of the constrained Rayleigh quotient and Newton methods for matrix polynomials expressed in different polynomial bases along with the confluent case, Accuracy assessment for eigencomputations: Variety of backward errors and pseudospectra, An iterative method for computing robustness of polynomial stability, Perturbation bounds for polynomials, An iterated eigenvalue algorithm for approximating roots of univariate polynomials, Polynomial Roots from Companion Matrix Eigenvalues, On the geometry of Graeffe iteration, Root neighborhoods, generalized lemniscates, and robust stability of dynamic systems, Error analysis of signal zeros from a related companion matrix eigenvalue problem., Calculating the Discrete Spectrum of the Transport Operator with Arbitrary Order Anisotropic Scattering, Real and complex pseudozero sets for polynomials with applications, Calculating near-singular eigenvalues of the neutron transport operator with arbitrary order anisotropic scattering, Implicit QR for companion-like pencils, Unnamed Item, Krylov Method Revisited with an Application to the Localization of Eigenvalues, Continuation methods for the computation of zeros of Szegő polynomials, A CMV-Based Eigensolver for Companion Matrices, Fast and Backward Stable Computation of Roots of Polynomials, More on pseudospectra for polynomial eigenvalue problems and applications in control theory
Uses Software
