Sparse Approximate Inverse Preconditioners for Iterative Solvers on GPUs

First Page		Document Content
Date: 2012-04-17 03:51:43 Preconditioner Sparse matrix Conjugate gradient method Cholesky decomposition Lis Multigrid method QR decomposition LU decomposition Incomplete LU factorization Numerical linear algebra Numerical analysis Mathematics		Sparse Approximate Inverse Preconditioners for Iterative Solvers on GPUs Add to Reading List Source URL: www.iue.tuwien.ac.at Download Document from Source Website File Size: 125,45 KB Share Document on Facebook

	2018 IEEE International Symposium on High Performance Computer Architecture OuterSPACE: An Outer Product based Sparse Matrix Multiplication Accelerator Subhankar Pal∗ Jonathan Beaumont∗ Dong-Hyeon Park∗ Aporva Ama DocID: 1uUeI - View Document
	0 Autotuning Runtime Specialization for Sparse Matrix-Vector Multiplication BUSE YILMAZ, Ozyegin University BARIS ¸ AKTEMUR, Ozyegin University DocID: 1uMPm - View Document
	Recommended Reading Efficient Parallel Sparse Matrix–Vector Multiplication Using Graph and Hypergraph Partitioning U.V. C DocID: 1uzWI - View Document
	EFFICIENT SPARSE MATRIX PROCESSING FOR NILM NILM Workshop 2014 Stephen Makonin, PhD Candidate, ISP, smIEEE! June 3,1 2014 DocID: 1uf4G - View Document
	Published as a conference paper at ICLRUnderstanding Trainable Sparse Coding via matrix factorization arXiv:1609.00285v4 [stat.ML] 29 May 2017 DocID: 1ued9 - View Document