AMReX_CrossProj.H

Go to the documentation of this file.

#ifndef AMREX_CROSS_PROJ_H_
#define AMREX_CROSS_PROJ_H_
#include <AMReX_Config.H>
 
#include <AMReX_Geometry.H>
#include <AMReX_MultiFab.H>
#include <AMReX_iMultiFab.H>
 
#include <memory>
 
#if (AMREX_SPACEDIM == 2)
 
namespace amrex::GMG
{


class CrossProj
{
public:

    explicit CrossProj (Geometry const& geom);
 
    ~CrossProj ();
    CrossProj (CrossProj const&) = delete;
    CrossProj (CrossProj&&) = delete;
    CrossProj& operator= (CrossProj const&) = delete;
    CrossProj& operator= (CrossProj&&) = delete;

    void solve (MultiFab& a_soln, MultiFab const& a_rhs);

    void setRelTol (Real rtol) { m_reltol = rtol; }
    void setAbsTol (Real atol) { m_abstol = atol; }
    void setMaxIter (int n) { m_maxiter = n; }
    void setVerbose (int v) { m_verbose = v; }
    [[nodiscard]] int getNumIters () const { return m_niters; }
 
    struct Level;
 
private:
 
    void setup (BoxArray const& ba, DistributionMapping const& dm);
    void precond ();
    void vcycle (int h, int lev);
 
    Geometry m_geom;
    Real m_reltol = std::is_same_v<Real,float> ? Real(1.e-5) : Real(1.e-10);
    Real m_abstol = Real(0.0);
    int m_maxiter = 200;
    int m_verbose = 0;
    int m_niters = 0;
 
    BoxArray m_grids; // cell-centered
    DistributionMapping m_dmap;
    bool m_reduced = false; // dx == dy: PCG on the red/black reduced problem
    MultiFab m_vel, m_x, m_p, m_q, m_rold;
    std::unique_ptr<Level> m_top;
    // Coarse hierarchies: 0 for smooth modes, 1 for the checkerboard.
    Array<Vector<std::unique_ptr<Level>>,2> m_hier;
};
 
}
 
#endif
#endif