Class RawLU

java.lang.Object

org.ojalgo.matrix.decomposition.AbstractDecomposition<Double, R064Store>

org.ojalgo.matrix.decomposition.RawDecomposition

org.ojalgo.matrix.decomposition.RawLU

All Implemented Interfaces:

LDU<Double>, LU<Double>, MatrixDecomposition<Double>, MatrixDecomposition.Determinant<Double>, MatrixDecomposition.Ordered<Double>, MatrixDecomposition.Pivoting<Double>, MatrixDecomposition.RankRevealing<Double>, MatrixDecomposition.Solver<Double>, MatrixDecomposition.Updatable<Double>, Provider2D, Provider2D.Determinant<Double>, Provider2D.Inverse<Optional<MatrixStore<Double>>>, Provider2D.Rank, Provider2D.Solution<Optional<MatrixStore<Double>>>, DeterminantTask<Double>, InverterTask<Double>, MatrixTask<Double>, SolverTask<Double>, InvertibleFactor<Double>, Structure1D, Structure2D

final class RawLU
extends RawDecomposition
implements LU<Double>

Nested Class Summary

Nested classes/interfaces inherited from interface InvertibleFactor

InvertibleFactor.IdentityFactor<N>

Nested classes/interfaces inherited from interface LU

LU.Factory<N>

Nested classes/interfaces inherited from interface MatrixDecomposition

MatrixDecomposition.Determinant<N>, MatrixDecomposition.EconomySize<N>, MatrixDecomposition.Factory<D>, MatrixDecomposition.Hermitian<N>, MatrixDecomposition.Ordered<N>, MatrixDecomposition.Pivoting<N>, MatrixDecomposition.RankRevealing<N>, MatrixDecomposition.Solver<N>, MatrixDecomposition.Updatable<N>, MatrixDecomposition.Values<N>

Nested classes/interfaces inherited from interface Provider2D

Provider2D.Condition, Provider2D.Determinant<N>, Provider2D.Eigenpairs, Provider2D.Hermitian, Provider2D.Inverse<M>, Provider2D.Rank, Provider2D.Solution<M>, Provider2D.Symmetric, Provider2D.Trace<N>

Nested classes/interfaces inherited from interface Structure1D

Structure1D.BasicMapper<T>, Structure1D.IndexMapper<T>, Structure1D.IntIndex, Structure1D.LongIndex, Structure1D.LoopCallback

Nested classes/interfaces inherited from interface Structure2D

Structure2D.IntRowColumn, Structure2D.Logical<S,B>, Structure2D.LongRowColumn, Structure2D.ReducibleTo1D<R>, Structure2D.Reshapable, Structure2D.RowColumnKey<R,C>, Structure2D.RowColumnMapper<R,C>

Field Summary

Fields

Modifier and Type	Field	Description
private Pivot	myColPivot
private final Pivot	myPivot
private R064Store	myWorkerColumn
private R064Store	myWorkerRow

Fields inherited from interface LU

C128, H256, Q128, R064, R128

Fields inherited from interface MatrixDecomposition

TYPICAL

Constructor Summary

Constructors

Constructor	Description
RawLU()	Not recommended to use this constructor directly.

Method Summary

