224 search results - page 11 / 45 » A Flexible Class of Parallel Matrix Multiplication Algorithm... |
CSL
2005
Springer
15 years 3 months ago
2005
Springer
We show that Csanky’s fast parallel algorithm for computing the characteristic polynomial of a matrix can be formalized in the logical theory LAP, and can be proved correct in LA...
CORR
2006
Springer
14 years 9 months ago
2006
Springer
In [12] we showed that a large class of fast recursive matrix multiplication algorithms is stable in a normwise sense, and that in fact if multiplication of n-by-n matrices can be...
EUROPAR
2005
Springer
15 years 3 months ago
2005
Springer
Sophisticated parallel matrix multiplication algorithms like PDGEMM exhibit a complex structure and can be controlled by a large set of parameters including blocking factors and bl...
89
Voted
ICDAR
2003
IEEE
15 years 2 months ago
2003
IEEE
The use of artificial outputs generated by a classifier simulator has recently emerged as a new trend to provide an underlying evaluation of classifier combination methods. In thi...
ECOOPW
1998
Springer
15 years 1 months ago
1998
Springer
Abstract. We present a uni ed approach for expressing high performance numerical linear algebra routines for a class of dense and sparse matrix formats and shapes. As with the Stan...