Iterative refinement of Schur decompositions
From MaRDI portal
Publication:2679661
DOI10.1007/s11075-022-01327-6OpenAlexW4286285454MaRDI QIDQ2679661
Zvonimir Bujanović, Christian Schröder, Daniel Kressner
Publication date: 23 January 2023
Published in: Numerical Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2203.10879
Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Eigenvalues, singular values, and eigenvectors (15A18)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Error-free transformations of matrix multiplication by using fast routines of matrix multiplication and its applications
- A direct method for completing eigenproblem solutions on a parallel computer
- Three methods for refining estimates of invariant subspaces
- Stabilization of DAEs and invariant manifolds
- Iterative refinement for symmetric eigenvalue decomposition
- Iterative refinement for symmetric eigenvalue decomposition. II. Clustered eigenvalues
- A Grassmann--Rayleigh Quotient Iteration for Computing Invariant Subspaces
- Adaptive Eigenvalue Computations Using Newton's Method on the Grassmann Manifold
- The Multishift QR Algorithm. Part I: Maintaining Well-Focused Shifts and Level 3 Performance
- The Multishift QR Algorithm. Part II: Aggressive Early Deflation
- A Jacobi-Like Method for the Automatic Computation of Eigenvalues and Eigenvectors of an Arbitrary Matrix
- Fast Polar Decomposition of an Arbitrary Matrix
- On Asymptotic Convergence of Nonsymmetric Jacobi Algorithms
- Continuation of Invariant Subspaces in Large Bifurcation Problems
- A Jacobi-Like Algorithm for Computing the Schur Decomposition of a Nonhermitian Matrix
- Data-flow algorithms for parallel matrix computation
- Nonlocal Perturbation Analysis of the Schur System of a Matrix
- Computing an Eigenvector with Inverse Iteration
- A New First-Order Algorithmic Framework for Optimization Problems with Orthogonality Constraints
- Accuracy and Stability of Numerical Algorithms
- Perturbation Bounds for the Generalized Schur Decomposition
- An Introduction to Optimization on Smooth Manifolds
- Functions of Matrices
- Recursive blocked algorithms for solving triangular systems—Part I
- Recursive blocked algorithms for solving triangular systems—Part II
- IMPROVEMENT OF AN APPROXIMATE SET OF LATENT ROOTS AND MODAL COLUMNS OF A MATRIX BY METHODS AKIN TO THOSE OF CLASSICAL PERTURBATION THEORY
- A Method for Finding Roots of Arbitrary Matrices
This page was built for publication: Iterative refinement of Schur decompositions
