Computational experience with sequential and parallel, preconditioned Jacobi--Davidson for large, sparse symmetric matrices
From MaRDI portal
Publication:1399640
DOI10.1016/S0021-9991(03)00190-6zbMATH Open1022.65037MaRDI QIDQ1399640FDOQ1399640
Authors: Luca Bergamaschi, Giorgio Pini, Flavio Sartoretto 
Publication date: 30 July 2003
Published in: Journal of Computational Physics (Search for Journal in Brave)
Recommendations
- Parallelization strategies for subspace methods to solve large eigenproblems
- Numerical comparison of iterative eigensolvers for large sparse symmetric positive definite matrices
- scientific article; zbMATH DE number 1262866
- A Jacobi–Davidson Iteration Method for Linear Eigenvalue Problems
- Improving the parallel performance of a domain decomposition preconditioning technique in the Jacobi-Davidson method for large scale eigenvalue problems
performanceconvergenceeigenvaluespreconditioningparallel algorithmsJacobi-Davidson methodapproximate inverse preconditionerssparse approximate inverseslarge, sparse matricesparalell algorithms
Computational methods for sparse matrices (65F50) Parallel numerical computation (65Y05) Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Numerical computation of matrix norms, conditioning, scaling (65F35)
Cites Work
- Templates for the Solution of Algebraic Eigenvalue Problems
- An Iterative Solution Method for Linear Systems of Which the Coefficient Matrix is a Symmetric M-Matrix
- Parallel iterative methods for sparse linear systems
- A Jacobi–Davidson Iteration Method for Linear Eigenvalue Problems
- Bi-CGSTAB: A Fast and Smoothly Converging Variant of Bi-CG for the Solution of Nonsymmetric Linear Systems
- Factorized Sparse Approximate Inverse Preconditionings I. Theory
- A Priori Sparsity Patterns for Parallel Sparse Approximate Inverse Preconditioners
- A Sparse Approximate Inverse Preconditioner for the Conjugate Gradient Method
- A Transpose-Free Quasi-Minimal Residual Algorithm for Non-Hermitian Linear Systems
- Deflation Techniques for an Implicitly Restarted Arnoldi Iteration
- Combination of Jacobi–Davidson and conjugate gradients for the partial symmetric eigenproblem
- Computational Variants of the Lanczos Method for the Eigenproblem
- The Spectral Transformation Lanczos Method for the Numerical Solution of Large Sparse Generalized Symmetric Eigenvalue Problems
- A new look at the Lanczos algorithm for solving symmetric systems of linear equations
- Accelerated simultaneous iterations for large finite element eigenproblems
- Numerical comparison of iterative eigensolvers for large sparse symmetric positive definite matrices
- Inexact Newton preconditioning techniques for large symmetric eigenvalue problems
- Mixed finite elements and Newton-type linearizations for the solution of Richards' equation
- Dynamic Thick Restarting of the Davidson, and the Implicitly Restarted Arnoldi Methods
- A scalable parallel algorithm for incomplete factor preconditioning
- Approximate inverse preconditioning in the parallel solution of sparse eigenproblems
- Preconditioned Gradient-Type Iterative Methods in a Subspace for Partial Generalized Symmetric Eigenvalue Problems
- Asymptotic Convergence of Conjugate Gradient Methods for the Partial Symmetric Eigenproblem
- The convergence of Jacobi–Davidson iterations for Hermitian eigenproblems
- Solution methods for eigenvalue problems in structural mechanics
- Efficient expansion of subspaces in the Jacobi-Davidson method for standard and generalized eigenproblems
- Parallel incomplete factorizations with pseudo-overlapped subdomains
- Mixed finite elements and finite volumes for density-dependent flow and transport in groundwater
- Title not available (Why is that?)
- Parallel preconditioning of a sparse eigensolver
- Title not available (Why is that?)
- SOLVING SPARSE TRIANGULAR LINEAR SYSTEMS ON PARALLEL COMPUTERS
Cited In (21)
- Mathematical modeling of semiconductor quantum dots based on the nonparabolic effective-mass approximation
- A parallel implementation of the Jacobi-Davidson eigensolver for unsymmetric matrices
- Practical aspects of domain decomposition in Jacobi-Davidson for parallel performance
- Parallelization strategies for subspace methods to solve large eigenproblems
- 3-D nested eigenanalysis on finite element grids
- Preconditioning for sparse linear systems at the dawn of the 21st century: history, current developments, and future perspectives
- Improving the parallel performance of a domain decomposition preconditioning technique in the Jacobi-Davidson method for large scale eigenvalue problems
- Numerical comparison of iterative eigensolvers for large sparse symmetric positive definite matrices
- Parallel Jacobi-Davidson with block FSAI preconditioning and controlled inner iterations.
- Exploiting Multilevel Preconditioning Techniques in Eigenvalue Computations
- A parallel additive Schwarz preconditioned Jacobi-Davidson algorithm for polynomial eigenvalue problems in quantum dot simulation
- Increasing the performance of the Jacobi-Davidson method by blocking
- Parallel preconditioned conjugate gradient optimization of the Rayleigh quotient for the solution of sparse eigenproblems
- JADAMILU: a software code for computing selected eigenvalues of large sparse symmetric matrices
- Efficient parallel solution to large-size sparse eigenproblems with block FSAI preconditioning.
- The Jacobi-Davidson method
- A Parallel Jacobi--Davidson-type Method for Solving Large Generalized Eigenvalue Problems in Magnetohydrodynamics
- Approximate inverse preconditioning in the parallel solution of sparse eigenproblems
- Application of the Jacobi-Davidson method for spectral low-rank preconditioning in computational electromagnetics problems
- A numerical experimental study of inverse preconditioning for the parallel iterative solution to 3D finite element flow equations
- Preconditioned inexact Jacobi-Davidson method for large symmetric eigenvalue problems
Uses Software
This page was built for publication: Computational experience with sequential and parallel, preconditioned Jacobi--Davidson for large, sparse symmetric matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1399640)
