An inexact Newton-Lanczos method for solving a system of nonlinear equations
From MaRDI portal
Recommendations
- The inexact-Newton via GMRES subspace method without line search technique for solving symmetric nonlinear equations
- Inexact Newton method via Lanczos decomposed technique for solving box-constrained nonlinear systems
- A nonmonotone inexact Newton algorithm for nonlinear systems of equations
- A nonmonotone hybrid method of conjugate gradient and Lanczos-type for solving nonlinear systems
- Globally convergent inexact quasi-Newton methods for solving nonlinear systems
Cites work
- A globally convergent Newton-GMRES subspace method for systems of nonlinear equations
- A new presentation of orthogonal polynomials with applications to their computation
- A Theoretical Comparison of the Arnoldi and GMRES Algorithms
- An unconstrained optimization test functions collection
- Avoiding breakdown and near-breakdown in Lanczos type algorithms
- Benchmarking optimization software with performance profiles.
- Bi-CGSTAB: A Fast and Smoothly Converging Variant of Bi-CG for the Solution of Nonsymmetric Linear Systems
- Choosing the Forcing Terms in an Inexact Newton Method
- Convergence Theory of Nonlinear Newton–Krylov Algorithms
- Globally convergent algorithms for solving unconstrained optimization problems
- Globally Convergent Inexact Newton Methods
- Globally convergent inexact quasi-Newton methods for solving nonlinear systems
- GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
- scientific article; zbMATH DE number 781821 (Why is no real title available?)
- Hybrid Krylov Methods for Nonlinear Systems of Equations
- Inexact Newton method via Lanczos decomposed technique for solving box-constrained nonlinear systems
- Inexact Newton Methods
- Nonmonotone Spectral Methods for Large-Scale Nonlinear Systems
- On Convergence of the Additive Schwarz Preconditioned Inexact Newton Method
- On the residual norm in FOM and GMRES
- Tensor-GMRES Method for Large Systems of Nonlinear Equations
- The principle of minimized iterations in the solution of the matrix eigenvalue problem
- Variations on Arnoldi's method for computing eigenelements of large unsymmetric matrices
This page was built for publication: An inexact Newton-Lanczos method for solving a system of nonlinear equations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6123717)