class DenseMat[T] extends MutableMat[T]
- Source
- DenseMat.scala
- Alphabetic
- By Inheritance
- DenseMat
- MutableMat
- Mat
- Traversable
- GenTraversable
- GenericTraversableTemplate
- TraversableLike
- GenTraversableLike
- Parallelizable
- TraversableOnce
- GenTraversableOnce
- FilterMonadic
- HasNewBuilder
- AnyRef
- Any
- Hide All
- Show All
- Public
- All
Instance Constructors
Type Members
-
class
ColVec
extends ImmutableVec[T]
- Definition Classes
- Mat
-
class
RowVec
extends ImmutableVec[T]
- Definition Classes
- Mat
-
type
Self = Traversable[T]
- Attributes
- protected[this]
- Definition Classes
- TraversableLike
-
class
WithFilter extends FilterMonadic[A, Repr]
- Definition Classes
- TraversableLike
Value Members
-
final
def
!=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
final
def
##(): Int
- Definition Classes
- AnyRef → Any
-
def
*(that: Mat[T]): Mat[T]
- Definition Classes
- Mat
-
def
*(that: Vec[T]): Vec[T]
- Definition Classes
- Mat
-
def
*(that: T): Mat[T]
- Definition Classes
- Mat
-
def
+(that: T): Mat[T]
- Definition Classes
- Mat
-
def
+(that: Mat[T]): Mat[T]
- Definition Classes
- Mat
-
def
++[B >: T, That](that: GenTraversableOnce[B])(implicit bf: CanBuildFrom[Traversable[T], B, That]): That
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
++:[B >: T, That](that: Traversable[B])(implicit bf: CanBuildFrom[Traversable[T], B, That]): That
- Definition Classes
- TraversableLike
-
def
++:[B >: T, That](that: TraversableOnce[B])(implicit bf: CanBuildFrom[Traversable[T], B, That]): That
- Definition Classes
- TraversableLike
-
def
-(that: T): Mat[T]
- Definition Classes
- Mat
-
def
-(that: Mat[T]): Mat[T]
- Definition Classes
- Mat
-
def
/:[B](z: B)(op: (B, T) ⇒ B): B
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
:\[B](z: B)(op: (T, B) ⇒ B): B
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
final
def
==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
def
addString(b: StringBuilder): StringBuilder
- Definition Classes
- TraversableOnce
-
def
addString(b: StringBuilder, sep: String): StringBuilder
- Definition Classes
- TraversableOnce
-
def
addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder
- Definition Classes
- TraversableOnce
-
def
aggregate[B](z: ⇒ B)(seqop: (B, T) ⇒ B, combop: (B, B) ⇒ B): B
- Definition Classes
- TraversableOnce → GenTraversableOnce
- def apply(row: Int, col: Int): T
-
final
def
asInstanceOf[T0]: T0
- Definition Classes
- Any
-
def
ataLeastSquaresSolveFor(y: Vec[T]): LinearSystemSolution[T]
Solve using AtAx = Aty method.
Solve using AtAx = Aty method.
Use leastSquaresSolveFor() instead unless you really must have this version.
- Definition Classes
- Mat
-
val
classTag: ClassTag[T]
- Definition Classes
- Mat
-
def
clone(): AnyRef
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
def
collect[B, That](pf: PartialFunction[T, B])(implicit bf: CanBuildFrom[Traversable[T], B, That]): That
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
collectFirst[B](pf: PartialFunction[T, B]): Option[B]
- Definition Classes
- TraversableOnce
-
def
column(index: Int): Vec[T]
- Definition Classes
- Mat
-
def
columnSpace: Basis[T]
Calculate A basis for the column space of this matrix.
Calculate A basis for the column space of this matrix. Note that this is just one of the bases that span this space.
- Definition Classes
- Mat
-
def
columns: Seq[Vec[T]]
- Definition Classes
- Mat
-
def
companion: GenericCompanion[Traversable]
- Definition Classes
- Traversable → GenTraversable → GenericTraversableTemplate
-
def
copyToArray[B >: T](xs: Array[B], start: Int, len: Int): Unit
- Definition Classes
- TraversableLike → TraversableOnce → GenTraversableOnce
-
def
copyToArray[B >: T](xs: Array[B]): Unit
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
copyToArray[B >: T](xs: Array[B], start: Int): Unit
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
copyToBuffer[B >: T](dest: Buffer[B]): Unit
- Definition Classes
- TraversableOnce
-
def
count(p: (T) ⇒ Boolean): Int
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
dataToString: String
- Definition Classes
- Mat
-
def
drop(n: Int): Traversable[T]
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
dropWhile(p: (T) ⇒ Boolean): Traversable[T]
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
echelonForm: (Mat[T], Mat[T])
Returns U and M such that MA = U.
Returns U and M such that MA = U.
A is this matrix. U is a row echelon matrix. M is a matrix containing the transforms to get to U.
- returns
(U,M)
- Definition Classes
- Mat
-
final
def
eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
def
equals(that: Any): Boolean
- Definition Classes
- Mat → AnyRef → Any
-
def
exists(p: (T) ⇒ Boolean): Boolean
- Definition Classes
- TraversableLike → TraversableOnce → GenTraversableOnce
-
def
factory: MatFactory
- Definition Classes
- Mat
-
def
filter(p: (T) ⇒ Boolean): Traversable[T]
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
filterNot(p: (T) ⇒ Boolean): Traversable[T]
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
finalize(): Unit
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( classOf[java.lang.Throwable] )
-
def
find(p: (T) ⇒ Boolean): Option[T]
- Definition Classes
- TraversableLike → TraversableOnce → GenTraversableOnce
-
def
flatMap[B, That](f: (T) ⇒ GenTraversableOnce[B])(implicit bf: CanBuildFrom[Traversable[T], B, That]): That
- Definition Classes
- TraversableLike → GenTraversableLike → FilterMonadic
-
def
flatten[B](implicit asTraversable: (T) ⇒ GenTraversableOnce[B]): Traversable[B]
- Definition Classes
- GenericTraversableTemplate
-
def
fold[A1 >: T](z: A1)(op: (A1, A1) ⇒ A1): A1
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
foldLeft[B](z: B)(op: (B, T) ⇒ B): B
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
foldRight[B](z: B)(op: (T, B) ⇒ B): B
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
forall(p: (T) ⇒ Boolean): Boolean
- Definition Classes
- TraversableLike → TraversableOnce → GenTraversableOnce
-
def
foreach[U](f: (T) ⇒ U): Unit
- Definition Classes
- Mat → GenericTraversableTemplate → TraversableLike → GenTraversableLike → TraversableOnce → GenTraversableOnce → FilterMonadic
-
def
frobeniusNorm(implicit ips: InnerProductSpace[T]): T
- Definition Classes
- Mat
-
def
genericBuilder[B]: Builder[B, Traversable[B]]
- Definition Classes
- GenericTraversableTemplate
-
final
def
getClass(): Class[_]
- Definition Classes
- AnyRef → Any
-
def
groupBy[K](f: (T) ⇒ K): Map[K, Traversable[T]]
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
hasDefiniteSize: Boolean
- Definition Classes
- TraversableLike → TraversableOnce → GenTraversableOnce
-
def
hashCode(): Int
- Definition Classes
- Mat → AnyRef → Any
-
def
head: T
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
headOption: Option[T]
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
init: Traversable[T]
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
inits: Iterator[Traversable[T]]
- Definition Classes
- TraversableLike
-
def
inverse: Mat[T]
Invert this matrix if it is invertible.
-
def
isColumnEchelon: Boolean
- Definition Classes
- Mat
-
def
isDiagonal: Boolean
- Definition Classes
- Mat
-
def
isEmpty: Boolean
- Definition Classes
- TraversableLike → TraversableOnce → GenTraversableOnce
-
def
isIdentity: Boolean
- Definition Classes
- Mat
-
final
def
isInstanceOf[T0]: Boolean
- Definition Classes
- Any
-
def
isInvertible: Boolean
- Definition Classes
- Mat
-
def
isLowerTriangular: Boolean
- Definition Classes
- Mat
-
def
isRowEchelon: Boolean
- Definition Classes
- Mat
-
final
def
isTraversableAgain: Boolean
- Definition Classes
- TraversableLike → GenTraversableLike → GenTraversableOnce
-
def
isUpperTriangular: Boolean
- Definition Classes
- Mat
-
def
isZero: Boolean
- Definition Classes
- Mat
-
def
last: T
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
lastOption: Option[T]
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
leastSquaresSolveFor(y: Vec[T]): Vec[T]
Solve Ax = y by least squares method, giving an approximate x.
Solve Ax = y by least squares method, giving an approximate x.
A is this matrix which, y is provided vector. Returns approximate solution x.
- returns
x
- Definition Classes
- Mat
-
val
linField: LinField[T]
- Definition Classes
- Mat
-
def
linearIndependentColumnSubset: IndexedSeq[Vec[T]]
Returns a subset of the columns that are linearly independent
Returns a subset of the columns that are linearly independent
- Definition Classes
- Mat
-
def
linearIndependentRowSubset: IndexedSeq[Vec[T]]
Returns a subset of the rows that are linearly independent
Returns a subset of the rows that are linearly independent
- Definition Classes
- Mat
-
def
map[U](f: (T) ⇒ U)(implicit arg0: LinField[U], arg1: ClassTag[U]): Mat[U]
- Definition Classes
- Mat
-
def
map[B, That](f: (T) ⇒ B)(implicit bf: CanBuildFrom[Traversable[T], B, That]): That
- Definition Classes
- TraversableLike → GenTraversableLike → FilterMonadic
-
def
mapWithIndexes[U](f: (Int, Int) ⇒ (T) ⇒ U)(implicit arg0: LinField[U], arg1: ClassTag[U]): Mat[U]
- Definition Classes
- Mat
-
def
max[B >: T](implicit cmp: Ordering[B]): T
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
maxBy[B](f: (T) ⇒ B)(implicit cmp: Ordering[B]): T
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
min[B >: T](implicit cmp: Ordering[B]): T
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
minBy[B](f: (T) ⇒ B)(implicit cmp: Ordering[B]): T
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
mkString: String
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
mkString(sep: String): String
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
mkString(start: String, sep: String, end: String): String
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
final
def
ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
def
newBuilder: Builder[T, Traversable[T]]
- Attributes
- protected[this]
- Definition Classes
- GenericTraversableTemplate → HasNewBuilder
-
def
nonEmpty: Boolean
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
final
def
notify(): Unit
- Definition Classes
- AnyRef
-
final
def
notifyAll(): Unit
- Definition Classes
- AnyRef
-
def
nullSpace: Basis[T]
Calculate the null space for this matrix
Calculate the null space for this matrix
- Definition Classes
- Mat
-
def
nullity: Int
- Definition Classes
- Mat
- val numColumns: Int
- val numRows: Int
-
def
par: ParIterable[T]
- Definition Classes
- Parallelizable
-
def
parCombiner: Combiner[T, ParIterable[T]]
- Attributes
- protected[this]
- Definition Classes
- TraversableLike → Parallelizable
-
def
partition(p: (T) ⇒ Boolean): (Traversable[T], Traversable[T])
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
product[B >: T](implicit num: Numeric[B]): B
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
qrDecomposition(implicit ips: InnerProductSpace[T]): (Mat[T], Mat[T])
Returns the QR decomposition of this matrix.
-
def
qrLeastSquaresSolveFor(y: Vec[T])(implicit ips: InnerProductSpace[T]): Vec[T]
Least squares solve using Q/R decomposition.
Least squares solve using Q/R decomposition.
Use leastSquaresSolveFor() instead unless you really must have the Q/R version.
- Definition Classes
- Mat
-
def
rank: Int
- Definition Classes
- Mat
-
def
reduce[A1 >: T](op: (A1, A1) ⇒ A1): A1
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
reduceLeft[B >: T](op: (B, T) ⇒ B): B
- Definition Classes
- TraversableOnce
-
def
reduceLeftOption[B >: T](op: (B, T) ⇒ B): Option[B]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
reduceOption[A1 >: T](op: (A1, A1) ⇒ A1): Option[A1]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
reduceRight[B >: T](op: (T, B) ⇒ B): B
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
reduceRightOption[B >: T](op: (T, B) ⇒ B): Option[B]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
reducedRowEchelonForm: (Mat[T], IndexedSeq[Int])
Returns row reduced echelon form and row swap list.
Returns row reduced echelon form and row swap list.
U is the reduced row echelon matrix. rows is a mapping of rows from original matrix to U
- returns
(U, rows)
- Definition Classes
- Mat
-
def
repr: Traversable[T]
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
reversed: List[T]
- Attributes
- protected[this]
- Definition Classes
- TraversableOnce
-
def
row(index: Int): Vec[T]
- Definition Classes
- Mat
-
def
rowSpace: Basis[T]
Calculate A basis for the row space of this matrix.
Calculate A basis for the row space of this matrix. Note that this is just one of the bases that span this space.
- Definition Classes
- Mat
-
def
rows: Seq[Vec[T]]
- Definition Classes
- Mat
-
def
scan[B >: T, That](z: B)(op: (B, B) ⇒ B)(implicit cbf: CanBuildFrom[Traversable[T], B, That]): That
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
scanLeft[B, That](z: B)(op: (B, T) ⇒ B)(implicit bf: CanBuildFrom[Traversable[T], B, That]): That
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
scanRight[B, That](z: B)(op: (T, B) ⇒ B)(implicit bf: CanBuildFrom[Traversable[T], B, That]): That
- Definition Classes
- TraversableLike → GenTraversableLike
- Annotations
- @migration
- Migration
(Changed in version 2.9.0) The behavior of
scanRight
has changed. The previous behavior can be reproduced with scanRight.reverse.
-
def
seq: Traversable[T]
- Definition Classes
- Traversable → GenTraversable → Parallelizable → TraversableOnce → GenTraversableOnce
-
val
size: Int
- Definition Classes
- Mat → GenTraversableLike → TraversableOnce → GenTraversableOnce
-
def
sizeHintIfCheap: Int
- Attributes
- protected[scala.collection]
- Definition Classes
- GenTraversableOnce
-
def
slice(from: Int, until: Int): Traversable[T]
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
solveFor(y: Vec[T]): LinearSystemSolution[T]
Solve Ax = y for this matrix.
Solve Ax = y for this matrix.
A is this matrix, y is provided vector. Returns solution x
- returns
x such that this * x = y
- Definition Classes
- Mat
-
def
span(p: (T) ⇒ Boolean): (Traversable[T], Traversable[T])
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
splitAt(n: Int): (Traversable[T], Traversable[T])
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
stringPrefix: String
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
sum[B >: T](implicit num: Numeric[B]): B
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
- Definition Classes
- AnyRef
-
def
tail: Traversable[T]
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
tails: Iterator[Traversable[T]]
- Definition Classes
- TraversableLike
-
def
take(n: Int): Traversable[T]
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
takeWhile(p: (T) ⇒ Boolean): Traversable[T]
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
thisCollection: Traversable[T]
- Attributes
- protected[this]
- Definition Classes
- TraversableLike
-
def
to[Col[_]](implicit cbf: CanBuildFrom[Nothing, T, Col[T]]): Col[T]
- Definition Classes
- TraversableLike → TraversableOnce → GenTraversableOnce
-
def
toArray[B >: T](implicit arg0: ClassTag[B]): Array[B]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
toBuffer[B >: T]: Buffer[B]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
toCollection(repr: Traversable[T]): Traversable[T]
- Attributes
- protected[this]
- Definition Classes
- TraversableLike
-
def
toIndexedSeq: IndexedSeq[T]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
toIterable: Iterable[T]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
toIterator: Iterator[T]
- Definition Classes
- TraversableLike → GenTraversableOnce
-
def
toList: List[T]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
toMap[T, U](implicit ev: <:<[T, (T, U)]): Map[T, U]
- Definition Classes
- TraversableOnce → GenTraversableOnce
- def toMat: Mat[T]
-
def
toSeq: Seq[T]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
toSet[B >: T]: Set[B]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
toStream: Stream[T]
- Definition Classes
- TraversableLike → GenTraversableOnce
-
def
toString(): String
- Definition Classes
- Mat → TraversableLike → AnyRef → Any
-
def
toTraversable: Traversable[T]
- Definition Classes
- TraversableLike → TraversableOnce → GenTraversableOnce
- Annotations
- @deprecatedOverriding( ... , "2.11.0" )
-
def
toVector: Vector[T]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
transpose: Mat[T]
- Definition Classes
- Mat
-
def
transpose[B](implicit asTraversable: (T) ⇒ GenTraversableOnce[B]): Traversable[Traversable[B]]
- Definition Classes
- GenericTraversableTemplate
- Annotations
- @migration
- Migration
(Changed in version 2.9.0)
transpose
throws anIllegalArgumentException
if collections are not uniformly sized.
-
def
triangularSolveFor(y: Vec[T]): Vec[T]
Solve Ax = y for this TRIANGULAR matrix.
Solve Ax = y for this TRIANGULAR matrix.
A is this matrix which is required to be upper triangular, y is provided vector. Returns solution x
- returns
x such that this * x = y
- Definition Classes
- Mat
-
def
unzip[A1, A2](implicit asPair: (T) ⇒ (A1, A2)): (Traversable[A1], Traversable[A2])
- Definition Classes
- GenericTraversableTemplate
-
def
unzip3[A1, A2, A3](implicit asTriple: (T) ⇒ (A1, A2, A3)): (Traversable[A1], Traversable[A2], Traversable[A3])
- Definition Classes
- GenericTraversableTemplate
-
def
update(row: Int, col: Int, value: T): Unit
- Definition Classes
- DenseMat → MutableMat
-
def
vectorFactory: VecFactory
- Definition Classes
- Mat
-
def
view(from: Int, until: Int): TraversableView[T, Traversable[T]]
- Definition Classes
- TraversableLike
-
def
view: TraversableView[T, Traversable[T]]
- Definition Classes
- TraversableLike
-
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
withFilter(p: (T) ⇒ Boolean): FilterMonadic[T, Traversable[T]]
- Definition Classes
- TraversableLike → FilterMonadic