Result 1 to 20 of 170 total
Communication-optimal parallel and sequential QR and LU factorizations. (English)
SIAM J. Sci. Comput. 34, No. 1, A206-A239 (2012).
1
CALU: A communication optimal LU factorization algorithm. (English)
SIAM J. Matrix Anal. Appl. 32, No. 4, 1317-1350 (2011).
2
Minimizing communication in numerical linear algebra. (English)
SIAM J. Matrix Anal. Appl. 32, No. 3, 866-901 (2011).
3
Communication-optimal parallel 2.5D matrix multiplication and LU factorization algorithms. (English)
Jeannot, Emmanuel (ed.) et al., Euro-Par 2011 parallel processing. 17th international conference, Euro-Par 2011, Bordeaux, France, August 29‒September 2, 2011. Proceedings, Part II. Berlin: Springer (ISBN 978-3-642-23396-8/pbk). Lecture Notes in Computer Science 6853, 90-109 (2011).
4
Minimizing communication in numerical linear algebra (English)
SIAM J. Matrix Analysis Applications 32, No. 3, 866-901 (2011).
5
Communication-optimal parallel 2.5D matrix multiplication and LU factorization algorithms (English)
Euro-Par (2), 90-109 (2011).
6
Improving communication performance in dense linear algebra via topology aware collectives (English)
SC, 77 (2011).
7
Communication-avoiding QR decomposition for gpus (English)
IPDPS, 48-58 (2011).
8
Reduced-bandwidth multithreaded algorithms for sparse matrix-vector multiplication (English)
IPDPS, 721-733 (2011).
9
Avoiding communication in numerical linear algebra (English)
ALENEX, 59 (2011).
10
Brief announcement: communication bounds for heterogeneous architectures (English)
SPAA, 257-258 (2011).
11
Graph expansion and communication costs of fast matrix multiplication: regular submission (English)
SPAA, 1-12 (2011).
12
Communication-optimal parallel and sequential Cholesky decomposition. (English)
SIAM J. Sci. Comput. 32, No. 6, 3495-3523 (2010).
13
Brief announcement: lower bounds on communication for sparse Cholesky factorization of a model problem (English)
SPAA, 79-81 (2010).
14
Nonnegative diagonals and high performance on low-profile matrices from householder QR. (English)
SIAM J. Sci. Comput. 31, No. 4, 2832-2841 (2009).
15
Minimizing communication in linear algebra. (English)
Comput. Res. Repos. 2009, Article No. 0905.2485 (2009).
16
Communication-optimal parallel and sequential Cholesky decomposition. (English)
Comput. Res. Repos. 2009, Article No. 0902.2537 (2009).
17
io-port 05747969 Asanovic, Krste;
Bodík, Rastislav;
Demmel, James;
Keaveny, Tony;
Keutzer, Kurt;
Kubiatowicz, John;
Morgan, Nelson;
Patterson, David A.;
Sen, Koushik;
Wawrzynek, John;
Wessel, David;
Yelick, Katherine A.
A view of the parallel computing landscape. (English)
Commun. ACM 52, No. 10, 56-67 (2009).
18
Extra-precise iterative refinement for overdetermined least squares problems. (English)
ACM Trans. Math. Softw. 35, No. 4 (2009).
19
Minimizing communication in sparse matrix solvers (English)
SC (2009).
20
Result 1 to 20 of 170 total
Start
Contact
Print
General Help
