arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1506.04770math.NAcs.NA
收藏

降维建模中的数据同化

Data Assimilation in Reduced Modeling

Peter Binev, Albert Cohen, Wolfgang Dahmen, Ronald DeVore, Guergana Petrova, Przemyslaw Wojtaszczyk

AI总结:

本文研究了在降维建模中如何通过已知线性泛函的测量数据最优恢复希尔伯特空间中的元素,提出了一种多空间问题的近最优恢复算法,通过交替投影迭代方法实现更精确的恢复。

摘要:

我们考虑了从通过已知线性泛函获得的m个测量数据中最优恢复希尔伯特空间H中元素u的问题。此类问题在假设u属于预设模型类(例如H中的已知紧致子集)时已被广泛研究。受参数偏微分方程降维建模的启发,本文考虑了另一种设定,其中关于u的额外信息以u能被某个已知子空间V_n(维数为n)或更一般地,每个k维子空间V_k(属于嵌套序列V_0⊂V_1⊂…⊂V_n)的近似程度的形式给出。对于单空间情形的恢复算法,本文证明其在选择有利基底表示V_n和测量数据时是最佳且具有简单形式的。本文的主要贡献是分析多空间情形,证明所有满足给定信息的u可描述为H中一系列已知椭球体的交集。由此可知,多空间问题的近最优恢复算法是识别交集中的任一点,其精度远优于单空间问题。本文提出了两种基于交替投影的迭代算法用于多空间问题的恢复。对其中一种的详细分析提供了后验性能估计,包括迭代的性能、停止准则和收敛速率。由于算法的极限点在上述椭球体的交集中,因此提供了u的近最优恢复。

英文摘要:

We consider the problem of optimal recovery of an element $u$ of a Hilbert space $\mathcal{H}$ from $m$ measurements obtained through known linear functionals on $\mathcal{H}$. Problems of this type are well studied \cite{MRW} under an assumption that $u$ belongs to a prescribed model class, e.g. a known compact subset of $\mathcal{H}$. Motivated by reduced modeling for parametric partial differential equations, this paper considers another setting where the additional information about $u$ is in the form of how well $u$ can be approximated by a certain known subspace $V_n$ of $\mathcal{H}$ of dimension $n$, or more generally, how well $u$ can be approximated by each $k$-dimensional subspace $V_k$ of a sequence of nested subspaces $V_0\subset V_1\cdots\subset V_n$. A recovery algorithm for the one-space formulation, proposed in \cite{MPPY}, is proven here to be optimal and to have a simple formulation, if certain favorable bases are chosen to represent $V_n$ and the measurements. The major contribution of the present paper is to analyze the multi-space case for which it is shown that the set of all $u$ satisfying the given information can be described as the intersection of a family of known ellipsoids in $\mathcal{H}$. It follows that a near optimal recovery algorithm in the multi-space problem is to identify any point in this intersection which can provide a much better accuracy than in the one-space problem. Two iterative algorithms based on alternating projections are proposed for recovery in the multi-space problem. A detailed analysis of one of them provides a posteriori performance estimates for the iterates, stopping criteria, and convergence rates. Since the limit of the algorithm is a point in the intersection of the aforementioned ellipsoids, it provides a near optimal recovery for $u$.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