Numerical comparison of iterative eigensolvers for large sparse symmetric positive definite matrices
type: Item
instance of: scholarly article
title: Numerical comparison of iterative eigensolvers for large sparse symmetric positive definite matrices
zbMATH Open document ID: 1016.65013
DOI: 10.1016/S0045-7825(02)00457-7
published in: Computer Methods in Applied Mechanics and Engineering
publication date: 2003-05-06T00:00:00Z
Mathematics Subject Classification ID: 65F15
Mathematics Subject Classification ID: 35J25
Mathematics Subject Classification ID: 65N06
Mathematics Subject Classification ID: 65N30
Mathematics Subject Classification ID: 65F50
zbMATH DE Number: 1906450
zbMATH Keywords: eigenvalues
zbMATH Keywords: sparse symmetric matrices
zbMATH Keywords: diffusion equation
zbMATH Keywords: iterative methods
zbMATH Keywords: deflation accelerated conjugate gradient method
zbMATH Keywords: Lanczos method
zbMATH Keywords: comparison of methods
zbMATH Keywords: numerical examples
zbMATH Keywords: Jacobi-Davidson method
zbMATH Keywords: partial eigenspectrum
zbMATH Keywords: large sparse matrices
zbMATH Keywords: numerical experiments
zbMATH Keywords: finite element
zbMATH Keywords: finite difference
Wikidata QID: Q62925950
author: Luca Bergamaschi
author: Mario Putti
describes a project that uses: JDQR
describes a project that uses: JDQZ
describes a project that uses: ILUT
describes a project that uses: ARPACK
MaRDI profile type: Publication
cites work: A Sparse Approximate Inverse Preconditioner for the Conjugate Gradient Method
cites work: Asymptotic Convergence of Conjugate Gradient Methods for the Partial Symmetric Eigenproblem
cites work: Approximate inverse preconditioning in the parallel solution of sparse eigenproblems
cites work: Parallel preconditioning of a sparse eigensolver
cites work: Q3137917
cites work: Nested Iterations for Symmetric Eigenproblems
cites work: An orthogonal accelerated deflation technique for large symmetric eigenproblems
cites work: Preconditioned Gradient-Type Iterative Methods in a Subspace for Partial Generalized Symmetric Eigenvalue Problems
cites work: Deflation Techniques for an Implicitly Restarted Arnoldi Iteration
cites work: ARPACK Users' Guide
cites work: An Iterative Solution Method for Linear Systems of Which the Coefficient Matrix is a Symmetric M-Matrix
cites work: Lanczos versus subspace iteration for solution of eigenvalue problems
cites work: Computational Variants of the Lanczos Method for the Eigenproblem
cites work: The Software Scene in the Extraction of Eigenvalues from Sparse Matrices
cites work: Variations on Arnoldi's method for computing eigenelements of large unsymmetric matrices
cites work: Numerical methods for large eigenvalue problems
cites work: ILUT: A dual threshold incomplete LU factorization
cites work: GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
cites work: A Jacobi–Davidson Iteration Method for Linear Eigenvalue Problems
cites work: Templates for the Solution of Algebraic Eigenvalue Problems
cites work: Bi-CGSTAB: A Fast and Smoothly Converging Variant of Bi-CG for the Solution of Nonsymmetric Linear Systems
description: scientific article; zbMATH DE number 1906450