MINRES

swMATH13371MaRDI QIDQ25285FDOQ25285

Author name not available (Why is that?)

Cited In (44)

• Accuracy of the Lanczos Process for the Eigenproblem and Solution of Equations
• On the non-singularity of the quasi-Newton-least squares method
• 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
• A Robust Iterative Scheme for Symmetric Indefinite Systems
• Conjugate gradients for symmetric positive semidefinite least-squares problems
• Acquired Clustering Properties and Solution of Certain Saddle Point Systems
• A Class of Approximate Inverse Preconditioners Based on Krylov-Subspace Methods for Large-Scale Nonconvex Optimization
• On the convergence of Q-OR and Q-MR Krylov methods for solving nonsymmetric linear systems
• MINRES-QLP: A Krylov Subspace Method for Indefinite or Singular Symmetric Systems
• Projected Krylov Methods for Saddle-Point Systems
• A transpose-free quasi-minimal residual variant of the CORS method for solving non-Hermitian linear systems
• Goal-Oriented Optimal Approximations of Bayesian Linear Inverse Problems
• 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
• Do you trust derivatives or differences?
• Critical Point-Finding Methods Reveal Gradient-Flat Regions of Deep Network Losses
• BiLQ: An Iterative Method for Nonsymmetric Linear Systems with a Quasi-Minimum Error Property
• Convergence of Newton-MR under Inexact Hessian Information
• Euclidean-Norm Error Bounds for SYMMLQ and CG
• Backward step control for global Newton-type methods
• An active-set algorithm for norm constrained quadratic problems
• Hodge Laplacians on Graphs
• Preconditioned steepest descent-like methods for symmetric indefinite systems
• LNLQ: An Iterative Method for Least-Norm Problems with an Error Minimization Property
• Quotient-space boundary element methods for scattering at complex screens
• Algorithm 937
• Stopping Criteria for the Iterative Solution of Linear Least Squares Problems
• Numerical equivalences among Krylov subspace algorithms for skew-symmetric matrices
• LSLQ: An Iterative Method for Linear Least-Squares with an Error Minimization Property
• MINRES: From Negative Curvature Detection to Monotonicity Properties
• A Domain Decomposition Rayleigh--Ritz Algorithm for Symmetric Generalized Eigenvalue Problems
• 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
• <scp>TriCG</scp> and <scp>TriMR</scp>: Two Iterative Methods for Symmetric Quasi-definite Systems
• LSMB: Minimizing the Backward Error for Least-Squares Problems
• Solution of Sparse Indefinite Systems of Linear Equations
• 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