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

03/16/2022
by   Peter Benner, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/12/2018

A fast spectral divide-and-conquer method for banded matrices

Based on the spectral divide-and-conquer algorithm by Nakatsukasa and Hi...
research
06/06/2022

The structured distance to singularity of a symmetric tridiagonal Toeplitz matrix

This paper is concerned with the distance of a symmetric tridiagonal Toe...
research
08/05/2020

A parallel structured divide-and-conquer algorithm for symmetric tridiagonal eigenvalue problems

In this paper, a parallel structured divide-and-conquer (PSDC) eigensolv...
research
12/19/2019

Analysis of the multiplicative Schwarz method for matrices with a special block structure

We analyze the convergence of the (algebraic) multiplicative Schwarz met...
research
12/22/2016

An efficient hybrid tridiagonal divide-and-conquer algorithm on distributed memory architectures

In this paper, an efficient divide-and-conquer (DC) algorithm is propose...
research
11/12/2020

Quantum algorithms for spectral sums

We propose and analyze new quantum algorithms for estimating the most co...
research
11/25/2020

Iterations for the Unitary Sign Decomposition and the Unitary Eigendecomposition

We construct fast, structure-preserving iterations for computing the sig...

Please sign up or login with your details

Forgot password? Click here to reset