A LINEAR ARRAY FOR LARGE SPARSE MATRIX OPERATIONS - I CHOLESKY FACTORIZATION (Q4238523)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 1271242
Language Label Description Also known as
default for all languages
No label defined
    English
    A LINEAR ARRAY FOR LARGE SPARSE MATRIX OPERATIONS - I CHOLESKY FACTORIZATION
    scientific article; zbMATH DE number 1271242

      Statements

      A LINEAR ARRAY FOR LARGE SPARSE MATRIX OPERATIONS - I CHOLESKY FACTORIZATION (English)
      0 references
      0 references
      0 references
      0 references
      25 January 2000
      0 references
      complexity
      0 references
      parallel computation
      0 references
      Cholesky factorization
      0 references
      linear array
      0 references
      parallel solution
      0 references
      sparse matrix
      0 references
      algorithms
      0 references
      This is the first part of a two-part paper dealing with Cholesky factorization on a linear array for large sparse matrix operations. [For the second part see ibid. 13, No. 3, 217-237 (1999; reviewed below).] The authors present three parallel algorithms one of which maps the elements of the matrix \(A\) onto the processors and the other two compute the submatrix Cholesky factorization on the linear array. Different issues concerning complexity of the proposed parallel algorithms are discussed.
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references
      0 references