Main Page   Class Hierarchy   Alphabetical List   Compound List   File List   Compound Members   File Members  

NodeBiCGStabSmoother Class Reference

Implements BiCGStab as a bottom smoother for LevelOp-derived classes. More...

#include <NodeBiCGStabSmoother.H>

Inheritance diagram for NodeBiCGStabSmoother:

Inheritance graph
[legend]
Collaboration diagram for NodeBiCGStabSmoother:

Collaboration graph
[legend]
List of all members.

Public Methods

 NodeBiCGStabSmoother ()
 {\bf constructor and destructor}

virtual ~NodeBiCGStabSmoother ()
virtual NodeBaseBottomSmoothernew_bottomSmoother () const
void setMaxIter (int a_max_iter)
 {\bf parameter-setting functions}

void setSolverTol (Real a_solverTol)
void setVerbose (bool a_verbose)
virtual void doBottomSmooth (LevelData< NodeFArrayBox > &a_phi, const LevelData< NodeFArrayBox > &a_rhs, NodeLevelOp *a_levelopPtr)
 {\bf data modification functions}


Protected Attributes

int m_maxIter
Real m_solverTol
Real m_small
Real m_converge_small
bool m_verbose

Detailed Description

Implements BiCGStab as a bottom smoother for LevelOp-derived classes.

The NodeBiCGStabSmoother class implements the BiCGStab algorithm for NodeLevelOp-derived classes


Constructor & Destructor Documentation

NodeBiCGStabSmoother::NodeBiCGStabSmoother  
 

{\bf constructor and destructor}

Default constructor.

virtual NodeBiCGStabSmoother::~NodeBiCGStabSmoother   [virtual]
 

Destructor.


Member Function Documentation

virtual void NodeBiCGStabSmoother::doBottomSmooth LevelData< NodeFArrayBox > &    a_phi,
const LevelData< NodeFArrayBox > &    a_rhs,
NodeLevelOp   a_levelopPtr
[virtual]
 

{\bf data modification functions}

Perform BiCGStab smoothing of L(a_phi) = a_rhs; \ L is the operator defined in a_levelopPtr, and the preconditioner is a_levelopPtr->smooth().

{\bf Arguments:}\ a_phi (modified): the data at this level.\ a_rhs (not modified): right-hand side.\ a_levelopPtr (not modified): pointer to the operator.\

Implements NodeBaseBottomSmoother.

virtual NodeBaseBottomSmoother* NodeBiCGStabSmoother::new_bottomSmoother   const [virtual]
 

this gets around the "no virtual constructor" rule

Implements NodeBaseBottomSmoother.

void NodeBiCGStabSmoother::setMaxIter int    a_max_iter
 

{\bf parameter-setting functions}

set max number of BiCGStab iterations

void NodeBiCGStabSmoother::setSolverTol Real    a_solverTol
 

set solver tolerance (amount residual must be decreased, etc)

void NodeBiCGStabSmoother::setVerbose bool    a_verbose
 

set whether i/o is done when solving (default is false)


Member Data Documentation

Real NodeBiCGStabSmoother::m_converge_small [protected]
 

int NodeBiCGStabSmoother::m_maxIter [protected]
 

Real NodeBiCGStabSmoother::m_small [protected]
 

Real NodeBiCGStabSmoother::m_solverTol [protected]
 

bool NodeBiCGStabSmoother::m_verbose [protected]
 


The documentation for this class was generated from the following file:
Generated on Tue Apr 15 18:34:54 2003 for AMRNodeElliptic by doxygen1.2.16