Parallel implementation of efficient preconditioned linear solver for grid-based applications in chemical physics. I: Block Jacobi diagonalization
From MaRDI portal
Publication:856383
Recommendations
- Parallel implementation of an efficient preconditioned linear solver for grid-based applications in chemical physics. III: Improved parallel scalability for sparse matrix-vector products
- Parallel implementation of efficient preconditioned linear solver for grid-based applications in chemical physics. II: QMR linear solver
- Block jacobi preconditioning of the conjugate gradient method on a vector processor
- Parallel block preconditioning for the solution of boundary value methods
- Combinatorial preconditioning for accelerating the convergence of the parallel block Jacobi method for the symmetric eigenvalue problem
- Efficient block preconditioned eigensolvers for linear response time-dependent density functional theory
- Block and full matrix ILU preconditioners for parallel finite element solvers
- scientific article; zbMATH DE number 434789
- scientific article; zbMATH DE number 66103
Cited In (5)
- How to generate effective block Jacobi preconditioners for solving large sparse linear systems
- On the subspace projected approximate matrix method.
- Efficient implementation of the Lanczos method for magnetic systems
- Parallel implementation of an efficient preconditioned linear solver for grid-based applications in chemical physics. III: Improved parallel scalability for sparse matrix-vector products
- Parallel implementation of efficient preconditioned linear solver for grid-based applications in chemical physics. II: QMR linear solver
This page was built for publication: Parallel implementation of efficient preconditioned linear solver for grid-based applications in chemical physics. I: Block Jacobi diagonalization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q856383)