The DOI matches its Crossref record; 7 of the 7 references it cites were found in a registry or an index.
Choosing the Forcing Terms in an Inexact Newton Method
Abstract
An inexact Newton method is a generalization of Newton’s method for solving $F(x) = 0,F:\mathbb{R}^n \to \mathbb{R}^n $in which, at the kth iteration, the step $s_k $ from the current approximate solution $x_k $ is required to satisfy a condition $\|F(x_k ) + F'(x_k )s_k \| \leqslant \eta _k \|F(x_k )\|$ for a “forcing term” $\eta _k \in [0,1)$. In typical applications, the choice of the forcing terms is critical to the efficiency of the method and can affect robustness as well. Promising choices of the forcing terms are given, their local convergence properties are analyzed, and their practical performance is shown on a representative set of test problems.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
Saad, Y., & Schultz, M. H. (1986) · SIAM Journal on Scientific and Statistical Computing · doi:10.1137/0907058 · Cited by 11,154
Numerical Methods for Unconstrained Optimization and Nonlinear Equations
Dennis, J. E., & Schnabel, R. B. (1996) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611971200 · Cited by 7,615
Introduction to Numerical Analysis
Stoer, J., & Bulirsch, R. (1980) · Springer eBooks · doi:10.1007/978-1-4757-5592-3 · Cited by 2,154
Dembo, R. S., Eisenstat, S. C., & Steihaug, T. (1982) · SIAM Journal on Numerical Analysis · doi:10.1137/0719025 · Cited by 1,539
Self-citationHybrid Krylov Methods for Nonlinear Systems of Equations
Brown, P. N., & Saad, Y. (1990) · SIAM Journal on Scientific and Statistical Computing · doi:10.1137/0911026 · Cited by 751
Truncated-Newton algorithms for large-scale unconstrained optimization
Dembo, R. S., & Steihaug, T. (1983) · Mathematical Programming · doi:10.1007/bf02592055 · Cited by 420
Swarztrauber, P. N., & Sweet, R. A. (1979) · ACM Transactions on Mathematical Software · doi:10.1145/355841.355850 · Cited by 233
Cited by
SUNDIALS: Suite of nonlinear and differential/algebraic equation solvers
Hindmarsh, A. C., Brown, P. N., Grant, K. E., Lee, S. L., Serban, R., Shumaker, D. E., & Woodward, C. S. (2005) · ACM Transactions on Mathematical Software · doi:10.1145/1089014.1089020 · Cited by 2,556
Jacobian-free Newton–Krylov methods: a survey of approaches and applications
Knoll, D. A., & Keyes, D. E. (2004) · Journal of Computational Physics · doi:10.1016/j.jcp.2003.08.010 · Cited by 1,930
Numerical Solution of Richards' Equation: A Review of Advances and Challenges
Farthing, M. W., & Ogden, F. L. (2017) · Soil Science Society of America Journal · doi:10.2136/sssaj2017.02.0058 · Cited by 412
Multiphysics simulations: Challenges and opportunities
Keyes, D. E., McInnes, L. C., Woodward, C., Gropp, W., Myra, E., Pernice, M., Bell, J., Brown, J., Clo, A., Connors, J., et al. (2013) · The International Journal of High Performance Computing Applications · doi:10.1177/1094342012468181 · Cited by 389
Jones, J. E., & Woodward, C. S. (2001) · Advances in Water Resources · doi:10.1016/s0309-1708(00)00075-0 · Cited by 383
Model Reduction for Large-Scale Systems with High-Dimensional Parametric Input Space
Bui-Thanh, T., Willcox, K., & Ghattas, O. (2008) · SIAM Journal on Scientific Computing · doi:10.1137/070694855 · Cited by 367
NITSOL: A Newton Iterative Solver for Nonlinear Systems
Pernice, M., & Walker, H. F. (1998) · SIAM Journal on Scientific Computing · doi:10.1137/s1064827596303843 · Cited by 293
Self-citationProximal Newton-Type Methods for Minimizing Composite Functions
Lee, J. D., Sun, Y., & Saunders, M. A. (2014) · SIAM Journal on Optimization · doi:10.1137/130921428 · Cited by 268
A survey of truncated-Newton methods
Nash, S. G. (2000) · Journal of Computational and Applied Mathematics · doi:10.1016/s0377-0427(00)00426-x · Cited by 266
A review of nonlinear FFT-based computational homogenization methods
Schneider, M. (2021) · Acta Mechanica · doi:10.1007/s00707-021-02962-1 · Cited by 265
PETSc/TAO Users Manual (Rev. 3.19)
Argonne National Laboratory (ANL), A., Balay, S., USDOE Office of Science (SC), A. S. C. R. (., Abhyankar, S., Adams, M., Benson, S., Brown, J., Brune, P., Buschelman, K., Constantinescu, E., et al. (2023) · doi:10.2172/1968587 · Cited by 67
Metadata
- Authors
- Eisenstat, S. C., & Walker, H. F.
- Venue
- SIAM Journal on Scientific Computing
- Published
- 1996-01
- Volume
- 17
- Issue
- 1
- Pages
- 16-32
- ISSN
- 1064-8275 (ISSN-L)
- 1095-7197
- OpenAlex
- W2048369486
- Cited by
- 736
- References
- 7
- FWCI
- 12.62
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.