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

DOI10.1080/10637199808947367zbMath0929.65013OpenAlexW2003554808MaRDI QIDQ4238523

Bharat B. Madan, M. V. Padmini, Bijendra N. Jain

Publication date: 25 January 2000

Published in: Parallel Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/10637199808947367

zbMATH Keywords

complexityalgorithmsparallel computationCholesky factorizationsparse matrixparallel solutionlinear array

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Parallel numerical computation (65Y05) Complexity and performance of numerical algorithms (65Y20) Direct numerical methods for linear systems and matrix inversion (65F05)

Related Items (1)

A LINEAR ARRAY FOR LARGE SPARSE MATRIX OPERATIONS – II TRIANGULAR SYSTEM SOLVERS AND MATRIX MULTIPLICATION

Uses Software

• Harwell-Boeing sparse matrix collection
• symrcm

Cites Work

• Solution of sparse positive definite systems on a shared-memory multiprocessor
• Solution of sparse positive definite systems on a hypercube
• Sparse Cholesky Factorization on a Local-Memory Multiprocessor
• A New Implementation of Sparse Gaussian Elimination
• Parallel Algorithms for Sparse Linear Systems
• A LINEAR ARRAY FOR LARGE SPARSE MATRIX OPERATIONS – II TRIANGULAR SYSTEM SOLVERS AND MATRIX MULTIPLICATION

This page was built for publication: A LINEAR ARRAY FOR LARGE SPARSE MATRIX OPERATIONS - I CHOLESKY FACTORIZATION