A Structure-Preserving Divide-and-Conquer Method for Pseudosymmetric Matrices

DOI10.1137/22m1484985arXiv2203.08900OpenAlexW4386274716MaRDI QIDQ6094743

Peter Benner, Carolin Penke, Yuji Nakatsukasa

Publication date: 14 September 2023

Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2203.08900

zbMATH Keywords

eigenvalue problempolar decompositionmatrix sign functiondivide-and-conquerstructure preservationpseudosymmetry

Mathematics Subject Classification ID

Numerical linear algebra (65Fxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Damped oscillations of linear systems. A mathematical introduction
• Structure preserving parallel algorithms for solving the Bethe-Salpeter eigenvalue problem
• An analysis of the HR algorithm for computing the eigenvalues of a matrix
• Eigenvalues of Ax=lambdaBx for real symmetric matrices A and B computed by reduction to a pseudosymmetric form and the HR process
• Parallel algorithm for solving some spectral problems of linear algebra
• An inverse free parallel spectral divide and conquer algorithm for nonsymmetric eigenproblems
• Fast iterative solution of the Bethe-Salpeter eigenvalue problem using low-rank and QTT tensor approximation
• 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 hyperbolic Schur decomposition
• Stable and Efficient Spectral Divide and Conquer Algorithms for the Symmetric Eigenvalue Decomposition and the SVD
• Backward Stability of Iterations for Computing the Polar Decomposition
• The Canonical Generalized Polar Decomposition
• Optimizing Halley's Iteration for Computing the Matrix Polar Decomposition
• Minimizing Communication in Numerical Linear Algebra
• 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†
• Some Stable Methods for Calculating Inertia and Solving Symmetric Linear Systems
• Spectral division methods for block generalized Schur decompositions
• The matrix sign function
• Stable and Efficient Computation of Generalized Polar Decompositions
• 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
• Structured Factorizations in Scalar Product Spaces
• Two-sided hyperbolic SVD

This page was built for publication: A Structure-Preserving Divide-and-Conquer Method for Pseudosymmetric Matrices