The DOI matches its Crossref record.
Solution of Equations and Systems of Equations
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
Cited by
On the Convergence Properties of the EM Algorithm
Wu, C. F. J. (1983) · The Annals of Statistics · doi:10.1214/aos/1176346060 · Cited by 3,269
Mixture Densities, Maximum Likelihood and the EM Algorithm
Redner, R. A., & Walker, H. F. (1984) · SIAM Review · doi:10.1137/1026034 · Cited by 2,693
Iterative methods for linear and nonlinear equations
(1996) · Choice Reviews Online · doi:10.5860/choice.33-4556 · Cited by 1,947
Convergence Conditions for Ascent Methods
Wolfe, P. (1969) · SIAM Review · doi:10.1137/1011036 · Cited by 1,106
Iterative Procedures for Nonlinear Integral Equations
Anderson, D. G. (1965) · Journal of the ACM · doi:10.1145/321296.321305 · Cited by 979
Principal Component Analysis of Three-Mode Data by Means of Alternating Least Squares Algorithms
Kroonenberg, P. M., & de Leeuw, J. (1980) · Psychometrika · doi:10.1007/bf02293599 · Cited by 724
Biconvex sets and optimization with biconvex functions: a survey and extensions
Gorski, J., Pfeuffer, F., & Klamroth, K. (2007) · Mathematical Methods of Operations Research · doi:10.1007/s00186-007-0161-1 · Cited by 690
An algorithm with guaranteed convergence for finding a zero of a function
Brent, R. P. (1971) · The Computer Journal · doi:10.1093/comjnl/14.4.422 · Cited by 533
Designing structured tight frames via an alternating projection method
Tropp, J. A., Dhillon, I. S., Heath, R. W., & Strohmer, T. (2005) · IEEE Transactions on Information Theory · doi:10.1109/tit.2004.839492 · Cited by 494
A new method of solving the liquid structure integral equations
Gillan, M. J. (1979) · Molecular Physics · doi:10.1080/00268977900102861 · Cited by 344
On the Convergence of the EM Algorithm
Boyles, R. A. (1983) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1983.tb01229.x · Cited by 333
Theory of algorithms for unconstrained optimization
Nocedal, J. (1992) · Acta Numerica · doi:10.1017/s0962492900002270 · Cited by 333
Anistropy of the Constant-Energy Surfaces inn-Type BiTe32andBi2Se3from Galvanomagnetic Coefficients
Caywood, L. P., & Miller, G. R. (1970) · Physical Review B · doi:10.1103/physrevb.2.3209 · Cited by 89
Metadata
- Authors
- I., E., & Ostrowski, A. M.
- Venue
- Mathematics of Computation
- Publisher
- JSTOR
- Published
- 1967-10
- Volume
- 21
- Issue
- 100
- Pages
- 732
- ISSN
- 0025-5718 (ISSN-L)
- OpenAlex
- W1975400766
- Cited by
- 937
- References
- 0
- FWCI
- 22.54
- 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.