Evaluation of Optimization Algorithms and Noise Robustness of Sparsity-Promoting Dynamic Mode Decomposition

In the present study, we organize the existing sparsity-promoting dynamic mode decomposition (DMDsp) in terms of noise robustness, propose faster optimization algorithm for DMDsp, and evaluate its characteristics. Two kinds of DMDsp, namely system-based DMDsp (sDMDsp) and observation-based DMDsp (oD...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:IEEE access Ročník 10; s. 80748 - 80763
Hlavní autoři: Iwasaki, Yuto, Nonomura, Taku, Nakai, Kumi, Nagata, Takayuki, Saito, Yuji, Asai, Keisuke
Médium: Journal Article
Jazyk:angličtina
Vydáno: Piscataway IEEE 2022
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Témata:
ISSN:2169-3536, 2169-3536
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:In the present study, we organize the existing sparsity-promoting dynamic mode decomposition (DMDsp) in terms of noise robustness, propose faster optimization algorithm for DMDsp, and evaluate its characteristics. Two kinds of DMDsp, namely system-based DMDsp (sDMDsp) and observation-based DMDsp (oDMDsp), combined with three kinds of optimization algorithm, namely the fast iterative shrinkage thresholding algorithm (FISTA), the alternating direction method of multipliers (ADMM), and a greedy algorithm, are investigated. For both sDMDsp and oDMDsp, FISTA yields the shortest processing time. The processing time for sDMDsp with FISTA is shorter than that for oDMDsp with FISTA. The original data reconstruction errors for sDMDsp and oDMDsp are similar among the three optimization algorithms. The noise robustness for sDMDsp and oDMDsp is evaluated. sDMDsp and oDMDsp have similar robustness to observation noise, except for a system with large system and observation noise, for which oDMDsp outperforms sDMDsp.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:2169-3536
2169-3536
DOI:10.1109/ACCESS.2022.3193157