A minimization method for the solution of large symmetriric eigenproblems

This paper concerns with the solution of a special eigenvalue problem for a large sparse symmetric matrix by a fast convergent minimization method. A theoretical analysis of the method is developed; it is proved that is convergent with a convergence rate of fourth order. This minimization method requires to solve a sequence of equality-constrained least squares problems that become increasingly ill-conditioned, as the solution of eigenvalue problem is approached. A particular attention has been addressed to this question of ill-conditioning for the practical application of the method. Computational experiments carried out on Cray C90 show the behaviour of this minimization method as accelerating technique of the inverse iteration method. Also a comparison with the scaled Newton method has been done.

[1]  Charles L. Lawson,et al.  Solving least squares problems , 1976, Classics in applied mathematics.

[2]  V. Ruggiero.  Polynomial preconditioning on vector computers , 1993 .

[3]  Valeria Ruggiero,et al.  Numerical solution of equality-constrained quadratic programming problems on vector-parallel computers , 1993 .

[4]  L. Gross,et al.  A POLYALGORITHM FOR THE SOLUTION OF LARGE SYMMETRICAL GENERAL EIGENPROBLEMS , 1992 .

[5]  E. Galligani,et al.  The arithmetic mean preconditioner for multivector computers , 1992 .

[6]  G. Pini,et al.  Computation of minimum eigenvalue through minimization of rayleigh's quotient for large sparse matrices using vector computer , 1990, Int. J. Comput. Math..

[7]  J. Barlow.  Error Analysis and Implementation Aspects of Deferred Correction for Equality Constrained Least Squares Problems , 1988 .

[8]  J. Ortega.  Introduction to Parallel and Vector Solution of Linear Systems , 1988, Frontiers of Computer Science.

[9]  V. A. Barker,et al.  Finite element solution of boundary value problems , 1984 .

[10]  C. Loan.  On the Method of Weighting for Equality Constrained Least Squares Problems , 1984 .

[11]  David G. Luenberger,et al.  Linear and nonlinear programming , 1984 .

[12]  Preconditioned iterative methods for the generalized eigenvalue problem , 1983 .

[13]  Michael A. Saunders,et al.  LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares , 1982, TOMS.

[14]  J. H. Wilkinson,et al.  Inverse Iteration, Ill-Conditioned Equations and Newton’s Method , 1979 .

[15]  M. Saunders,et al.  Solution of Sparse Indefinite Systems of Linear Equations , 1975 .

[16]  Garry H. Rodrigue,et al.  A gradient method for the matrix eigenvalue problemAx=λBx , 1974 .

[17]  Axel Ruhe,et al.  The method of conjugate gradients used in inverse iteration , 1972 .

[18]  D. Luenberger.  Hyperbolic Pairs in the Method of Conjugate Gradients , 1969 .

[19]  R. Fletcher,et al.  New iterative methods for solution of the eigenproblem , 1966 .

[20]  S. Chu,et al.  On continuous functions, commuting functions, and fixed points , 1966 .

[21]  M. Hestenes,et al.  A method of gradients for the calculation of the characteristic roots and vectors of a real symmetric matrix , 1951 .