F64SparseLinearAlgebra
The sparse matrix halves, with the active sparse-vector kernels used by their surrounding operations.
Inheritors
Properties
sparseKernels
The sparse vector kernels used by operations around these matrix halves.
Whether this backend can do work on this host. koblas's own implementations always can, so the default is true; a binding reports whether the library it calls resolved.
Whether this is koblas's own implementation rather than a binding to a host library. The compiled-in SIMD kernels are portable however fast they are; only something calling out counts as accelerated.
Relative preference among the backends offered for one half (F64Blas, F64Decompositions, F64Kernels or a sparse counterpart). registerBackend picks the highest; the portable reference is 0.
Whether factorBasis answers with a factorization that updates its factors in place. When false a replacement costs a factorization, so a caller pacing its own refactorizations has nothing left to pace.
Functions
Factorize the square a into something solvable. A singular matrix comes back as a factorization reporting singular rather than as an exception, with a failedAt counting elimination steps rather than naming a column: the step that fails is the one with no acceptable pivot left, so there is no column of a to attribute it to.
Factor a simplex basis for column replacements.
A · x, or Aᵀ · x when transpose, into a fresh result.
solveInto into a fresh vector.