✦ LIBER ✦

CONJUGATE GRADIENT METHODS FOR SOLVING THE SMALLEST EIGENPAIR OF LARGE SYMMETRIC EIGENVALUE PROBLEMS

✍ Scribed by Y. T. FENG; D. R. J. OWEN

Publisher: John Wiley and Sons
Year: 1996
Tongue: English
Weight: 1000 KB
Volume: 39
Category: Article
ISSN: 0029-5981
DOI: 10.1002/(sici)1097-0207(19960715)39:13<2209::aid-nme951>3.0.co;2-r

No coin nor oath required. For personal study only.

✦ Synopsis

In this paper, a detailed description of CG for evaluating eigenvalue problems by minimizing the Rayleigh quotient is presented from both theoretical and computational viewpoints. Three variants of CG together with their asymptotic behaviours and restarted schemes are discussed. In addition, it is shown that with a generally selected preconditioning matrix the actual performance of the PCG scheme may not be superior to an accelerated inverse power method. Finally, some test problems in the finite element simulation of 2-D and 3-D large scale structural models with up to 20200 unknowns are performed to examine and demonstrate the performances.

📜 SIMILAR VOLUMES

An economical method for determining the

An economical method for determining the smallest eigenvalues of large linear systems

✍ G. C. Wright; G. A. Miles 📂 Article 📅 1971 🏛 John Wiley and Sons 🌐 English ⚖ 478 KB

Asymptotic Convergence of Conjugate Grad

Asymptotic Convergence of Conjugate Gradient Methods for the Partial Symmetric Eigenproblem

✍ Luca Bergamaschi; Giuseppe Gambolati; Giorgio Pini 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 149 KB

Recently an efficient method (DACG) for the partial solution of the symmetric generalized eigenproblem Ax = λBx has been developed, based on the conjugate gradient (CG) minimization of the Rayleigh quotient over successive deflated subspaces of decreasing size. The present paper provides a numerical

New Methods for Calculations of the Lowe

New Methods for Calculations of the Lowest Eigenvalues of the Real Symmetric Generalized Eigenvalue Problem

✍ Alexander V. Mitin 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 71 KB

A new iterative method based on a Newton correction vector for extension of the Krylov subspace, its diagonal, and band versions are proposed for calculation of selected lowest eigenvalues and corresponding eigenvectors of the generalized symmetric eigenvalue problem. Additionally, diagonal and band

Efficient Computational Schemes of the C

Efficient Computational Schemes of the Conjugate Gradient Method for Solving Linear Systems

✍ Stepan G. Mulyarchik; Stanislav S. Bielawski; Andrew V. Popov 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 444 KB

An approximate method for the standard i

An approximate method for the standard interval eigenvalue problem of real non-symmetric interval matrices

✍ Qiu, Zhiping ;Müller, Peter C. ;Frommer, Andreas 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 94 KB 👁 2 views

An iterative method for solving a large

An iterative method for solving a large dense matrix in the method of moments solution of an electrostatic problem

✍ Ritu Singh; Surendra Singh 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 77 KB 👁 1 views

## Abstract This paper illustrates the application of Wynn's vector ε‐algorithm to solve a system of equations arising in the method of moments (MoM) solution of an electrostatic problem. Since the method is iterative, it does not require inversion of a matrix. The degree of accuracy of the solutio