Best one-sided approximation of polynomials under \({\mathbf L}_1\) norm (Q1612361)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Best one-sided approximation of polynomials under \({\mathbf L}_1\) norm |
scientific article; zbMATH DE number 1787653
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Best one-sided approximation of polynomials under \({\mathbf L}_1\) norm |
scientific article; zbMATH DE number 1787653 |
Statements
Best one-sided approximation of polynomials under \({\mathbf L}_1\) norm (English)
0 references
22 August 2002
0 references
In this work, given polynomials are approximated by lower degree polynomials with respect to the \(L_1\)-norm. The goal is to approximate a given polynomial from above and below up to a prescribed accuracy, which is measured in the \(L_1\)-norm. The main technique is the use of orthogonal polynomials. Specific applications in CAGD are discussed at the end of the paper.
0 references
one-sided approximation
0 references
orthogonal polynomials
0 references
interval Bézier curves
0 references
0.9272882
0 references
0.9254997
0 references
0.9254163
0 references
0.92148185
0 references
0.9194271
0 references
0.9085485
0 references
