class MatrixC extends MatriC with Error with Serializable
The MatrixC class stores and operates on Numeric Matrices of type Complex.
This class follows the gen.MatrixN framework and is provided for efficiency.
Caveat: Only works for rectangular matrices. For matrix-like structures
based on jagged arrays, where the second dimension varies,
- See also
scalation.linalgebra.gen.HMatrix2
- Alphabetic
- By Inheritance
- MatrixC
- Serializable
- Serializable
- MatriC
- Error
- AnyRef
- Any
- Hide All
- Show All
- Public
- All
Instance Constructors
-
new
MatrixC(b: MatriC)
Construct a matrix and assign values from matrix 'b'.
Construct a matrix and assign values from matrix 'b'.
- b
the matrix of values to assign
-
new
MatrixC(dim: (Int, Int), u: Complex*)
Construct a matrix from repeated values.
Construct a matrix from repeated values.
- dim
the (row, column) dimensions
- u
the repeated values
-
new
MatrixC(u: Array[Array[Complex]])
Construct a matrix and assign values from array of arrays 'u'.
Construct a matrix and assign values from array of arrays 'u'.
- u
the 2D array of values to assign
-
new
MatrixC(dim1: Int, dim2: Int, x: Complex)
Construct a 'dim1' by 'dim2' matrix and assign each element the value 'x'.
Construct a 'dim1' by 'dim2' matrix and assign each element the value 'x'.
- dim1
the row dimension
- dim2
the column dimension
- x
the scalar value to assign
-
new
MatrixC(dim1: Int)
Construct a 'dim1' by 'dim1' square matrix.
Construct a 'dim1' by 'dim1' square matrix.
- dim1
the row and column dimension
-
new
MatrixC(d1: Int, d2: Int, v: Array[Array[Complex]] = null)
- d1
the first/row dimension
- d2
the second/column dimension
- v
the 2D array used to store matrix elements
Value Members
-
final
def
!=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
final
def
##(): Int
- Definition Classes
- AnyRef → Any
-
def
*(x: Complex): MatrixC
Multiply 'this' matrix by scalar 'x'.
-
def
*(u: VectoC): VectorC
Multiply 'this' matrix by (column) vector 'u' (vector elements beyond 'dim2' ignored).
-
def
*(b: MatriC): MatrixC
Multiply 'this' matrix by matrix 'b', transposing 'b' to improve efficiency.
-
def
*(b: MatrixC): MatrixC
Multiply 'this' matrix by matrix 'b', transposing 'b' to improve efficiency.
Multiply 'this' matrix by matrix 'b', transposing 'b' to improve efficiency. Use 'times' method to skip the transpose step.
- b
the matrix to multiply by (requires 'sameCrossDimensions')
-
def
**(u: VectoC): MatrixC
Multiply 'this' matrix by vector 'u' to produce another matrix 'a_ij * u_j'.
-
def
**:(u: VectoC): MatrixC
Multiply vector 'u' by 'this' matrix to produce another matrix 'u_i * a_ij'.
-
def
**=(u: VectoC): MatrixC
Multiply in-place 'this' matrix by vector 'u' to produce another matrix 'a_ij * u_j'.
-
def
*:(u: VectoC): VectoC
Multiply (row) vector 'u' by 'this' matrix.
Multiply (row) vector 'u' by 'this' matrix. Note '*:' is right associative. vector = vector *: matrix
- u
the vector to multiply by
- Definition Classes
- MatriC
-
def
*=(x: Complex): MatrixC
Multiply in-place 'this' matrix by scalar 'x'.
-
def
*=(b: MatriC): MatrixC
Multiply in-place 'this' matrix by matrix 'b', transposing 'b' to improve efficiency.
-
def
*=(b: MatrixC): MatrixC
Multiply in-place 'this' matrix by matrix 'b', transposing 'b' to improve efficiency.
Multiply in-place 'this' matrix by matrix 'b', transposing 'b' to improve efficiency. Use 'times_ip' method to skip the transpose step.
- b
the matrix to multiply by (requires square and 'sameCrossDimensions')
-
def
+(x: Complex): MatrixC
Add 'this' matrix and scalar 'x'.
-
def
+(u: VectoC): MatrixC
Add 'this' matrix and (row) vector 'u'.
-
def
+(b: MatriC): MatrixC
Add 'this' matrix and matrix 'b' for any type extending MatriC.
-
def
+(b: MatrixC): MatrixC
Add 'this' matrix and matrix 'b'.
Add 'this' matrix and matrix 'b'.
- b
the matrix to add (requires 'leDimensions')
-
def
++(b: MatriC): MatrixC
Concatenate (row-wise) 'this' matrix and matrix 'b'.
-
def
++^(b: MatriC): MatrixC
Concatenate (column-wise) 'this' matrix and matrix 'b'.
-
def
+:(u: VectoC): MatrixC
Concatenate (row) vector 'u' and 'this' matrix, i.e., prepend 'u' to 'this'.
-
def
+=(x: Complex): MatrixC
Add in-place 'this' matrix and scalar 'x'.
-
def
+=(u: VectoC): MatrixC
Add in-place 'this' matrix and (row) vector 'u'.
-
def
+=(b: MatriC): MatrixC
Add in-place 'this' matrix and matrix 'b' for any type extending MatriC.
-
def
+=(b: MatrixC): MatrixC
Add in-place 'this' matrix and matrix 'b'.
Add in-place 'this' matrix and matrix 'b'.
- b
the matrix to add (requires 'leDimensions')
-
def
+^:(u: VectoC): MatrixC
Concatenate (column) vector 'u' and 'this' matrix, i.e., prepend 'u' to 'this'.
-
def
-(x: Complex): MatrixC
From 'this' matrix subtract scalar 'x'.
-
def
-(u: VectoC): MatrixC
From 'this' matrix subtract (row) vector 'u'.
-
def
-(b: MatriC): MatrixC
From 'this' matrix subtract matrix 'b' for any type extending MatriC.
-
def
-(b: MatrixC): MatrixC
From 'this' matrix subtract matrix 'b'.
From 'this' matrix subtract matrix 'b'.
- b
the matrix to subtract (requires 'leDimensions')
-
def
-=(x: Complex): MatrixC
From 'this' matrix subtract in-place scalar 'x'.
-
def
-=(u: VectoC): MatrixC
From 'this' matrix subtract in-place (row) vector 'u'.
-
def
-=(b: MatriC): MatrixC
From 'this' matrix subtract in-place matrix 'b'.
-
def
-=(b: MatrixC): MatrixC
From 'this' matrix subtract in-place matrix 'b'.
From 'this' matrix subtract in-place matrix 'b'.
- b
the matrix to subtract (requires 'leDimensions')
-
def
/(x: Complex): MatrixC
Divide 'this' matrix by scalar 'x'.
-
def
/=(x: Complex): MatrixC
Divide in-place 'this' matrix by scalar 'x'.
-
def
:+(u: VectoC): MatrixC
Concatenate 'this' matrix and (row) vector 'u', i.e., append 'u' to 'this'.
-
def
:^+(u: VectoC): MatrixC
Concatenate 'this' matrix and (column) vector 'u', i.e., append 'u' to 'this'.
-
final
def
==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
def
apply(): Array[Array[Complex]]
Get the underlying 2D array for 'this' matrix.
-
def
apply(ir: Range, jr: Range): MatrixC
Get a slice 'this' matrix row-wise on range 'ir' and column-wise on range 'jr'.
-
def
apply(i: Int): VectorC
Get 'this' matrix's vector at the 'i'-th index position ('i'-th row).
-
def
apply(i: Int, j: Int): Complex
Get 'this' matrix's element at the 'i,j'-th index position.
-
def
apply(i: Int, jr: Range): VectoC
Get a slice 'this' matrix row-wise at index 'i' and column-wise on range 'jr'.
Get a slice 'this' matrix row-wise at index 'i' and column-wise on range 'jr'. Ex: u = a(2, 3..5)
- i
the row index
- jr
the column range
- Definition Classes
- MatriC
-
def
apply(ir: Range, j: Int): VectoC
Get a slice 'this' matrix row-wise on range 'ir' and column-wise at index j.
Get a slice 'this' matrix row-wise on range 'ir' and column-wise at index j. Ex: u = a(2..4, 3)
- ir
the row range
- j
the column index
- Definition Classes
- MatriC
-
final
def
asInstanceOf[T0]: T0
- Definition Classes
- Any
-
def
bsolve(y: VectoC): VectorC
Solve for 'x' using back substitution in the equation 'u*x = y' where 'this' matrix ('u') is upper triangular (see 'lud_npp' above).
-
def
clean(thres: Double = TOL, relative: Boolean = true): MatrixC
Clean values in 'this' matrix at or below the threshold 'thres' by setting them to zero.
Clean values in 'this' matrix at or below the threshold 'thres' by setting them to zero. Iterative algorithms give approximate values and if very close to zero, may throw off other calculations, e.g., in computing eigenvectors.
- thres
the cutoff threshold (a small value)
- relative
whether to use relative or absolute cutoff
-
def
clone(): AnyRef
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
def
col(col: Int, from: Int = 0): VectorC
Get column 'col' from the matrix, returning it as a vector.
-
def
copy(): MatrixC
Create an exact copy of 'this' m-by-n matrix.
-
def
det: Complex
Compute the determinant of 'this' matrix.
-
def
diag(p: Int, q: Int = 0): MatrixC
Form a matrix '[Ip, this, Iq]' where Ir is a 'r-by-r' identity matrix, by positioning the three matrices 'Ip', 'this' and 'Iq' along the diagonal.
-
def
diag(b: MatriC): MatrixC
Combine 'this' matrix with matrix 'b', placing them along the diagonal and filling in the bottom left and top right regions with zeros; '[this, b]'.
-
lazy val
dim1: Int
Dimension 1
-
lazy val
dim2: Int
Dimension 2
-
def
dot(b: MatrixC): VectorC
Compute the dot product of 'this' matrix and matrix 'b' that results in a vector, by taking the dot product for each column 'j' of both matrices.
Compute the dot product of 'this' matrix and matrix 'b' that results in a vector, by taking the dot product for each column 'j' of both matrices.
- b
the matrix to multiply by (requires same first dimensions)
- See also
www.mathworks.com/help/matlab/ref/dot.html
-
def
dot(b: MatriC): VectorC
Compute the dot product of 'this' matrix and matrix 'b' that results in a vector, by taking the dot product for each column 'j' of both matrices.
-
def
dot(u: VectoC): VectorC
Compute the dot product of 'this' matrix and vector 'u', by first transposing 'this' matrix and then multiplying by 'u' (i.e., 'a dot u = a.t * u').
-
final
def
eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
def
equals(b: Any): Boolean
Override equals to determine whether 'this' matrix equals matrix 'b'.
Override equals to determine whether 'this' matrix equals matrix 'b'.
- b
the matrix to compare with this
- Definition Classes
- MatrixC → AnyRef → Any
-
val
fString: String
Format string used for printing vector values (change using 'setFormat')
Format string used for printing vector values (change using 'setFormat')
- Attributes
- protected
- Definition Classes
- MatriC
-
def
finalize(): Unit
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( classOf[java.lang.Throwable] )
-
final
def
flaw(method: String, message: String): Unit
Show the flaw by printing the error message.
Show the flaw by printing the error message.
- method
the method where the error occurred
- message
the error message
- Definition Classes
- Error
-
def
foreach[U](f: (Array[Complex]) ⇒ U): Unit
Iterate over 'this' matrix row by row applying method 'f'.
Iterate over 'this' matrix row by row applying method 'f'.
- f
the function to apply
- Definition Classes
- MatriC
-
final
def
getClass(): Class[_]
- Definition Classes
- AnyRef → Any
-
def
getDiag(k: Int = 0): VectorC
Get the 'k'th diagonal of 'this' matrix.
-
def
hashCode(): Int
Must also override hashCode for 'this' matrix to be compatible with equals.
Must also override hashCode for 'this' matrix to be compatible with equals.
- Definition Classes
- MatrixC → AnyRef → Any
-
def
inverse: MatrixC
Invert 'this' matrix (requires a square matrix) and use partial pivoting.
-
def
inverse_ip(): MatrixC
Invert in-place 'this' matrix (requires a square matrix) and uses partial pivoting.
-
def
inverse_npp: MatrixC
Invert 'this' matrix (requires a square matrix) and does not use partial pivoting.
-
def
isBidiagonal: Boolean
Check whether 'this' matrix is bidiagonal (has non-zero elements only in main diagonal and super-diagonal).
Check whether 'this' matrix is bidiagonal (has non-zero elements only in main diagonal and super-diagonal). The method may be overriding for efficiency.
- Definition Classes
- MatriC
-
final
def
isInstanceOf[T0]: Boolean
- Definition Classes
- Any
-
def
isNonnegative: Boolean
Check whether 'this' matrix is nonnegative (has no negative elements).
Check whether 'this' matrix is nonnegative (has no negative elements).
- Definition Classes
- MatriC
-
def
isRectangular: Boolean
Check whether 'this' matrix is rectangular (all rows have the same number of columns).
-
def
isSquare: Boolean
Check whether 'this' matrix is square (same row and column dimensions).
Check whether 'this' matrix is square (same row and column dimensions).
- Definition Classes
- MatriC
-
def
isSymmetric: Boolean
Check whether 'this' matrix is symmetric.
Check whether 'this' matrix is symmetric.
- Definition Classes
- MatriC
-
def
isTridiagonal: Boolean
Check whether 'this' matrix is bidiagonal (has non-zero elements only in main diagonal and super-diagonal).
Check whether 'this' matrix is bidiagonal (has non-zero elements only in main diagonal and super-diagonal). The method may be overriding for efficiency.
- Definition Classes
- MatriC
-
def
leDimensions(b: MatriC): Boolean
Check whether 'this' matrix dimensions are less than or equal to 'le' those of the other matrix 'b'.
Check whether 'this' matrix dimensions are less than or equal to 'le' those of the other matrix 'b'.
- b
the other matrix
- Definition Classes
- MatriC
-
def
lowerT: MatrixC
Return the lower triangular of 'this' matrix (rest are zero).
-
def
lud_ip(): (MatrixC, MatrixC)
Factor in-place 'this' matrix into the product of lower and upper triangular matrices '(l, u)' using the 'LU' Factorization algorithm.
-
def
lud_npp: (MatrixC, MatrixC)
Factor 'this' matrix into the product of upper and lower triangular matrices '(l, u)' using the 'LU' Factorization algorithm.
-
def
mag: Complex
Find the magnitude of 'this' matrix, the element value farthest from zero.
Find the magnitude of 'this' matrix, the element value farthest from zero.
- Definition Classes
- MatriC
-
def
max(e: Int = dim1): Complex
Find the maximum element in 'this' matrix.
-
def
mdot(b: MatrixC): MatrixC
Compute the matrix dot product of 'this' matrix and matrix 'b', by first transposing 'this' matrix and then multiplying by 'b' (i.e., 'a dot b = a.t * b').
Compute the matrix dot product of 'this' matrix and matrix 'b', by first transposing 'this' matrix and then multiplying by 'b' (i.e., 'a dot b = a.t * b').
- b
the matrix to multiply by (requires same first dimensions)
-
def
mdot(b: MatriC): MatrixC
Compute the matrix dot product of 'this' matrix and matrix 'b', by first transposing 'this' matrix and then multiplying by 'b' (i.e., 'a dot b = a.t * b').
-
def
mean: VectoC
Compute the column means of this matrix.
Compute the column means of this matrix.
- Definition Classes
- MatriC
-
def
min(e: Int = dim1): Complex
Find the minimum element in 'this' matrix.
-
final
def
ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
def
norm1: Complex
Compute the 1-norm of 'this' matrix, i.e., the maximum 1-norm of the column vectors.
Compute the 1-norm of 'this' matrix, i.e., the maximum 1-norm of the column vectors. This is useful for comparing matrices '(a - b).norm1'.
- Definition Classes
- MatriC
-
def
normalizeU: MatrixC
Create a normalized version of 'this' matrix.
-
final
def
notify(): Unit
- Definition Classes
- AnyRef
-
final
def
notifyAll(): Unit
- Definition Classes
- AnyRef
-
def
nullspace: VectorC
Compute the (right) nullspace of 'this' 'm-by-n' matrix (requires 'n = m+1') by performing Gauss-Jordan reduction and extracting the negation of the last column augmented by 1.
Compute the (right) nullspace of 'this' 'm-by-n' matrix (requires 'n = m+1') by performing Gauss-Jordan reduction and extracting the negation of the last column augmented by 1.
nullspace (a) = set of orthogonal vectors v s.t. a * v = 0
The left nullspace of matrix 'a' is the same as the right nullspace of 'a.t'. FIX: need a more robust algorithm for computing nullspace (@see Fac_QR.scala). FIX: remove the 'n = m+1' restriction.
-
def
nullspace_ip(): VectorC
Compute in-place the (right) nullspace of 'this' 'm-by-n' matrix (requires 'n = m+1') by performing Gauss-Jordan reduction and extracting the negation of the last column augmented by 1.
Compute in-place the (right) nullspace of 'this' 'm-by-n' matrix (requires 'n = m+1') by performing Gauss-Jordan reduction and extracting the negation of the last column augmented by 1.
nullspace (a) = set of orthogonal vectors v s.t. a * v = 0
The left nullspace of matrix 'a' is the same as the right nullspace of 'a.t'. FIX: need a more robust algorithm for computing nullspace (@see Fac_QR.scala). FIX: remove the 'n = m+1' restriction.
-
val
range1: Range
Range for the storage array on dimension 1 (rows)
Range for the storage array on dimension 1 (rows)
- Definition Classes
- MatriC
-
val
range2: Range
Range for the storage array on dimension 2 (columns)
Range for the storage array on dimension 2 (columns)
- Definition Classes
- MatriC
-
def
reduce: MatrixC
Use Gauss-Jordan reduction on 'this' matrix to make the left part embed an identity matrix.
-
def
reduce_ip(): Unit
Use Gauss-Jordan reduction in-place on 'this' matrix to make the left part embed an identity matrix.
-
def
sameCrossDimensions(b: MatriC): Boolean
Check whether 'this' matrix and the other matrix 'b' have the same cross dimensions.
Check whether 'this' matrix and the other matrix 'b' have the same cross dimensions.
- b
the other matrix
- Definition Classes
- MatriC
-
def
sameDimensions(b: MatriC): Boolean
Check whether 'this' matrix and the other matrix 'b' have the same dimensions.
Check whether 'this' matrix and the other matrix 'b' have the same dimensions.
- b
the other matrix
- Definition Classes
- MatriC
-
def
selectCols(colIndex: Array[Int]): MatrixC
Select columns from 'this' matrix according to the given index/basis.
-
def
selectRows(rowIndex: Array[Int]): MatrixC
Select rows from 'this' matrix according to the given index/basis.
-
def
selectRows2(rowIndex: Array[Int]): MatrixC
Select rows from 'this' matrix according to the given index/basis.
Select rows from 'this' matrix according to the given index/basis. The new matrix is formed by referencing rows in the current matrix, thereby saving space.
- rowIndex
the row index positions (e.g., (0, 2, 5))
-
def
set(i: Int, u: VectoC, j: Int = 0): Unit
Set 'this' matrix's 'i'-th row starting at column 'j' to the vector 'u'.
-
def
set(u: Array[Array[Complex]]): Unit
Set all the values in 'this' matrix as copies of the values in 2D array 'u'.
-
def
set(x: Complex): Unit
Set all the elements in 'this' matrix to the scalar 'x'.
-
def
setCol(col: Int, u: VectoC): Unit
Set column 'col' of the matrix to a vector.
-
def
setDiag(x: Complex): Unit
Set the main diagonal of 'this' matrix to the scalar 'x'.
-
def
setDiag(u: VectoC, k: Int = 0): Unit
Set the 'k'th diagonal of 'this' matrix to the vector 'u'.
-
def
setFormat(newFormat: String): Unit
Set the format to the 'newFormat'.
-
def
slice(r_from: Int, r_end: Int, c_from: Int, c_end: Int): MatrixC
Slice 'this' matrix row-wise 'r_from' to 'r_end' and column-wise 'c_from' to 'c_end'.
-
def
slice(from: Int, end: Int): MatrixC
Slice 'this' matrix row-wise 'from' to 'end'.
-
def
sliceCol(from: Int, end: Int): MatrixC
Slice 'this' matrix column-wise 'from' to 'end'.
-
def
sliceExclude(row: Int, col: Int): MatrixC
Slice 'this' matrix excluding the given row and/or column.
-
def
solve(b: VectoC): VectoC
Solve for 'x' in the equation 'a*x = b' where 'a' is 'this' matrix.
-
def
solve(l: MatriC, u: MatriC, b: VectoC): VectoC
Solve for 'x' in the equation 'l*u*x = b' (see 'lud_npp' above).
-
def
solve(lu: (MatriC, MatriC), b: VectoC): VectoC
Solve for 'x' in the equation 'l*u*x = b' (see 'lud' above).
Solve for 'x' in the equation 'l*u*x = b' (see 'lud' above).
- lu
the lower and upper triangular matrices
- b
the constant vector
- Definition Classes
- MatriC
-
def
sum: Complex
Compute the sum of 'this' matrix, i.e., the sum of its elements.
-
def
sumAbs: Complex
Compute the 'abs' sum of 'this' matrix, i.e., the sum of the absolute value of its elements.
-
def
sumLower: Complex
Compute the sum of the lower triangular region of 'this' matrix.
-
def
swap(i: Int, k: Int, col: Int = 0): Unit
Swap the elements in rows 'i' and 'k' starting from column 'col'.
Swap the elements in rows 'i' and 'k' starting from column 'col'.
- i
the first row in the swap
- k
the second row in the swap
- col
the starting column for the swap (default 0 => whole row)
- Definition Classes
- MatriC
-
def
swapCol(j: Int, l: Int, row: Int = 0): Unit
Swap the elements in columns 'j' and 'l' starting from row 'row'.
Swap the elements in columns 'j' and 'l' starting from row 'row'.
- j
the first column in the swap
- l
the second column in the swap
- row
the starting row for the swap (default 0 => whole column)
- Definition Classes
- MatriC
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
- Definition Classes
- AnyRef
-
def
t: MatrixC
Transpose 'this' matrix (columns => rows).
-
def
times(b: MatrixC): MatrixC
Multiply 'this' matrix by matrix 'b' without first transposing 'b'.
Multiply 'this' matrix by matrix 'b' without first transposing 'b'.
- b
the matrix to multiply by (requires 'sameCrossDimensions')
-
def
times_d(b: MatriC): MatrixC
Multiply 'this' matrix by matrix 'b' using 'dot' product (concise solution).
Multiply 'this' matrix by matrix 'b' using 'dot' product (concise solution).
- b
the matrix to multiply by (requires 'sameCrossDimensions')
-
def
times_ip(b: MatrixC): Unit
Multiply in-place 'this' matrix by matrix 'b' without first transposing 'b'.
Multiply in-place 'this' matrix by matrix 'b' without first transposing 'b'. If 'b' and 'this' reference the same matrix 'b == this', a copy of the 'this' matrix is made.
- b
the matrix to multiply by (requires square and 'sameCrossDimensions')
-
def
times_ip_pre(b: MatrixC, d: Int = 0): Unit
Pre-multiply in-place 'this' ('a') matrix by matrix 'b', starting with column 'd'.
Pre-multiply in-place 'this' ('a') matrix by matrix 'b', starting with column 'd'.
a(d:m, d:n) = b a(d:m, d:n)
- b
the matrix to pre-multiply by 'this' (requires square and 'sameCrossDimensions')
- d
the column to start with
-
def
times_s(b: MatrixC): MatrixC
Multiply 'this' matrix by matrix 'b' using the Strassen matrix multiplication algorithm.
Multiply 'this' matrix by matrix 'b' using the Strassen matrix multiplication algorithm. Both matrices ('this' and 'b') must be square. Although the algorithm is faster than the traditional cubic algorithm, its requires more memory and is often less stable (due to round-off errors). FIX: could be make more efficient using a virtual slice 'vslice' method.
- b
the matrix to multiply by (it has to be a square matrix)
- See also
http://en.wikipedia.org/wiki/Strassen_algorithm
-
def
tip(): MatrixC
Transpose, in-place, 'this' matrix (columns => rows).
Transpose, in-place, 'this' matrix (columns => rows). FIX: may wish to use algorithm with better data locality.
-
def
toDense: MatrixC
Convert 'this' matrix to a dense matrix.
-
def
toInt: MatrixI
Convert 'this'
MatrixCinto aMatrixI. -
def
toString(): String
Convert 'this' real (double precision) matrix to a string.
Convert 'this' real (double precision) matrix to a string.
- Definition Classes
- MatrixC → AnyRef → Any
-
def
trace: Complex
Compute the trace of 'this' matrix, i.e., the sum of the elements on the main diagonal.
-
def
update(ir: Range, jr: Range, b: MatriC): Unit
Set a slice 'this' matrix row-wise on range 'ir' and column-wise on range 'jr'.
-
def
update(i: Int, u: VectoC): Unit
Set 'this' matrix's row at the 'i'-th index position to the vector 'u'.
-
def
update(i: Int, j: Int, x: Complex): Unit
Set 'this' matrix's element at the 'i,j'-th index position to the scalar 'x'.
-
def
update(i: Int, jr: Range, u: VectoC): Unit
Set a slice of 'this' matrix row-wise at index 'i' and column-wise on range 'jr' to vector 'u'.
Set a slice of 'this' matrix row-wise at index 'i' and column-wise on range 'jr' to vector 'u'. Ex: a(2, 3..5) = u
- i
the row index
- jr
the column range
- u
the vector to assign
- Definition Classes
- MatriC
-
def
update(ir: Range, j: Int, u: VectoC): Unit
Set a slice of 'this' matrix row-wise on range 'ir' and column-wise at index 'j' to vector 'u'.
Set a slice of 'this' matrix row-wise on range 'ir' and column-wise at index 'j' to vector 'u'. Ex: a(2..4, 3) = u
- ir
the row range
- j
the column index
- u
the vector to assign
- Definition Classes
- MatriC
-
def
upperT: MatrixC
Return the upper triangular of 'this' matrix (rest are zero).
-
final
def
wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
def
write(fileName: String): Unit
Write 'this' matrix to a CSV-formatted text file with name 'fileName'.
-
def
zero(m: Int = dim1, n: Int = dim2): MatrixC
Create an m-by-n matrix with all elements initialized to zero.
-
def
~^(p: Int): MatrixC
Raise 'this' matrix to the 'p'th power (for some integer 'p' >= 1) using a divide and conquer algorithm.