The paper claims the Laplacian kernel enables better kernel DMD reconstruction from sparse irregular data and proves Koopman closability, but the proofs have invalid steps and circular reasoning.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.DS 1years
2025 1verdicts
REJECT 1representative citing papers
citing papers explorer
-
Kernel Dynamic Mode Decomposition For Sparse Reconstruction of Closable Koopman Operators
The paper claims the Laplacian kernel enables better kernel DMD reconstruction from sparse irregular data and proves Koopman closability, but the proofs have invalid steps and circular reasoning.