sparsax.solve_bcoo¶
-
sparsax.solve_bcoo(A, b, mode=
0)[source]¶ solve()for a JAXBCOOmatrixA.Equivalent to
solve(A.indices[:, 0], A.indices[:, 1], A.data, b, ...). A full-symmetric BCOO works directly — only the upper triangle is read — and duplicate/unsorted entries are handled. The pattern cache keys on the index values, so the analysis-reuse speedup applies wheneverA’s sparsity pattern is stable across calls.