A computational algorithm for solving periodic penta-diagonal linear systems (Q2490232): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: Matlab / 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.1016/j.amc.2005.04.098 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2070859589 / 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: Iterative Solution of Implicit Approximations of Multidimensional Partial Differential Equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new computational algorithm for solving periodic tri-diagonal linear systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Parallel Elimination Method for "Periodic" Tridiagonal Systems / rank
 
Normal rank

Latest revision as of 13:37, 24 June 2024

scientific article
Language Label Description Also known as
English
A computational algorithm for solving periodic penta-diagonal linear systems
scientific article

    Statements

    A computational algorithm for solving periodic penta-diagonal linear systems (English)
    0 references
    0 references
    28 April 2006
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    Periodic penta-diagonal matrices
    0 references
    Linear systems
    0 references
    Determinants
    0 references
    Computer algebra systems
    0 references
    MAPLE
    0 references
    MACSYMA
    0 references
    MATHEMATICA
    0 references
    MATLAB
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references