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

取值于 $\mathbb{R}^d$ 中像集的集值函数的逼近

Approximation of Set-Valued Functions with images sets in $\mathbb{R}^d$

Nira Dyn, David Levin

AI总结:

本文针对取值于 $\mathbb{R}^d$ 紧子集的连续集值函数,提出在像集拓扑变化点附近实现高阶逼近的方法,并推广到二维及更高维情形。

摘要:

给定一个连续集值函数 $F$ 的有限个样本,该函数将区间映射到 $\mathbb{R}^d$ 的非空紧子集,$F: [a,b] \to K(\mathbb{R}^d)$,我们讨论计算 $F$ 的良好逼近的问题。我们还讨论了直接高阶评估 $F$ 的图(即集合 $Graph(F)=\{(t,y)\\ | \\ y\in F(t),\\ t\in [a,b]\}\in K(\mathbb{R}^{d+1})$)的算法。一个集值函数可以是连续的,但仍然存在像集拓扑发生变化的点。集值函数逼近的主要挑战是在这些点附近推导高阶逼近。在之前的一篇论文中,我们与 Q. Muzaffar 一起提出了一种逼近像集为一维集合($d=1$)的集值函数的算法,在拓扑变化点附近实现了高阶逼近。本文我们基于 $d=1$ 情形的结果和算法,首先更详细地处理重要的 $d=2$ 情形,然后处理更高维中集值函数及其图的逼近。

英文摘要:

Given a finite number of samples of a continuous set-valued function F, mapping an interval to non-empty compact subsets of $\mathbb{R}^d$, $F: [a,b] \to K(\mathbb{R}^d)$, we discuss the problem of computing good approximations of F. We also discuss algorithms for a direct high-order evaluation of the graph of $F$, namely, the set $Graph(F)=\{(t,y)\ | \ y\in F(t),\ t\in [a,b]\}\in K(\mathbb{R}^{d+1})$. A set-valued function can be continuous and yet have points where the topology of the image sets changes. The main challenge in set-valued function approximation is to derive high-order approximations near these points. In a previous paper, we presented with Q. Muzaffar, an algorithm for approximating set-valued functions with 1D sets ($d=1$) as images, achieving high approximation order near points of topology change. Here we build upon the results and algorithms in the $d=1$ case, first in more detail for the important case $d=2$, and later for approximating set-valued functions and their graphs in higher dimensions.

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

↑