The DOI matches its Crossref record; 19 of the 19 references it cites were found in a registry or an index.
Two classes of multisecant methods for nonlinear acceleration
Abstract
Many applications in science and engineering lead to models that require solving large‐scale fixed point problems, or equivalently, systems of nonlinear equations. Several successful techniques for handling such problems are based on quasi‐Newton methods that implicitly update the approximate Jacobian or inverse Jacobian to satisfy a certain secant condition. We present two classes of multisecant methods which allow to take into account a variable number of secant equations at each iteration. The first is the Broyden‐like class, of which Broyden's family is a subclass, and Anderson mixing is a particular member. The second class is that of the nonlinear Eirola–Nevanlinna‐type methods. This work was motivated by a problem in electronic structure calculations, whereby a fixed point iteration, known as the self‐consistent field (SCF) iteration, is accelerated by various strategies termed ‘mixing’. Copyright © 2008 John Wiley & Sons, Ltd.
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
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
Levary, R. R. (1982) · European Journal of Operational Research · doi:10.1016/0377-2217(82)90093-5 · Cited by 4,158
Numerical Methods for Least Squares Problems
Björck, Å. (1996) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611971484 · Cited by 3,257
Numerical methods for least squares problems
(1996) · Choice Reviews Online · doi:10.5860/choice.34-1602 · Cited by 3,007
A class of methods for solving nonlinear simultaneous equations
Broyden, C. G. (1965) · Mathematics of Computation · doi:10.1090/s0025-5718-1965-0198670-6 · Cited by 2,788
(2007) · Springer eBooks · doi:10.1007/978-0-387-71107-2 · Cited by 2,687
Quasi-Newton Methods, Motivation and Theory
Dennis, Jr., & Moré, J. J. (1977) · SIAM Review · doi:10.1137/1019005 · Cited by 1,553
Handbook of Numerical Analysis
(2009) · Handbook of Numerical Analysis · doi:10.1016/s1570-8659(09)70001-8 · Cited by 990
Iterative Procedures for Nonlinear Integral Equations
Anderson, D. G. (1965) · Journal of the ACM · doi:10.1145/321296.321305 · Cited by 979
Hybrid 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
Self-citationModified Broyden’s method for accelerating convergence in self-consistent calculations
Johnson, D. D. (1988) · Physical Review B · doi:10.1103/physrevb.38.12807 · Cited by 593
A Comparative Study on Methods for Convergence Acceleration of Iterative Vector Sequences
Eyert, V. (1996) · Journal of Computational Physics · doi:10.1006/jcph.1996.0059 · Cited by 376
Kronik, L., Makmal, A., Tiago, M. L., Alemany, M. M. G., Jain, M., Huang, X., Saad, Y., & Chelikowsky, J. R. (2006) · physica status solidi (b) · doi:10.1002/pssb.200541463 · Cited by 324
Self-citationVanderbilt, D., & Louie, S. G. (1984) · Physical Review B · doi:10.1103/physrevb.30.6118 · Cited by 320
Quantum Theory of Real Materials
(1996) · Kluwer international series in engineering and computer science · doi:10.1007/978-1-4613-0461-6 · Cited by 239
Practical quasi-Newton methods for solving nonlinear systems
Martı́nez, J. M. (2000) · Journal of Computational and Applied Mathematics · doi:10.1016/s0377-0427(00)00434-9 · Cited by 223
Broyden's method for self-consistent field convergence acceleration
Srivastava, G. P. (1984) · Journal of Physics A Mathematical and General · doi:10.1088/0305-4470/17/6/002 · Cited by 130
Evolution of Magnetism in Iron from the Atom to the Bulk
Tiago, M. L., Zhou, Y., Alemany, M. M. G., et al. (2006) · Physical Review Letters · doi:10.1103/physrevlett.97.147201 · Cited by 92
Diagonalization methods in PARSEC
Saad, Y. E.-M., Zhou, Y., Bekas, C., et al. (2006) · physica status solidi (b) · doi:10.1002/pssb.200666816 · Cited by 15
Self-citation
Cited by
Kühne, T. D., Iannuzzi, M., Del Ben, M., Rybkin, V. V., Seewald, P., Stein, F., Laino, T., Khaliullin, R. Z., Schütt, O., Schiffmann, F., et al. (2020) · The Journal of Chemical Physics · doi:10.1063/5.0007045 · Cited by 4,468
Anderson Acceleration for Fixed-Point Iterations
Walker, H. F., & Ni, P. (2011) · SIAM Journal on Numerical Analysis · doi:10.1137/10078356x · Cited by 590
A new generation 99 line Matlab code for compliance topology optimization and its extension to 3D
Ferrari, F., & Sigmund, O. (2020) · Structural and Multidisciplinary Optimization · doi:10.1007/s00158-020-02629-w · Cited by 265
A review of nonlinear FFT-based computational homogenization methods
Schneider, M. (2021) · Acta Mechanica · doi:10.1007/s00707-021-02962-1 · Cited by 265
Metadata
- Authors
- Fang, H., & Saad, Y.
- Venue
- Numerical Linear Algebra with Applications
- Publisher
- Wiley
- Published
- 2008-08-26
- Volume
- 16
- Issue
- 3
- Pages
- 197-221
- ISSN
- 1070-5325 (ISSN-L)
- 1099-1506
- OpenAlex
- W2100514507
- Cited by
- 309
- References
- 19
- FWCI
- 3.06
- 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.