Method midpointStep

src/IB/IBMethod.cpp:769–795

} // backwardEulerStep

void
IBMethod::midpointStep(const double current_time, const double new_time)
{
    int ierr;
    const int coarsest_ln = 0;
    const int finest_ln = d_hierarchy->getFinestLevelNumber();
    const double dt = new_time - current_time;
    std::vector<Pointer<LData>>* U_data;
    getVelocityData(&U_data, current_time + 0.5 * dt);
    for (int ln = coarsest_ln; ln <= finest_ln; ++ln)
    {
        if (!d_l_data_manager->levelContainsLagrangianData(ln)) continue;
        ierr = VecWAXPY(d_X_new_data[ln]->getVec(), dt, (*U_data)[ln]->getVec(), d_X_current_data[ln]->getVec());
        IBTK_CHKERRQ(ierr);
    }
    d_X_new_needs_ghost_fill = true;

    std::vector<Pointer<LData>>* X_half_data = nullptr;
    bool* X_half_needs_ghost_fill = nullptr;
    getPositionData(&X_half_data, &X_half_needs_ghost_fill, d_half_time);
    TBOX_ASSERT(X_half_data);
    reinitMidpointData(d_X_current_data, d_X_new_data, *X_half_data);
    TBOX_ASSERT(X_half_needs_ghost_fill);
    *X_half_needs_ghost_fill = true;

    return;
} // midpointStep

void
IBMethod::trapezoidalStep(const double current_time, const double new_time)