Registry
|
LU-Decomposition exact solver. More...
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< ILinearIterator > | clone () |
returns a clone of the object which can be modified independently More... | |
std::string | config_string () const |
ConstSmartPtr< IConvergenceCheck > | convergence_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 |
LU | ( | ) |
Solve A*u = f, such that u = A^{-1} f by iterating u := u + B(f - A*u), f remains constant.
[in] | u | |
[in] | f |
References ILinearOperatorInverse< X, Y >::apply().
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.
[in] | u | |
[in] | f |
References ILinearOperatorInverse< X, Y >::apply_return_defect().
[in] | unnamed | |
[in] | unnamed |
References ILinearIterator< X, Y >::apply_update_defect().
|
inlineinherited |
returns a clone of the object which can be modified independently
References ILinearIterator< X, Y >::clone().
|
inlineinherited |
References ILinearOperatorInverse< X, Y >::config_string().
|
inlineinherited |
|
inlineinherited |
References ILinearOperatorInverse< X, Y >::defect().
|
inlineinherited |
[in] | unnamed |
References ILinearOperatorInverse< X, Y >::init().
|
inlineinherited |
References ILinearIterator< X, Y >::name().
|
inlineinherited |
References ILinearOperatorInverse< X, Y >::reduction().
|
inlineinherited |
[in] | unnamed |
References ILinearOperatorInverse< X, Y >::set_convergence_check().
|
inlineinherited |
|
inline |
if true, sparse LU prints some fill-in info
[in] | bInfo |
References LU< class >::set_info().
|
inline |
[in] | N |
References LU< class >::set_minimum_for_sparse().
|
inline |
switches the progress indicator on/off
[in] | onoff |
References LU< class >::set_show_progress().
|
inline |
if bSort=true, use a cuthill-mckey sorting to reduce fill-in in sparse LU. default true
[in] | bSort |
References LU< class >::set_sort_sparse().
|
inlineinherited |
References ILinearOperatorInverse< X, Y >::step().