, including all inherited members.
| add(const LaurentPolynomial< R > &p) | MathTL::LaurentPolynomial< R > | [inline] |
| add(const R s, const LaurentPolynomial< R > &p) | MathTL::LaurentPolynomial< R > | [inline] |
| InfiniteVector< R, int >::add(const InfiniteVector< R, int > &v) | MathTL::InfiniteVector< R, int > | [protected] |
| InfiniteVector< R, int >::add(const Rs, const InfiniteVector< R, int > &v) | MathTL::InfiniteVector< R, int > | [protected] |
| add_coefficient(const int &index, const Rincrement) | MathTL::InfiniteVector< R, int > | [protected] |
| advance_time(const double delta_t) | MathTL::FunctionTime | [inline, virtual] |
| begin() const | MathTL::LaurentPolynomial< R > | [inline] |
| clear() | MathTL::InfiniteVector< R, int > | [protected] |
| clip(const std::set< int > &supp) | MathTL::InfiniteVector< R, int > | [protected] |
| COARSE(const double eps, InfiniteVector< R, int > &v) const | MathTL::InfiniteVector< R, int > | [protected] |
| compress(const double eta=1e-15) | MathTL::InfiniteVector< R, int > | [protected] |
| const_iterator typedef | MathTL::LaurentPolynomial< R > | |
| const_reverse_iterator typedef | MathTL::LaurentPolynomial< R > | |
| degree() const | MathTL::LaurentPolynomial< R > | [inline] |
| dimension | MathTL::Function< 1, R > | [static] |
| divide(const LaurentPolynomial< R > &q, LaurentPolynomial< R > &p) const | MathTL::LaurentPolynomial< R > | |
| divide(const LaurentPolynomial< R > &q, LaurentPolynomial< R > &p, LaurentPolynomial< R > &r) const | MathTL::LaurentPolynomial< R > | |
| empty() const | MathTL::InfiniteVector< R, int > | [inline, protected] |
| end() const | MathTL::LaurentPolynomial< R > | [inline] |
| Function(const unsigned int n_components=1, const double initial_time=0.0) | MathTL::Function< 1, R > | |
| FunctionTime(const double initial_time=0.0) | MathTL::FunctionTime | [inline] |
| get_coefficient(const int k) const | MathTL::LaurentPolynomial< R > | [inline] |
| InfiniteVector< R, int >::get_coefficient(const int &index) const | MathTL::InfiniteVector< R, int > | [protected] |
| get_time() const | MathTL::FunctionTime | [inline] |
| InfiniteVector() | MathTL::InfiniteVector< R, int > | [protected] |
| InfiniteVector(const InfiniteVector< R, int > &v) | MathTL::InfiniteVector< R, int > | [protected] |
| LaurentPolynomial() | MathTL::LaurentPolynomial< R > | |
| LaurentPolynomial(const LaurentPolynomial< R > &p) | MathTL::LaurentPolynomial< R > | |
| LaurentPolynomial(const R c) | MathTL::LaurentPolynomial< R > | [explicit] |
| LaurentPolynomial(const Polynomial< R > &p) | MathTL::LaurentPolynomial< R > | [explicit] |
| memory_consumption() const | MathTL::Function< 1, R > | |
| multiply(const LaurentPolynomial< R > &p) | MathTL::LaurentPolynomial< R > | |
| n_components | MathTL::Function< 1, R > | |
| operator!=(const InfiniteVector< R, int > &v) const | MathTL::InfiniteVector< R, int > | [protected] |
| operator*(const R c) const | MathTL::LaurentPolynomial< R > | |
| InfiniteVector< R, int >::operator*(const InfiniteVector< R, int > &v) const | MathTL::InfiniteVector< R, int > | [protected] |
| operator*=(const R c) | MathTL::LaurentPolynomial< R > | [inline] |
| operator*=(const LaurentPolynomial< R > &p) | MathTL::LaurentPolynomial< R > | [inline] |
| operator+(const LaurentPolynomial< R > &p) const | MathTL::LaurentPolynomial< R > | [inline] |
| operator+=(const LaurentPolynomial< R > &p) | MathTL::LaurentPolynomial< R > | [inline] |
| InfiniteVector< R, int >::operator+=(const InfiniteVector< R, int > &v) | MathTL::InfiniteVector< R, int > | [protected] |
| operator-() const | MathTL::LaurentPolynomial< R > | [inline] |
| operator-(const LaurentPolynomial< R > &p) const | MathTL::LaurentPolynomial< R > | [inline] |
| operator-=(const LaurentPolynomial< R > &p) | MathTL::LaurentPolynomial< R > | [inline] |
| InfiniteVector< R, int >::operator-=(const InfiniteVector< R, int > &v) | MathTL::InfiniteVector< R, int > | [protected] |
| operator/=(const Rc) | MathTL::InfiniteVector< R, int > | [protected] |
| operator=(const LaurentPolynomial< R > &p) | MathTL::LaurentPolynomial< R > | |
| operator=(const R c) | MathTL::LaurentPolynomial< R > | |
| InfiniteVector< R, int >::operator=(const InfiniteVector< R, int > &v) | MathTL::InfiniteVector< R, int > | [protected] |
| operator==(const InfiniteVector< R, int > &v) const | MathTL::InfiniteVector< R, int > | [protected] |
| operator[](const int &index) const | MathTL::InfiniteVector< R, int > | [protected] |
| operator[](const int &index) | MathTL::InfiniteVector< R, int > | [protected] |
| power(const unsigned int k) const | MathTL::LaurentPolynomial< R > | |
| rbegin() const | MathTL::LaurentPolynomial< R > | [inline] |
| rend() const | MathTL::LaurentPolynomial< R > | [inline] |
| sadd(const R s, const LaurentPolynomial< R > &p) | MathTL::LaurentPolynomial< R > | [inline] |
| InfiniteVector< R, int >::sadd(const Rs, const InfiniteVector< R, int > &v) | MathTL::InfiniteVector< R, int > | [protected] |
| scale(const Rs) | MathTL::InfiniteVector< R, int > | [protected] |
| scale(const InfiniteDiagonalMatrix< R, int > *D, const int k=1) | MathTL::InfiniteVector< R, int > | [protected] |
| set_coefficient(const int k, const R coeff) | MathTL::LaurentPolynomial< R > | [inline] |
| InfiniteVector< R, int >::set_coefficient(const int &index, const Rvalue) | MathTL::InfiniteVector< R, int > | [protected] |
| set_time(const double new_time) | MathTL::FunctionTime | [inline, virtual] |
| size() const | MathTL::InfiniteVector< R, int > | [protected] |
| size_type typedef | MathTL::Function< 1, R > | |
| subtract(const LaurentPolynomial< R > &p) | MathTL::LaurentPolynomial< R > | [inline] |
| InfiniteVector< R, int >::subtract(const InfiniteVector< R, int > &v) | MathTL::InfiniteVector< R, int > | [protected] |
| support(std::set< int > &supp) const | MathTL::InfiniteVector< R, int > | [protected] |
| swap(InfiniteVector< R, int > &v) | MathTL::InfiniteVector< R, int > | [protected] |
| value(const R x) const | MathTL::LaurentPolynomial< R > | |
| value(const Point< 1 > &p, const unsigned int component=0) const | MathTL::LaurentPolynomial< R > | [inline] |
| Function< 1, R >::value(const Point< DIM, R > &p, const unsigned int component=0) const =0 | MathTL::Function< 1, R > | [pure virtual] |
| vector_value(const Point< 1 > &p, Vector< R > &values) const | MathTL::LaurentPolynomial< R > | [inline] |
| Function< 1, R >::vector_value(const Point< DIM, R > &p, Vector< R > &values) const =0 | MathTL::Function< 1, R > | [pure virtual] |
| weak_norm(const double tau) const | MathTL::InfiniteVector< R, int > | [protected] |
| wrmsqr_norm(const double atol, const double rtol, const InfiniteVector< R, int > &v, const InfiniteVector< R, int > &w) const | MathTL::InfiniteVector< R, int > | [protected] |
| ~Function()=0 | MathTL::Function< 1, R > | [pure virtual] |
| ~FunctionTime() | MathTL::FunctionTime | [inline, virtual] |
| ~LaurentPolynomial() | MathTL::LaurentPolynomial< R > | [virtual] |