Computational experience with sequential and parallel, preconditioned Jacobi--Davidson for large, sparse symmetric matrices
From MaRDI portal
(Redirected from Publication:1399640)
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
Cites work
- scientific article; zbMATH DE number 554772 (Why is no real title available?)
- scientific article; zbMATH DE number 1113878 (Why is no real title available?)
- A Jacobi–Davidson Iteration Method for Linear Eigenvalue Problems
- 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
- A new look at the Lanczos algorithm for solving symmetric systems of linear equations
- A scalable parallel algorithm for incomplete factor preconditioning
- Accelerated simultaneous iterations for large finite element eigenproblems
- An Iterative Solution Method for Linear Systems of Which the Coefficient Matrix is a Symmetric M-Matrix
- Approximate inverse preconditioning in the parallel solution of sparse eigenproblems
- Asymptotic Convergence of Conjugate Gradient Methods for the Partial Symmetric Eigenproblem
- Bi-CGSTAB: A Fast and Smoothly Converging Variant of Bi-CG for the Solution of Nonsymmetric Linear Systems
- Combination of Jacobi–Davidson and conjugate gradients for the partial symmetric eigenproblem
- Computational Variants of the Lanczos Method for the Eigenproblem
- Deflation Techniques for an Implicitly Restarted Arnoldi Iteration
- Dynamic Thick Restarting of the Davidson, and the Implicitly Restarted Arnoldi Methods
- Efficient expansion of subspaces in the Jacobi-Davidson method for standard and generalized eigenproblems
- Factorized Sparse Approximate Inverse Preconditionings I. Theory
- Inexact Newton preconditioning techniques for large symmetric eigenvalue problems
- Mixed finite elements and Newton-type linearizations for the solution of Richards' equation
- Mixed finite elements and finite volumes for density-dependent flow and transport in groundwater
- Numerical comparison of iterative eigensolvers for large sparse symmetric positive definite matrices
- Parallel incomplete factorizations with pseudo-overlapped subdomains
- Parallel iterative methods for sparse linear systems
- Parallel preconditioning of a sparse eigensolver
- Preconditioned Gradient-Type Iterative Methods in a Subspace for Partial Generalized Symmetric Eigenvalue Problems
- SOLVING SPARSE TRIANGULAR LINEAR SYSTEMS ON PARALLEL COMPUTERS
- Solution methods for eigenvalue problems in structural mechanics
- Templates for the Solution of Algebraic Eigenvalue Problems
- The Spectral Transformation Lanczos Method for the Numerical Solution of Large Sparse Generalized Symmetric Eigenvalue Problems
- The convergence of Jacobi–Davidson iterations for Hermitian eigenproblems
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
- JADAMILU: a software code for computing selected eigenvalues of large sparse symmetric matrices
- 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.
- 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
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)
