Expand description
The sparse LU backend, chosen at run time.
Every Newton loop in the crate — power flow, state estimation, continuation,
dynamics — factors a real system whose sparsity pattern is fixed and whose
values change every iteration, which is the contract
LinearSolver states. Each backend implements that trait; SparseLu
picks one of them from a LuBackend value, so a caller holds one field
and writes no match over the backends, and the klu/pardiso feature
gates live here and nowhere else.
The cost is one match per factorization, against the factorization
itself.
Structs§
- Sparse
Lu - A sparse LU that analyzes a pattern once and refactors it on every solve,
with its backend picked by a
LuBackend.
Enums§
- LuBackend
- Which sparse LU factors the system.