SIAM Journal on Matrix Analysis and Applications · 2008 · 75 citations · 3 references
Natural SciencesComputer ScienceInformation TheoryTheory Of ComputationVulnerability AnalysisCharacteristic FunctionsEigenvalue ProblemsLinear AlgebraMatrix ComputationPerturbation MethodsPerturbation TheoryCharacteristic Function BoundsMatrix Perturbation TheorySymmetric Functions
We derive absolute perturbation bounds for the coefficients of the characteristic polynomial of a $n\times n$ complex matrix. The bounds consist of elementary symmetric functions of singular values, and suggest that coefficients of normal matrices are better conditioned with regard to absolute perturbations than those of general matrices. When the matrix is Hermitian positive-definite, the bounds can be expressed in terms of the coefficients themselves. We also improve absolute and relative perturbation bounds for determinants. The basis for all bounds is an expansion of the determinant of a perturbed diagonal matrix.
3
Accuracy and stability of numerical algorithms
Choice Reviews Online · 1996 · 2.1K citations
Variation of tensor powers and spectrat
Shmuel Friedland · Linear and Multilinear Algebra · 1982 · 36 citations