A domain decomposition method for generating orthogonal polynomials for a Gaussian weight on a finite interval (Q1186206): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Numerical integration using Rys polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3742651 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3829268 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Calculation of Gauss Quadrature Rules / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5518575 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5558293 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds for the solutions of second-order linear difference equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A reformulation of Olver's algorithm for the numerical solution of second-order difference-equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Orthogonal polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5342712 / rank
 
Normal rank

Revision as of 16:02, 15 May 2024

scientific article
Language Label Description Also known as
English
A domain decomposition method for generating orthogonal polynomials for a Gaussian weight on a finite interval
scientific article

    Statements

    A domain decomposition method for generating orthogonal polynomials for a Gaussian weight on a finite interval (English)
    0 references
    28 June 1992
    0 references
    A domain decomposition method is developed for generating orthogonal polynomials for a Gaussian weight on \((-1,1)\). Section 2 defines the problem of generating orthogonal polynomials given just the weight. Section 3 reviews the ``modified moments'' method. Sections 4 and 5 develop the domain decomposition method and give the algorithm. Section 6 shows some computational results and discusses the effectiveness of the preconditioning polynomial subspace.
    0 references
    numerical examples
    0 references
    modified moments method
    0 references
    domain decomposition method
    0 references
    orthogonal polynomials
    0 references
    Gaussian weight
    0 references
    algorithm
    0 references
    preconditioning polynomial subspace
    0 references
    0 references
    0 references

    Identifiers