A new presentation of orthogonal polynomials with applications to their computation (Q1186618): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Padé-type approximation and general orthogonal polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3985593 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extrapolation methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lanczos-type algorithms for solving systems of linear equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynômes orthogonaux formels - applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3258508 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Completed Theory of the Unsymmetric Lanczos Process and Related Algorithms. Part II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4072022 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Der Quotienten-Differenzen-Algorithmus / rank
 
Normal rank

Latest revision as of 17:07, 15 May 2024

scientific article
Language Label Description Also known as
English
A new presentation of orthogonal polynomials with applications to their computation
scientific article

    Statements

    A new presentation of orthogonal polynomials with applications to their computation (English)
    0 references
    0 references
    0 references
    0 references
    28 June 1992
    0 references
    A new presentation of orthogonal polynomials is given. Various determinantal formulae connected with this presentation are obtained in section 2. In section 3, a new and more direct proof for the existence of a three-term recurrence relation between orthogonal polynomials is given either in the definite or in the indefinite case and the \(qd\)-algorithm is recovered very easily. More new determinantal formulae are obtained in section 4. Numerical examples are discussed from the point of view of the numerical stability in the last section.
    0 references
    0 references
    0 references
    0 references
    0 references
    Hankel determinant
    0 references
    orthogonal polynomials
    0 references
    determinantal formulae
    0 references
    three-term recurrence relation
    0 references
    \(qd\)-algorithm
    0 references
    Numerical examples
    0 references
    numerical stability
    0 references
    orthonal polynomials
    0 references
    0 references