Accelerated simultaneous iterations for large finite element eigenproblems
The problem of computing some few of the smallest eigenvalues and corresponding eigenvectors of the generalized eigenvalue problem \(Ax=\lambda B_ x\) for symmetric, positive definite and sparse matrices A and B of high order is considered. An attractive idea and an algorithm are described that iterates simultaneously a set of vectors in order to find the smallest stationary values of the Rayleigh quotient by means of the method of conjugate gradients. This basic algorithm with known bad convergence properties is combined with a preconditioning of the eigenvalue problem by using an incomplete factorization of A to improve substantially the convergence. Numerical experiments indicate the superiority of the preconditioned simultaneous Rayleigh quotient minimization algorithm over existing methods that exploit the sparsity to a full extent.
- scientific article; zbMATH DE number 3997026
- Extreme eigenvalues of large sparse matrices by Rayleigh quotient and modified conjugate gradients
- Publication:3212187
- Computation of minimum eigenvalue through minimization of rayleigh's quotient for large sparse matrices using vector computer:
- scientific article; zbMATH DE number 440672
- m-Step Preconditioned Conjugate Gradient Methods
- A class of first order factorization methods
- A new look at the Lanczos algorithm for solving symmetric systems of linear 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
- An improved iterative optimization technique for the leftmost eigenpairs of large symmetric matrices
- An iterative method for large systems of linear structural equations
- An Iterative Solution Method for Linear Systems of Which the Coefficient Matrix is a Symmetric M-Matrix
- Block Preconditioning for the Conjugate Gradient Method
- Computational Variants of the Lanczos Method for the Eigenproblem
- Coupling of substructures for dynamic analyses.
- 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
- Finite hybrid elements to compute the ideal magnetohydrodynamic spectrum of an axisymmetric plasma
- scientific article; zbMATH DE number 3181418 (Why is no real title available?)
- scientific article; zbMATH DE number 3658896 (Why is no real title available?)
- Incomplete factorization for finite element methods
- Numerical comparison of preconditionings for large sparse finite element problems
- Numerische Behandlung von Eigenwertaufgaben. Tagung über numerische Behandlung von Eigenwertaufgaben vom 19. bis 24. November 1972
- Partial Elimination
- Partial solution of large symmetric generalized eigenvalue problems by nonlinear optimization of a modified Rayleigh quotient
- Polynomial Preconditioners for Conjugate Gradient Calculations
- Practical Use of Polynomial Preconditionings for the Conjugate Gradient Method
- Preconditioned conjugate residual methods for the solution of spectral equations
- Preconditioning and Two-Level Multigrid Methods of Arbitrary Degree of Approximation
- Simultaneous Rayleigh-quotient minimization methods for Ax=lambdaBx
- The incomplete Cholesky-conjugate gradient method for the iterative solution of systems of linear equations
- The Spectral Transformation Lanczos Method for the Numerical Solution of Large Sparse Generalized Symmetric Eigenvalue Problems
- Extreme eigenvalues of large sparse matrices by Rayleigh quotient and modified conjugate gradients
- An improved iterative optimization technique for the leftmost eigenpairs of large symmetric matrices
- A partial preconditioned conjugate gradient method for large eigenproblems
- An orthogonal accelerated deflation technique for large symmetric eigenproblems
- Computational experience with sequential and parallel, preconditioned Jacobi--Davidson for large, sparse symmetric matrices
- Parallel preconditioned conjugate gradient optimization of the Rayleigh quotient for the solution of sparse eigenproblems
- scientific article; zbMATH DE number 440672 (Why is no real title available?)
- scientific article; zbMATH DE number 4195040 (Why is no real title available?)
- Solution of the partial eigenproblem by iterative methods
- 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:
- scientific article; zbMATH DE number 3911581 (Why is no real title available?)
- Effective algorithms for solving the eigenvalue problem
- scientific article; zbMATH DE number 4096232 (Why is no real title available?)
- Preconditioned iterative algorithms for large sparse unsymmetric problems
- scientific article; zbMATH DE number 48355 (Why is no real title available?)
- scientific article; zbMATH DE number 176177 (Why is no real title available?)
- A memory saving fast A-EFIE solver for modeling low-frequency large-scale problems
- CONJUGATE GRADIENT METHODS FOR SOLVING THE SMALLEST EIGENPAIR OF LARGE SYMMETRIC EIGENVALUE PROBLEMS
- scientific article; zbMATH DE number 1985702 (Why is no real title available?)
- On an iterative method for finding lovver eigenvalues
- A Numerical Study of Eigenvalues of the Hyperbolic Laplacian for Polyhedra with One Cusp
- Concurrent iterative solution of large finite element systems
- scientific article; zbMATH DE number 3997026 (Why is no real title available?)
- On the preconditioned conjugate gradient method for solving (A – λB)X =0
- Efficient parallel solution to large-size sparse eigenproblems with block FSAI preconditioning.
- scientific article; zbMATH DE number 278841 (Why is no real title available?)
- Computing several eigenpairs of Hermitian problems by conjugate gradient iterations
This page was built for publication: Accelerated simultaneous iterations for large finite element eigenproblems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1115098)