Reduced basis methods build low-rank approximation spaces for the solution sets of parameterized PDEs by computing solutions of the given PDE for appropriately selected snapshot parameters. Localized reduced basis methods reduce the offline cost of computing these snapshot solutions by instead constructing a global space from spatially localized less expensive problems. In the case of online enrichment, these local problems are iteratively solved in regions of high residual and correspond to subdomain solves in domain decomposition methods. We show in this note that indeed there is a close relationship between online-enriched localized reduced basis and domain decomposition methods by introducing a Localized Reduced Basis Additive Schwarz method (LRBAS), which can be interpreted as a locally adaptive multi-preconditioning scheme for the CG method.
翻译:降低基数的方法通过计算特定PDE为适当选择的快照参数的解决方案,为参数化PDE的成套解决方案建立低空近似空间; 降低基数的本地化方法,通过从空间上不太昂贵的问题构建全球空间,降低计算这些快照解决方案的离线成本; 在网上浓缩方面,这些本地问题在高残留区得到迭接解决,与域分解方法的子域域解决方案相对应。 我们在本说明中表明,在网上浓缩的本地化减少基数和域分解方法之间确实存在密切关系,采用了本地化的减少基础Additve Schwarz方法(LRBAS),该方法可以被解释为CG方法的本地适应性多端调制方案。