The DOI matches its Crossref record; 10 of the 10 references it cites were found in a registry or an index.
Discrete square root filtering: A survey of current techniques
Abstract
The conventional Kalman approach to discrete filtering involves propagation of a state estimate and an error covariance matrix from stage to stage. Alternate recursive relationships have been developed to propagate a state estimate and a square root error covariance instead. Although equivalent algebraically to the conventional approach, the square root filters exhibit improved numerical characteristics, particularly in ill-conditioned problems. In this paper, current techniques in square root filtering are surveyed and related by applying a duality association. Four efficient square root implementations are suggested, and compared with three common conventional implementations in terms of computational complexity and precision. The square root computational burden should not exceed the conventional by more than 50 percent in most practical problems. An examination of numerical conditioning predicts that the square root approach can yield twice the effective precision of the conventional filter in ill-conditioned problems. This prediction is verified in two examples. The excellent numerical characteristics and reasonable computation requirements of the square root approach make it a viable alternative to the conventional filter in many applications, particularly when computer word length is limited, or the estimation problem is badly conditioned.
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
A New Approach to Linear Filtering and Prediction Problems
Kalman, R. E. (1960) · Journal of Basic Engineering · doi:10.1115/1.3662552 · Cited by 31,751
THE THEORY OF MATRICES IN NUMERICAL ANALYSIS
Mirsky, L. (1965) · Journal of the London Mathematical Society · doi:10.1112/jlms/s1-40.1.378b · Cited by 1,148
Numerical methods for solving linear least squares problems
Golub, G. (1965) · Numerische Mathematik · doi:10.1007/bf01436075 · Cited by 849
Linear least squares solutions by householder transformations
Businger, P., & Golub, G. H. (1965) · Numerische Mathematik · doi:10.1007/bf01436084 · Cited by 508
Solving linear least squares problems by Gram-Schmidt orthogonalization
Björck, Å. (1967) · BIT · doi:10.1007/bf01934122 · Cited by 470
Battin, R. H. (1964) · Cited by 337
Computational Methods of Linear Algebra.
Lewis, D. J., Faddeev, D. K., Faddeeva, V. N., & Williams, R. C. (1966) · The American Mathematical Monthly · doi:10.2307/2315509 · Cited by 256
Experiments on Gram-Schmidt orthogonalization
Rice, J. R. (1966) · Mathematics of Computation · doi:10.1090/s0025-5718-1966-0192673-4 · Cited by 169
Extensions and applications of the Householder algorithm for solving linear least squares problems
Hanson, R. J., & Lawson, C. L. (1969) · Mathematics of Computation · doi:10.1090/s0025-5718-1969-0258258-9 · Cited by 158
Extension of square-root filtering to include process noise
Dyer, P., & McReynolds, S. R. (1969) · Journal of Optimization Theory and Applications · doi:10.1007/bf00929358 · Cited by 140
Cited by
Arasaratnam, I., & Haykin, S. (2009) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2009.2019800 · Cited by 3,380
Cubature Kalman Filtering for Continuous-Discrete Systems: Theory and Simulations
Arasaratnam, I., Haykin, S., & Hurd, T. R. (2010) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2010.2056923 · Cited by 580
Tracking and Kalman Filtering Made Easy
Brookner, E. (1998) · doi:10.1002/0471224197 · Cited by 435
Classification, Parameter Estimation and State Estimation: An Engineering Approach Using MATLAB ®
Heijden, F. V. D., Duin, R. P. W., de Ridder, D., & Tax, D. M. J. (2004) · Wiley eBooks · doi:10.1002/0470090154 · Cited by 403
Metadata
- Authors
- Kaminski, P., Bryson, A., & Schmidt, S.
- Venue
- IEEE Transactions on Automatic Control
- Published
- 1971-12
- Volume
- 16
- Issue
- 6
- Pages
- 727-736
- ISSN
- 0018-9286 (ISSN-L)
- OpenAlex
- W2022749616
- Cited by
- 468
- References
- 10
- FWCI
- 10.48
- 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: Discrete square root filtering: A survey of current techniques. https://app.cochat.ai/papers/10.1109/tac.1971.1099816
- The paper
- Kaminski, P., Bryson, A., & Schmidt, S. (1971). Discrete square root filtering: A survey of current techniques. IEEE Transactions on Automatic Control. https://doi.org/10.1109/tac.1971.1099816
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.