lu_solve

→Tensor

lu_solve(LU: Tensor, pivots: Tensor, B: Tensor)

source edit

Implementing kernel

C++lu_solve_opfree fn

Solve a linear system from a precomputed LU factorization.

Given the packed factorization $PA = LU$ returned by lu_factor, solves

A\,X \,=\, B

by applying the permutation and performing two triangular solves (forward + back substitution).

Parameters

LUTensor

Packed LU factor of shape (*, n, n) from lu_factor.

pivotsTensor

Pivot indices of shape (*, n) from lu_factor (1-based, LAPACK convention).

BTensor

Right-hand side of shape (*, n, k) (or (*, n)).

Returns

Tensor

Solution $X$ , same shape as B.

Notes

Backed by LAPACK getrs. Cost per solve is $O(n^2 k)$ — much cheaper than a fresh solve ( $O(n^3)$ ) when the same $A$ is reused.

Examples

>>> import lucid
>>> from lucid.linalg import lu_factor, lu_solve
>>> A = lucid.tensor([[3.0, 1.0], [1.0, 2.0]])
>>> LU, piv = lu_factor(A)
>>> b = lucid.tensor([[9.0], [8.0]])
>>> lu_solve(LU, piv, b)
Tensor([[2.0000],
        [3.0000]])

>>> import lucid >>> from lucid.linalg import lu_factor, lu_solve >>> A = lucid.tensor([[3.0, 1.0], [1.0, 2.0]]) >>> LU, piv = lu_factor(A) >>> b = lucid.tensor([[9.0], [8.0]]) >>> lu_solve(LU, piv, b) Tensor([[2.0000], [3.0000]])