An improved iterative optimization technique for the leftmost eigenpairs of large symmetric matrices
DOI10.1016/0021-9991(88)90067-8zbMATH Open0619.65027OpenAlexW2011000353MaRDI QIDQ1089736FDOQ1089736
Authors: G. Gambolati, Giorgio Pini, Flavio Sartoretto 
Publication date: 1988
Published in: Journal of Computational Physics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0021-9991(88)90067-8
Recommendations
- 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
eigenvectorsconvergence accelerationnumerical experimentsRayleigh quotientpreconditioning matricesincomplete Cholesky factorizationconjugate gradient schemeaccelerated optimization techniquefinite element symmetric positive definite matricesleftmost eigenvaluesstepwise deflation procedurevery fast convergence rate
Computational methods for sparse matrices (65F50) Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Numerical computation of matrix norms, conditioning, scaling (65F35) Finite element methods applied to problems in solid mechanics (74S05)
Cites Work
- An Iterative Solution Method for Linear Systems of Which the Coefficient Matrix is a Symmetric M-Matrix
- Methods of conjugate gradients for solving linear systems
- A Trace Minimization Algorithm for the Generalized Eigenvalue Problem
- Title not available (Why is that?)
- Conjugate gradient type methods for unsymmetric and inconsistent systems of linear equations
- Simultaneous Rayleigh-quotient minimization methods for Ax=lambdaBx
- A numerical study of various algorithms related to the preconditioned conjugate gradient method
- A robust incomplete Choleski-conjugate gradient algorithm
- Title not available (Why is that?)
- Efficient Implementation of a Class of Preconditioned Conjugate Gradient Methods
- The incomplete Cholesky-conjugate gradient method for the iterative solution of systems of linear equations
- A class of iterative methods for finite element equations
- The computational efficiency of a new minimization algorithm for eigenvalue analysis
- Extreme eigenvalues of large sparse matrices by Rayleigh quotient and modified conjugate gradients
- Berechnung von Eigenwerten und Eigenvektoren normaler Matrizenpaare durch Ritz‐Iteration
- Iterative eigenvalue algorithms based on convergent splittings
- 𝑆𝑂𝑅-methods for the eigenvalue problem with large sparse matrices
- New iterative methods for solution of the eigenproblem
- An iterative procedure for the calculation of the lowest real eigenvalue and eigenvector of a nonsymmetric matrix
- The iterative calculation of several of the lowest or highest eigenvalues and corresponding eigenvectors of very large symmetric matrices
- Title not available (Why is that?)
- The eigenvalue problem \((A-\lambda B)x = 0\) for symmetric matrices of high order
- Preconditioned iterative methods for the large sparse symmetric eigenvalue problem
- Minimal eigenvalue of large sparse matrices by an efficient reverse power-conjugate gradient scheme
- Fast solution to finite element flow equations by newton iteration and modified conjugate gradient method
- Gradient methods for finite-element eigenproblems.
- Optimal gradient minimization scheme for finite element eigenproblems
- Numerical integration of differential equations and large linear systems. Proceedings of two Workshops held at the University of Bielefeld, Spring 1980
- Acceleration of the convergence in Nesbet's algorithm for eigenvalues and eigenvectors of large matrices
- Solution of the partial eigenproblem by iterative methods
Cited In (11)
- CONJUGATE GRADIENT METHODS FOR SOLVING THE SMALLEST EIGENPAIR OF LARGE SYMMETRIC EIGENVALUE PROBLEMS
- An orthogonal accelerated deflation technique for large symmetric eigenproblems
- On vectorizing the preconditioned generalized conjugate residual methods
- Efficient parallel solution to large‐size sparse eigenproblems with block FSAI preconditioning
- Computation of minimum eigenvalue through minimization of rayleigh's quotient for large sparse matrices using vector computer:
- 3-D nested eigenanalysis on finite element grids
- Accelerated simultaneous iterations for large finite element eigenproblems
- Extreme eigenvalues of large sparse matrices by Rayleigh quotient and modified conjugate gradients
- 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
- Block subspace projection preconditioned conjugate gradient method in modal structural analysis
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)
