|
| std::optional< LuNorms< make_real_t< S > > > const & | norms () const &noexcept |
| | Original norms at factor precision, absent only when capture was disabled.
|
| |
| std::size_t | order () const noexcept |
| | Matrix order, including zero for a successfully factored empty matrix.
|
| |
| DenseMatrix< S > const & | packed () const &noexcept |
| | Read-only packed L/U matrix, valid while this object retains its storage.
|
| |
| std::span< std::size_t const > | pivots () const &noexcept |
| | Zero-based swap sequence; at step k exchange rows k and pivots[k].
|
| |
| Precision | precision () const |
| | Finite working precision used for these factors and subsequent solves.
|
| |
template<RealOrComplex S>
class uni20::linalg::LuFactorization< S >
Immutable owning packed factors satisfying P A = L U.
Created only by successful factorization. P applies the stored row swaps in elimination order; the unit diagonal of L is implicit. Copies own their data. A moved-from object supports destruction and reassignment; other operations require an intact factorization. Factor storage cannot overlap a solve's writable RHS.
