A Structure-Preserving Divide-and-Conquer Method for Pseudosymmetric Matrices
From MaRDI portal
Publication:6094743
Abstract: We devise a spectral divide-and-conquer scheme for matrices that are self-adjoint with respect to a given indefinite scalar product (i.e. pseudosymmetic matrices). The pseudosymmetric structure of the matrix is preserved in the spectral division, such that the method can be applied recursively to achieve full diagonalization. The method is well-suited for structured matrices that come up in computational quantum physics and chemistry. In this application context, additional definiteness properties guarantee a convergence of the matrix sign function iteration within two steps when Zolotarev functions are used. The steps are easily parallelizable. Furthermore, it is shown that the matrix decouples into symmetric definite eigenvalue problems after just one step of spectral division.
Cites work
- A New Scaling for Newton's Iteration for the Polar Decomposition and its Backward Stability
- A QDWH-based SVD software framework on distributed-memory manycore systems
- An analysis of the HR algorithm for computing the eigenvalues of a matrix
- An inverse free parallel spectral divide and conquer algorithm for nonsymmetric eigenproblems
- Backward stability of iterations for computing the polar decomposition
- Computing Fundamental Matrix Decompositions Accurately via the Matrix Sign Function in Two Iterations: The Power of Zolotarev's Functions
- Damped oscillations of linear systems. A mathematical introduction
- Efficient and accurate algorithms for solving the Bethe-Salpeter eigenvalue problem for crystalline systems
- Eigenvalues of Ax=lambdaBx for real symmetric matrices A and B computed by reduction to a pseudosymmetric form and the HR process
- Fast iterative solution of the Bethe-Salpeter eigenvalue problem using low-rank and QTT tensor approximation
- Functions of Matrices
- Functions Preserving Matrix Groups and Iterations for the Matrix Square Root
- scientific article; zbMATH DE number 3863589 (Why is no real title available?)
- scientific article; zbMATH DE number 3872553 (Why is no real title available?)
- scientific article; zbMATH DE number 4050200 (Why is no real title available?)
- scientific article; zbMATH DE number 3671577 (Why is no real title available?)
- scientific article; zbMATH DE number 46496 (Why is no real title available?)
- scientific article; zbMATH DE number 781814 (Why is no real title available?)
- scientific article; zbMATH DE number 6159604 (Why is no real title available?)
- Linear model reduction and solution of the algebraic Riccati equation by use of the sign function†
- Minimizing communication in numerical linear algebra
- Optimizing Halley's Iteration for Computing the Matrix Polar Decomposition
- Parallel algorithm for solving some spectral problems of linear algebra
- Rational Iterative Methods for the Matrix Sign Function
- Rounding-error and perturbation bounds for the indefinite QR factorization
- Some Stable Methods for Calculating Inertia and Solving Symmetric Linear Systems
- Spectral division methods for block generalized Schur decompositions
- Stable and efficient computation of generalized polar decompositions
- Stable and efficient spectral divide and conquer algorithms for the symmetric eigenvalue decomposition and the SVD
- Structure preserving parallel algorithms for solving the Bethe-Salpeter eigenvalue problem
- Structured Factorizations in Scalar Product Spaces
- The canonical generalized polar decomposition
- The hyperbolic Schur decomposition
- The Matrix Eigenvalue Problem
- The matrix sign function
- Two-sided hyperbolic SVD
Cited in
(1)
This page was built for publication: A Structure-Preserving Divide-and-Conquer Method for Pseudosymmetric Matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6094743)
