A real symmetric tridiagonal matrix with a given characteristic polynomial

DOI10.1016/0024-3795(93)90268-SzbMath0793.15009MaRDI QIDQ1318198

Gerhard Schmeisser

Publication date: 27 March 1994

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

zbMATH Keywords

characteristic polynomialreal symmetric tridiagonal matrix

Mathematics Subject Classification ID

Eigenvalues, singular values, and eigenvectors (15A18) Special polynomials in general fields (12E10) Canonical forms, reductions, classification (15A21)

Related Items

Construction of unitary and normal companion matrices, Polynomial zerofinding iterative matrix algorithms, A composite polynomial zerofinding matrix algorithm, 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., General polynomial roots and their multiplicities inO(N)memory andO(N²)Time^∗, Choosing improved initial values for polynomial zerofinding in extended Newbery method to obtain convergence, Sturm and Sylvester algorithms revisited via tridiagonal determinantal representations, Sums of squares over totally real fields are rational sums of squares, Inverse matrix eigenvalue problems

Cites Work

• Expressing a polynomial as the characteristic polynomial of a symmetric matrix
• A Generalization of a Theorem of Bôcher
• Unnamed Item