How many independent elements/variables do you need to represent all the position of a point in space? 3.
How many independent elements do you need to represent all the functions? You need to find the dimension of a basis of functions, whose linear combinations can represents all the functions. How many are they? Infinite.
As an example:
- polynomial basis: $1, x, x^2, \dots$;
- harmonic functions for $2\pi$-periodic functions: $1, \cos(x), \cos(2x), \dots, \sin(x), \sin(2x), \dots$;
- $\dots$
In general, continuous functions in space can be represented as a linear combinations of base functions with coefficients that are function of time,
$f(x,t) = \sum_{i=1}^{\infty} F_i(t) \phi_i(x)$.
Usually, a good choice of a basis $\phi_i(x)$ allows you to have a good approximation of f(x,t) with a small number of $\phi_i(x)$, namely
$f(x,t) \simeq \sum_{i\in A} F_i(t) \phi_i(x)$,
being $A$ the subset of the infinite basis, whose linear combinations are a "good enough" (for you) approximation of the function $f(x,t)$.
Numerical simulations.
This is exactly the same process you perform in finite element methods, spectral element methods or other numerical methods.
As an example, base functions are compact function in finite element methods; these functions are usually determined by the degree of the local approximation and by the mesh used for the numerical problem.
When you refine the mesh, you're implicitly increasing the number of base function $\phi_i(x)$ used for the numerical approximation of the fields. When you change the degree of the approximation, you're changing the family of the base function $\phi_i(x)$.
Reduction.
In numerical simulations, in order to select a more efficient set of base functions, sometimes you don't rely on the full basis induced by the grid, but you evaluate a subset of all the possible linear combinations of the base functions.
For some examples about reduction:
- modal analysis
- balanced truncation
- proper orthogonal decomposition
- ...