Expressing a polynomial as the characteristic polynomial of a symmetric matrix

DOI10.1016/0024-3795(90)90323-5MaRDI QIDQ2640669zbMATH OpenOpenAlexFDO

Authors Miroslav Fiedler

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

zbMATH Keywords

characteristic polynomialeigenvalueeigenvectorreal symmetric matrix

Mathematics Subject Classification ID

Polynomials in real and complex fields: location of zeros (algebraic theorems) (12D10) Eigenvalues, singular values, and eigenvectors (15A18) Hermitian, skew-Hermitian, and related matrices (15B57) Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Numerical computation of solutions to single equations (65H05)

Review text

The author proves that every polynomial with distinct real roots is the characteristic polynomial of a real symmetric matrix. An algorithm is described that associates to every eigenvalue of a symmetric matrix a corresponding eigenvector. The proofs are based on interpolation devices. Some applications to the computation of the roots of polynomial equations are discussed.

Recommendations

• A real symmetric tridiagonal matrix with a given characteristic polynomial
• scientific article; zbMATH DE number 67156
• Characteristic polynomials of symmetric matrices
• Computing characteristic polynomials from eigenvalues
• On Matrix Polynomials with Real Roots

Cites work

• A Jacobi type method for complex symmetric matrices
• scientific article; zbMATH DE number 3892457 (Why is no real title available?)
• Pencils of real symmetric matrices and real algebraic curves

Cited in

(24)

• A real symmetric tridiagonal matrix with a given characteristic polynomial
• Construction of unitary and normal companion matrices
• Polynomial zerofinding iterative matrix algorithms
• 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
• Inverse matrix eigenvalue problems
• Choosing improved initial values for polynomial zerofinding in extended Newbery method to obtain convergence
• Fast and stable QR eigenvalue algorithms for generalized companion matrices and secular equations
• A composite polynomial zerofinding matrix algorithm
• Characteristic polynomials of symmetric matrices over the univariate polynomial ring
• Characteristic polynomials of symmetric matrices
• Backward error analysis of polynomial eigenvalue problems solved by linearization
• Computing characteristic polynomials from eigenvalues
• Backward error of polynomial eigenvalue problems solved by linearization of Lagrange interpolants
• scientific article; zbMATH DE number 3858496 (Why is no real title available?)
• Sums of squares over totally real fields are rational sums of squares
• General polynomial roots and their multiplicities inO(N)memory andO(N²)Time^∗
• Characteristic polynomials of symmetric matrices
• Polynomials compatible with a symmetric Loewner matrix
• An iterated eigenvalue algorithm for approximating roots of univariate polynomials
• Parameterizing intersecting surfaces via invariants
• Characteristic polynomials of distance matrices of one dimensional sets
• Sturm and Sylvester algorithms revisited via tridiagonal determinantal representations

This page was built for publication: Expressing a polynomial as the characteristic polynomial of a symmetric matrix

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2640669)