The DOI matches its Crossref record; 7 of the 7 references it cites were found in a registry or an index.
A class of methods for solving nonlinear simultaneous equations
Open accessAbstract
solution. The functions that require zeroing are real functions of real variables and it will be assumed that they are continuous and differentiable with respect to these variables. In many practical examples they are extremely complicated anld hence laborious to compute, an-d this fact has two important immediate consequences. The first is that it is impracticable to compute any derivative that may be required by the evaluation of the algebraic expression of this derivative. If derivatives are needed they must be obtained by differencing. The second is that during any iterative solution process the bulk of the computing time will be spent in evaluating the functions. Thus, the most efficient process will tenid to be that which requires the smallest number of function evaluations. This paper discusses certain modificatioins to Newton's method designed to reduce the number of function evaluations required. Results of various numerical experiments are given and conditions under which the modified versions are superior to the original are tentatively suggested.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Varga, R. S. (2000) · Springer Series in Computational Mathematics · doi:10.1007/978-3-642-05156-2 · Cited by 5,811
Powell, M. J. D. (1964) · The Computer Journal · doi:10.1093/comjnl/7.2.155 · Cited by 4,632
A Rapidly Convergent Descent Method for Minimization
Fletcher, R., & Powell, M. J. D. (1963) · The Computer Journal · doi:10.1093/comjnl/6.2.163 · Cited by 4,583
Bramble, J. H., & Varga, R. S. (1963) · Mathematics of Computation · doi:10.2307/2003862 · Cited by 4,091
Variable Metric Method for Minimization
Davidon, W. C. (1991) · SIAM Journal on Optimization · doi:10.1137/0801001 · Cited by 892
A Method for Minimizing a Sum of Squares of Non-Linear Functions Without Calculating Derivatives
Powell, M. J. D. (1965) · The Computer Journal · doi:10.1093/comjnl/7.4.303 · Cited by 759
Numerical solutions of systems of nonlinear equations
Bus, J. C. P. (1980) · Data Archiving and Networked Services (DANS) · Cited by 13
Cited by
Efficient iterative schemes for ab initio total-energy calculations using a plane-wave basis set
Kresse, G., & Furthmüller, J. (1996) · Physical Review B · doi:10.1103/physrevb.54.11169 · Cited by 123,652
Kresse, G., & Furthmüller, J. (1996) · Computational Materials Science · doi:10.1016/0927-0256(96)00008-0 · Cited by 75,638
Deep learning in neural networks: an overview
Schmidhuber, J. (2015) · Neural Networks · doi:10.1016/j.neunet.2014.09.003 · Cited by 18,570
Conditioning of quasi-Newton methods for function minimization
Shanno, D. F. (1970) · Mathematics of Computation · doi:10.1090/s0025-5718-1970-0274029-x · Cited by 3,872
First-principles computation of material properties: the ABINIT software project
Gonze, X., Beuken, J.-M., Caracas, R., Detraux, F., Fuchs, M., Rignanese, G.-M., Sindic, L., Verstraete, M., Zerah, G., Jollet, F., et al. (2002) · Computational Materials Science · doi:10.1016/s0927-0256(02)00325-7 · Cited by 3,114
Metadata
- Authors
- Broyden, C. G.
- Venue
- Mathematics of Computation
- Publisher
- American Mathematical Society (AMS)
- Published
- 1965
- Volume
- 19
- Issue
- 92
- Pages
- 577-593
- ISSN
- 0025-5718 (ISSN-L)
- 1088-6842
- OpenAlex
- W1977822596
- Cited by
- 2,788
- References
- 7
- FWCI
- 8.61
- Type
- journal article
- Language
- en
- Open access
- bronze
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: A class of methods for solving nonlinear simultaneous equations. https://app.cochat.ai/papers/10.1090/s0025-5718-1965-0198670-6
- The paper
- Broyden, C. G. (1965). A class of methods for solving nonlinear simultaneous equations. Mathematics of Computation. https://doi.org/10.1090/s0025-5718-1965-0198670-6
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.