Title of article
PARALLEL COMPLEXITY OF NUMERICALLY ACCURATE LINEAR SYSTEM SOLVERS
Author/Authors
LEONCINI، MAURO نويسنده , , MANZINI، GIOVANNI نويسنده , , MARGARA، LUCIANO نويسنده ,
Issue Information
دوماهنامه با شماره پیاپی سال 1999
Pages
-202
From page
203
To page
0
Abstract
An associative block design is a certain balanced partition of a hypercube into smaller hypercubes. We construct such a design, thus settling the smallest open case.
Keywords
P-complete problems , NC algorithms , parallel complexity , inherently sequential algorithms , matrix factorization , numerical stability
Journal title
SIAM Journal on Computing
Serial Year
1999
Journal title
SIAM Journal on Computing
Record number
16629
Link To Document