Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Comparative computational analysis of a new per-sample partitioning linear filter and the Kalman filter

From MaRDI portal
Publication:3764032
Jump to:navigation, search

DOI10.1080/00207728708963972zbMath0627.93079OpenAlexW1982897309MaRDI QIDQ3764032

K. E. Anagnostou, Demetrios G. Lainiotis

Publication date: 1987

Published in: International Journal of Systems Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207728708963972


zbMATH Keywords

algorithmKalman filterlinear estimation problempartitioning approachcomparative computational analysismultisensor estimation


Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Filtering in stochastic control theory (93E11) Estimation and detection in stochastic control theory (93E10) Linear systems in control theory (93C05) Probabilistic methods, stochastic differential equations (65C99)


Related Items (1)

New doubling algorithm for the discrete periodic Riccati equation




Cites Work

  • Unnamed Item
  • On computational efficiency of linear filtering algorithms




This page was built for publication: Comparative computational analysis of a new per-sample partitioning linear filter and the Kalman filter

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3764032&oldid=17304650"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 5 February 2024, at 12:06.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki