Expressing a polynomial as the characteristic polynomial of a symmetric matrix
From MaRDI portal
Publication:2640669
DOI10.1016/0024-3795(90)90323-5zbMath0721.15005OpenAlexW2023818677MaRDI QIDQ2640669
Publication date: 1990
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0024-3795(90)90323-5
Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Eigenvalues, singular values, and eigenvectors (15A18) Hermitian, skew-Hermitian, and related matrices (15B57) Numerical computation of solutions to single equations (65H05) Polynomials in real and complex fields: location of zeros (algebraic theorems) (12D10)
Related Items
Construction of unitary and normal companion matrices, Polynomial zerofinding iterative matrix algorithms, A composite polynomial zerofinding matrix algorithm, Backward Error of Polynomial Eigenvalue Problems Solved by Linearization of Lagrange Interpolants, Bounds for the zeros of polynomials from eigenvalues and singular values of some companion matrices, A method for finding the zeros of polynomials using a companion matrix., Inverse power and Durand-Kerner iterations for univariate polynomial root-finding, Polynomials compatible with a symmetric Loewner matrix, General polynomial roots and their multiplicities inO(N)memory andO(N2)Time∗, Choosing improved initial values for polynomial zerofinding in extended Newbery method to obtain convergence, An iterated eigenvalue algorithm for approximating roots of univariate polynomials, Fast and stable QR eigenvalue algorithms for generalized companion matrices and secular equations, Sturm and Sylvester algorithms revisited via tridiagonal determinantal representations, Backward Error Analysis of Polynomial Eigenvalue Problems Solved by Linearization, Sums of squares over totally real fields are rational sums of squares, Inverse matrix eigenvalue problems, A real symmetric tridiagonal matrix with a given characteristic polynomial
Cites Work
