object
LU extends UFunc
Type Members
-
type
Impl[V, VR] = UImpl[LU.this.type, V, VR]
-
type
Impl2[V1, V2, VR] = UImpl2[LU.this.type, V1, V2, VR]
-
type
Impl3[V1, V2, V3, VR] = UImpl3[LU.this.type, V1, V2, V3, VR]
-
type
Impl4[V1, V2, V3, V4, VR] = UImpl4[LU.this.type, V1, V2, V3, V4, VR]
-
-
-
-
-
type
SinkImpl2[S, V1, V2] = generic.UFunc.SinkImpl2[LU.this.type, S, V1, V2]
-
type
SinkImpl3[S, V1, V2, V3] = generic.UFunc.SinkImpl3[LU.this.type, S, V1, V2, V3]
Value Members
-
final
def
!=(arg0: Any): Boolean
-
final
def
##(): Int
-
final
def
==(arg0: Any): Boolean
-
-
-
-
final
def
apply[V1, V2, V3, V4, VR](v1: V1, v2: V2, v3: V3, v4: V4)(implicit impl: Impl4[V1, V2, V3, V4, VR]): VR
-
final
def
apply[V1, V2, V3, VR](v1: V1, v2: V2, v3: V3)(implicit impl: Impl3[V1, V2, V3, VR]): VR
-
final
def
apply[V1, V2, VR](v1: V1, v2: V2)(implicit impl: Impl2[V1, V2, VR]): VR
-
final
def
apply[V, VR](v: V)(implicit impl: Impl[V, VR]): VR
-
final
def
asInstanceOf[T0]: T0
-
implicit
def
canZipMapValuesImpl[T, V1, VR, U](implicit handhold: ScalarOf[T, V1], impl: Impl2[V1, V1, VR], canZipMapValues: CanZipMapValues[T, V1, VR, U]): Impl2[T, T, U]
-
def
clone(): AnyRef
-
-
-
def
finalize(): Unit
-
final
def
getClass(): Class[_]
-
def
hashCode(): Int
-
final
def
inPlace[V, V2, V3](v: V, v2: V2, v3: V3)(implicit impl: generic.UFunc.InPlaceImpl3[LU.this.type, V, V2, V3]): V
-
final
def
inPlace[V, V2](v: V, v2: V2)(implicit impl: generic.UFunc.InPlaceImpl2[LU.this.type, V, V2]): V
-
final
def
inPlace[V](v: V)(implicit impl: generic.UFunc.InPlaceImpl[LU.this.type, V]): V
-
final
def
isInstanceOf[T0]: Boolean
-
-
final
def
notify(): Unit
-
final
def
notifyAll(): Unit
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
-
def
toString(): String
-
final
def
wait(): Unit
-
final
def
wait(arg0: Long, arg1: Int): Unit
-
final
def
wait(arg0: Long): Unit
-
final
def
withSink[S](s: S): WithSinkHelp[LU.this.type, S]
Computes the LU factorization of the given real M-by-N matrix X such that X = P * L * U where P is a permutation matrix (row exchanges).
Upon completion, a tuple consisting of a matrix A and an integer array P.
The upper triangular portion of A resembles U whereas the lower triangular portion of A resembles L up to but not including the diagonal elements of L which are all equal to 1.
For 0 <= i < M, each element P(i) denotes whether row i of the matrix X was exchanged with row P(i-1) during computation (the offset is caused by the internal call to LAPACK).