Package no.uib.cipr.matrix
Class UpperSPDBandMatrix
- java.lang.Object
-
- no.uib.cipr.matrix.AbstractMatrix
-
- no.uib.cipr.matrix.UpperSymmBandMatrix
-
- no.uib.cipr.matrix.UpperSPDBandMatrix
-
- All Implemented Interfaces:
java.lang.Iterable<MatrixEntry>,Matrix
public class UpperSPDBandMatrix extends UpperSymmBandMatrix
Upper symmetrical positive definite banded matrix. It does not enforce this property (except for symmetry), and has the same storage layout asUpperSymmBandMatrix.
-
-
Nested Class Summary
-
Nested classes/interfaces inherited from interface no.uib.cipr.matrix.Matrix
Matrix.Norm
-
-
Field Summary
-
Fields inherited from class no.uib.cipr.matrix.AbstractMatrix
numColumns, numRows
-
-
Constructor Summary
Constructors Constructor Description UpperSPDBandMatrix(int n, int kd)Constructor for UpperSPDBandMatrixUpperSPDBandMatrix(Matrix A, int kd)Constructor for UpperSPDBandMatrixUpperSPDBandMatrix(Matrix A, int kd, boolean deep)Constructor for UpperSPDBandMatrix
-
Method Summary
All Methods Instance Methods Concrete Methods Modifier and Type Method Description UpperSPDBandMatrixcopy()Creates a deep copy of the matrixdouble[]getData()Returns the matrix contentsjava.util.Iterator<MatrixEntry>iterator()VectormultAdd(double alpha, Vector x, Vector y)y = alpha*A*x + yintnumSubDiagonals()Returns the number of lower diagonalsintnumSuperDiagonals()Returns the number of upper diagonalsMatrixset(Matrix B)A=B.Matrixsolve(Matrix B, Matrix X)X = A\B.Vectorsolve(Vector b, Vector x)x = A\b.VectortransMultAdd(double alpha, Vector x, Vector y)y = alpha*AT*x + yMatrixtranspose()Transposes the matrix in-place.MatrixtransSolve(Matrix B, Matrix X)X = AT\B.VectortransSolve(Vector b, Vector x)x = AT\b.Matrixzero()Zeros all the entries in the matrix, while preserving any underlying structure.-
Methods inherited from class no.uib.cipr.matrix.UpperSymmBandMatrix
add, get, set
-
Methods inherited from class no.uib.cipr.matrix.AbstractMatrix
add, add, check, checkMultAdd, checkMultAdd, checkRank1, checkRank1, checkRank2, checkRank2, checkSize, checkSolve, checkSolve, checkTransABmultAdd, checkTransAmultAdd, checkTransBmultAdd, checkTransMultAdd, checkTranspose, checkTranspose, checkTransRank1, checkTransRank2, isSquare, max, max, mult, mult, mult, mult, multAdd, multAdd, multAdd, norm, norm1, normF, normInf, numColumns, numRows, rank1, rank1, rank1, rank1, rank1, rank1, rank2, rank2, rank2, rank2, scale, set, toString, transABmult, transABmult, transABmultAdd, transABmultAdd, transAmult, transAmult, transAmultAdd, transAmultAdd, transBmult, transBmult, transBmultAdd, transBmultAdd, transMult, transMult, transMultAdd, transpose, transRank1, transRank1, transRank2, transRank2
-
-
-
-
Constructor Detail
-
UpperSPDBandMatrix
public UpperSPDBandMatrix(int n, int kd)Constructor for UpperSPDBandMatrix- Parameters:
n- Size of the matrix. Since the matrix must be square, this equals both the number of rows and columnskd- Number of bands off the main diagonal (off diagonals)
-
UpperSPDBandMatrix
public UpperSPDBandMatrix(Matrix A, int kd)
Constructor for UpperSPDBandMatrix- Parameters:
A- Matrix to copy contents from. Only the parts ofAthat lie within the allocated band are copied over, the rest is ignoredkd- Number of bands off the main diagonal (off diagonals)
-
UpperSPDBandMatrix
public UpperSPDBandMatrix(Matrix A, int kd, boolean deep)
Constructor for UpperSPDBandMatrix- Parameters:
A- Matrix to copy contents from. Only the parts ofAthat lie within the allocated band are copied over, the rest is ignoredkd- Number of bands off the main diagonal (off diagonals)deep- True for a deep copy. For shallow copies,Amust be a banded matrix
-
-
Method Detail
-
copy
public UpperSPDBandMatrix copy()
Description copied from interface:MatrixCreates a deep copy of the matrix- Specified by:
copyin interfaceMatrix- Overrides:
copyin classUpperSymmBandMatrix- Returns:
- A
-
solve
public Matrix solve(Matrix B, Matrix X)
Description copied from interface:MatrixX = A\B. Not all matrices support this operation, those that do not throwUnsupportedOperationException. Note that it is often more efficient to use a matrix decomposition and its associated solver
-
multAdd
public Vector multAdd(double alpha, Vector x, Vector y)
Description copied from interface:Matrixy = alpha*A*x + y- Specified by:
multAddin interfaceMatrix- Overrides:
multAddin classAbstractMatrixx- Vector of sizeA.numColumns()y- Vector of sizeA.numRows()- Returns:
- y
-
transMultAdd
public Vector transMultAdd(double alpha, Vector x, Vector y)
Description copied from interface:Matrixy = alpha*AT*x + y- Specified by:
transMultAddin interfaceMatrix- Overrides:
transMultAddin classAbstractMatrixx- Vector of sizeA.numRows()y- Vector of sizeA.numColumns()- Returns:
- y
-
iterator
public java.util.Iterator<MatrixEntry> iterator()
- Specified by:
iteratorin interfacejava.lang.Iterable<MatrixEntry>
-
solve
public Vector solve(Vector b, Vector x)
Description copied from interface:Matrixx = A\b. Not all matrices support this operation, those that do not throwUnsupportedOperationException. Note that it is often more efficient to use a matrix decomposition and its associated solver- Specified by:
solvein interfaceMatrix- Overrides:
solvein classAbstractMatrix- Parameters:
b- Vector of sizeA.numRows()x- Vector of sizeA.numColumns()- Returns:
- x
-
transSolve
public Matrix transSolve(Matrix B, Matrix X)
Description copied from interface:MatrixX = AT\B. Not all matrices support this operation, those that do not throwUnsupportedOperationException. Note that it is often more efficient to use a matrix decomposition and its associated transpose solver- Specified by:
transSolvein interfaceMatrix- Overrides:
transSolvein classAbstractMatrix- Parameters:
B- Matrix with a number of rows equalA.numColumns(), and the same number of columns asXX- Matrix with the same number of rows asA, and the same number of columns asB- Returns:
- X
-
transSolve
public Vector transSolve(Vector b, Vector x)
Description copied from interface:Matrixx = AT\b. Not all matrices support this operation, those that do not throwUnsupportedOperationException. Note that it is often more efficient to use a matrix decomposition and its associated solver- Specified by:
transSolvein interfaceMatrix- Overrides:
transSolvein classAbstractMatrix- Parameters:
b- Vector of sizeA.numColumns()x- Vector of sizeA.numRows()- Returns:
- x
-
transpose
public Matrix transpose()
Description copied from interface:MatrixTransposes the matrix in-place. In most cases, the matrix must be square for this to work.- Specified by:
transposein interfaceMatrix- Overrides:
transposein classAbstractMatrix- Returns:
- This matrix
-
getData
public double[] getData()
Returns the matrix contents
-
numSubDiagonals
public int numSubDiagonals()
Returns the number of lower diagonals
-
numSuperDiagonals
public int numSuperDiagonals()
Returns the number of upper diagonals
-
set
public Matrix set(Matrix B)
Description copied from interface:MatrixA=B. The matrices must be of the same size- Specified by:
setin interfaceMatrix- Overrides:
setin classAbstractMatrix- Returns:
- A
-
-