MINRES-QLP

swMATH11181MaRDI QIDQ23128FDOQ23128

Author name not available (Why is that?)

Described by source

• MINRES-QLP: a Krylov subspace method for indefinite or singular symmetric systems
• Algorithm 937: MINRES-QLP for symmetric and Hermitian linear equations and least-squares problems

Cited In (25)

• A domain decomposition Rayleigh-Ritz algorithm for symmetric generalized eigenvalue problems
• Spectral condition‐number estimation of large sparse matrices
• Statistical ranking and combinatorial Hodge theory
• Solving Large-Scale Cubic Regularization by a Generalized Eigenvalue Problem
• Approximate Generalized Inverses with Iterative Refinement for $\epsilon$-Accurate Preconditioning of Singular Systems
• Conjugate gradients for symmetric positive semidefinite least-squares problems
• MINRES: from negative curvature detection to monotonicity properties
• On the convergence of Q-OR and Q-MR Krylov methods for solving nonsymmetric linear systems
• A transpose-free quasi-minimal residual variant of the CORS method for solving non-Hermitian linear systems
• Preconditioned GMRES method for a class of Toeplitz linear systems in fractional eigenvalue problems
• A Nonmonotone Matrix-Free Algorithm for Nonlinear Equality-Constrained Least-Squares Problems
• On moment methods in Krylov subspaces
• Absorption kinetics of vacancies by cavities in aluminum: numerical characterization of sink strengths and first-passage statistics through Krylov subspace projection and eigenvalue deflation
• Inexact Newton-type methods based on Lanczos orthonormal method and application for full waveform inversion
• Accuracy of the Lanczos process for the eigenproblem and solution of equations
• Do you trust derivatives or differences?
• A robust iterative scheme for symmetric indefinite systems
• An active-set algorithm for norm constrained quadratic problems
• Preconditioned steepest descent-like methods for symmetric indefinite systems
• A class of approximate inverse preconditioners based on Krylov-subspace methods for large-scale nonconvex optimization
• BiLQ: an iterative method for nonsymmetric linear systems with a quasi-minimum error property
• <scp>TriCG</scp> and <scp>TriMR</scp>: Two Iterative Methods for Symmetric Quasi-definite Systems
• Critical point-finding methods reveal gradient-flat regions of deep network losses
• Convergence of Newton-MR under inexact Hessian information
• Hodge Laplacians on graphs

This page was built for software: MINRES-QLP