Modifier and Type	Method	Description
void	btran(double[] arg)
void	btran(PhysicalStore<Double> arg)	Backwards-transformation
Double	calculateDeterminant(Access2D<?> matrix)
protected boolean	checkSolvability()
int	countSignificant(double threshold)
boolean	decompose(Access2D.Collectable<Double, ? super TransformableRegion<Double>> matrix)
boolean	decomposeWithoutPivoting(Access2D.Collectable<Double, ? super TransformableRegion<Double>> matrix)	The normal MatrixDecomposition.decompose(Access2D.Collectable) method must handle cases where pivoting is necessary.
private boolean	doDecompose(double[][] data, boolean pivoting)
private MatrixStore<Double>	doGetInverse(PhysicalStore<Double> preallocated)
private MatrixStore<Double>	doSolve(PhysicalStore<Double> preallocated)
void	ftran(double[] arg)
void	ftran(PhysicalStore<Double> arg)	Forward-transformation
Double	getDeterminant()	A matrix' determinant is the product of its eigenvalues.
MatrixStore<Double>	getInverse(PhysicalStore<Double> preallocated)	Implementing this method is optional.
MatrixStore<Double>	getL()
int[]	getPivotOrder()
double	getRankThreshold()
int[]	getReversePivotOrder()
MatrixStore<Double>	getSolution(Access2D.Collectable<Double, ? super PhysicalStore<Double>> rhs, PhysicalStore<Double> preallocated)	Implementing this method is optional.
MatrixStore<Double>	getU()	http://en.wikipedia.org/wiki/Row_echelon_form This is the same as [D][U].
(package private) R064Store	getWorkerColumn(int nbRows)
(package private) R064Store	getWorkerRow(int nbCols)
MatrixStore<Double>	invert(Access2D<?> original, PhysicalStore<Double> preallocated)	Exactly how (if at all) a specific implementation makes use of preallocated is not specified by this interface.
boolean	isPivoted()
boolean	isSolvable()	Please note that producing a pseudoinverse and/or a least squares solution is ok! The return value, of this method, is not an indication of if the decomposed matrix is square, has full rank, is postive definite or whatever.
PhysicalStore<Double>	preallocate(int nbEquations, int nbVariables, int nbSolutions)
MatrixStore<Double>	solve(Access2D<?> body, Access2D<?> rhs, PhysicalStore<Double> preallocated)	Exactly how (if at all) a specific implementation makes use of preallocated is not specified by this interface.
boolean	updateColumn(int columnIndex, Access1D.Collectable<Double, ? super TransformableRegion<Double>> newColumn)	Updates the decomposition when a column in the original matrix is replaced.

Methods inherited from class RawDecomposition

checkSymmetry, getColDim, getInternalData, getInternalStore, getRowDim, make, newRawStore, reset, wrap

Methods inherited from class AbstractDecomposition

aggregator, applyPivotOrder, applyReverseOrder, collect, computed, copyColumn, copyRow, function, getDimensionalEpsilon, isAspectRatioNormal, isComputed, makeArray, makeDiagonal, makeEye, makeHouseholder, makeIdentity, makeRotation, makeRotation, makeZero, makeZero, reset, scalar, wrap

Methods inherited from class Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Methods inherited from interface InverterTask

invert, preallocate

Methods inherited from interface LDU

isOrdered

Methods inherited from interface LU

getSolution, reconstruct

Methods inherited from interface MatrixDecomposition

isComputed, reset

Methods inherited from interface MatrixDecomposition.Determinant

toDeterminantProvider

Methods inherited from interface MatrixDecomposition.RankRevealing

getRank, isFullRank

Methods inherited from interface MatrixDecomposition.Solver

compute, getInverse, invert, preallocate, solve, toInverseProvider, toSolutionProvider

Methods inherited from interface SolverTask

preallocate, solve

Methods inherited from interface Structure2D

count, countColumns, countRows, firstInColumn, firstInRow, getColDim, getMaxDim, getMinDim, getRowDim, isEmpty, isFat, isScalar, isSquare, isTall, isVector, limitOfColumn, limitOfRow, size

Field Details

myColPivot

private Pivot myColPivot

myPivot

private final Pivot myPivot

myWorkerColumn

private transient R064Store myWorkerColumn

myWorkerRow

private transient R064Store myWorkerRow

Constructor Details

RawLU

RawLU()

Not recommended to use this constructor directly. Consider using the static factory method

invalid reference

org.ojalgo.matrix.decomposition.LU#make(Access2D)

instead.

Method Details

btran

public void btran(double[] arg)

Specified by:

btran in interface InvertibleFactor<Double>

See Also:

• InvertibleFactor.IdentityFactor.btran(PhysicalStore)

btran

public void btran(PhysicalStore<Double> arg)

Description copied from interface: InvertibleFactor

Backwards-transformation

Solve [x]^T[A] = [b]^T (equivalent to [A]^T[x] = [b]) by transforming [b] into [x] in-place.

Specified by:

btran in interface InvertibleFactor<Double>

Parameters:

arg - [b] transformed into [x]

calculateDeterminant

public Double calculateDeterminant(Access2D<?> matrix)

Specified by:

calculateDeterminant in interface DeterminantTask<Double>

countSignificant

