Best one-sided approximation of polynomials under \({\mathbf L}_1\) norm (Q1612361): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q4858543 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Degree reduction of interval Bézier curves / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Robust interval solid modelling. I: Representations. / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Reducing the degree of an interval polynomial / rank | |||
Normal rank | |||
Latest revision as of 14:58, 4 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Best one-sided approximation of polynomials under \({\mathbf L}_1\) norm |
scientific article |
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
