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

精确离散化、紧框架以及通过 D-最优设计进行恢复

Exact discretization, tight frames and recovery via D-optimal designs

Faculty of Mathematics of Chemnitz University of Technology(开姆尼茨工业大学数学系);Institute of Mathematics of NAS of Ukraine(乌克兰国家科学院数学研究所)

Felix Bartel, Lutz Kämmerer, Kateryna Pozharska, Martin Schäfer, Tino Ullrich

AI总结:

本文利用最大化 Gramian 行列式的 D-最优设计,在 L2 中确定性构造紧框架、精确离散测度与加权最小二乘恢复点权,并给出点数上界及格点规则的不可能性结果。

摘要:

D-最优设计起源于统计学文献,是一种用于最优实验设计的方法。在数值分析中,由极大行列式产生的点和权重被证明对求积和插值很有用。同样在最近,两位本文作者及其合作者研究了其与一致范数下离散化问题之间的联系。在这里,我们使用这种关于点和权重最大化某个 Gramian 矩阵行列式的方法,来构造 L2 中的紧框架和精确 Marcinkiewicz–Zygmund 不等式。我们提出了一种直接且构造性的方法,得到一个至多具有 N≤n²+1 个原子的离散测度,该测度对包含在给定 n 维子空间中的复值函数的 L2 范数进行离散且精确的子采样。该方法同样可用于从 L2 中的一般 RKHS 重构函数,此时只能访问最重要的特征函数。我们以可验证且确定性的方式为加权最小二乘恢复过程构造点和权重;与早期最优但属于概率性的方法相比,我们在收敛速率上付出了代价。一般结果适用于 d-球面,或适用于 T^d 上谱支集包含在任意有限指标集 I⊂Z^d 中的多元三角多项式。它们可以使用至多 |I|²−|I|+1 个点和权重进行离散化。数值实验表明了该结果的尖锐性。作为一个负面结果,我们证明:一般而言,在不对 I 的结构附加条件的情况下,不可能仅通过基数 |I| 来控制重构格点规则中的点数。我们用数值实验支持了这些发现。

英文摘要:

$D$-optimal designs originate in statistics literature as an approach for optimal experimental designs. In numerical analysis points and weights resulting from maximal determinants turned out to be useful for quadrature and interpolation. Also recently, two of the present authors and coauthors investigated a connection to the discretization problem for the uniform norm. Here we use this approach of maximizing the determinant of a certain Gramian matrix with respect to points and weights for the construction of tight frames and exact Marcinkiewicz-Zygmund inequalities in $L_2$. We present a direct and constructive approach resulting in a discrete measure with at most $N \leq n^2+1$ atoms, which discretely and accurately subsamples the $L_2$-norm of complex-valued functions contained in a given $n$-dimensional subspace. This approach can as well be used for the reconstruction of functions from general RKHS in $L_2$ where one only has access to the most important eigenfunctions. We verifiably and deterministically construct points and weights for a weighted least squares recovery procedure and pay in the rate of convergence compared to earlier optimal, however probabilistic approaches. The general results apply to the $d$-sphere or multivariate trigonometric polynomials on $\mathbb{T}^d$ spectrally supported on arbitrary finite index sets~$I \subset \mathbb{Z}^d$. They can be discretized using at most $|I|^2-|I|+1$ points and weights. Numerical experiments indicate the sharpness of this result. As a negative result we prove that, in general, it is not possible to control the number of points in a reconstructing lattice rule only in the cardinality $|I|$ without additional condition on the structure of $I$. We support our findings with numerical experiments.

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

↑