Restructures incremental SVD to batch updates, proving exact-arithmetic equivalence, a sharpened sqrt(n) tol truncation bound, and orthogonality loss independent of stream length n under a probabilistic rounding model.
Brand , Fast low-rank modifications of the thin singular value decomposition , Linear Al- gebra Appl., 415 (2006), pp
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
verdicts
UNVERDICTED 2representative citing papers
An iSVD-based adaptive ROM framework updates reduced bases with occasional full-order snapshots, showing improved accuracy and efficiency over direct adaptation baselines on Burgers, Sod, and rotating detonation engine problems.
citing papers explorer
-
An Improved Incremental Singular Value Decomposition and New Error Bounds
Restructures incremental SVD to batch updates, proving exact-arithmetic equivalence, a sharpened sqrt(n) tol truncation bound, and orthogonality loss independent of stream length n under a probabilistic rounding model.
-
History-aware adaptive reduced-order models via incremental singular value decomposition
An iSVD-based adaptive ROM framework updates reduced bases with occasional full-order snapshots, showing improved accuracy and efficiency over direct adaptation baselines on Burgers, Sod, and rotating detonation engine problems.