Approximate inverse preconditioning in the parallel solution of sparse eigenproblems
From MaRDI portal
Recommendations
- Parallel preconditioning of a sparse eigensolver
- LEFTMOST EIGENVALUE OF REAL AND COMPLEX SPARSE MATRICES ON PARALLEL COMPUTER USING APPROXIMATE INVERSE PRECONDITIONING
- Parallel Preconditioning with Sparse Approximate Inverses
- Computational experience with sequential and parallel, preconditioned Jacobi--Davidson for large, sparse symmetric matrices
- Numerical experiments with two approximate inverse preconditioners
Cites work
Cited in
(30)- Shifted FSAI preconditioners for the efficient parallel solution of non-linear groundwater flow models
- Polynomial preconditioners based on factorized sparse approximate inverses
- Preconditioning techniques for large linear systems: A survey
- A sparse approximate inverse preconditioner for parallel preconditioning of general sparse matrices
- Об одной вычислительной реализации блочного метода Гаусса-Зейделя для нормальных систем уравнений
- scientific article; zbMATH DE number 1138094 (Why is no real title available?)
- Computing the smallest eigenpairs of the graph Laplacian
- A Fast Parallel Algorithm for Selected Inversion of Structured Sparse Matrices with Application to 2D Electronic Structure Calculations
- Computational experience with sequential and parallel, preconditioned Jacobi--Davidson for large, sparse symmetric matrices
- Preconditioning for sparse linear systems at the dawn of the 21st century: history, current developments, and future perspectives
- A geometric theory for preconditioned inverse iteration. III: A short and sharp convergence estimate for generalized eigenvalue problems
- Parallel Rayleigh quotient optimization with FSAI-based preconditioning
- Stabilized approximate inverse preconditioning based on A-orthogonalization process for parallel finite element analysis
- Numerical comparison of iterative eigensolvers for large sparse symmetric positive definite matrices
- Block regularization Kaczmarz method
- LEFTMOST EIGENVALUE OF REAL AND COMPLEX SPARSE MATRICES ON PARALLEL COMPUTER USING APPROXIMATE INVERSE PRECONDITIONING
- Preconditioning constrained eigenvalue problems
- Deflation by restriction for the inverse-free preconditioned Krylov subspace method
- Sparse Hierarchical Preconditioners Using Piecewise Smooth Approximations of Eigenvectors
- Parallel preconditioned conjugate gradient optimization of the Rayleigh quotient for the solution of sparse eigenproblems
- Efficient parallel solution to large-size sparse eigenproblems with block FSAI preconditioning.
- Approximate eigen-decomposition preconditioners for solving numerical PDE problems
- Stabilized and block approximate inverse preconditioners for problems in solid and structural mechanics
- A new approximate inverse preconditioner based on the Vaidya’s maximum spanning tree for matrix equation AXB = C
- A parallel solver for large-scale Markov chains
- Approximate inverse preconditioners for some large dense random electrostatic interaction matrices
- Scalable Parallel Preconditioning with the Sparse Approximate Inverse of Triangular Matrices
- A partitioned shift-without-invert algorithm to improve parallel eigensolution efficiency in real-space electronic transport
- Preconditioning complex symmetric linear systems
- Parallel preconditioning of a sparse eigensolver
This page was built for publication: Approximate inverse preconditioning in the parallel solution of sparse eigenproblems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2760332)
