A BSP recursive divide and conquer algorithm to solve a tridiagonal linear system (Q702669): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import241208061232 (talk | contribs)
Normalize DOI.
 
(6 intermediate revisions by 6 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.amc.2003.08.130 / rank
Normal rank
 
Property / describes a project that uses
 
Property / describes a project that uses: BSPlib / 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.2003.08.130 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2038554248 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Divide and conquer: A parallel algorithm for the solution of a tridiagonal linear system of equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A BSP recursive divide and conquer algorithm to compute the inverse of a tridiagonal matrix / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the recursive decoupling method for solving tridiagonal linear systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: BSP linear solvers for dense matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Fast Direct Solution of Poisson's Equation Using Fourier Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computer science today. Recent trends and developments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Divide and conquer methods for block tridiagonal systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Stable Parallel Linear System Solvers / rank
 
Normal rank
Property / cites work
 
Property / cites work: The parallel recursive decoupling algorithm for solving tridiagonal linear systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Efficient Parallel Algorithm for the Solution of a Tridiagonal Linear System of Equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Parallel Method for Tridiagonal Equations / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.AMC.2003.08.130 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 01:10, 10 December 2024

scientific article
Language Label Description Also known as
English
A BSP recursive divide and conquer algorithm to solve a tridiagonal linear system
scientific article

    Statements

    A BSP recursive divide and conquer algorithm to solve a tridiagonal linear system (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    17 January 2005
    0 references
    tridiagonal matrix
    0 references
    BSP computer
    0 references
    divide and conquer
    0 references
    Sherman-Morrison formula
    0 references
    diagonal dominant matrix
    0 references
    numerical examples
    0 references
    algorithms
    0 references
    performance
    0 references

    Identifiers