Fast enclosure of matrix eigenvalues and singular values via rounding mode controlled computation (Q5929749): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Fast verification of solutions of matrix equations / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Norms and exclusion theorems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3998482 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5185900 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Relative Perturbation Techniques for Singular Value Problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Calculating the Singular Values and Pseudo-Inverse of a Matrix / rank | |||
Normal rank |
Latest revision as of 15:09, 3 June 2024
scientific article; zbMATH DE number 1586462
Language | Label | Description | Also known as |
---|---|---|---|
English | Fast enclosure of matrix eigenvalues and singular values via rounding mode controlled computation |
scientific article; zbMATH DE number 1586462 |
Statements
Fast enclosure of matrix eigenvalues and singular values via rounding mode controlled computation (English)
0 references
12 February 2002
0 references
The author derives two methods to enclose matrix eigenvalues and one method to enclose singular values. The entries of the matrix are assumed to be floating point numbers. The computations are executed in a floating point system using MATLAB combined with directed rounding. The first method starts with a Bauer-Fike like perturbation theorem for general complex \(n\times n\) matrices \(A\). The second assumes \(A\) to be real and symmetric and is based on a Weyl type perturbation theorem which also induces a perturbation theorem for singular values of a real \(m\times n\) matrix. It is shown how these theorems are to be applied in order to get guaranteed lower and upper bounds for the items to be enclosed. MATLAB-like programs are given, their efficiency is tested using matrices of various size.
0 references
verified eigenvalue computation
0 references
rounding mode controlled computation
0 references
Bauer-Fike type theorem
0 references
Weyl type theorem
0 references
verified singular value computation
0 references
MATLAB
0 references
perturbation theory
0 references
numerical examples
0 references