In this contribution, we extend a projection method for square matrices to the singular non-square case. Eigensolvers involving complex moments for linear square matrix eigenproblems are paid much attention in the eigencomputation due to its coarse-grained parallelizability. Such solvers determine all finite eigenvalues in a prescribed region in the complex plane and the corresponding eigenvectors. For extracting eigencomponents from random vectors or matrices , a complex moment forms a filter that allows desired eigencomponents to pass through. The challenge is to extend the definition of a complex matrix moment to the non-square case . This extension naively replaces the standard matrix inverse in the resolvent with the pseudoinverse. The extended method involves complex moments associated with contour integrals of generalized resolvents associated with rectangular matrices. We give conditions such that this method gives all finite eigenvalues in a prescribed region in the complex plane and the corresponding eigenvectors. Surprisingly, almost the same algorithm as the original complex moment eigensolver works similarly on the non-square case. In numerical computations, the contour integrals are approximated by using numerical quadratures. The dominant cost is in the solutions of linear least squares problems that arise from quadrature points, and they can be readily parallelized in practice. Numerical experiments on large matrix pencils illustrate the method , comparing with previous methods, and show that the new method is  more robust and efficient , in particular, in parallel. Further , the proposed method does not fail for the existence of many pairs of extremely close eigenvalues and breaks the previous barrier of problem size . We also discuss the limitation of the scope of problems that the proposed method can solve .
For linear square matrix eigenproblems , eigensolvers involving complex moments can determine all the eigenvalues in a given region in the complex plane and the corresponding eigenvectors. A complex moment plays the role of a filter and extracts eigencomponents of interest from random vectors or matrices . This study extends a projection method for regular matrix pencils to the singular nonsquare case. Extending the definition of a complex moment matrix to the nonsquare case has posed a challenge . This extension replaces the standard matrix inverse in the resolvent with the pseudoinverse. The extended method involves complex moments given by contour integrals of generalized resolvents associated with nonsquare matrices. We give conditions such that the method gives all finite eigenvalues in a prescribed region in the complex plane . In numerical computations, the contour integrals are approximated using numerical quadratures. The primary cost is in the solutions of linear least squares problems that arise from quadrature points, and they can be readily parallelized in practice. Numerical experiments on large matrix pencils illustrate the method . As compared to previous methods, the new method is found to be more robust and efficient and is conjectured by experiment results to be more efficient in parallelized settings. Notably , the proposed method does not fail in cases involving pairs of extremely close eigenvalues ; it overcomes the issue of problem size .
R
In this contribution, we extend a projection method for square matrices to the singular non-square case. Eigensolvers involving complex moments for
For
R
are paid much attention in the eigencomputation due to its coarse-grained parallelizability. Such solvers determine all finite
, eigensolvers involving complex moments can determine all the
R
prescribed
given
R
For extracting eigencomponents
A complex moment plays the role of a filter and extracts eigencomponents of interest
R
, a complex moment forms a filter that allows desired eigencomponents to pass through. The challenge is to extend
. This study extends a projection method for regular matrix pencils to the singular nonsquare case. Extending
R
matrix moment to the non-square case
moment matrix to the nonsquare case has posed a challenge
D
naively
R
associated with
given by
R
rectangular
nonsquare
R
this
the
R
and the corresponding eigenvectors. Surprisingly, almost the same algorithm as the original complex moment eigensolver works similarly on the non-square case.
.
D
by
R
dominant
primary
R
, comparing with
. As compared to
D
and show that
A
found to be
R
, in particular, in parallel. Further
and is conjectured by experiment results to be more efficient in parallelized settings. Notably
R
for the existence of many
in cases involving
R
and breaks the previous barrier
; it overcomes the issue
D
. We also discuss the limitation of the scope of problems that the proposed method can solve