A filter diagonalization for generalized eigenvalue problems based on the Sakurai-Sugiura projection method

TL;DR: Experiments show that the proposed distributed self-scheduler achieves the desired fault resiliency for an application program developed using the middleware, and that the scheduler itself is also fault resilient.

TL;DR: The proposed structure-preserving technique of the block SS–Hankel method for solving Hermitian GEPs improves the accuracy of the eigenvalues and the numerical results support the results of the analysis.

TL;DR: The algebraic multiplicity of the eigenvalues of nonlinear eigenvalue problems (NEPs) to the rational form and the extension of the argument principle are generalized and a novel numerical method to determine the algebraic multiplier in a given region by the contour integral method is proposed.

TL;DR: In this paper , the authors extended the FEAST eigensolver to the computation of the singular triplets of a large matrix A with the singular values in a given interval, and proposed a robust alternative that constructs approximate spectral projectors by using the Chebyshev-Jackson polynomial series.

TL;DR: In this paper, an interpretation of Dr. Cornelius Lanczos' iteration method, which he has named ''minimized iterations'' is discussed, expounding the method as applied to the solution of the characteristic matrix equations both in homogeneous and nonhomogeneous form.

TL;DR: This book discusses iterative projection methods for solving Eigenproblems, and some of the techniques used to solve these problems came from the literature on Hermitian Eigenvalue.

TL;DR: A new method for the iterative computation of a few of the extremal eigenvalues of a symmetric matrix and their associated eigenvectors is proposed that has improved convergence properties and that may be used for general matrices.