Fast secant methods for the iterative solution of large nonsymmetric linear systems
From MaRDI portal
Recommendations
Cited in
(20)- Quasi-Newton acceleration for equality-constrained minimization
- A faster Broyden method
- Inexact-Newton methods for semismooth systems of equations with block-angular structure
- A minimal residual class of algorithms for linear systems
- Practical quasi-Newton methods for solving nonlinear systems
- The grand four: affine invariant globalizations of Newton's method
- Under-relaxed quasi-Newton acceleration for an inverse fixed-point problem coming from positron emission tomography
- A numerical study on large-scale nonlinear solvers
- An extension of the theory of secant preconditioners
- Inexact Newton methods for solving nonsmooth equations
- A new family of preconditioned iterative solvers for nonsymmetric linear systems
- Efficient solution of nonlinear elliptic problems using hierarchical matrices with Broyden updates
- Special issue: GAMM 2000. Annual meeting. Short communications in mathematics and mechanics, section 9-25. Univ. of Göttingen, Germany, April 2--7, 2000
- A variable metric method for approximating generalized inverses of matrices
- Composing scalable nonlinear algebraic solvers
- Two classes of multisecant methods for nonlinear acceleration
- scientific article; zbMATH DE number 440674 (Why is no real title available?)
- Solving nonlinear systems of equations by means of quasi-neston methods with a nonmonotone stratgy∗
- Numerical methods for nonlinear equations
- An analysis for the DIIS acceleration method used in quantum chemistry calculations
This page was built for publication: Fast secant methods for the iterative solution of large nonsymmetric linear systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3355148)