On the minimum FLOPs problem in the sparse Cholesky factorization
type: Item
instance of: scholarly article
zbMATH Open document ID: 1298.65047
DOI: 10.1137/130912438
author: Robert Luce
author: Esmond G. Ng
published in: SIAM Journal on Matrix Analysis and Applications
publication date: 2014-08-21T00:00:00Z
full work available at URL: https://arxiv.org/abs/1303.1754
Mathematics Subject Classification ID: 65F05
Mathematics Subject Classification ID: 65F50
Mathematics Subject Classification ID: 68Q17
Mathematics Subject Classification ID: 65Y20
zbMATH DE Number: 6333357
zbMATH Keywords: sparse Cholesky factorization
zbMATH Keywords: minimum fill
zbMATH Keywords: minimum operation count
zbMATH Keywords: computational complexity
Wikidata QID: Q57558433
MaRDI profile type: Publication
OpenAlex ID: W3098043076
arXiv ID: 1303.1754
title: On the minimum FLOPs problem in the sparse Cholesky factorization
review text: The authors reconsider the idea of reordering rows and columns of a matrix, for reducing both the number of fill elements and, respectively, arithmetic operations in the Cholesky factorization algorithm. They show that no ordering is optimal for both fill and FLOPs in the constructed graph, and provide a reduction chain that shows the NP hardness of minimizing the number of arithmetic operations.
reviewed by: Constantin Popa
description: scientific article; zbMATH DE number 6333357