Abstract
Let E ⊂ R2 be a finite set, and let f : E → [0, ∞). In this paper, we address the algorithmic aspects of nonnegative C2 interpolation in the plane. Specifically, we provide an efficient algorithm to compute a nonnegative C2(R2) extension of f with norm within a universal constant factor of the least possible. We also provide an efficient algorithm to approximate the trace norm.
© 2021 Elsevier Inc
© 2021 Elsevier Inc
| Original language | English |
|---|---|
| Article number | 107756 |
| Pages (from-to) | 107756 |
| Journal | Advances in Mathematics |
| Volume | 385 |
| Online published | 28 Apr 2021 |
| DOIs | |
| Publication status | Published - 16 Jul 2021 |
| Externally published | Yes |
Bibliographical note
Full text of this publication does not contain sufficient affiliation information. Research Unit(s) information for this record is supplemented by the author(s) concerned.Research Keywords
- Nonnegative data interpolation
- Shape preservation
- Interpolation algorithm
Fingerprint
Dive into the research topics of 'Algorithms for nonnegative C2(R2) interpolation'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver