Computing Characteristic Polynomials from Eigenvalues

DOI10.1137/100788392zbMath1220.65047OpenAlexW2126060872WikidataQ57437387 ScholiaQ57437387MaRDI QIDQ3008240

Ilse C. F. Ipsen, Rizwana Rehman

Publication date: 15 June 2011

Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/3afc33e4e2abe7cf90e7842b821bf074f59e0c9f

zbMATH Keywords

numerical experimentserror boundscharacteristic polynomialdeterminantrounding errorselementary symmetric functionssummation algorithmeigenvalues perturbation bounds

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Determinants, permanents, traces, other special matrix functions (15A15) Eigenvalues, singular values, and eigenvectors (15A18) Roundoff error (65G50) Numerical computation of determinants (65F40)

Related Items

SIC-POVMs from Stark units: Prime dimensions n2 + 3 ⋮ Further results on color energy of graphs ⋮ On the characteristic polynomials and eigenvalues of some specially bordered matrices ⋮ Low-Rank Approximation in the Frobenius Norm by Column and Row Subset Selection ⋮ Accurate, validated and fast evaluation of elementary symmetric functions and its application ⋮ Relationship between the characteristic polynomial and the spectrum of a diagonalizable matrix and those of its low-rank update ⋮ Some algorithms for maximum volume and cross approximation of symmetric semidefinite matrices

Uses Software

• Matlab

This page was built for publication: Computing Characteristic Polynomials from Eigenvalues