1993Unpublished venueRequires access

An efficient block-oriented approach to parallel sparse Cholesky factorization

E. Rothburg, Aman Gupta

Open publisher page 36 citations

Abstract

No abstract available.

About this research paper

What this paper is about

No abstract available.

Why it matters

OpenAlex reports 36 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

No abstract available.

Key concepts: Cholesky decomposition, Computer science, Incomplete Cholesky factorization, Parallel computing, Block (permutation group theory), Minimum degree algorithm, Sparse matrix, Factorization

Related papers

Back to paper searchBrowse research topicsOriginal source
An efficient block-oriented approach to parallel sparse Cholesky factorization — Research Paper | ScholarLens