Registry
LU Class Reference

LU-Decomposition exact solver. More...

+ Inheritance diagram for LU:

Public Member Functions

bool apply (Vector *u, const Vector *f)
 Solve A*u = f, such that u = A^{-1} f by iterating u := u + B(f - A*u), f remains constant. More...
 
bool apply_return_defect (Vector *u, Vector *f)
 Solve A*u = f, such that u = A^{-1} f by iterating u := u + B(f - A*u), f := f - A*u becomes new defect. More...
 
bool apply_update_defect (Vector *unnamed, Vector *unnamed)
 
SmartPtr< ILinearIteratorclone ()
 returns a clone of the object which can be modified independently More...
 
std::string config_string () const
 
ConstSmartPtr< IConvergenceCheckconvergence_check () const
 
double defect () const
 
bool init (SmartPtr< ILinearOperator > unnamed)
 
 LU ()
 
const char * name () const
 
double reduction () const
 
void set_convergence_check (SmartPtr< IConvergenceCheck > unnamed)
 
void set_damp (double damp)
 set the damping to a number More...
 
void set_info (bool bInfo)
 if true, sparse LU prints some fill-in info More...
 
void set_minimum_for_sparse (size_t N)
 
void set_show_progress (bool onoff)
 switches the progress indicator on/off More...
 
void set_sort_sparse (bool bSort)
 if bSort=true, use a cuthill-mckey sorting to reduce fill-in in sparse LU. default true More...
 
int step () const
 

Detailed Description

LU-Decomposition exact solver.

Note
default specialization is LUCPU1
See also
ug::LU

Constructor & Destructor Documentation

◆ LU()

LU ( )

Member Function Documentation

◆ apply()

bool apply ( Vector u,
const Vector f 
)
inlineinherited

Solve A*u = f, such that u = A^{-1} f by iterating u := u + B(f - A*u), f remains constant.

Parameters
[in]u
[in]f
Returns
Success

References ILinearOperatorInverse< X, Y >::apply().

◆ apply_return_defect()

bool apply_return_defect ( Vector u,
Vector f 
)
inlineinherited

Solve A*u = f, such that u = A^{-1} f by iterating u := u + B(f - A*u), f := f - A*u becomes new defect.

Parameters
[in]u
[in]f
Returns
Success

References ILinearOperatorInverse< X, Y >::apply_return_defect().

◆ apply_update_defect()

bool apply_update_defect ( Vector unnamed,
Vector unnamed 
)
inlineinherited
Parameters
[in]unnamed
[in]unnamed

References ILinearIterator< X, Y >::apply_update_defect().

◆ clone()

SmartPtr<ILinearIterator> clone ( )
inlineinherited

returns a clone of the object which can be modified independently

Returns
SmartPointer to a copy of this object

References ILinearIterator< X, Y >::clone().

◆ config_string()

std::string config_string ( ) const
inlineinherited

◆ convergence_check()

ConstSmartPtr<IConvergenceCheck> convergence_check ( ) const
inlineinherited

◆ defect()

double defect ( ) const
inlineinherited
Returns
the current defect

References ILinearOperatorInverse< X, Y >::defect().

◆ init()

bool init ( SmartPtr< ILinearOperator unnamed)
inlineinherited
Parameters
[in]unnamed

References ILinearOperatorInverse< X, Y >::init().

◆ name()

const char* name ( ) const
inlineinherited

◆ reduction()

double reduction ( ) const
inlineinherited
Returns
the current relative reduction

References ILinearOperatorInverse< X, Y >::reduction().

◆ set_convergence_check()

void set_convergence_check ( SmartPtr< IConvergenceCheck unnamed)
inlineinherited
Parameters
[in]unnamed

References ILinearOperatorInverse< X, Y >::set_convergence_check().

◆ set_damp()

void set_damp ( double  damp)
inlineinherited

set the damping to a number

Parameters
[in]damp

References ILinearIterator< X, Y >::set_damp().

◆ set_info()

void set_info ( bool  bInfo)
inline

if true, sparse LU prints some fill-in info

Parameters
[in]bInfo

References LU< class >::set_info().

◆ set_minimum_for_sparse()

void set_minimum_for_sparse ( size_t  N)
inline
Parameters
[in]N

References LU< class >::set_minimum_for_sparse().

◆ set_show_progress()

void set_show_progress ( bool  onoff)
inline

switches the progress indicator on/off

Parameters
[in]onoff

References LU< class >::set_show_progress().

◆ set_sort_sparse()

void set_sort_sparse ( bool  bSort)
inline

if bSort=true, use a cuthill-mckey sorting to reduce fill-in in sparse LU. default true

Parameters
[in]bSort

References LU< class >::set_sort_sparse().

◆ step()

int step ( ) const
inlineinherited
Returns
the current number of steps

References ILinearOperatorInverse< X, Y >::step().