public int countSignificant(double threshold)

Specified by:

countSignificant in interface MatrixDecomposition.RankRevealing<Double>

Parameters:

threshold - Significance limit

Returns:

The number of elements in the diagonal matrix that are greater than the threshold

decompose

public boolean decompose(Access2D.Collectable<Double, ? super TransformableRegion<Double>> matrix)

Specified by:

decompose in interface MatrixDecomposition<Double>

Parameters:

matrix - A matrix to decompose

Returns:

true if decomposition suceeded; false if not

decomposeWithoutPivoting

public boolean decomposeWithoutPivoting(Access2D.Collectable<Double, ? super TransformableRegion<Double>> matrix)

Description copied from interface: MatrixDecomposition.Pivoting

The normal MatrixDecomposition.decompose(Access2D.Collectable) method must handle cases where pivoting is necessary. If you know that pivoting is not needed you may call this method instead - it may be faster. Implementing this method, to actually decompose without pivoting, is optional. The default implementation simply calls MatrixDecomposition.decompose(Access2D.Collectable).

Specified by:

decomposeWithoutPivoting in interface MatrixDecomposition.Pivoting<Double>

ftran

public void ftran(double[] arg)

Specified by:

ftran in interface InvertibleFactor<Double>

See Also:

• InvertibleFactor.IdentityFactor.ftran(PhysicalStore)

ftran

public void ftran(PhysicalStore<Double> arg)

Description copied from interface: InvertibleFactor

Forward-transformation

Solve [A][x] = [b] by transforming [b] into [x] in-place.

Specified by:

ftran in interface InvertibleFactor<Double>

Parameters:

arg - [b] transformed into [x]

getDeterminant

public Double getDeterminant()

Description copied from interface: MatrixDecomposition.Determinant

A matrix' determinant is the product of its eigenvalues.

Specified by:

getDeterminant in interface MatrixDecomposition.Determinant<Double>

Specified by:

getDeterminant in interface Provider2D.Determinant<Double>

Returns:

The matrix' determinant

getInverse

public MatrixStore<Double> getInverse(PhysicalStore<Double> preallocated)

Description copied from interface: MatrixDecomposition.Solver

Implementing this method is optional.

Exactly how a specific implementation makes use of preallocated is not specified by this interface. It must be documented for each implementation.

Should produce the same results as calling MatrixDecomposition.Solver.getInverse().

Specified by:

getInverse in interface MatrixDecomposition.Solver<Double>

Parameters:

preallocated - Preallocated memory for the results, possibly some intermediate results. You must assume this is modified, but you cannot assume it will contain the full/final/correct solution. Use MatrixDecomposition.Solver.preallocate(int, int) or InverterTask.preallocate(Structure2D) to get a suitable instance.

Returns:

The inverse, this is where you get the solution

getL

public MatrixStore<Double> getL()

Specified by:

getL in interface LU<Double>

getPivotOrder

public int[] getPivotOrder()

Specified by:

getPivotOrder in interface MatrixDecomposition.Pivoting<Double>

Returns:

The pivot (row and/or columnn) order

getRankThreshold

public double getRankThreshold()

Specified by:

getRankThreshold in interface MatrixDecomposition.RankRevealing<Double>

getReversePivotOrder

public int[] getReversePivotOrder()

Specified by:

getReversePivotOrder in interface MatrixDecomposition.Pivoting<Double>

getSolution

public MatrixStore<Double> getSolution(Access2D.Collectable<Double, ? super PhysicalStore<Double>> rhs,
 PhysicalStore<Double> preallocated)

Description copied from interface: MatrixDecomposition.Solver

Implementing this method is optional.

Exactly how a specific implementation makes use of preallocated is not specified by this interface. It must be documented for each implementation.

Should produce the same results as calling MatrixDecomposition.Solver.getSolution(Collectable).

Specified by:

getSolution in interface MatrixDecomposition.Solver<Double>

Parameters:

rhs - The Right Hand Side, wont be modfied

preallocated - Preallocated memory for the results, possibly some intermediate results. You must assume this is modified, but you cannot assume it will contain the full/final/correct solution. Use SolverTask.preallocate(int, int, int) or SolverTask.preallocate(Structure2D, Structure2D) to get a suitable instance.

