Approximation by constrained parametric polynomials (Q1178598): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q4732025 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3848301 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4178157 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3226265 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chebyshev economization for parametric surfaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3882894 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4195371 / rank
 
Normal rank

Revision as of 11:43, 15 May 2024

scientific article
Language Label Description Also known as
English
Approximation by constrained parametric polynomials
scientific article

    Statements

    Approximation by constrained parametric polynomials (English)
    0 references
    26 June 1992
    0 references
    The author attacks the problem of approximating higher degree polynomials by lower degree ones. Depending on the chosen norm, the solutions are given by constrained Chebyshev polynomials of the form \((x^ 2-1)^ \alpha(x^ m-\dots)\in\Pi_{m+2\alpha}\) (Chebyshev norm), or Jacobi resp. ultraspherical polynomials (\(L^ 2\)-norm). Furthermore, these considerations on polynomials are applied to constrained approximation of curves and parametric surfaces.
    0 references
    Jacobi polynomials
    0 references
    computer-aided design
    0 references
    CAD systems
    0 references
    constrained Chebyshev polynomials
    0 references
    ultraspherical polynomials
    0 references
    constrained approximation
    0 references
    curve
    0 references
    parametric surfaces
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references