This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
2009 WRI World Congress on Computer Science and Information Engineering
Implementation of Block Algorithm for LU Factorization
Los Angeles, California USA
March 31-April 02
ISBN: 978-0-7695-3507-4
Applying blocking technology to the computation of big dense matrices can make a better use of computer’s memory hierarchies and increase computing efficiency. The blocked algorithm for LU factorization is studied in this paper. Efficient algorithms are designed for the computation of the different matrix operations involved in the blocked LU factorization algorithm. Optimization techniques including matrix transposing and loop unrolling are used in the implementation of the matrix computations. Experimental results show that the block LU factorization algorithm runs much faster than the standard LU factorization. A speedup of more than 50% is achieved.
Citation:
Jianping Chen, Kun Ji, Zhenguo Shi, Weifu Liu, "Implementation of Block Algorithm for LU Factorization," csie, vol. 2, pp.569-573, 2009 WRI World Congress on Computer Science and Information Engineering, 2009
Usage of this product signifies your acceptance of the Terms of Use.