Computing orthogonal polynomials in Sobolev spaces (Q1899117)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 802460
Language Label Description Also known as
default for all languages
No label defined
    English
    Computing orthogonal polynomials in Sobolev spaces
    scientific article; zbMATH DE number 802460

      Statements

      Computing orthogonal polynomials in Sobolev spaces (English)
      0 references
      0 references
      0 references
      4 October 1995
      0 references
      Two methods are developed for computing the coefficients of polynomials orthogonal with respect to an inner product of Sobolev type. The one is based on the Chebyshev algorithm, and the other is a generation of the Stieltjes procedure, expressing the desired coefficients in terms of a Sobolev inner product involving the orthogonal polynomials in question. With numerical experiments the authors conclude that a version of the Stieltjes algorithm is appropriate for orthogonal polynomials of Sobolev type.
      0 references
      recurrence relations
      0 references
      Chebyshev algorithm
      0 references
      numerical experiments
      0 references
      Stieltjes algorithm
      0 references
      orthogonal polynomials of Sobolev type
      0 references

      Identifiers