Recomputing the shift in each iteration makes shifted Cholesky QR robust up to condition numbers of 10^20, with an updating scheme and block panels for iterative model order reduction.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.NA 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Towards an Efficient Shifted Cholesky QR for Applications in Model Order Reduction using pyMOR
Recomputing the shift in each iteration makes shifted Cholesky QR robust up to condition numbers of 10^20, with an updating scheme and block panels for iterative model order reduction.