Computing characteristic polynomials from eigenvalues
From MaRDI portal
Recommendations
- Accurate, validated and fast evaluation of elementary symmetric functions and its application
- Perturbation Bounds for Determinants and Characteristic Polynomials
- Expressing a polynomial as the characteristic polynomial of a symmetric matrix
- The coefficients of the characteristic polynomial in terms of the eigenvalues and the elements of an n n matrix
- Bounds on the coefficients of the characteristic and minimal polynomials
Cited in
(14)- scientific article; zbMATH DE number 3958571 (Why is no real title available?)
- Low-Rank Approximation in the Frobenius Norm by Column and Row Subset Selection
- Bounds on the coefficients of the characteristic and minimal polynomials
- Some algorithms for maximum volume and cross approximation of symmetric semidefinite matrices
- A characteristic polynomial
- SIC-POVMs from Stark units: Prime dimensions n2 + 3
- Relationship between the characteristic polynomial and the spectrum of a diagonalizable matrix and those of its low-rank update
- scientific article; zbMATH DE number 140142 (Why is no real title available?)
- Expressing a polynomial as the characteristic polynomial of a symmetric matrix
- The coefficients of the characteristic polynomial in terms of the eigenvalues and the elements of an n n matrix
- On the characteristic polynomials and eigenvalues of some specially bordered matrices
- Further results on color energy of graphs
- Eigenvalues and polynomial equations
- Accurate, validated and fast evaluation of elementary symmetric functions and its application
This page was built for publication: Computing characteristic polynomials from eigenvalues
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3008240)