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

DOI10.1080/10637199808947368zbMath0929.65014OpenAlexW2075085406MaRDI QIDQ4238524

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

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/10637199808947368

zbMATH Keywords

algorithmsnumerical resultsparallel computationsparse matrixparallel solutionslinear arraysparse matrix multiplicationtriangular solvers

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 - I CHOLESKY FACTORIZATION

Cites Work

• Solution of sparse positive definite systems on a shared-memory multiprocessor
• Solution of sparse positive definite systems on a hypercube
• Parallel algorithms for sparse triangular system solution
• A Parallel Triangular Solver for a Distributed-Memory Multiprocessor
• Two Fast Algorithms for Sparse Matrices: Multiplication and Permuted Transposition
• A LINEAR ARRAY FOR LARGE SPARSE MATRIX OPERATIONS - I CHOLESKY FACTORIZATION

This page was built for publication: A LINEAR ARRAY FOR LARGE SPARSE MATRIX OPERATIONS – II TRIANGULAR SYSTEM SOLVERS AND MATRIX MULTIPLICATION