The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
A Stable and Efficient Algorithm for Nonlinear Orthogonal Distance Regression
Abstract
One of the most widely used methodologies in scientific and engineering research is the fitting of equations to data by least squares. In cases where significant observation errors exist in the independent variables as well as the dependent variables, however, the ordinary least squares (OLS) approach, where all errors are attributed to the dependent variable, is often inappropriate. An alternate approach, suggested by several researchers, involves minimizing the sum of squared orthogonal distances between each data point and the curve described by the model equation. We refer to this as orthogonal distance regression (ODR). This paper describes a method for solving the orthogonal distance regression problem that is a direct analog of the trust region Levenberg-Marquardt algorithm. The number of unknowns involved is the number of model parameters plus the number of data points, often a very large number. By exploiting sparsity, however, our algorithm has a computational effort per step which is of the same order as required for the Levenberg-Marquardt method for ordinary least squares. We prove our algorithm to be globally and locally convergent, and perform computational tests that illustrate some differences between ODR and OLS.
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
Golub, G. (2012) · doi:10.56021/9781421407944 · Cited by 34,505
Solving Least Squares Problems
Lawson, C. L., & Hanson, R. J. (1995) · doi:10.1137/1.9781611971217 · Cited by 7,103
Cited by
Bundle Adjustment — A Modern Synthesis
Triggs, B., McLauchlan, P. F., Hartley, R. I., & Fitzgibbon, A. W. (2000) · Lecture Notes in Computer Science · doi:10.1007/3-540-44480-7_21 · Cited by 3,988
Least-squares fitting of circles and ellipses
Gander, W., Golub, G. H., & Strebel, R. (1994) · BIT · doi:10.1007/bf01934268 · Cited by 860
NONLINEAR DYNAMICAL SYSTEM IDENTIFICATION FROM UNCERTAIN AND INDIRECT MEASUREMENTS
VOSS, H. U., TIMMER, J., & KURTHS, J. (2004) · International Journal of Bifurcation and Chaos · doi:10.1142/s0218127404010345 · Cited by 293
The Calibration Index and Taxonomy for Robot Kinematic Calibration Methods
Hollerbach, J. M., & Wampler, C. W. (1996) · The International Journal of Robotics Research · doi:10.1177/027836499601500604 · Cited by 293
Globally optimised parameters for a model of mitotic control in frog egg extracts.
Zwolak, J. W., Tyson, J. J., & Watson, L. T. (2005) · IEE Proceedings - Systems Biology · doi:10.1049/ip-syb:20045032 · Cited by 49
Metadata
- Authors
- Boggs, P. T., Byrd, R. H., & Schnabel, R. B.
- Venue
- SIAM Journal on Scientific and Statistical Computing
- Published
- 1987-11
- Volume
- 8
- Issue
- 6
- Pages
- 1052-1078
- ISSN
- 0196-5204 (ISSN-L)
- 2168-3417
- OpenAlex
- W2075788737
- Cited by
- 369
- References
- 2
- FWCI
- 9.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
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 Stable and Efficient Algorithm for Nonlinear Orthogonal Distance Regression. https://app.cochat.ai/papers/10.1137/0908085
- The paper
- Boggs, P. T., Byrd, R. H., & Schnabel, R. B. (1987). A Stable and Efficient Algorithm for Nonlinear Orthogonal Distance Regression. SIAM Journal on Scientific and Statistical Computing. https://doi.org/10.1137/0908085
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.