|
TBCI Numerical high perf. C++ Library
2.8.0
|
Iterative solver for linear systems TBCI::GMRES. More...
#include "tbci/basics.h"
Go to the source code of this file.
Functions | |
| NAMESPACE_TBCI | INST2 (template< Matrix< T >, Vector< T > > class NN friend void Update(Vector< T > &, int, Matrix< T > &, Vector< T > &, Vector< T > *);) INST2(template< BdMatrix< T > |
| NAMESPACE_TBCI Vector< T > class NN friend void | Update (Vector< T > &, int, BdMatrix< T > &, Vector< T > &, Vector< T > *) |
| template<typename SysMatrix , typename SysVector > | |
| void | Update (SysVector &x, int k, SysMatrix &h, SysVector &s, SysVector *V) |
| INST (template< typename T > class NN friend void GeneratePlaneRotation(const T &, const double &, double &, T &);) template< typename T > inline void GeneratePlaneRotation(const T &dx | |
| We follow Frayssé, Giraud, Gratton for the complex implementation of the Givens plane rotations. More... | |
Variables | |
| const double & | dy |
| const double double & | cs |
Iterative solver for linear systems TBCI::GMRES.
Definition in file gmres.h.
| INST | ( | template< typename T > class NN friend void GeneratePlaneRotation(const T &, const double &, double &, T &); | ) | const |
We follow Frayssé, Giraud, Gratton for the complex implementation of the Givens plane rotations.
http://www.cerfacs.fr/algor/ There, cs is chosen to always be real, whereas sn is complex and the roation is given by (* denoting complex conjugate) x' = cs* x + sn* y y' = -sn x + cs y = 0
| NAMESPACE_TBCI INST2 | ( | template< Matrix< T >, Vector< T > > class NN friend void Update(Vector< T > &, int, Matrix< T > &, Vector< T > &, Vector< T > *); | ) |
| NAMESPACE_TBCI Vector<T> class NN friend void Update | ( | Vector< T > & | , |
| int | , | ||
| BdMatrix< T > & | , | ||
| Vector< T > & | , | ||
| Vector< T > * | |||
| ) |
| void Update | ( | SysVector & | x, |
| int | k, | ||
| SysMatrix & | h, | ||
| SysVector & | s, | ||
| SysVector * | V | ||
| ) |
1.8.5