Returns:

The solution

getU

public MatrixStore<Double> getU()

Description copied from interface: LU

http://en.wikipedia.org/wiki/Row_echelon_form

This is the same as [D][U]. Together with the pivotOrder and [L] this constitutes an alternative, more compact, way to express the decomposition.

Specified by:

getU in interface LU<Double>

See Also:

• MatrixDecomposition.Pivoting.getPivotOrder()
• LU.getL()

invert

public MatrixStore<Double> invert(Access2D<?> original,
 PhysicalStore<Double> preallocated)
                           throws RecoverableCondition

Description copied from interface: InverterTask

Exactly how (if at all) a specific implementation makes use of preallocated is not specified by this interface. It must be documented for each implementation.

Should produce the same results as calling InverterTask.invert(Access2D).

Use InverterTask.preallocate(Structure2D) to obtain a suitbale preallocated.

Specified by:

invert in interface InverterTask<Double>

Parameters:

preallocated - Preallocated memory for the results, possibly some intermediate results. You must assume this is modified, but you cannot assume it will contain the full/final/correct solution.

Returns:

The inverse

Throws:

RecoverableCondition - TODO

isPivoted

public boolean isPivoted()

Specified by:

isPivoted in interface MatrixDecomposition.Pivoting<Double>

Returns:

true if any pivoting was actually done

isSolvable

public boolean isSolvable()

Description copied from interface: MatrixDecomposition.Solver

Please note that producing a pseudoinverse and/or a least squares solution is ok! The return value, of this method, is not an indication of if the decomposed matrix is square, has full rank, is postive definite or whatever. It's that in combination with the specific decomposition algorithm's capabilities.

Specified by:

isSolvable in interface MatrixDecomposition.Solver<Double>

Overrides:

isSolvable in class AbstractDecomposition<Double, R064Store>

Returns:

true if this matrix decomposition is in a state to be able to deliver an inverse or an equation system solution (with some degree of numerical stability).

preallocate

public PhysicalStore<Double> preallocate(int nbEquations,
 int nbVariables,
 int nbSolutions)

Specified by:

preallocate in interface SolverTask<Double>

solve

public MatrixStore<Double> solve(Access2D<?> body,
 Access2D<?> rhs,
 PhysicalStore<Double> preallocated)
                          throws RecoverableCondition

Description copied from interface: SolverTask

Exactly how (if at all) a specific implementation makes use of preallocated is not specified by this interface. It must be documented for each implementation.

Should produce the same results as calling SolverTask.solve(Access2D, Access2D).

Use SolverTask.preallocate(Structure2D, Structure2D) to obtain a suitbale preallocated.

Specified by:

solve in interface SolverTask<Double>

Parameters:

rhs - The Right Hand Side, wont be modfied

preallocated - Preallocated memory for the results, possibly some intermediate results. You must assume this is modified, but you cannot assume it will contain the full/ /correct solution.

Returns:

The solution

Throws:

RecoverableCondition

updateColumn

public boolean updateColumn(int columnIndex,
 Access1D.Collectable<Double, ? super TransformableRegion<Double>> newColumn)

Description copied from interface: MatrixDecomposition.Updatable

Updates the decomposition when a column in the original matrix is replaced.

This method can only be called after an initial decomposition has been calculated.

If the updatable decomposition is a MatrixDecomposition.Solver then this method should only return true if MatrixDecomposition.Solver.isSolvable() is true after the update.

Specified by:

updateColumn in interface MatrixDecomposition.Updatable<Double>

Parameters:

columnIndex - The index of the column, in the original matrix, to replace

newColumn - The new column values

Returns:

true if update was successful, false if not.

doDecompose

private boolean doDecompose(double[][] data,
 boolean pivoting)

doGetInverse

private MatrixStore<Double> doGetInverse(PhysicalStore<Double> preallocated)

doSolve

private MatrixStore<Double> doSolve(PhysicalStore<Double> preallocated)

checkSolvability

protected boolean checkSolvability()

Overrides:

checkSolvability in class AbstractDecomposition<Double, R064Store>

getWorkerColumn

R064Store getWorkerColumn(int nbRows)

getWorkerRow

R064Store getWorkerRow(int nbCols)