scientific article; zbMATH DE number 7828152
From MaRDI portal
Publication:6123717
DOI10.12386/a20210026MaRDI QIDQ6123717
De-Tong Zhu, Jue-Yu Wang, Chao Gu
Publication date: 8 April 2024
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
global convergenceLanczos methodinexact-Newton methodsymmetric nonlinear equationsNewton-Krylov subspace method
Cites Work
- Unnamed Item
- Unnamed Item
- Inexact Newton method via Lanczos decomposed technique for solving box-constrained nonlinear systems
- Variations on Arnoldi's method for computing eigenelements of large unsymmetric matrices
- A new presentation of orthogonal polynomials with applications to their computation
- Avoiding breakdown and near-breakdown in Lanczos type algorithms
- Globally convergent inexact quasi-Newton methods for solving nonlinear systems
- A Globally Convergent Newton-GMRES Subspace Method for Systems of Nonlinear Equations
- On the Residual Norm in FOM and GMRES
- Hybrid Krylov Methods for Nonlinear Systems of Equations
- GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
- Inexact Newton Methods
- Bi-CGSTAB: A Fast and Smoothly Converging Variant of Bi-CG for the Solution of Nonsymmetric Linear Systems
- Convergence Theory of Nonlinear Newton–Krylov Algorithms
- Globally Convergent Inexact Newton Methods
- Tensor-GMRES Method for Large Systems of Nonlinear Equations
- Nonmonotone Spectral Methods for Large-Scale Nonlinear Systems
- Choosing the Forcing Terms in an Inexact Newton Method
- Globally convergent algorithms for solving unconstrained optimization problems
- On Convergence of the Additive Schwarz Preconditioned Inexact Newton Method
- A Theoretical Comparison of the Arnoldi and GMRES Algorithms
- The principle of minimized iterations in the solution of the matrix eigenvalue problem
- Benchmarking optimization software with performance profiles.
This page was built for publication:
