How large? It's likely one of those pesky timecomplexity things you run into sometimes =(
Joe H.  HP Software
Original Message
From: Mike Zhou [mailto:mike.zhou@interpss.org]
Sent: Wednesday, December 08, 2010 2:49 PM
To: Commons Users List
Subject: [MATH] Linear equation [A] [X] = [B] solution using Sparse Matrix
Hi,
I am trying to use common math library to solve largescale liner equation
with sparse structure. Use the SpareRealMatrix interface
and OpenMapRealMatrix implementation, I defined my matrix. Then using the LU
decomposition,
new LUDecompositionImpl(A).getSolver().solve(B)
I could find the solution. However, the LU based solution seems to be very
slow. I guess, it solves the sparse matrix as a full matrix.
Question
 Does the LUComposition implementation take full advantage of the sparse
matrix structure
 If yes, where I might be wrong?
I am using common math lib 2.1.
Thanks, Mike Zhou

To unsubscribe, email: userunsubscribe@commons.apache.org
For additional commands, email: userhelp@commons.apache.org
