Stable and Efficient Computation of Generalized Polar Decompositions
DOI10.1137/21M1411986zbMath1492.65116arXiv2104.06659OpenAlexW3153059961WikidataQ114141810 ScholiaQ114141810MaRDI QIDQ5094209
Peter Benner, Yuji Nakatsukasa, Carolin Penke
Publication date: 2 August 2022
Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2104.06659
matrix sign functiongeneralized polar decomposition\(LDL^T\) factorizationdynamically weighted Halley iterationhyperbolic QR decompositionindefinite QR decompositionpermuted graph basis
Numerical computation of matrix exponential and similar matrix functions (65F60) Numerical methods for low-rank matrix approximation; matrix compression (65F55)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Damped oscillations of linear systems. A mathematical introduction
- Procrustes problems in finite dimensional indefinite scalar product spaces
- Perturbation analysis for the hyperbolic QR factorization
- Structure preserving parallel algorithms for solving the Bethe-Salpeter eigenvalue problem
- Roundoff error analysis of the CholeskyQR2 algorithm
- Solving the algebraic Riccati equation with the matrix sign function
- Decomposition of a symmetric matrix
- Solving stable generalized Lyapunov equations with the matrix sign function
- Polar decompositions in finite dimensional indefinite scalar product spaces: General theory
- On doubly structured matrices and pencils that arise in linear response theory.
- Unitary equivalence in an indefinite scalar product: An analogue of singular-value decomposition
- Rounding-error and perturbation bounds for the indefinite QR factorization
- Efficient and accurate algorithms for solving the Bethe-Salpeter eigenvalue problem for crystalline systems
- The eigenvalue problem for Hermitian matrices with time reversal symmetry
- Indefinite QR factorization
- Modern multidimensional scaling. Theory and applications.
- Symplectic Balancing of Hamiltonian Matrices
- Backward Stability of Iterations for Computing the Polar Decomposition
- Permuted Graph Matrices and Their Applications
- The Canonical Generalized Polar Decomposition
- Optimizing Halley's Iteration for Computing the Matrix Polar Decomposition
- Computing Fundamental Matrix Decompositions Accurately via the Matrix Sign Function in Two Iterations: The Power of Zolotarev's Functions
- A New Scaling for Newton's Iteration for the Polar Decomposition and its Backward Stability
- Linear model reduction and solution of the algebraic Riccati equation by use of the sign function†
- On Scaling Newton’s Method for Polar Decomposition and the Matrix Sign Function
- Some Stable Methods for Calculating Inertia and Solving Symmetric Linear Systems
- Accurate Symmetric Indefinite Linear Equation Solvers
- J-Orthogonal Matrices: Properties and Generation
- Solving the Indefinite Least Squares Problem by Hyperbolic QR Factorization
- Stabilizing the Generalized Schur Algorithm
- Spectral division methods for block generalized Schur decompositions
- Doubling Algorithms with Permuted Lagrangian Graph Bases
- Rational Iterative Methods for the Matrix Sign Function
- A QDWH-based SVD Software Framework on Distributed-memory Manycore Systems
- Functions Preserving Matrix Groups and Iterations for the Matrix Square Root
- The Matrix Eigenvalue Problem
- Functions of Matrices
- MA57---a code for the solution of sparse symmetric definite and indefinite systems
- Structured Factorizations in Scalar Product Spaces
- Direct Methods for Solving Symmetric Indefinite Systems of Linear Equations
This page was built for publication: Stable and Efficient Computation of Generalized Polar Decompositions
