core
Shared MPI block decomposition + asynchronous ghost-layer exchange (header-only C++20)
Loading...
Searching...
No Matches
peclet::core::solver::GraphAMG Class Reference

Smoothed-aggregation AMG hierarchy usable as z = M⁻¹ r (one symmetric V-cycle from a zero initial guess) — the CG preconditioner that makes the iteration count mesh-independent. More...

#include <graph_amg.hpp>

Public Member Functions

void build (const HostCsrOp &A, const AmgParams &prm={})
 
void apply (const std::vector< double > &r, std::vector< double > &z) const
 z = M⁻¹ r: one V-cycle (correction scheme) from a zero initial guess.
 
int numLevels () const
 
Index size (int L=0) const
 
double operatorComplexity () const
 Total nonzeros / finest nonzeros — the grid+operator complexity (should stay ~<2 for a healthy hierarchy; a useful health check when tuning theta).
 

Detailed Description

Smoothed-aggregation AMG hierarchy usable as z = M⁻¹ r (one symmetric V-cycle from a zero initial guess) — the CG preconditioner that makes the iteration count mesh-independent.

Definition at line 89 of file graph_amg.hpp.

Member Function Documentation

◆ build()

void peclet::core::solver::GraphAMG::build ( const HostCsrOp A,
const AmgParams prm = {} 
)
inline

Definition at line 91 of file graph_amg.hpp.

◆ apply()

void peclet::core::solver::GraphAMG::apply ( const std::vector< double > &  r,
std::vector< double > &  z 
) const
inline

z = M⁻¹ r: one V-cycle (correction scheme) from a zero initial guess.

Definition at line 111 of file graph_amg.hpp.

Referenced by peclet::core::solver::amgPcg().

◆ numLevels()

int peclet::core::solver::GraphAMG::numLevels ( ) const
inline

Definition at line 119 of file graph_amg.hpp.

◆ size()

Index peclet::core::solver::GraphAMG::size ( int  L = 0) const
inline

Definition at line 120 of file graph_amg.hpp.

References peclet::core::solver::HostCsrOp::n.

◆ operatorComplexity()

double peclet::core::solver::GraphAMG::operatorComplexity ( ) const
inline

Total nonzeros / finest nonzeros — the grid+operator complexity (should stay ~<2 for a healthy hierarchy; a useful health check when tuning theta).

Definition at line 124 of file graph_amg.hpp.


The documentation for this class was generated from the following file: