#include <grid.h>
Inheritance diagram for Grid_Chebyshev_GL:
Public Member Functions | |
Grid_Chebyshev_GL (int nb_nodes) | |
Standard constructor. | |
Grid_Chebyshev_GL (const Grid_Chebyshev_GL &) | |
Copy constructor. | |
virtual | ~Grid_Chebyshev_GL () |
Destructor. | |
void | operator= (const Grid_Chebyshev_GL &) |
Assignment to another Grid_Chebyshev_GL. | |
int | n () const |
returns N, i.e. the number of nodes - 1 | |
double | operator() (int i) const |
returns value of node no. i | |
void | plot (int color=1, int nfig=0, double ymin=-1., double ymax=1., const char *title=0x0, const char *label_y=0x0, const char *device=0x0) const |
Graphical display of the node points. | |
double | lagrange (int i, double x) const |
Lagrange polynomials (characteristic polynomials). | |
double | nodal_polynomial (double x) const |
Nodal polynomial. | |
double | interpole (double(*f)(double), double x) const |
Interpolation of a given function at the nodes. | |
double | lebesgue_constant () const |
Computes (an approximate value of) the Lebesgue constant. | |
Protected Attributes | |
const int | nn |
N = number of nodes - 1 | |
double * | xx |
Values of the nodes (pointer to an array of size nn+1 ). |
()
Definition at line 321 of file grid.h.
|
Standard constructor.
Definition at line 50 of file grid_chebyshev_gl.C. |
|
Copy constructor.
Definition at line 63 of file grid_chebyshev_gl.C. |
|
Destructor.
Definition at line 70 of file grid_chebyshev_gl.C. |
|
Interpolation of a given function at the nodes.
Definition at line 215 of file grid.C. References Grid::lagrange(), Grid::nn, and Grid::xx. |
|
Lagrange polynomials (characteristic polynomials).
The Lagrange polynomial no. i is the unique polynomial
Definition at line 182 of file grid.C. References Grid::xx. |
|
Computes (an approximate value of) the Lebesgue constant.
Definition at line 231 of file grid.C. References Grid::lagrange(), and Grid::nn. |
|
returns N, i.e. the number of nodes - 1
Definition at line 135 of file grid.C. References Grid::nn. |
|
Nodal polynomial.
The nodal polynomoal is the unique polynomial of degree N + 1 and leading coefficient 1, the roots of which are the N +1 nodes
|
|
returns value of node no.
|
|
Assignment to another Grid_Chebyshev_GL.
Definition at line 77 of file grid_chebyshev_gl.C. References Grid::operator=(). |
|
Graphical display of the node points.
Definition at line 165 of file grid.C. References plot_point(), and Grid::xx. |
|
N = number of nodes - 1
|
|
Values of the nodes (pointer to an array of size
|