A Newton class defines a solver using Newton–Raphson iteration. More...

#include <Newton.h>

Inheritance diagram for Newton:

Collaboration diagram for Newton:

Public Member Functions
	Newton (unsigned=0, bool=false)

int	analyze () override

void	print () override

Public Member Functions inherited from Solver
	Solver (unsigned=0)

	Solver (const Solver &)=default

	Solver (Solver &&)=default

Solver &	operator= (const Solver &)=delete

Solver &	operator= (Solver &&)=delete

	~Solver () override=default

virtual int	initialize ()

virtual int	analyze ()=0

virtual void	set_step_size (double)

void	set_step_amplifier (double)

double	get_step_amplifier () const

void	set_converger (const shared_ptr< Converger > &)

const shared_ptr< Converger > &	get_converger () const

void	set_integrator (const shared_ptr< Integrator > &)

const shared_ptr< Integrator > &	get_integrator () const

bool	constant_matrix () const

Public Member Functions inherited from Tag
	Tag (unsigned=0)

	Tag (const Tag &)=default

	Tag (Tag &&)=default

Tag &	operator= (const Tag &)=delete

Tag &	operator= (Tag &&)=delete

virtual	~Tag ()=default

void	set_tag (unsigned) const

unsigned	get_tag () const

void	enable ()

void	disable ()

void	guard ()

void	unguard ()

bool	is_active () const

bool	is_guarded () const

virtual void	print ()

Detailed Description

A Newton class defines a solver using Newton–Raphson iteration.

Constructor & Destructor Documentation

explicit

int Newton::analyze ( )

overridevirtual

Implements Solver.

Here is the call graph for this function:

void Newton::print ( )

overridevirtual

Reimplemented from Tag.

Reimplemented in AICN.

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