object
logdet extends UFunc
Type Members
-
type
Impl[V, VR] = UImpl[logdet.this.type, V, VR]
-
type
Impl2[V1, V2, VR] = UImpl2[logdet.this.type, V1, V2, VR]
-
type
Impl3[V1, V2, V3, VR] = UImpl3[logdet.this.type, V1, V2, V3, VR]
-
type
Impl4[V1, V2, V3, V4, VR] = UImpl4[logdet.this.type, V1, V2, V3, V4, VR]
-
-
-
-
-
-
type
SinkImpl3[S, V1, V2, V3] = generic.UFunc.SinkImpl3[logdet.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[logdet.this.type, V, V2, V3]): V
-
final
def
inPlace[V, V2](v: V, v2: V2)(implicit impl: generic.UFunc.InPlaceImpl2[logdet.this.type, V, V2]): 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[logdet.this.type, S]
Computes the log of the determinant of the given real matrix. The value returned is (sign of determinant, log of determinant). This method can be more accurate than just using breeze.linalg.det, if det is very small.