Library Reference

sinv(a)

Compute a quasi-inverse of a, i.e. an object a* satisfying

\[ a^* = 1 + a a^* = 1 + a^* a.\]

sldiv(a, b)

Solve the linear fixed-point equation

\[ ax + b = x,\]

where a, b, and x are elements of a semiring.

sldiv!(A, B::AbstractVecOrMat)

Solve the linear fixed-point equation

\[ AX + B = X,\]

over-writing B with the solution.

mtsldiv!(A::SparseSemiringLU, B::AbstractMatrix)

A multi-threaded version of sldiv!.

srdiv(b, a)

Solve the linear fixed-point equation

\[ xa + b = x,\]

where a, b, and x are elements of a semiring.

srdiv!(B::AbstractVecOrMat, A)

Solve the linear fixed-point equation

\[ XA + B = X,\]

over-writing B with the solution.

mtsrdiv!(B::AbstractMatrix, A::SparseSemiringLU)

A multi-threaded version of srdiv!.

slu(A::AbstractMatrix)

Compute an LU factorization of a semiring- valued matrix A.

slu(A::SparseMatricCSC; alg=AMF(), snd=Maximal())

Compute an LU factorization of a sparse semiring-valued matrix A, optionally specifying an elimination algorithm alg and supernode type snd.

slu!(A::AbstractMatrix)

Compute an LU factorization of a semiring- valued matrix A, over-writing A with the factors.

SemiringLU{T, M <: AbstractMatrix{T}} <: AbstractSemiringLU{T}

An LU factorization of a semiring-valued matrix.

SparseSemiringLU{T, I} <: AbstractSemiringLU{T}

An LU factorization of a sparse semiring- valued matrix.

SymbolicSemiringLU{I}

A symbolic factorization of a sparse semiring-valued matrix.