richardson.cpp

Go to the documentation of this file.

/**
 * @file richardson.cpp
 * @brief Richardson explicit scheme implementation.
 */
 
#include "methods/richardson.hpp"
 
#include <cstddef> // for std::size_t
 
void Richardson::step(const Grid& g,
                      double D,
                      double dt,
                      const std::vector<double>& Tprev,
                      const std::vector<double>& Tcurr,
                      std::vector<double>& Tnext) const
{
    const double r = D * dt / (g.dx * g.dx);
    const std::size_t N = g.Nx;
 
    // Update interior nodes only; boundaries are imposed by the solver.
    for (std::size_t i = 1; i + 1 < N; ++i)
    {
        Tnext[i] = Tprev[i] + 2.0 * r * (Tcurr[i + 1] - 2.0 * Tcurr[i] + Tcurr[i - 1]);
    }
    // Tnext[0] and Tnext[N-1] left as-is
}