Add to ORKGThis paper is concerned with the computation of the minimal eigenpair of the generalized eigen-problem. An iterative method of first degree with the arithmetic mean preconditioner and the SSOR preconditioner has been analyzed. These preconditioners have been evaluated also for the method of Rayleigh quotient minimization
AbstractThis paper proposes new iterative methods for the efficient computation of the smallest eige...
145 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1981.This thesis presents an algor...
This paper proposes new iterative methods for the efficient computation of the smallest eigenvalue o...
This paper is concerned with the computation of the minimal eigenpair of the generalized eigen-probl...
This report is concerned with the computation of the minimal eigenpair of the generalized eigen-prob...
Rayleigh Quotient Minimization methods for the calculation of minimal eigenpair achieve great effici...
AbstractThe problem of approximation of an eigenpair of a large n × n matrix A is considered. We stu...
We exploit an optimization method, called DACG, which sequentially computes the smallest eigenpairs ...
We present an implementation of the generalized minimal residual (gmr) algorithm for finding an eige...
A preconditioned simultaneous iteration method is described for the solution of the generalized eige...
We discuss the generalized Davidson's algorithm for computing accurate approximations of the k princ...
A parallel algorithm based on the S-dimensional minimization of the Rayleigh quotient is proposed to...
We propose a new algorithm for sparse estimation of eigenvectors in generalized eigenvalue problems ...
A general eigenvalue solver for a large sparse symmetric matrix with zero eigenvalue solutions is de...
This paper proposes new iterative methods for the efficient computation of the smallest eigenvalue o...
AbstractThis paper proposes new iterative methods for the efficient computation of the smallest eige...
145 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1981.This thesis presents an algor...
This paper proposes new iterative methods for the efficient computation of the smallest eigenvalue o...
This paper is concerned with the computation of the minimal eigenpair of the generalized eigen-probl...
This report is concerned with the computation of the minimal eigenpair of the generalized eigen-prob...
Rayleigh Quotient Minimization methods for the calculation of minimal eigenpair achieve great effici...
AbstractThe problem of approximation of an eigenpair of a large n × n matrix A is considered. We stu...
We exploit an optimization method, called DACG, which sequentially computes the smallest eigenpairs ...
We present an implementation of the generalized minimal residual (gmr) algorithm for finding an eige...
A preconditioned simultaneous iteration method is described for the solution of the generalized eige...
We discuss the generalized Davidson's algorithm for computing accurate approximations of the k princ...
A parallel algorithm based on the S-dimensional minimization of the Rayleigh quotient is proposed to...
We propose a new algorithm for sparse estimation of eigenvectors in generalized eigenvalue problems ...
A general eigenvalue solver for a large sparse symmetric matrix with zero eigenvalue solutions is de...
This paper proposes new iterative methods for the efficient computation of the smallest eigenvalue o...
AbstractThis paper proposes new iterative methods for the efficient computation of the smallest eige...
145 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1981.This thesis presents an algor...
This paper proposes new iterative methods for the efficient computation of the smallest eigenvalue o...