An improved iterative optimization technique for the leftmost eigenpairs of large symmetric matrices
accelerated optimization techniqueconjugate gradient schemeconvergence accelerationeigenvectorsfinite element symmetric positive definite matricesincomplete Cholesky factorizationleftmost eigenvaluesnumerical experimentspreconditioning matricesRayleigh quotientstepwise deflation procedurevery fast convergence rate
An accelerated optimization technique combined with a stepwise deflation procedure is presented for the efficient evaluation of the p (p\(\leq 20)\) leftmost eigenvalues and eigenvectors of finite element symmetric positive definite matrices of very large size. The optimization is performed on the Rayleigh quotient of the deflated matrices by the aid of a conjugate gradient (CG) scheme effectively preconditioned with the incomplete Cholesky factorization. No a priori estimate of acceleration parameters is required. Numerical experiments on large arbitrarily sparse problems taken from the engineering finite elements practice show a very fast convergence rate for any value of p within the explored interval and particularly so for the minimal eigenpair. In this case the number of iterations needed to achieve an accurate solution may by as much as 2 orders of magnitude smaller than the problem size. Several results concerning the spectral behavior of the CG preconditioning matrices are also given and discussed.
- Extreme eigenvalues of large sparse matrices by Rayleigh quotient and modified conjugate gradients
- An orthogonal accelerated deflation technique for large symmetric eigenproblems
- Accelerated simultaneous iterations for large finite element eigenproblems
- Computation of minimum eigenvalue through minimization of rayleigh's quotient for large sparse matrices using vector computer:
- CONJUGATE GRADIENT METHODS FOR SOLVING THE SMALLEST EIGENPAIR OF LARGE SYMMETRIC EIGENVALUE PROBLEMS
- A class of iterative methods for finite element equations
- A numerical study of various algorithms related to the preconditioned conjugate gradient method
- A robust incomplete Choleski-conjugate gradient algorithm
- A Trace Minimization Algorithm for the Generalized Eigenvalue Problem
- Acceleration of the convergence in Nesbet's algorithm for eigenvalues and eigenvectors of large matrices
- An iterative procedure for the calculation of the lowest real eigenvalue and eigenvector of a nonsymmetric matrix
- An Iterative Solution Method for Linear Systems of Which the Coefficient Matrix is a Symmetric M-Matrix
- Berechnung von Eigenwerten und Eigenvektoren normaler Matrizenpaare durch Ritz‐Iteration
- Conjugate gradient type methods for unsymmetric and inconsistent systems of linear equations
- Efficient Implementation of a Class of Preconditioned Conjugate Gradient Methods
- Extreme eigenvalues of large sparse matrices by Rayleigh quotient and modified conjugate gradients
- Fast solution to finite element flow equations by newton iteration and modified conjugate gradient method
- Gradient methods for finite-element eigenproblems.
- scientific article; zbMATH DE number 3181418 (Why is no real title available?)
- scientific article; zbMATH DE number 3671573 (Why is no real title available?)
- scientific article; zbMATH DE number 3083850 (Why is no real title available?)
- Iterative eigenvalue algorithms based on convergent splittings
- Methods of conjugate gradients for solving linear systems
- Minimal eigenvalue of large sparse matrices by an efficient reverse power-conjugate gradient scheme
- New iterative methods for solution of the eigenproblem
- Numerical integration of differential equations and large linear systems. Proceedings of two Workshops held at the University of Bielefeld, Spring 1980
- Optimal gradient minimization scheme for finite element eigenproblems
- Preconditioned iterative methods for the large sparse symmetric eigenvalue problem
- Simultaneous Rayleigh-quotient minimization methods for Ax=lambdaBx
- Solution of the partial eigenproblem by iterative methods
- The computational efficiency of a new minimization algorithm for eigenvalue analysis
- The eigenvalue problem \((A-\lambda B)x = 0\) for symmetric matrices of high order
- The incomplete Cholesky-conjugate gradient method for the iterative solution of systems of linear equations
- The iterative calculation of several of the lowest or highest eigenvalues and corresponding eigenvectors of very large symmetric matrices
- 𝑆𝑂𝑅-methods for the eigenvalue problem with large sparse matrices
- Extreme eigenvalues of large sparse matrices by Rayleigh quotient and modified conjugate gradients
- Accelerated simultaneous iterations for large finite element eigenproblems
- An orthogonal accelerated deflation technique for large symmetric eigenproblems
- Block subspace projection preconditioned conjugate gradient method in modal structural analysis
- 3-D nested eigenanalysis on finite element grids
- Computation of minimum eigenvalue through minimization of rayleigh's quotient for large sparse matrices using vector computer:
- On vectorizing the preconditioned generalized conjugate residual methods
- CONJUGATE GRADIENT METHODS FOR SOLVING THE SMALLEST EIGENPAIR OF LARGE SYMMETRIC EIGENVALUE PROBLEMS
- LEFTMOST EIGENVALUE OF REAL AND COMPLEX SPARSE MATRICES ON PARALLEL COMPUTER USING APPROXIMATE INVERSE PRECONDITIONING
- Numerical comparison of preconditionings for large sparse finite element problems
- Efficient parallel solution to large-size sparse eigenproblems with block FSAI preconditioning.
This page was built for publication: An improved iterative optimization technique for the leftmost eigenpairs of large symmetric matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1089736)
