Efficient algorithm for linear problems using packed data structure with a set of parallel pointers
type: Item
instance of: scholarly article
title: Efficient algorithm for linear problems using packed data structure with a set of parallel pointers
zbMATH Open document ID: 0876.65018
DOI: 10.1016/0045-7949(94)90170-8
author: Mansoor Al-A'Ali
author: Manzur Ali Ajiz
published in: Computers & Structures
publication date: 1997-11-12T00:00:00Z
Mathematics Subject Classification ID: 65F05
Mathematics Subject Classification ID: 65F50
Mathematics Subject Classification ID: 65Y05
zbMATH DE Number: 1004835
zbMATH Keywords: symmetric matrices
zbMATH Keywords: parallel computation
zbMATH Keywords: sparse matrix
zbMATH Keywords: Cholesky decomposition
zbMATH Keywords: algorithms
MaRDI profile type: MaRDI publication profile
full work available at URL: 0045-7949(94)90170-8
OpenAlex ID: W1966176558
Recommended article: A parallel algorithm for linear programming problems
Recommended article: Efficient parallel linear programming
Recommended article: Q3217943
Recommended article: Fast and efficient parallel solution of dense linear systems
Recommended article: An optimal parallel algorithm for linear programming in the plane
Recommended article: Linear complexity parallel algorithms for linear systems of equations with recursive structure
Recommended article: Parallel algorithms for the solution of certain large sparse linear systems
Recommended article: Parallelism and fast solution of linear systems
Recommended article: Q4414778
Recommended article: Q3723695
description: scientific article; zbMATH DE number 1004835