INTRODUCTION
An application of geometrical probability (Kamal AlDawoud and Khomchenko, 2007) for constructing polynomials basic functions essentially simplifies problems of approximation in finiteelements method (Norrie and de Vries, 1978; Oden, 1972). In this paper the probabilistic aspects of finiteelement approximation on threedimensional models are presented. Special attention is given to a simplex (a tetrahedron, 4 units) and multiplex (a cube, 8 units). Usually nodal parameters are more favorably to choose on vertexes of an element, as vertexes are the general for more number of elements, than units on edges or lateral sides. Such choice reduces the general number of central parameters of system elements and reduces the size of a global matrix of the linear algebraic equations system (Norrie and de Vries, 1978).
Simplex models (Oden, 1972) are concerned with using linear polynomials in finiteelements. They were among the first used in (FEM) in 1956 (Turner, Clough, Martin and Topp), in 1957 (Synge), in 1962 (Gallagher, Padlog and Bijlaard). Finiteelements in the form of a cube have quickly won popularity in threedimensional problems, where one cube took the same volume, as 6 tetrahedrons. Let's notice, that irregular splitting of the area into tetrahedrons is difficult for carrying out even with the help of a Computer (Strang and Fix, 1973). Threelinear approximation on a cubic element for the first time was used in 1963. (Melosh), then in 1966 (Key), in 1967 (Zienkiewicz and Cheung), in 1969 (Oden).
Kolmogorov's model of random wanderings on a threedimensional grid allows
schematizing random wanderings with random start and absorbing units in vertexes
of a finiteelement. Computer experiments give the basis to assume, that the
transitive probabilities have properties of stability and are independent of
the form of the trajectory and the number of steps. The establishment of the
specified properties allows ignoring a history of random wanderings and stimulates
searches of the simplified singlestep scheme, which appreciably accelerate
calculations in Monte Carlo methods. The economical schemes of random transitions
are the result of minimizing the number of steps. In this study, it is theoretically
proved that the transitive probability invariant concerning the form of a route
depends only on coordinates of a startingpoint and vertex of an element (finishpoint).
In the optimum scheme, the particle for one step on a startline route reaches
vertex of an element. Interpolations function of three arguments is a mathematical
expectation of nodal values. From the mechanical point of view, transitive probabilities
show, how to distribute a single mass on vertexes of an element, which barycentric
appeared in a reselected point.
FORMULATION AND SOLUTION
On Fig. 1, the threedimensional simplexa tetrahedron with 4 nodes is represented. This element has equipment with 4 basic functions. In research problems of scalar fields in each node, there is one degree of freedom (for example, temperature). Traditional algebraic procedure of designing polynomial a interpolation is reduced to the definition of 4 parameters α_{i} in a general view polynomial:
The source information contains 16 numbers: coordinates of nodes and
nodal temperatures .
For determining α_{i} using systems of linear algebraic equations
4x4, where kth equation of system is given by:
The system (2) has the unique solution as its determinant Δ is not zero:

