StrictLowerTriQSM

StrictLowerTriQSM#

class tinygp.solvers.quasisep.core.StrictLowerTriQSM(p: JAXArray, q: JAXArray, a: JAXArray)[source]#

Bases: QSM

A strictly lower triangular order m quasiseparable matrix

Parameters:

  • p (n, m) – The left quasiseparable elements.

  • q (n, m) – The right quasiseparable elements.

  • a (n, m, m) – The transition matrices.

matmul(x: tinygp.helpers.JAXArray, *, parallel: bool = False) → tinygp.helpers.JAXArray[source]#

The dot product of this matrix with a dense vector or matrix

Parameters:

  • x (n, ...) – A matrix or vector with leading dimension matching this matrix.

  • parallel – If True, use a parallel associative-scan algorithm instead of the default sequential scan.

scale(other: tinygp.helpers.JAXArray) → StrictLowerTriQSM[source]#

The multiplication of this matrix times a scalar, as a QSM

self_add(other: StrictLowerTriQSM) → StrictLowerTriQSM[source]#

The sum of two StrictLowerTriQSM matrices

self_mul(other: StrictLowerTriQSM) → StrictLowerTriQSM[source]#

The elementwise product of two StrictLowerTriQSM matrices

property shape: tuple[int, int]#

The shape of the matrix

to_dense() → tinygp.helpers.JAXArray#

Render this representation to a dense matrix

This implementation is not optimized and should really only ever be used for testing purposes.

transpose() → StrictUpperTriQSM[source]#

The matrix transpose as a QSM