and
-
1.
The importance of the approximate calculation of a function, defined directly, through its properties, or as a solution of a certain differential equation, is particularly great in technical applications.
The theory of polynomial interpolation plays an important role in this direction. The extensive use of interpolation polynomials is justified by their simple analytical structure, the possibility of drawing up systematic and simple calculation programs, as well as the sufficiently good precision to which they lead.
2. In the case of polynomial interpolation of functions of several variables, however, quite great difficulties are encountered. Even if the interpolation nodes are distinct, it could happen that a certain interpolation polynomial does not exist or is not unique. However, it is easily shown that if the nodes are not located on a hypersurface of an order equal to the degree of the interpolation polynomial, then its existence and uniqueness are assured.
From a practical point of view it is useful to give certain concrete schemes of nodes relative to which the interpolation polynomial is perfectly determined and in addition to obtain for it an effective expression convenient for applications, for calculations.
3. We will seek in what follows to give some more general distributions of nodes than those that have been used so far, distributions that allow a wide variety of node networks to be used.
4. Let us first deal with the case of two variables.
Whethera function defined and bounded in a certain domainfrom the plane. Suppose that the values ​​of the function are knownon the following points of this area
|
|
|
Lagrange's interpolation formula relative to the variableServiceon the string of values
|
|
|
|
|
|
|
|
|
|
|
|
is the difference divided by the orderof the functionfor his value.
But the functioncan also be developed using the same interpolation formula using the values
|
|
|
|
|
|
|
|
|
Replacing this expression within (2), we find the following interpolation formula
|
|
|
|
|
|
is the minimum degree interpolation polynomial that coincides with the functionon the nodes (1), and
|
|
|
|
|
|
(9) |
|
|
|
(10) |
is the remainder of this interpolation formula.
5. We emphasize that the interpolation formula (7) is much more general than the classical Lagrange interpolation formula for two variables, since the ordinates (4) depend on the abscissaboth as a value and as a number (what we specified through indices).
The well-known Lagrange interpolation formula is obtained if we make the following customizations
|
|
|
(11) |
-
6.
Let's give an example. Assuming that
let's write the interpolation polynomial on the nodes
|
|
|
which are the nodes of an hexagonal network (see figure).
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
-
7.
In the case of three variables, using the nodes
|
|
|
(12) |
the interpolation formula is obtained
|
|
|
(13) |
|
|
|
(14) |
is the minimum degree interpolation polynomial that coincides with the function.on the nodes (12), and the rest has the expression
|
|
|
(15) |
|
|
|
|
|
|
Above, along with the notations already explained, I also used the following:
|
|
|
-
8.
In the general case, considering the function
|
|
|
limited and confined to a domainof Euclidean space- dimensionaland the nodes
|
|
|
|
|
|
the interpolation formula is obtained
|
|
|
|
|
|
(1) |
|
|
|
is the minimum degree interpolation polynomial that coincides with the functionon the nodes (16)
The rest of the interpolation formula (17) has the expression
|
|
|
|
|
|
|
|
|
-
9.
In the particular case *)
|
|
|
the interpolation polynomial (18) has degree ().
The corresponding interpolation nodes
|
|
|
|
|
|
|
|
we will say that it determines a pseudo-network of the order,
His coefficientfrom the interpolation polynomial, which is obtained in this case, is
|
|
|
(21) |
We will call expression (21) the partial divided difference of the orderof the functionon points (20).
We mention on this occasion the following formula which allows us to (1) see the structure of this divided partial difference
|
|
|
|
|
|
(22) |
|
|
|
-
10.
If we further particularize the previous pseudo-network so that it reduces to the so-called Merchaus network *) of order (,), determined by the nodes
|
|
|
(23) |
The previous results are greatly simplified.
The interpolation polynomial (18) reduces to the well-known **) Lagrange interpolation polynomial forvariables.
In this case the partial divided difference (21) takes the form
|
|
|
|
|
|
(24) |
|
|
|
Formula (22) simplifies greatly:
|
|
|
This tells us that in the case of a Marchaud network a partial division difference of the order () is a superposition ofdifferences divided by a variable, the order of superposition being arbitrary.
11. Relative to the partial divided difference (24) we will give some average forms useful for establishing the structure of the remainder of many approximation formulas.
A first average formula is
|
|
|
whereis contained in the smallest interval containing the numbers.
This formula, for the case, can be seen in [4].
12. Let us considernatural numbersso that.
|
|
|
Taking into account formula (24), it is easy to verify that we have
|
|
|
|
|
|
the previous formula will lead us to the average formula
|
|
|
|
|
|
|
|
|
|
|
For example in the case ofThis average formula is written
|
|
|
-
13.
Taking into account formula (25), it can be immediately extended tovariables, an important average theorem given, in the one-dimensional case, by Prof. T. Popoviciu [5], [6].
Considering the following system ofpuncture
|
|
|
(27) |
|
|
|
any partial difference divided by the ordertandemis contained in the smallest interval containing the numbers, onpoints, from those in (27), is an arithmetic mean.
We note that the numbersare the same in all (generalized) derivatives of the following kind:
|
|
|
|
|
|
are independent of the functionand
|
|
|
|
|
|
-
14.
In the particular case of nodes (23) the rest of formula (17) can be expressed using the divided partial differences *).
Based on formula (25) and the average theorems we have, it can be shown **) that this remainder can be expressed, of course assuming that the functionis partially differentiable a sufficient number of times, the form
|
|
|
If we apply to
each divided partial difference, which occurs in the expression of the remainder, only the average formula (26), as some authors did in the case of, then this result, which seems to be important both theoretically and practically, cannot be obtained.
yl
-
15.
In this part of the paper we will deal with Gaussian-type numerical interpolation formulas, using the interpolation formulas that are refined on the particular distribution of nodes from (23).
First we will make an observation on Gauss' quadrature formula.
16. Let us consider the Lagrange-Hernite interpolation polynomial of degree:
|
|
|
|
|
|
|
|
(29) |
|
|
|
|
|
|
A. Markov [7] observed that if the nodes are chosenfind the roots of Legendre's polynomial
|
|
|
(30) |
tunci in the quadrature formula
|
|
|
(31) |
I divide the coefficients.and we arrive at Gauss' quadrature formula
|
|
|
(32) |
labile for any polynomialof degree at most.
labile for any polynomialof degree at most.
This observation allowed AA Markov to establish But the expression of the remainder of this quadrature formula in the case whenis some function differentiable fromtimes.
17. We will show that this situation also occurs in somewhat more general cases.
Let's consider the distinct numbers.Formsof Lagrange interpolation relative to these nodes and a function thatit is written
|
|
|
|
|
|
Using the interpolation formula (33) to calculate the integral *)
|
|
|
the evasion formula is reached
|
|
|
It is worth noting that if one takes, that is, if the nodethe roots of the Legendre polynomial are chosenand, then we also have
|
|
|
and, it is obtained, whatever, Gauss' numerical integration formula.
Indeed, if in formula (37) we replacewith
|
|
|
is obtained
|
|
|
|
|
|
(38) |
(becauseis a polynomial of degreeand the divided difference (38) has the order.
because, it follows that
|
|
|
(and the quadrature formula (37) reduces to
|
|
|
(39) |
|
|
|
(40) |
To determine the coefficientslet's do in formula (39)
|
|
|
(41) |
|
|
|
(42) |
-
18.
Given that whatever the polynomial isof the degree, we have
|
|
|
(43) |
|
|
|
it can be put in the form
|
|
|
|
|
|
So the coefficients of the quadrature formula (39) can also be expressed by the formula
|
|
|
which shows us that the evadration formula (39) has all positive coefficients. This result is due to Stieltjes [8].
Formula (39) is Gauss's numerical integration formula.
For the coefficients of this formula, the following simple expressions can also be given, as shown by Christoffel [9]:
|
|
|
Apart from this, if we take into account that between the roots of the Legendre polynomial there is the relation, it immediately follows *) that we have such
|
|
|
Gauss's quadrature formula has, as is well known, a reputation for accuracy..
If it is taken, the remainder (40) becomes **)
|
|
|
Hereis contained in the smallest interval containing the value: and.
*) See for example [10].
**) The coefficient ofFROMmust be equal to 1, as seen from (35), for the reason in (30) we chose
where in [11].
19. Above we assumed that the numbersare distinct and different from its roots).
Let us now assume that the numbers, are not generally distinct, namely:has the order of multiplicity, whereand.
Let us write the expression of the interpolation polynomial of LagrangeHermite **), on the nodes represented by the roots of the polynomial
|
|
|
(48) |
|
|
|
|
|
|
(49) |
In the interpolation formula
|
|
|
() |
the rest has the expression
|
|
|
(50) |
Using formula (49) to calculate integral (36), we arrive at an escapement formula of the form
|
|
|
(51) |
|
|
|
Ifare the roots of the Legendre polynomial, then, taking into account (49), it is observed that
|
|
|
(52) |
|
|
|
*) Ifone comes across the case of AA Markov [7].
**) The explicit expression of the Lagrange-Hermite polynomial can be seen for example
whatever the roots of the polynomial of degree
|
|
|
(53) |
Taking into account the introduced notations, the polynomial (48) is written as
|
|
|
Given that whatever the polynomial is, of the degreen it can be put in the form (43), we find, as in point 18, expressions (44) for the coefficientsof the quadrature formula (51).
In the end, we find that even in the case we dealt with in that paragraph, we arrive at Gauss' quadrature formula *)
|
|
|
() |
TAKING, the rest of this formula will be
|
|
|
|
|
|
|
|
|
(55) |
-
20.
The previous considerations can also be made on multiple integrals. Let us deal, for the sake of ease of exposition, with the case of double integrals.
We propose to establish a cubature formula with a minimum number of terms for the double integral
|
|
|
(56) |
|
|
|
Let's consider the interpolation formula
|
|
|
(5i) |
|
|
|
|
|
|
(60) |
|
|
|
Using the interpolation formula (57) to calculate the integral (56), a cubature formula of the form is obtained
|
|
|
|
|
|
(61) |
|
|
|
(62) |
If the numbers are chosen
|
|
|
so that they are respectively the roots of Legendre's polynomials,and we note
|
|
|
(63) |
|
|
|
(64) |
|
|
|
The remaining coefficients have the expressions
|
|
|
Since whatever the polynomials (63), with, we have
|
|
|
whereifand, andifand, the expressions for the coefficients (64) are found
|
|
|
(65) |
Taking into account (64), the cubature formula (61) reduces to
|
|
|
(66) |
|
|
|
the following expressions are also found for the coefficients of this cubature formula
|
|
|
((67) |
|
|
|
|
|
|
Based on Christoffel's result, reported in point 18, we find e
|
|
|
(168) |
We also have the relationships
|
|
|
-
21.
By a procedure similar to that used in the case of one variable, it is shown that the previous results are preserved even when the roots of the polynomials (63) are not distinct.
-
22.
Let us now look for the expression of the remainder of the Gauss-type cubature formula (66), which has the degree of accuracy.
making, and, formulas (59) and (62) lead us to the following expression of the remainder
|
|
|
(69) |
|
|
|
|
|
|
|
|
|
|
|
|
The case treated by AA Markov for one variable corresponds to the case for two variables
|
|
|
() |
when the previous remainder will become
|
|
|
|
|
|
|
|
|
|
|
|
We want to find an evaluation of the remainder (69) in this case.
Taking into account formula (25), the additivity property of divided differences and the average formula (26), we can write successively,
|
|
|
|
|
|
Andandare respectively included in the intervaland the mth interval containing the values.
With these the rest becomes
|
|
|
In this way we arrive at the following expression for the rest of the cubature formula (66)
|
|
|
Let us now consider some particular cases of the formula (6.
|
|
|
.
.
|
|
|
|
|
|
|
|
|
(73) |
|
|
|
-
23.
If the polynomialsandare not chosen as in determining the remainder. (70), determining the remainder is quite complicated.
Let's give an example.
If one chooseswe have seen that the formula for cubature (72) is obtained. To evaluate its remainder, let us choose
|
|
|
(i) The remainder according to formula (69) and the following will be
where
|
|
|
|
|
|
*) This formula was also encountered incidentally by Mikeladze
Now some difficulties arise because the polynomials that multiply, the divided differences above do not keep a constant sign in the domain of integration.
By making a convenient decomposition of the integration domain, one can obtain, after some transformations, the following expression for the remainder
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
(7.) |
Assuming that in square D we have
|
|
|
the following delimitation of this remainder results
|
|
|
It is worth noting that the same delimitation is obtained if we start from the expression (72) of the remainder. In fact, the remainder (70) must also be independent of the parameters. In the previous example the correct expression for the remainder is that of (72). The formula (72') differs only in appearance from that of (7.
24. The preceding results can now be extended very easily to the case of several variables.
Let us briefly present some results from the case of three variables.
Let the triple integral be
|
|
|
|
|
|
Using the interpolation formula
|
|
|
|
|
|
is the interpolation polynomial that coincides with the functionon the hot nodes
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
is obtained, regardless of whetherare distinct or not, the cubature formula
|
|
|
(74) |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
-
25.
Let us consider two particular cases of the cubature formula (74)..
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
In these expressions, the Legendre polynomialcontains numerical factor.
Between these coefficients there are the relationships
|
|
|
|
|
|
for the rest of the cubature formula (74) the following expression is obtained
|
|
|
.
|
|
|
-
26.
In a future paper, we will construct, starting from the interpolation formulas we gave in this paper, cubature formulas for double and triple integrals in the case when the integration domain is a regular polygon, a circle, a regular polyhedron or a sphere.