2022
DOI: 10.1007/s00009-022-01987-7
|View full text |Cite
|
Sign up to set email alerts
|

Near-Optimal Polynomial Interpolation on Spherical Triangles

Abstract: By the fundamental notion of Dubiner distance on a compact set, we construct Chebyshev polynomial norming grids in the sup-norm on spherical triangles. These grids can be used to extract Fekete-like interpolation points with slowly increasing Lebesgue constant.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2022
2022
2022
2022

Publication Types

Select...
2

Relationship

1
1

Authors

Journals

citations
Cited by 2 publications
(1 citation statement)
references
References 25 publications
(32 reference statements)
0
1
0
Order By: Relevance
“…Such thinning processes are also useful in generating multilevel subsets with decreasing separation distances [57] which are useful for multilevel algorithms [53,54,216]. [191] We distinguish this use of oversampled point clouds from another notion also referred to as "oversampling" in which both a fine and a coarse point cloud are used in the simulation, one on the test and another on the trial side of a discretization [96,172].…”
Section: Oversamplingmentioning
confidence: 99%
“…Such thinning processes are also useful in generating multilevel subsets with decreasing separation distances [57] which are useful for multilevel algorithms [53,54,216]. [191] We distinguish this use of oversampled point clouds from another notion also referred to as "oversampling" in which both a fine and a coarse point cloud are used in the simulation, one on the test and another on the trial side of a discretization [96,172].…”
Section: Oversamplingmentioning
confidence: 99%