numerics 0.1.0
Loading...
Searching...
No Matches
impl.hpp
Go to the documentation of this file.
1/// @file linalg/factorization/backends/seq/impl.hpp
2/// @brief Private declarations for the sequential factorization backend.
3/// Only included by the dispatcher .cpp files in src/linalg/factorization/.
4#pragma once
5
9
10namespace num::backends::seq {
11
12LUResult lu(const Matrix& A);
13QRResult qr(const Matrix& A);
14void thomas(const Vector& a,
15 const Vector& b,
16 const Vector& c,
17 const Vector& d,
18 Vector& x);
19
20} // namespace num::backends::seq
LU factorization with partial pivoting.
LUResult lu(const Matrix &A)
Definition lu.cpp:9
void thomas(const Vector &a, const Vector &b, const Vector &c, const Vector &d, Vector &x)
Definition thomas.cpp:8
QRResult qr(const Matrix &A)
Definition qr.cpp:11
BasicVector< real > Vector
Real-valued dense vector with full backend dispatch (CPU + GPU)
Definition vector.hpp:130
QR factorization via Householder reflections.
Thomas algorithm – direct O(n) tridiagonal solver.