|
||||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | |||||||||
java.lang.Objectde.desy.acop.demo.example.LUDecomposition
public class LUDecomposition
LUDecomposition provides a method to solve a n-by-n system of linear
equations. It makes a LU decomposition of the matrix (lower triangle L and upper
triangle U) and provides a solution to an arbitrary system A*x=b, where b
is given by the user and x is returned. The implementation supports pivotting.
| Constructor Summary | |
|---|---|
LUDecomposition(double[][] A)
Creates a new LUDecomposition object. |
|
| Method Summary | |
|---|---|
boolean |
isSingular()
Returns true if the given matrix is singular or false if not. |
double[] |
solve(double[] b)
Solves A*x = b |
| Methods inherited from class java.lang.Object |
|---|
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
| Constructor Detail |
|---|
public LUDecomposition(double[][] A)
throws com.cosylab.util.CommonException
A - the matrix to be decomposed
MathException - if the matrix is singular
com.cosylab.util.CommonException| Method Detail |
|---|
public boolean isSingular()
public double[] solve(double[] b)
throws com.cosylab.util.CommonException
b - vector of the dimension of this LU
MathException - if the dimensions are not equal
com.cosylab.util.CommonException
|
||||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | |||||||||