Pages that link to "Item:Q2640669"
From MaRDI portal
The following pages link to Expressing a polynomial as the characteristic polynomial of a symmetric matrix (Q2640669):
Displayed 17 items.
- Polynomials compatible with a symmetric Loewner matrix (Q686382) (← links)
- An iterated eigenvalue algorithm for approximating roots of univariate polynomials (Q697487) (← links)
- Sturm and Sylvester algorithms revisited via tridiagonal determinantal representations (Q989047) (← links)
- A real symmetric tridiagonal matrix with a given characteristic polynomial (Q1318198) (← links)
- Construction of unitary and normal companion matrices (Q1329931) (← links)
- Polynomial zerofinding iterative matrix algorithms (Q1343560) (← links)
- Bounds for the zeros of polynomials from eigenvalues and singular values of some companion matrices (Q1379083) (← links)
- A method for finding the zeros of polynomials using a companion matrix. (Q1421154) (← links)
- Inverse power and Durand-Kerner iterations for univariate polynomial root-finding (Q1433125) (← links)
- Inverse matrix eigenvalue problems (Q1576009) (← links)
- Choosing improved initial values for polynomial zerofinding in extended Newbery method to obtain convergence (Q1760574) (← links)
- Fast and stable QR eigenvalue algorithms for generalized companion matrices and secular equations (Q1780608) (← links)
- A composite polynomial zerofinding matrix algorithm (Q1903777) (← links)
- Backward Error Analysis of Polynomial Eigenvalue Problems Solved by Linearization (Q2790065) (← links)
- Backward Error of Polynomial Eigenvalue Problems Solved by Linearization of Lagrange Interpolants (Q3195442) (← links)
- Sums of squares over totally real fields are rational sums of squares (Q3617579) (← links)
- General polynomial roots and their multiplicities in<i>O</i>(<i>N</i>)memory and<i>O</i>(<i>N</i><sup>2</sup>)Time<sup>∗</sup> (Q3836210) (← links)