swMATH13371MaRDI QIDQ25285FDOQ25285
Author name not available (Why is that?)
Official website: http://web.stanford.edu/group/SOL/software/minres/
Cited In (60)
- On the non-singularity of the quasi-Newton-least squares method
- A domain decomposition Rayleigh-Ritz algorithm for symmetric generalized eigenvalue problems
- Statistical ranking and combinatorial Hodge theory
- The Conjugate Residual Method in Linesearch and Trust-Region Methods
- 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
- Acquired Clustering Properties and Solution of Certain Saddle Point Systems
- 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
- Euclidean-norm error bounds for SYMMLQ and CG
- Implementation of an interior point method with basis preconditioning
- 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
- LSMB: minimizing the backward error for least-squares problems
- Accuracy of the Lanczos process for the eigenproblem and solution of equations
- Do you trust derivatives or differences?
- LSLQ: an iterative method for linear least-squares with an error minimization property
- A robust iterative scheme for symmetric indefinite systems
- Backward step control for global Newton-type methods
- GMRES
- LSQR
- MUSCOP
- BiCOR
- CORS
- HSL_MI20
- An active-set algorithm for norm constrained quadratic problems
- Projected Krylov methods for saddle-point systems
- FACTORIZE
- CCLIB
- MINRES-QLP
- BEAMLAB
- LSMR
- Goal-oriented optimal approximations of Bayesian linear inverse problems
- Preconditioned steepest descent-like methods for symmetric indefinite systems
- ACELAN-COMPOS
- A class of approximate inverse preconditioners based on Krylov-subspace methods for large-scale nonconvex optimization
- SG
- Quotient-space boundary element methods for scattering at complex screens
- Stopping Criteria for the Iterative Solution of Linear Least Squares Problems
- Numerical equivalences among Krylov subspace algorithms for skew-symmetric matrices
- Krylov.jl
- Linear systems arising in interior methods for convex optimization: a symmetric formulation with bounded condition number
- Fast iterative solver for the optimal control of time‐dependent PDEs with Crank–Nicolson discretization in time
- 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
- 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
- Solution of Sparse Indefinite Systems of Linear Equations
- Hodge Laplacians on graphs
- LNLQ: an iterative method for least-norm problems with an error minimization property
- CRAIG
- paper-regularized-qn-benchmark
- A Matrix-Free Algorithm for Equality Constrained Optimization Problems with Rank-Deficient Jacobians
- On the solution of the Neumann Poisson problem arising from a compact differencing scheme using the full multi-grid method
This page was built for software: MINRES
