On the minimum FLOPs problem in the sparse Cholesky factorization (Q2877076)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6333357
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the minimum FLOPs problem in the sparse Cholesky factorization |
scientific article; zbMATH DE number 6333357 |
Statements
21 August 2014
0 references
sparse Cholesky factorization
0 references
minimum fill
0 references
minimum operation count
0 references
computational complexity
0 references
On the minimum FLOPs problem in the sparse Cholesky factorization (English)
0 references
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.
0 references
0.8264284729957581
0 references
0.810009241104126
0 references
0.80682373046875
0 references
0.8012415766716003
0 references
0.7948547601699829
0 references
