Win a copy of Re-engineering Legacy Software this week in the Refactoring forum
or Docker in Action in the Cloud/Virtualization forum!
  • Post Reply
  • Bookmark Topic Watch Topic
  • New Topic

Solving linear equation systems including sparse matrices

 
Gregor Franz
Greenhorn
Posts: 1
  • Mark post as helpful
  • send pies
  • Quote
  • Report post to moderator
Hi everyone,

Working on a Java project, I face the following problem:

I would like to solve a linear equation system of the form

A * x = b.

Therein, the matrix ‘A’ and both vectors ‘x’ and ‘b’ contain several thousand array elements. ‘A’, however, is a sparse matrix and only a small number of diagonals of ‘A’ may contain values that differ from zero.

The use of Java standard solvers results in very long computation times as these solvers normally do not use the specific properties of sparse matrices. Therefore I would like to ask if someone knows packages that include linear equation solvers which are able to solve systems as described above in a reasonable time.

I would be very grateful for any hint.

Thanks a lot in advance and best regards
 
Ulf Dittmer
Rancher
Pie
Posts: 42967
73
  • Mark post as helpful
  • send pies
  • Quote
  • Report post to moderator
The Apache Commons Math library can handle linear equation systems, but it's not optimized for sparse matrices, so it'll most likely not work with systems of this size.

The Colt library hasn't been updated in a long time, but it does claim to support sparse matrices, so may be worth checking out.
 
  • Post Reply
  • Bookmark Topic Watch Topic
  • New Topic