Tuned preconditioners for the eigensolution of large SPD matrices arising in engineering problems.
From MaRDI portal
(Redirected from Publication:2829105)
Recommendations
- Efficiently preconditioned inexact Newton methods for large symmetric eigenvalue problems
- Two-stage spectral preconditioners for iterative eigensolvers.
- Numerical comparison of iterative eigensolvers for large sparse symmetric positive definite matrices
- A tuned preconditioner for inexact inverse iteration applied to Hermitian eigenvalue problems
- Preconditioned inexact Jacobi-Davidson method for large symmetric eigenvalue problems
Cites work
- scientific article; zbMATH DE number 1274356 (Why is no real title available?)
- A Case for a Biorthogonal Jacobi--Davidson Method: Restarting and Correction Equation
- A Jacobi--Davidson Iteration Method for Linear Eigenvalue Problems
- A Jacobi–Davidson Iteration Method for Linear Eigenvalue Problems
- A tuned preconditioner for inexact inverse iteration applied to Hermitian eigenvalue problems
- ARPACK Users' Guide
- Approximations of the generalized inverse of the graph Laplacian matrix
- Asymptotic Convergence of Conjugate Gradient Methods for the Partial Symmetric Eigenproblem
- Combination of Jacobi–Davidson and conjugate gradients for the partial symmetric eigenproblem
- Computing the smallest eigenpairs of the graph Laplacian
- Efficient Preconditioned Inner Solves For Inexact Rayleigh Quotient Iteration And Their Connections To The Single-Vector Jacobi–Davidson Method
- Efficiently preconditioned inexact Newton methods for large symmetric eigenvalue problems
- Fast inexact implicitly restarted Arnoldi method for generalized eigenvalue problems with spectral transformation
- ILUT: A dual threshold incomplete LU factorization
- Inexact Newton preconditioning techniques for large symmetric eigenvalue problems
- Inexact Rayleigh quotient-type methods for eigenvalue computations
- Jacobi--Davidson Style QR and QZ Algorithms for the Reduction of Matrix Pencils
- Low-rank update of preconditioners for the inexact Newton method with SPD Jacobian
- Low-rank update of preconditioners for the nonlinear Richards equation
- Numerical comparison of iterative eigensolvers for large sparse symmetric positive definite matrices
- Parallel RFSAI-BFGS preconditioners for large symmetric eigenproblems
- Quasi-Newton preconditioners for the inexact Newton method
- Shift-invert Arnoldi's method with preconditioned iterative solves
- Solution of large eigenvalue problems in electronic structure calculations
- Variable Accuracy of Matrix-Vector Products in Projection Methods for Eigencomputation
Cited in
(9)- Two-stage spectral preconditioners for iterative eigensolvers.
- Spectral preconditioners for the efficient numerical solution of a continuous branched transport model
- A tuned preconditioner for inexact inverse iteration applied to Hermitian eigenvalue problems
- Block preconditioners for linear systems in interior point methods for convex constrained optimization
- Generalized Block Tuned Preconditioners for SPD Eigensolvers
- Computing the smallest eigenpairs of the graph Laplacian
- A fast hierarchically preconditioned eigensolver based on multiresolution matrix decomposition
- GMRES convergence bounds for eigenvalue problems
- Low complexity matrix projections preserving actions on vectors
This page was built for publication: Tuned preconditioners for the eigensolution of large SPD matrices arising in engineering problems.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2829105)
