An integrated Davidson and multigrid solution approach for very large scale symmetric eigenvalue problems
From MaRDI portal
Publication:5935674
DOI10.1016/S0045-7825(00)00283-8zbMath1006.74085WikidataQ127754207 ScholiaQ127754207MaRDI QIDQ5935674
No author found.
Publication date: 12 March 2003
Published in: Computer Methods in Applied Mechanics and Engineering (Search for Journal in Brave)
Rayleigh quotientmultigrid methodcorrection equationDavidson methodJacobi-Davidson methodlarge scale eigenvalue problemsmodified inflated Newton scheme
Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Finite element methods applied to problems in solid mechanics (74S05) Thin bodies, structures (74K99) Iterative numerical methods for linear systems (65F10)
Related Items
Increasing the Performance of the Jacobi--Davidson Method by Blocking ⋮ Parallel two-level domain decomposition based Jacobi-Davidson algorithms for pyramidal quantum dot simulation ⋮ The Jacobi-Davidson method
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- A multilevel variational method for \(Au=\lambda Bu\) on composite grids
- A new look at the Lanczos algorithm for solving symmetric systems of linear equations
- The iterative calculation of a few of the lowest eigenvalues and corresponding eigenvectors of large real-symmetric matrices
- Inexact Newton preconditioning techniques for large symmetric eigenvalue problems
- A block Rayleigh quotient iteration with local quadratic convergence
- Efficient expansion of subspaces in the Jacobi-Davidson method for standard and generalized eigenproblems
- Preconditioning eigensolvers -- an Oxymoron?
- Restarting techniques for the (Jacobi-)Davidson symmetric eigenvalue method
- A non-nested Galerkin multi-grid method for solving linear and nonlinear solid mechanics problems
- Jacobi-Davidson type methods for generalized eigenproblems and polynomial eigenproblems
- Alternative correction equations in the Jacobi-Davidson method
- GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
- Generalizations of Davidson’s Method for Computing Eigenvalues of Sparse Symmetric Matrices
- The Multifrontal Method for Sparse Matrix Solution: Theory and Practice
- Bi-CGSTAB: A Fast and Smoothly Converging Variant of Bi-CG for the Solution of Nonsymmetric Linear Systems
- An alternating digital tree (ADT) algorithm for 3D geometric searching and intersection problems
- Multi-Level Adaptive Solutions to Boundary-Value Problems
- A multi-grid enhanced GMRES algorithm for elasto-plastic problems
- A Truncated RQ Iteration for Large Scale Eigenvalue Calculations
- Jacobi--Davidson Style QR and QZ Algorithms for the Reduction of Matrix Pencils
- A Shifted Block Lanczos Algorithm for Solving Sparse Symmetric Generalized Eigenproblems
- Dynamic Thick Restarting of the Davidson, and the Implicitly Restarted Arnoldi Methods
- Coarse mesh evolution strategies in the Galerkin multigrid method with adaptive remeshing for geometrically non-linear problems
- A Jacobi–Davidson Iteration Method for Linear Eigenvalue Problems
- A Flexible Inner-Outer Preconditioned GMRES Algorithm
