Engineering Papers⌕ Search

NASA NTRS · 20060037059

A General Purpose Sparse Matrix Parallel Solvers Package

Abstract

A general purpose solver package for constructing and solving a range of sparse linear systems arising from discretization of PDEs on unstructured meshes is developed. Once the sparse symmetric complex matrix is constructed, it can be solved by either a preconditioned bi-conjugate gradient solver, a two-stage Cholesky LDLT factorization solver, or a hybrid solver combining the above two methods. (More detailed than 95-0127).

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Ding, H. Q., Ferraro, R. D.. 1995-04-01. A General Purpose Sparse Matrix Parallel Solvers Package. https://engineeringpapers.com/record/nasa%3A20060037059/a-general-purpose-sparse-matrix-parallel-solvers-package

Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite Engineering Papers by Indiciae: BibTeX · RIS.

KEEP EXPLORING

Related reports

A General Purpose Sparse Matrix Parallel Solvers Package

A general purpose solver package for constructing and solving a range of sparse linear systems arising from discretization of PDEs on unstructured meshes is developed. Once the sparse symmetric complex matrix is constructed, it can be solved by either a preconditioned bi-conjugate gradient solver, a two-stage Cholesky LDLT factorization solver, or a hybrid solver combining the above two methods.

solver sparse matrix solvers package PDE↗