Parallel and Fully Recursive Multifrontal Supernodal Sparse Cholesky

Dror Irony; Gil Shklarski; Sivan Toledo

doi:10.1007/3-540-46080-2_35

ScienceGate Book Chapters

BOOK-CHAPTER

Parallel and Fully Recursive Multifrontal Supernodal Sparse Cholesky

Dror Irony Gil Shklarski Sivan Toledo

Year: 2002 Lecture notes in computer science Pages: 335-344 Publisher: Springer Science+Business Media

DOI: 10.1007/3-540-46080-2_35

Get Full-Text PDF Get Analytical Report

Keywords:

Computer science Cholesky decomposition Parallel computing Sparse matrix Subroutine Code (set theory) Block matrix Incomplete Cholesky factorization Factorization Block (permutation group theory) Algorithm Programming language Mathematics

Metrics

Cited By

2.40

FWCI (Field Weighted Citation Impact)

Refs

0.90

Citation Normalized Percentile

Is in top 1%

Is in top 10%

Citation History

Topics

Parallel Computing and Optimization Techniques

Physical Sciences → Computer Science → Hardware and Architecture

Matrix Theory and Algorithms

Physical Sciences → Computer Science → Computational Theory and Mathematics

Tensor decomposition and applications

Physical Sciences → Mathematics → Computational Mathematics

Parallel and Fully Recursive Multifrontal Supernodal Sparse Cholesky

Metrics

Citation History

Topics

Related Documents

Parallel and fully recursive multifrontal sparse Cholesky

Parallel and fully recursive multifrontal sparse Cholesky

Supernodal Sparse Cholesky Factorization on Distributed-Memory Multiprocessors

Supernodal sparse Cholesky factorization on graphics processing units

Dynamic Parallelization Strategies for Multifrontal Sparse Cholesky Factorization