public static interface MatrixDecomposition.Pivoting<N extends Number> extends MatrixDecomposition<N>
The pivot or pivot element is the element of a matrix, or an array, which is selected first by an algorithm (e.g. Gaussian elimination, simplex algorithm, etc.), to do certain calculations. In the case of matrix algorithms, a pivot entry is usually required to be at least distinct from zero, and often distant from it; in this case finding this element is called pivoting. Pivoting may be followed by an interchange of rows or columns to bring the pivot to a fixed position and allow the algorithm to proceed successfully, and possibly to reduce round-off error. It is often used for verifying row echelon form.
Pivoting might be thought of as swapping or sorting rows or columns in a matrix, and thus it can be represented as multiplication by permutation matrices. However, algorithms rarely move the matrix elements because this would cost too much time; instead, they just keep track of the permutations.
Overall, pivoting adds more operations to the computational cost of an algorithm. These additional operations are sometimes necessary for the algorithm to work at all. Other times these additional operations are worthwhile because they add numerical stability to the final result.
MatrixDecomposition.Determinant<N extends Number>, MatrixDecomposition.EconomySize<N extends Number>, MatrixDecomposition.Factory<D extends MatrixDecomposition<?>>, MatrixDecomposition.Hermitian<N extends Number>, MatrixDecomposition.Ordered<N extends Number>, MatrixDecomposition.Pivoting<N extends Number>, MatrixDecomposition.RankRevealing<N extends Number>, MatrixDecomposition.Solver<N extends Number>, MatrixDecomposition.Values<N extends Number>Structure2D.IntRowColumn, Structure2D.Logical<S extends Structure2D,B extends Structure2D.Logical<S,?>>, Structure2D.LongRowColumn, Structure2D.ReducibleTo1D<R extends Structure1D>, Structure2D.RowColumnCallback, Structure2D.RowColumnKey<R,C>, Structure2D.RowColumnMapper<R,C>Structure1D.BasicMapper<T>, Structure1D.IndexCallback, Structure1D.IndexMapper<T>, Structure1D.IntIndex, Structure1D.LongIndex, Structure1D.LoopCallbackTYPICAL| Modifier and Type | Method and Description |
|---|---|
default boolean |
decomposeWithoutPivoting(Access2D.Collectable<N,? super PhysicalStore<N>> matrix)
The normal
MatrixDecomposition.decompose(Access2D.Collectable) method must handle cases where pivoting is
necessary. |
int[] |
getPivotOrder() |
boolean |
isPivoted() |
decompose, isComputed, reconstruct, resetcolumn, column, column, column, column, count, count, countColumns, countRows, index, index, isEmpty, isFat, isScalar, isSquare, isTall, isVector, loopAll, loopColumn, loopColumn, loopDiagonal, loopMatching, loopRow, loopRow, mapperOf, row, row, row, row, rowindex, loopAll, loopMatching, loopRange, mapper, sizedefault boolean decomposeWithoutPivoting(Access2D.Collectable<N,? super PhysicalStore<N>> matrix)
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).int[] getPivotOrder()
boolean isPivoted()
Copyright © 2019 Optimatika. All rights reserved.