Class DenseLDL<N extends Comparable<N>>

java.lang.Object

org.ojalgo.matrix.decomposition.AbstractDecomposition<N, DecompositionStore<N>>

org.ojalgo.matrix.decomposition.InPlaceDecomposition<N>

org.ojalgo.matrix.decomposition.DenseLDL<N>

All Implemented Interfaces:

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

Direct Known Subclasses:

DenseLDL.C128, DenseLDL.H256, DenseLDL.Q128, DenseLDL.R064, DenseLDL.R128

abstract class DenseLDL<N extends Comparable<N>>
extends InPlaceDecomposition<N>
implements LDL<N>

Nested Class Summary

Nested Classes

Modifier and Type	Class	Description
(package private) static final class	DenseLDL.C128
(package private) static final class	DenseLDL.H256
(package private) static final class	DenseLDL.Q128
(package private) static final class	DenseLDL.R064
(package private) static final class	DenseLDL.R128

Nested classes/interfaces inherited from interface InvertibleFactor

InvertibleFactor.IdentityFactor<N>

Nested classes/interfaces inherited from interface LDL

LDL.Factory<N>, LDL.ModifiedFactory<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 final Pivot	myPivot
private double	myThreshold

Fields inherited from interface LDL

C128, H256, Q128, R064, R128

Fields inherited from interface MatrixDecomposition

TYPICAL

Constructor Summary

Constructors

Modifier	Constructor	Description
protected	DenseLDL(PhysicalStore.Factory<N, ? extends DecompositionStore<N>> factory)

Method Summary

