Computing orthogonal polynomials in Sobolev spaces (Q1899117): Difference between revisions
From MaRDI portal
Removed claim: reviewed by (P1447): Item:Q1112569 |
Set OpenAlex properties. |
||
(3 intermediate revisions by 3 users not shown) | |||
Property / reviewed by | |||
Property / reviewed by: Yasuhiro Kobayashi / rank | |||
Normal rank | |||
Property / describes a project that uses | |||
Property / describes a project that uses: EISPACK / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1007/s002110050140 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2058689772 / rank | |||
Normal rank |
Latest revision as of 18:15, 19 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Computing orthogonal polynomials in Sobolev spaces |
scientific article |
Statements
Computing orthogonal polynomials in Sobolev spaces (English)
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