Tuned preconditioners for the eigensolution of large SPD matrices arising in engineering problems.
From MaRDI portal
Publication:2829105
DOI10.1002/NLA.2032zbMATH Open1413.65101OpenAlexW2533725447MaRDI QIDQ2829105FDOQ2829105
Publication date: 26 October 2016
Published in: Numerical Linear Algebra with Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/nla.2032
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
Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Preconditioners for iterative methods (65F08)
Cites Work
- ARPACK Users' Guide
- ILUT: A dual threshold incomplete LU factorization
- Title not available (Why is that?)
- A Jacobi–Davidson Iteration Method for Linear Eigenvalue Problems
- A Jacobi--Davidson Iteration Method for Linear Eigenvalue Problems
- Jacobi--Davidson Style QR and QZ Algorithms for the Reduction of Matrix Pencils
- Combination of Jacobi–Davidson and conjugate gradients for the partial symmetric eigenproblem
- Inexact Rayleigh quotient-type methods for eigenvalue computations
- Solution of large eigenvalue problems in electronic structure calculations
- Low-rank update of preconditioners for the inexact Newton method with SPD Jacobian
- Quasi-Newton preconditioners for the inexact Newton method
- Numerical comparison of iterative eigensolvers for large sparse symmetric positive definite matrices
- Inexact Newton preconditioning techniques for large symmetric eigenvalue problems
- Efficient Preconditioned Inner Solves For Inexact Rayleigh Quotient Iteration And Their Connections To The Single-Vector Jacobi–Davidson Method
- A tuned preconditioner for inexact inverse iteration applied to Hermitian eigenvalue problems
- Asymptotic Convergence of Conjugate Gradient Methods for the Partial Symmetric Eigenproblem
- Fast inexact implicitly restarted Arnoldi method for generalized eigenvalue problems with spectral transformation
- Shift-Invert Arnoldi's Method with Preconditioned Iterative Solves
- Variable Accuracy of Matrix-Vector Products in Projection Methods for Eigencomputation
- Low-rank update of preconditioners for the nonlinear Richards equation
- Parallel RFSAI-BFGS preconditioners for large symmetric eigenproblems
- Efficiently preconditioned inexact Newton methods for large symmetric eigenvalue problems
- Approximations of the Generalized Inverse of the Graph Laplacian Matrix
- Computing the smallest eigenpairs of the graph Laplacian
- A Case for a Biorthogonal Jacobi--Davidson Method: Restarting and Correction Equation
Cited In (8)
- 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
- GMRES convergence bounds for eigenvalue problems
- Low complexity matrix projections preserving actions on vectors
- A Fast Hierarchically Preconditioned Eigensolver Based on Multiresolution Matrix Decomposition
Uses Software
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)
