Tuned preconditioners for the eigensolution of large SPD matrices arising in engineering problems

DOI10.1002/NLA.2032zbMath1413.65101OpenAlexW2533725447MaRDI QIDQ2829105

Àngeles Martínez

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

zbMATH Keywords

eigenvaluesLanczos methodNewton methodBFGS updateincomplete Cholesky preconditionerSPD matrix

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Preconditioners for iterative methods (65F08)

Related Items (7)

GMRES convergence bounds for eigenvalue problems ⋮ Spectral preconditioners for the efficient numerical solution of a continuous branched transport model ⋮ Low complexity matrix projections preserving actions on vectors ⋮ A Fast Hierarchically Preconditioned Eigensolver Based on Multiresolution Matrix Decomposition ⋮ Generalized Block Tuned Preconditioners for SPD Eigensolvers ⋮ Computing the smallest eigenpairs of the graph Laplacian ⋮ Block preconditioners for linear systems in interior point methods for convex constrained optimization

Uses Software

• JDQR
• ARPACK
• KELLEY
• JDQZ
• ILUT
• JDCG

Cites Work

• Unnamed Item
• Low-rank update of preconditioners for the inexact Newton method with SPD Jacobian
• Quasi-Newton preconditioners for the inexact Newton method
• Inexact Newton preconditioning techniques for large symmetric eigenvalue problems
• Inexact Rayleigh quotient-type methods for eigenvalue computations
• Computing the smallest eigenpairs of the graph Laplacian
• Parallel RFSAI-BFGS preconditioners for large symmetric eigenproblems
• Numerical comparison of iterative eigensolvers for large sparse symmetric positive definite matrices
• Solution of large eigenvalue problems in electronic structure calculations
• Low-rank update of preconditioners for the nonlinear Richards equation
• Fast Inexact Implicitly Restarted Arnoldi Method for Generalized Eigenvalue Problems with Spectral Transformation
• Efficiently preconditioned inexact Newton methods 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
• Shift-Invert Arnoldi's Method with Preconditioned Iterative Solves
• Jacobi--Davidson Style QR and QZ Algorithms for the Reduction of Matrix Pencils
• Asymptotic Convergence of Conjugate Gradient Methods for the Partial Symmetric Eigenproblem
• ARPACK Users' Guide
• A Jacobi--Davidson Iteration Method for Linear Eigenvalue Problems
• A Case for a Biorthogonal Jacobi--Davidson Method: Restarting and Correction Equation
• ILUT: A dual threshold incomplete LU factorization
• A Jacobi–Davidson Iteration Method for Linear Eigenvalue Problems
• Approximations of the Generalized Inverse of the Graph Laplacian Matrix
• Combination of Jacobi–Davidson and conjugate gradients for the partial symmetric eigenproblem
• Variable Accuracy of Matrix-Vector Products in Projection Methods for Eigencomputation

This page was built for publication: Tuned preconditioners for the eigensolution of large SPD matrices arising in engineering problems