Unisolvent functions

In mathematics, a set of ''n'' functions ''f''₁, ''f''₂, ..., ''f''_''n'' is unisolvent (meaning "uniquely solvable") on a domain Ω if the vectors

: $\beginf_1(x_1) \\ f_1(x_2) \\ \vdots \\ f_1(x_n)\end, \beginf_2(x_1) \\ f_2(x_2) \\ \vdots \\ f_2(x_n)\end, \dots, \beginf_n(x_1) \\ f_n(x_2) \\ \vdots \\ f_n(x_n)\end$

are linearly independent for any choice of ''n'' distinct points ''x''₁, ''x''₂ ... ''x''_''n'' in Ω. Equivalently, the collection is unisolvent if the matrix ''F'' with entries ''f''_''i''(''x''_''j'') has nonzero determinant: det(''F'') ≠ 0 for any choice of distinct ''x''_''j'''s in Ω. Unisolvency is a property of vector spaces, not just particular sets of functions. That is, a vector space of functions of dimension ''n'' is unisolvent if given any basis (equivalently, a linearly independent set of ''n'' functions), the basis is unisolvent (as a set of functions). This is because any two bases are related by an invertible matrix (the change of basis matrix), so one basis is unisolvent if and only if any other basis is unisolvent.

Unisolvent systems of functions are widely used in interpolation since they guarantee a unique solution to the interpolation problem. The set of polynomials of degree at most (which form a vector space of dimension ) are unisolvent by the unisolvence theorem.

Examples

* 1, ''x'', ''x''² is unisolvent on any interval by the unisolvence theorem
* 1, ''x''² is unisolvent on , 1 but not unisolvent on ��1, 1* 1, cos(''x''), cos(2''x''), ..., cos(''nx''), sin(''x''), sin(2''x''), ..., sin(''nx'') is unisolvent on ��''Ï€'', ''Ï€''* Unisolvent functions are used in linear inverse problems.

Unisolvence in the finite element method

When using "simple" functions to approximate an unknown function, such as in the finite element method, it is useful to consider a set of functionals $\_^n$ that act on a finite dimensional vector space $V_h$ of functions, usually polynomials. Often, the functionals are given by evaluation at points in Euclidean space or some subset of it.

For example, let $V_h = \big\$ be the space of univariate polynomials of degree $m$ or less, and let $f_k(p) := f\Big(\frac\Big)$ for $0\leq i \leq n$ be defined by evaluation at $n+1$ equidistant points on the unit interval ,1/math>. In this context, the unisolvence of $V_h$ with respect to $\_^n$ means that $\_^n$ is a basis for $V_h^*$, the dual space of $V_h$. Equivalently, and perhaps more intuitively, unisolvence here means that given any set of values $\_^n$, there exists a unique polynomial $q(x) \in V_h$ such that $f_k(q) = q( \tfrac ) = c_k$. Results of this type are widely applied in polynomial interpolation; given any function on \phi \in C( ,1, by letting $c_k = \phi( \tfrac)$, we can find a polynomial $q\in V_h$ that interpolates $\phi$ at each of the $n+1$ points: . $\phi(\tfrac) = q(\tfrac), \ \forall k \in \$

Dimensions

Systems of unisolvent functions are much more common in 1 dimension than in higher dimensions. In dimension ''d'' = 2 and higher (Ω âŠ‚ R^''d''), the functions ''f''₁, ''f''₂, ..., ''f''_''n'' cannot be unisolvent on Ω if there exists a single open set on which they are all continuous. To see this, consider moving points ''x''₁ and ''x''₂ along continuous paths in the open set until they have switched positions, such that ''x''₁ and ''x''₂ never intersect each other or any of the other ''x''_''i''. The determinant of the resulting system (with ''x''₁ and ''x''₂ swapped) is the negative of the determinant of the initial system. Since the functions ''f''_''i'' are continuous, the intermediate value theorem implies that some intermediate configuration has determinant zero, hence the functions cannot be unisolvent.

See also

* Inverse problem

References

{{reflist
* Philip J. Davis: ''Interpolation and Approximation'' pp. 31–32

Interpolation
Inverse problems
Numerical analysis
Approximation theory