Computational experience with sequential and parallel, preconditioned Jacobi–Davidson for large, sparse symmetric matrices
Authors:
- Luca BergamaschiLBLuca Bergamaschi
- Giorgio PiniGPGiorgio Pini
- Flavio SartorettoFSFlavio Sartoretto
- 10 June 2003
- journal article
- Published by Elsevier in Journal of Computational Physics
- Vol. 188 (1) , 318-331
Abstract
No abstract availableKeywords
This publication has 26 references indexed in Scilit:
- Numerical comparison of iterative eigensolvers for large sparse symmetric positive definite matricesComputer Methods in Applied Mechanics and Engineering, 2002
- Parallel preconditioning of a sparse eigensolverParallel Computing, 2001
- Parallel Implementation and Practical Use of Sparse Approximate Inverse Preconditioners with a Priori Sparsity PatternsThe International Journal of High Performance Computing Applications, 2001
- Approximate inverse preconditioning in the parallel solution of sparse eigenproblemsNumerical Linear Algebra with Applications, 2000
- A Priori Sparsity Patterns for Parallel Sparse Approximate Inverse PreconditionersSIAM Journal on Scientific Computing, 2000
- Mixed finite elements and Newton-type linearizations for the solution of Richards' equationInternational Journal for Numerical Methods in Engineering, 1999
- Asymptotic Convergence of Conjugate Gradient Methods for the Partial Symmetric EigenproblemNumerical Linear Algebra with Applications, 1997
- A Sparse Approximate Inverse Preconditioner for the Conjugate Gradient MethodSIAM Journal on Scientific Computing, 1996
- SOLVING SPARSE TRIANGULAR LINEAR SYSTEMS ON PARALLEL COMPUTERSInternational Journal of High Speed Computing, 1989
- Solution methods for eigenvalue problems in structural mechanicsInternational Journal for Numerical Methods in Engineering, 1973