An approximate solution for a system with a symmetric matrix (Q1130406): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A fast algorithm for solving special tridiagonal systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new fourth order method for computing eigenvalues of two-point boundary value problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3994560 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5719651 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Solution of Circulant Linear Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new method for solving symmetric circulant tridiagonal systems of linear equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast method for solving second Order boundary value volterra Integro-differential equations / rank
 
Normal rank

Latest revision as of 15:56, 28 May 2024

scientific article
Language Label Description Also known as
English
An approximate solution for a system with a symmetric matrix
scientific article

    Statements

    An approximate solution for a system with a symmetric matrix (English)
    0 references
    0 references
    4 March 1999
    0 references
    This paper deals with a discrete approximation for the solution of the boundary value problem for an ordinary differential equation (unusually formulated). Using methods of the Numerov's type a system of equations is obtained. The matrix of this large system of equations is reformulated as the product of two bounded matrices for the purpose of obtaining the solution of the linear system more efficiently. An error estimate is presented.
    0 references
    system
    0 references
    Numerov method
    0 references
    error estimate
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references