Prev: Removing Image Curvature
Next: Changing specific value in XML file
From: jamuna ramesh on 15 Apr 2010 10:35
hai

In my hand I have only "A" matrix, which is sparse matrix size of (m x n); Whereas A is concatenation of two matrix [Ae;Ar], Ae is size of (s x n) & Ar is size of (q x n);

I should do the triangular factorization by row pivolting and get the following matrix
[Le;Mr]*[Ue].

Resultant matrix sizes:
Le - (s x n)
Mr - (q x n)
Ue - (n x n)

Le and Ue is the Lower and Upper triangular sparse matrix. Mr is known as rectangular sparse matrix. In the paper is mentioned that which is solved by Krauts method. By i dont find this method thro net also.

Help me in this. Hope u understand the problem.

Jamuna
 | 
Pages: 1
Prev: Removing Image Curvature
Next: Changing specific value in XML file