Complexity Blowup in Simulating Analog Linear Time-Invariant Systems on Digital Computers

DOI10.1109/TSP.2021.3102826MaRDI QIDQ5868751zbMATH OpenOpenAlexWikidataFDO

Authors Holger Boche, Volker Pohl

Publication date 23 September 2022

Published in IEEE Transactions on Signal Processing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tsp.2021.3102826

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Cited in

(4)

• Bit-complexity of classical solutions of linear evolutionary systems of partial differential equations
• Recent progress in computability for prediction and Wiener filter theory
• A variational framework for the complexity of PDE solutions
• What is a \textit{polynomial-time} computable square-integrable function?

This page was built for publication: Complexity Blowup in Simulating Analog Linear Time-Invariant Systems on Digital Computers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5868751)