Papers › On-the-fly algorithm for Dynamic Mode Decomposition using Incremental Singular Value...
On-the-fly algorithm for Dynamic Mode Decomposition using Incremental Singular Value Decomposition and Total Least Squares
Daiki Matsumoto, Thomas Indinger
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
Dynamic Mode Decomposition (DMD) is a useful tool to effectively extract the dominant dynamic flow structure from a unsteady flow field. However, DMD requires massive computational resources with respect to memory consumption and the usage of storage. In this paper, an alternative incremental algorithm of Total DMD (Incremental TDMD) is proposed which is based on Incremental Singular Value Decomposition (SVD). The advantage of Incremental TDMD compared to the existing on-the-fly algorithms of DMD is that Sparsity-Promoting DMD (SPDMD) can be performed after the incremental process without saving huge datasets on the disk space. SPDMD combined with Incremental TDMD enable the effective identification of dominant modes which are relevant to the results from conventional TDMD combined with SPDMD.
In Syntology Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections