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

Complexity of preprocessing of recursive filters for running in parallel

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

DOI10.1016/0893-9659(92)90134-UzbMath0767.93079MaRDI QIDQ1187929

Andrej B. Kut'in

Publication date: 13 August 1992

Published in: Applied Mathematics Letters (Search for Journal in Brave)


zbMATH Keywords

linear feedback systemrecursive filtration


Mathematics Subject Classification ID

Filtering in stochastic control theory (93E11)


Related Items (1)

An exterior product identity for Schur functions




Cites Work

  • Die Berechnungskomplexität von elementarsymmetrischen Funktionen und von Interpolationskoeffizienten
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item




This page was built for publication: Complexity of preprocessing of recursive filters for running in parallel

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