15 for (
int k = 1; k <
n; ++k) {
26 for (
int k = 1; k <
n; ++k)
30 for (
int k =
n - 2; k >= 0; --k)
31 d[k] -=
c_mod[k] * d[k + 1];
std::vector< cplx > inv_b
void solve(std::vector< cplx > &d) const
std::complex< double > cplx
void factor(int n_, cplx a_, cplx b_, cplx c_)
std::vector< cplx > c_mod
Precomputed Thomas solver for constant-coefficient complex systems.