A skew-symmetric Lanczos bidiagonalization method for computing several largest eigenpairs of a large skew-symmetric matrix

by   Jinzhi Huang, et al.

The spectral decomposition of a real skew-symmetric matrix A can be mathematically transformed into a specific structured singular value decomposition (SVD) of A. Based on such equivalence, a skew-symmetric Lanczos bidiagonalization (SSLBD) method is proposed for the specific SVD problem that computes extreme singular values and the corresponding singular vectors of A, from which the eigenpairs of A corresponding to the extreme conjugate eigenvalues in magnitude are recovered pairwise in real arithmetic. A number of convergence results on the method are established, and accuracy estimates for approximate singular triplets are given. In finite precision arithmetic, it is proven that the semi-orthogonality of each set of basis vectors and the semi-biorthogonality of two sets of basis vectors suffice to compute the singular values accurately. A commonly used efficient partial reorthogonalization strategy is adapted to maintaining the needed semi-orthogonality and semi-biorthogonality. For a practical purpose, an implicitly restarted SSLBD algorithm is developed with partial reorthogonalization. Numerical experiments illustrate the effectiveness and overall efficiency of the algorithm.


page 1

page 2

page 3

page 4


A FEAST SVDsolver for the computation of singular value decompositions of large matrices based on the Chebyshev–Jackson series expansion

The FEAST eigensolver is extended to the computation of the singular tri...

PRIMME_SVDS: A High-Performance Preconditioned SVD Solver for Accurate Large-Scale Computations

The increasing number of applications requiring the solution of large sc...

Compressive spectral embedding: sidestepping the SVD

Spectral embedding based on the Singular Value Decomposition (SVD) is a ...

A rounding error analysis of the joint bidiagonalization process with applications to the GSVD computation

The joint bidiagonalization(JBD) process is a useful algorithm for appro...

A novel multi-step method for the partial pole assignment in symmetric quadratic pencil with time delay

In this paper, we study the partial pole assignment problem in symmetric...

A Fast Hierarchically Preconditioned Eigensolver Based On Multiresolution Matrix Decomposition

In this paper we propose a new iterative method to hierarchically comput...

Please sign up or login with your details

Forgot password? Click here to reset