scientific article; zbMATH DE number 7814803
From MaRDI portal
DOI10.22124/jmm.2023.23734.2120MaRDI QIDQ6151388
Publication date: 11 March 2024
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
rounding error analysisQZ methodsymmetric definite generalized eigenvalue problemCholesky-QR methodSchur-QR method
Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Canonical forms, reductions, classification (15A21) Matrix pencils (15A22)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Backward errors for eigenvalue and singular value decompositions
- Iterative refinement for symmetric eigenvalue decomposition
- Spectral refinement on quasi-diagonal matrices
- Iterative refinement for symmetric eigenvalue decomposition. II. Clustered eigenvalues
- Verification of positive definiteness
- Newton's Method in Floating Point Arithmetic and Iterative Refinement of Generalized Eigenvalue Problems
- Matrix Algorithms
- Analysis of the Cholesky Method with Iterative Refinement for Solving the Symmetric Definite Generalized Eigenproblem
- Linearization of regular matrix polynomials
- Improving the Accuracy of Computed Eigenvalues and Eigenvectors
- Structured Backward Error and Condition of Generalized Eigenvalue Problems
- $Ax = \lambda Bx$ and the Generalized Eigenproblem
- An Efficient and Stable Algorithm for the Symmetric-Definite Generalized Eigenvalue Problem
- Templates for the Solution of Algebraic Eigenvalue Problems
- Tridiagonal-Diagonal Reduction of Symmetric Indefinite Pairs
- Accuracy and Stability of Numerical Algorithms
- An Algorithm for Generalized Matrix Eigenvalue Problems