Fig. 1: 
Tetrahedron (4 nodes) 
Where, V is the volume of tetrahedron.
Procedure of designing of a polynomial actually ends of substitution of parameters α_{i} in Eq. 1. However, in most cases a polynomial (1) can be written in the form of Lagrange. For this element in (1) it is necessary to rearrange so that each element contains a multiplier f_{k}:
Where:
The determinant Δ_{k} produced from a determinant (3) replacement in kth row of coordinates of vertex Π_{k} by coordinates of the current point M(x, y, z). It is easy to notice, that basis Lagrange {N_{k}} will consist of barycentric coordinates of a threedimensional simplex, which have the following properties:
Where:
δ_{ki} = Kronecker's symbol
Property (5) represents special interest, as it has a precise probabilistic sense. To each nodal value of function f_{k} is matched a corresponding probability N_{k}. Thus, we can write the law of distribution of probabilities for the function of a random point M (x, y, z):
Now it is clear that interpolation polynomials value (4) in any point of a simplex is determined by the formula of expectation. Feature of the resulted table, where selective values are fixed and a random factor is present at the second row. Functions of a random point N_{k} (x, y, z) are interpreted as transitive probabilities of a wandering particle, from a random point M (x, y, z), to vertexes of a tetrahedron Π_{k}.
On Fig. 1, arrows are shown the routes of random transitions. Thus, in a tetrahedron the singlestep 4routing scheme of random transitions with random start and absorption in vertexes is realized. In terms of Monte Carlo method, formula (4) is the average compensation for an output of particles in vertex. It means construction of interpolation polynomials is reduced to the definition of transitive probabilities. On a simplex N_{k} are easily defined geometrically through relations of volumes of two tetrahedrons with the general side. For example:
On Fig. 1, the side bound is hatched.
Interpolation on a cube: On Fig. 2, the standard cube with the sizes 2x2x2 is represented. The origin coordinates coincides with barycentric cube. Algebraic procedure of constructing interpolation polynomials begins with the general expression containing 8 parameters (by number of nodes):
Coefficients are defined from the system of linear equations 8x8 using 32 numbers (coordinate of vertexes Π_{k} and a degree of freedom . Now the kth system equation is given by:

Fig. 2: 
Regular
hexahedron (cube, 8 nodes) 
The determinant of system Eq. 7 is not zero, which provides uniqueness of the solution. Substitution of α_{i} in Eq. 6 and corresponding transformations results in a polynomial Lagrange form:
In the special literature on (FEM) (Norrie and de Vries, 1978; Strang and Fix, 1973; Oden, 1972), local coordinates on a standard cube are designated through ξ, η, ς. The meanvalues of nodes (expectation) in formula (8) and the law of distribution of probabilities for the function of a random point M is:
In multiplex Fig. 2, a singlestep 8routing scheme of random transitions with random start point M and absorbing node in vertexes Π_{k} is realized.
In multiplex transition probabilities are also defined geometrically. It excludes necessity of drawing up and the resolution of the system of equations 8x8. Firstly, through the current point M (x, y, z) it is necessary to carry out three planes, parallel to coordinate planes. Thus the cube is divided into 8 rectangular parallelepipeds. Now, for defining N_{k}, it is necessary to find relative volume of a parallelepiped, opposite to node k. For example:
Other functions N_{k} are defined similarly or from N_{1} using consecutive transformation of parallel route carried on 2 units along one of coordinate directions (Fig. 2). Properties (5) are easy to check up, as in this model.
A lot of interesting properties of posteriori transitive probabilities n_{k}/n are found out in computer experiments with random wanderings in multiplex on nodes of an orthogonal spaces grid. Here nthe general number of particles, starting from control node, n_{k}  (number of the particles absorbing vertex Π_{k}). In the experiments, the Kolmogorov's classical model with a 6routing pattern and equally probability transitions on each step is used. An output of a particle on side multiplex wanderings turns into twodimensional, at an output on an edgein onedimensional and come to an end in one of two vertexes Π_{k}, belonging to the given edge. First of all it is necessary to specify convergence in probability:
n_{k}/n→N_{k} at n→∞
Experiments have confirmed independence of transitive probability of the form of a route and number of steps from start to finish. There are no bases to doubt about the result of experiments. However we shall try to prove the following theorem theoretically using probabilistic representations.
Theorem 1: For a particle, starting from any point of M multiplex, the probability of absorbing vertex Π_{k} is invariantly concerning the form of a trajectory and also coincides with corresponding function N_{k}threelinear interpolation.
Proof: On Fig. 2, different routes from a point M (x, y, z) in vertex Π_{1} (1;1;1) are demonstrated. Each broken line consists of three straightline segments, parallel to coordinate axes. On any route, the particle for 3 steps reaches vertex Π_{1}. On the first step, the particle goes to one of three edges containing vertex Π_{1}, on the second step, the particle goes to one of two edges containing vertex Π_{1}, on the third step, the particle is absorbed by vertex Π_{1}. For the particles absorbed by other vertexes, the situation is similar. To prove this theorem, it is enough to consider one of six possible routes from M to Π_{1}, for example:
M→A_{1}→B→Π_{1}
The probability of transition M→A_{1} is defined geometrically and is:
The probability of transition M→B_{2} provided, that a route passes through A_{1}, is:
Finally, the probability of transition M→Π_{1} through points A_{1} and B_{2}, is:
that coincides with the formula (9).
By changing trajectory from M to Π_{1} in the formula (9) and by changing only the order of factors all 3! Variants give the same results.
Remarks:
• 
Each side of a cube (Fig. 2) is twodimensional
multiplex with bilinear basis (Kamal AlDawoud and Khomchenko, 2007). Therefore
in view of results (Kamal AlDawoud and Khomchenko, 2007) it is possible
to offer the twostepbystep scheme of wanderings with the same transitive
probability (9). For methods of Monte Carlo: the more shorter a history
of wanderings, the more effective is computing algorithm. This explained
increased interest in singlestep scheme. 
• 
Simplicity
and content of models Kolmogorov with orthogonal trajectories allow constructing
the threedimensional scheme of wanderings as a superposition of three
onedimensional wanderings. However, multistep wanderings on a grid are
longterm and practically useless. 
Theorem 2: The probability of transition of a particle from random start in vertex Π_{k} multiplex is a harmonic function both on Laplace test and on Privalov's test.
Proof: The differential test of harmonic function, suggested by Laplace, is:
Δn_{k} (x, y, z) = 0
Where:
The integral test of harmonic, suggested by Privalov, is the meanvalue integral by element:
Simple consideration shows, that N_{k} (x, y, z) satisfies Laplace equation and the rules meanvalue. Notice, that in formula (10) multiplier 1/8 before triple integral is a density of uniform distribution of a random point in multiplex. Therefore, Privalov's test gives expectation of function of a random point. This result has exactly probability meaning and is formulated as the following theorem.
Theorem 3: Expectation of transitive probability N_{k} (x, y, z) on all random trajectories in multiplex is equal to probability of transition of a particle from barycentric to vertex.
For proof it is enough to refer to formula (10).
Remark: Surprisingly, the function N_{k} (x, y, z), containing members of the second and third degree, supposes exact integration using a simplified approached formula with a unique node in barycentric of an element.
CONCLUSION
New probability properties of basic functions Lagrange 3Dinterpolation are established. It stimulates attempts to distribute probability approaches on polynomials of the higher orders in onedimensional, twodimensional and threedimensional finite elements. Special interest is represented with penal routes with negative transitive probabilities. Such generalization of models of random wanderings will need correct and grounded formulations.