By Topic

Implementation of Block Algorithm for LU Factorization

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Jianping Chen ; Sch. of Comput. Sci. & Technol., Nantong Univ., Nantong, China ; Kun Ji ; Zhenguo Shi ; Weifu Liu

Applying blocking technology to the computation of big dense matrices can make a better use of computerpsilas 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.

Published in:

Computer Science and Information Engineering, 2009 WRI World Congress on  (Volume:2 )

Date of Conference:

March 31 2009-April 2 2009