#include <graph_amg.hpp>

Public Attributes
int	ndofPerNode = 1
	block size for nodal aggregation (Voronoi positions ⇒ 3, +weight ⇒ 4)

double	theta = 0.05
	strength-of-connection threshold (fraction of √(A_ii·A_jj))

double	smoothOmega = 4.0 / 3.0
	prolongator-smoothing damping (× 1/λ_max)

int	maxLevels = 25
	hierarchy depth cap

Index	coarsest = 40
	stop coarsening once a level has ≤ this many DOFs

int	pre = 1

int	post = 1
	smoother sweeps per level (pre == post keeps the V-cycle symmetric)

int	chebDegree = 2
	Chebyshev smoother polynomial degree; 0 ⇒ damped-Jacobi smoother.

double	jacobiOmega = 0.6
	damped-Jacobi smoother relaxation (used when chebDegree == 0)

int	coarseSweeps = 0
	coarsest level: 0 ⇒ a near-exact CG solve; >0 ⇒ this many smoother sweeps instead (with maxLevels=1 this turns GraphAMG into a plain single-level polynomial/Jacobi preconditioner — no coarse grid)

int	eigIters = 15
	power-iteration steps for the per-level λ_max(D⁻¹A) estimate

Detailed Description

Definition at line 72 of file graph_amg.hpp.

Member Data Documentation

◆ ndofPerNode

int peclet::core::solver::AmgParams::ndofPerNode = 1

block size for nodal aggregation (Voronoi positions ⇒ 3, +weight ⇒ 4)

Definition at line 73 of file graph_amg.hpp.

◆ theta

double peclet::core::solver::AmgParams::theta = 0.05

strength-of-connection threshold (fraction of √(A_ii·A_jj))

Definition at line 74 of file graph_amg.hpp.

◆ smoothOmega

double peclet::core::solver::AmgParams::smoothOmega = 4.0 / 3.0

prolongator-smoothing damping (× 1/λ_max)

Definition at line 75 of file graph_amg.hpp.

◆ maxLevels

int peclet::core::solver::AmgParams::maxLevels = 25

hierarchy depth cap

Definition at line 76 of file graph_amg.hpp.

◆ coarsest

Index peclet::core::solver::AmgParams::coarsest = 40

stop coarsening once a level has ≤ this many DOFs

Definition at line 77 of file graph_amg.hpp.

◆ pre

int peclet::core::solver::AmgParams::pre = 1

Definition at line 78 of file graph_amg.hpp.

◆ post

int peclet::core::solver::AmgParams::post = 1

smoother sweeps per level (pre == post keeps the V-cycle symmetric)

Definition at line 78 of file graph_amg.hpp.

◆ chebDegree

int peclet::core::solver::AmgParams::chebDegree = 2

Chebyshev smoother polynomial degree; 0 ⇒ damped-Jacobi smoother.

Definition at line 79 of file graph_amg.hpp.

◆ jacobiOmega

double peclet::core::solver::AmgParams::jacobiOmega = 0.6

damped-Jacobi smoother relaxation (used when chebDegree == 0)

Definition at line 80 of file graph_amg.hpp.

◆ coarseSweeps

int peclet::core::solver::AmgParams::coarseSweeps = 0

coarsest level: 0 ⇒ a near-exact CG solve; >0 ⇒ this many smoother sweeps instead (with maxLevels=1 this turns GraphAMG into a plain single-level polynomial/Jacobi preconditioner — no coarse grid)

Definition at line 81 of file graph_amg.hpp.

◆ eigIters

int peclet::core::solver::AmgParams::eigIters = 15

power-iteration steps for the per-level λ_max(D⁻¹A) estimate

Definition at line 84 of file graph_amg.hpp.

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

graph_amg.hpp

Public Attributes