Modifier and Type	Method	Description
void	btran(double[] arg)
void	btran(PhysicalStore<N> arg)	Backwards-transformation
N	calculateDeterminant(Access2D<?> matrix)
protected boolean	checkSolvability()
int	countSignificant(double threshold)
boolean	decompose(Access2D.Collectable<N, ? super TransformableRegion<N>> matrix)
boolean	decomposeWithoutPivoting(Access2D.Collectable<N, ? super TransformableRegion<N>> matrix)	The normal MatrixDecomposition.decompose(Access2D.Collectable) method must handle cases where pivoting is necessary.
private boolean	doDecompose(Access2D.Collectable<N, ? super PhysicalStore<N>> matrix, boolean pivoting)
void	ftran(double[] arg)
void	ftran(PhysicalStore<N> arg)	Forward-transformation
MatrixStore<N>	getD()
N	getDeterminant()	A matrix' determinant is the product of its eigenvalues.
MatrixStore<N>	getInverse(PhysicalStore<N> preallocated)	Implementing this method is optional.
MatrixStore<N>	getL()	Must implement either LDL.getL() or LDL.getR().
int[]	getPivotOrder()
double	getRankThreshold()
int[]	getReversePivotOrder()
MatrixStore<N>	getSolution(Access2D.Collectable<N, ? super PhysicalStore<N>> rhs, PhysicalStore<N> preallocated)	Implementing this method is optional.
MatrixStore<N>	invert(Access2D<?> original)	The output must be a "right inverse" and a "generalised inverse".
MatrixStore<N>	invert(Access2D<?> original, PhysicalStore<N> 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<N>	preallocate(int nbEquations, int nbVariables, int nbSolutions)
(package private) void	setThreshold(N threshold)
MatrixStore<N>	solve(Access2D<?> body, Access2D<?> rhs, PhysicalStore<N> preallocated)	Exactly how (if at all) a specific implementation makes use of preallocated is not specified by this interface.

Methods inherited from class InPlaceDecomposition

getColDim, getInPlace, getInverse, getRowDim, setInPlace

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

preallocate

Methods inherited from interface LDL

getR, reconstruct

Methods inherited from interface LDU

isOrdered

Methods inherited from interface MatrixDecomposition

isComputed, reset

Methods inherited from interface MatrixDecomposition.Determinant

toDeterminantProvider

Methods inherited from interface MatrixDecomposition.Hermitian

checkAndDecompose

Methods inherited from interface MatrixDecomposition.RankRevealing

getRank, isFullRank

Methods inherited from interface MatrixDecomposition.Solver

compute, getInverse, getSolution, 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

myPivot

private final Pivot myPivot

myThreshold

private double myThreshold

Constructor Details

DenseLDL

protected DenseLDL(PhysicalStore.Factory<N, ? extends DecompositionStore<N>> factory)

Method Details

btran

public void btran(double[] arg)

Specified by:

btran in interface InvertibleFactor<N extends Comparable<N>>

See Also:

• InvertibleFactor.IdentityFactor.btran(PhysicalStore)

btran

public void btran(PhysicalStore<N> 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<N extends Comparable<N>>

Parameters:

arg - [b] transformed into [x]

calculateDeterminant

public N calculateDeterminant(Access2D<?> matrix)

Specified by:

calculateDeterminant in interface DeterminantTask<N extends Comparable<N>>

countSignificant

public int countSignificant(double threshold)

Specified by:

countSignificant in interface MatrixDecomposition.RankRevealing<N extends Comparable<N>>

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<N, ? super TransformableRegion<N>> matrix)

Specified by:

decompose in interface MatrixDecomposition<N extends Comparable<N>>

Parameters:

matrix - A matrix to decompose

Returns:

true if decomposition suceeded; false if not

decomposeWithoutPivoting

public boolean decomposeWithoutPivoting(Access2D.Collectable<N, ? super TransformableRegion<N>> 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<N extends Comparable<N>>

ftran

public void ftran(double[] arg)

Specified by:

ftran in interface InvertibleFactor<N extends Comparable<N>>

See Also:

• InvertibleFactor.IdentityFactor.ftran(PhysicalStore)

ftran

public void ftran(PhysicalStore<N> 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<N extends Comparable<N>>

Parameters:

arg - [b] transformed into [x]

getD

public MatrixStore<N> getD()

Specified by:

getD in interface LDL<N extends Comparable<N>>

getDeterminant

public N getDeterminant()

Description copied from interface: MatrixDecomposition.Determinant

A matrix' determinant is the product of its eigenvalues.

Specified by:

getDeterminant in interface MatrixDecomposition.Determinant<N extends Comparable<N>>

Specified by:

getDeterminant in interface Provider2D.Determinant<N extends Comparable<N>>

Returns:

The matrix' determinant

getInverse

public MatrixStore<N> getInverse(PhysicalStore<N> 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<N extends Comparable<N>>

Overrides:

getInverse in class InPlaceDecomposition<N extends Comparable<N>>

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<N> getL()

Description copied from interface: LDL

Must implement either LDL.getL() or LDL.getR().

Specified by:

getL in interface LDL<N extends Comparable<N>>

getPivotOrder

public int[] getPivotOrder()

Specified by:

getPivotOrder in interface MatrixDecomposition.Pivoting<N extends Comparable<N>>

Returns:

The pivot (row and/or columnn) order

getRankThreshold

public double getRankThreshold()

Specified by:

getRankThreshold in interface MatrixDecomposition.RankRevealing<N extends Comparable<N>>

getReversePivotOrder

public int[] getReversePivotOrder()

Specified by:

getReversePivotOrder in interface MatrixDecomposition.Pivoting<N extends Comparable<N>>

getSolution

public MatrixStore<N> getSolution(Access2D.Collectable<N, ? super PhysicalStore<N>> rhs,
 PhysicalStore<N> 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<N extends Comparable<N>>

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

invert

public MatrixStore<N> invert(Access2D<?> original)
                      throws RecoverableCondition

Description copied from interface: InverterTask

The output must be a "right inverse" and a "generalised inverse".

Specified by:

invert in interface InverterTask<N extends Comparable<N>>

Throws:

RecoverableCondition

invert

public MatrixStore<N> invert(Access2D<?> original,
 PhysicalStore<N> 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<N extends Comparable<N>>

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<N extends Comparable<N>>

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<N extends Comparable<N>>

Overrides:

isSolvable in class AbstractDecomposition<N extends Comparable<N>, DecompositionStore<N extends Comparable<N>>>

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<N> preallocate(int nbEquations,
 int nbVariables,
 int nbSolutions)

Specified by:

preallocate in interface SolverTask<N extends Comparable<N>>

solve

public MatrixStore<N> solve(Access2D<?> body,
 Access2D<?> rhs,
 PhysicalStore<N> 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<N extends Comparable<N>>

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

doDecompose

private boolean doDecompose(Access2D.Collectable<N, ? super PhysicalStore<N>> matrix,
 boolean pivoting)

checkSolvability

protected boolean checkSolvability()

Overrides:

checkSolvability in class AbstractDecomposition<N extends Comparable<N>, DecompositionStore<N extends Comparable<N>>>

setThreshold

void setThreshold(N threshold)