Efficiently preconditioned inexact Newton methods for large symmetric eigenvalue problems
From MaRDI portal
Publication:2943819
DOI10.1080/10556788.2014.908878zbMath1327.65051arXiv1312.1553OpenAlexW2003829014MaRDI QIDQ2943819
Luca Bergamaschi, Àngeles Martínez
Publication date: 4 September 2015
Published in: Optimization Methods and Software (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1312.1553
Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Direct numerical methods for linear systems and matrix inversion (65F05) Numerical solution of nonlinear eigenvalue and eigenvector problems (65H17)
Related Items (3)
Generalized Block Tuned Preconditioners for SPD Eigensolvers ⋮ Preconditioned inexact Newton-like method for large nonsymmetric eigenvalue problems ⋮ Tuned preconditioners for the eigensolution of large SPD matrices arising in engineering problems
Cites Work
- Low-rank update of preconditioners for the inexact Newton method with SPD Jacobian
- Interior point methods 25 years later
- Parallel Rayleigh quotient optimization with FSAI-based preconditioning
- The iterative calculation of a few of the lowest eigenvalues and corresponding eigenvectors of large real-symmetric matrices
- Inexact Rayleigh quotient-type methods for eigenvalue computations
- Parallel RFSAI-BFGS preconditioners for large symmetric eigenproblems
- Numerical comparison of iterative eigensolvers for large sparse symmetric positive definite matrices
- Preconditioning indefinite systems in interior point methods for optimization
- Solution of large eigenvalue problems in electronic structure calculations
- Low-rank update of preconditioners for the nonlinear Richards equation
- On mutual impact of numerical linear algebra and large-scale optimization with focus on interior point methods
- Rayleigh quotient iteration and simplified Jacobi-Davidson method with preconditioned iterative solves
- Inexact constraint preconditioners for linear systems arising in interior point methods
- Fast Inexact Implicitly Restarted Arnoldi Method for Generalized Eigenvalue Problems with Spectral Transformation
- Efficient Preconditioned Inner Solves For Inexact Rayleigh Quotient Iteration And Their Connections To The Single-Vector Jacobi–Davidson Method
- Nonsymmetric Preconditioner Updates in Newton–Krylov Methods for Nonlinear Systems
- Preconditioning indefinite systems in interior point methods for large scale linear optimisation
- A note on hybrid preconditioners for large-scale normal equations arising from interior-point methods
- Convergence Analysis of Iterative Solvers in Inexact Rayleigh Quotient Iteration
- Shift-Invert Arnoldi's Method with Preconditioned Iterative Solves
- GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
- A Numerical Study of the Limited Memory BFGS Method and the Truncated-Newton Method for Large Scale Optimization
- Jacobi--Davidson Style QR and QZ Algorithms for the Reduction of Matrix Pencils
- Asymptotic Convergence of Conjugate Gradient Methods for the Partial Symmetric Eigenproblem
- Accelerated Inexact Newton Schemes for Large Systems of Nonlinear Equations
- Deflation Techniques for an Implicitly Restarted Arnoldi Iteration
- A Case for a Biorthogonal Jacobi--Davidson Method: Restarting and Correction Equation
- A Jacobi–Davidson Iteration Method for Linear Eigenvalue Problems
- Approximations of the Generalized Inverse of the Graph Laplacian Matrix
- A Preconditioning Framework for Sequences of Diagonally Modified Linear Systems Arising in Optimization
- Combination of Jacobi–Davidson and conjugate gradients for the partial symmetric eigenproblem
This page was built for publication: Efficiently preconditioned inexact Newton methods for large symmetric eigenvalue problems
