Solution of sparse positive definite systems on a hypercube
From MaRDI portal
Publication:1124265
DOI10.1016/0377-0427(89)90364-6zbMath0678.65014MaRDI QIDQ1124265
Publication date: 1989
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-0427(89)90364-6
hypercube; numerical experiments; parallel computation; Cholesky factorization; multiprocessors; numerical factorization; data structure; elimination trees; large sparse positive definite systems; pseudo-code algorithms; symbolic factorization; triangular solution
65F50: Computational methods for sparse matrices
65Y05: Parallel numerical computation
65F05: Direct numerical methods for linear systems and matrix inversion
Related Items
A LINEAR ARRAY FOR LARGE SPARSE MATRIX OPERATIONS - I CHOLESKY FACTORIZATION, A LINEAR ARRAY FOR LARGE SPARSE MATRIX OPERATIONS – II TRIANGULAR SYSTEM SOLVERS AND MATRIX MULTIPLICATION
Uses Software