CoChat

A New Approach to Linear Filtering and Prediction Problems

Kalman, R. E. · 1960 · Journal of Basic Engineering

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

Abstract

The classical filtering and prediction problem is re-examined using the Bode-Shannon representation of random processes and the “state-transition” method of analysis of dynamic systems. New results are: (1) The formulation and methods of solution of the problem apply without modification to stationary and nonstationary statistics and to growing-memory and infinite-memory filters. (2) A nonlinear difference (or differential) equation is derived for the covariance matrix of the optimal estimation error. From the solution of this equation the co-efficients of the difference (or differential) equation of the optimal linear filter are obtained without further calculations. (3) The filtering problem is shown to be the dual of the noise-free regulator problem. The new method developed here is applied to two well-known problems, confirming and extending earlier results. The discussion is largely self-contained and proceeds from first principles; basic concepts of the theory of random processes are reviewed in the Appendix.

Overview

Integrity signals

Registry

Crossref · 10.1115/1.3662552

Cites

19 of 19 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Verification

Claims the paper makes

This paper’s full text isn’t openly available, so its claims and self-check weren’t run. The registry and citation checks still apply.

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

Citations

Cites

Cited by

See all 31,751

Metadata

Authors
Kalman, R. E.
Affiliations
Research Institute for Advanced Study, Baltimore, Md.
Corresponding author
Kalman, R. E.
Venue
Journal of Basic Engineering
Published
1960-03-01
Volume
82
Issue
1
Pages
35-45
ISSN
0021-9223 (ISSN-L)
OpenAlex
W2105934661
Cited by
31,751
References
19
Citations by year
2026: 1477 · 2025: 1680 · 2024: 1656 · 2023: 1528 · 2022: 1552 · 2021: 1751 · 2020: 1587 · 2019: 1551 · 2018: 1443 · 2017: 1307 · 2016: 1362 · 2015: 1354 · 2014: 1387 · 2013: 1286 · 2012: 1108
FWCI
13.09
Type
journal article
Language
en
Open access
closed
Locations
Journal of Basic Engineering (publishedVersion)
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Target Tracking and Data Fusion in Sensor Networks
  • Physical Sciences › Engineering › Control and Systems Engineering › Control Systems and Identification
  • Physical Sciences › Computer Science › Signal Processing › Advanced Adaptive Filtering Techniques
Keywords
linear filtering, prediction, optimal linear filter, nonlinear difference equations, regulator problem, dual problem

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.