Set-Valued Approximation—Revisited and Improved

We address the problem of approximating a set-valued function F, where F:[a,b]→K(Rd) given its samples {F(a+ih)}i=0N, with h=(b−a)/N. We revisit an existing method that approximates set-valued functions by interpolating signed-distance functions. This method provides a high-order approximation for g...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Mathematics (Basel) Jg. 13; H. 7; S. 1194
1. Verfasser: Levin, David
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Basel MDPI AG 04.04.2025
Schlagworte:
Accuracy
Algorithms
Animation
Approximation
approximation algorithms
general topologies
Graphical representations
implicit representation
Mathematical functions
Methods
set-valued functions
Singularity (mathematics)
Topology
ISSN:2227-7390, 2227-7390
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:We address the problem of approximating a set-valued function F, where F:[a,b]→K(Rd) given its samples {F(a+ih)}i=0N, with h=(b−a)/N. We revisit an existing method that approximates set-valued functions by interpolating signed-distance functions. This method provides a high-order approximation for general topologies but loses accuracy near points where F undergoes topological changes. To address this, we introduce new techniques that enhance efficiency and maintain high-order accuracy across [a,b]. Building on the foundation of previous publication, we introduce new techniques to improve the method’s efficiency and extend its high-order approximation accuracy throughout the entire interval [a,b]. Particular focus is placed on identifying and analyzing the behavior of F near topological transition points. To address this, two algorithms are introduced. The first algorithm employs signed-distance quasi-interpolation, incorporating specialized adjustments to effectively handle singularities at points of topological change. The second algorithm leverages an implicit function representation of Graph(F), offering an alternative and robust approach to its approximation. These enhancements improve accuracy and stability in handling set-valued functions with changing topologies.
Bibliographie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:2227-7390
2227-7390
DOI:10.3390/math13071194