koblas
com.eignex.koblas/sparse/F64SingularSparseFactorization

F64SingularSparseFactorization

class F64SingularSparseFactorization(val n: Int, val failedAt: Int) : F64SparseFactorization(source)

What F64SparseLu.factor returns when no numerically acceptable pivot remains.

Constructors

F64SingularSparseFactorization

constructor(n: Int, failedAt: Int)(source)

Properties

failedAt

open override val failedAt: Int(source)

The pivot position that had no numerically acceptable candidate, or NOT_SINGULAR when the factorization succeeded.

n

open override val n: Int(source)

The dimension of the factored matrix.

nnz

open override val nnz: Int(source)

Nonzeros in the factors, the fill. Zero for a singular factorization, which has none.

rcond

open override val rcond: Double(source)

A cheap pivot-quality estimate: min(abs(U(k, k))) / max(abs(U(k, k))). A small value warns that the factorization may be inaccurate; it is not a reciprocal condition-number estimate.

Link copied to clipboard
open val singular: Boolean

Whether the factorization failed for want of a numerically acceptable pivot. Solving against one throws com.eignex.koblas.SingularMatrix rather than answering with infinities.

Functions

solveInto

open override fun solveInto(b: DoubleArray, out: DoubleArray, transpose: Boolean = false, workspace: Workspace? = null): DoubleArray(source)

Solve B x = b, or Bᵀ x = b when transpose, into out, which is returned. Allocates nothing when given a workspace. out may be b.

Link copied to clipboard
open fun solve(b: DoubleArray, transpose: Boolean = false): DoubleArray

Solve B x = b, or Bᵀ x = b when transpose, into a fresh result.