Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 221

The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.

Some new algorithms for recursive estimation in constant, linear, discrete-time systems

Morf, M., Sidhu, G., Kailath, T.·1974·IEEE Transactions on Automatic Control

Abstract

Certain recently developed fast algorithms for recursive estimation in constant continuous-time linear systems are extended to discrete-time systems. The main feature is the replacement of the Riccati-type difference equation that is generally used for such problems by another set of difference equations that we call of Chandrasekhar-type. The total number of operations in the new algorithm is in general less than with the Riccati-equation based Kalman filter, with significant reductions being obtained in several important special cases. The algorithms are derived via a factorization of increments of the Riccati equation variable, a method that can be extended to nonsymmetric Riccati equations as well.

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1109/tac.1974.1100576

Cites

1 of 1 references verified0 citation errors · 0 not checkable

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.

A few free checks a day · papers already verified open instantly · results are public

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

Show all 1 references

Cited by

See all 221

Metadata

Authors
Morf, M., Sidhu, G., & Kailath, T.
Venue
IEEE Transactions on Automatic Control
Published
1974-08
Volume
19
Issue
4
Pages
315-323
ISSN
0018-9286 (ISSN-L)
OpenAlex
W2087006469
Cited by
221
References
1
FWCI
13.31
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: Some new algorithms for recursive estimation in constant, linear, discrete-time systems. https://app.cochat.ai/papers/10.1109/tac.1974.1100576
The paper
Morf, M., Sidhu, G., & Kailath, T. (1974). Some new algorithms for recursive estimation in constant, linear, discrete-time systems. IEEE Transactions on Automatic Control. https://doi.org/10.1109/tac.1974.1100576

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.