Quadratic Mean Theories for 1D Bisectors of 3D Data in Fundamental Sciences of Estimation, Approximation, Data Modeling and Processing

by

© Ph. D. & Dr. Sc. Lev Gelimson

Academic Institute for Creating Fundamental Sciences (Munich, Germany)

Mathematical Journal

of the "Collegium" All World Academy of Sciences

Munich (Germany)

11 (2011), 17

By multidimensional data estimation, approximation, modeling and processing of [1], it is reasonable to use approximation (to such data) or, equivalently, bisectors (of such data) with less numbers of dimensions then it is the case by data.

In particular, by 3D data, it is possible to use not only 2D but also 1D approximation (to such data) or, equivalently, bisectors (of such data).

In overmathematics [2, 3] and fundamental sciences of estimation [4], approximation [5], data modeling [6] and processing [7], quadratic mean theories are valid by coordinate system linear transformation invariance of the given data.

Given n (n ∈ N+ = {1, 2, ...}, n > 3) points [j=1n (x'j , y'j , z'j)] = {(x'1 , y'1 , z'1), (x'2 , y'2 , z'2), ... , (x'n , y'n , z'n)] with any real coordinates.

Use clearly invariant coordinate system centralization transformation x = x' - Σj=1n x'j / n , y = y' - Σj=1n y'j / n , z = z' - Σj=1n z'j / n to provide coordinate system Oxyz central for the given data and further work in this system with points [j=1n (xj , yj , zj)] to be approximated with a straight line

x/a = y/b = z/c

containing origin O(0, 0, 0).

Nota bene: Consider cases a = 0, or b = 0, or c = 0, separately. Now regard nonzero values of a , b , and c only.

After centralization, additionally introduce coordinate system normalization transformation

X = x/(Σj=1n xj2)1/2 ,

Y = y/(Σj=1n yj2)1/2 ,

Z = z/(Σj=1n zj2)1/2

to provide coordinate system OXYZ which is central normalized for the given data and further work in this system with points [j=1n (Xj , Yj , Zj)] to be approximated with a straight line

X/A = Y/B = Z/C

containing origin O(0, 0, 0).

Nota bene: For these points, we have

Σj=1n Xj2 = 1,

Σj=1n Yj2 = 1,

Σj=1n Zj2 = 1,

j=1n Xj2)1/2 = 1,

j=1n Yj2)1/2 = 1,

j=1n Zj2)1/2 = 1.

Therefore, similarly to 1D approximation (to 2D data) or, equivalently, 1D bisectors (of such data), additionally using the possibility to simultaneously multiplicate or divide real numbers A , B , and C by any nonzero real number, we can consider

|A| = |B| = |C| = 1.

All the more, we can freely select the sign of one of these numbers A , B , and C , e.g. consider A positive. Then, similarly to 1D approximation (to 2D data) or, equivalently, 1D bisectors (of such data), we have

A = 1,

B = sign(Σj=1n XjYj) = sign(Σj=1n xjyj),

C = sign(Σj=1n XjZj) = sign(Σj=1n xjzj).

Check that necessary condition

sign(Σj=1n xjyj) sign(Σj=1n yjzj) = sign(Σj=1n xjzj)

is valid.

Then the equations of the desired straight line are

X = Y sign(Σj=1n XjYj) = Z sign(Σj=1n XjZj)

in coordinate system OXYZ ,

x/(Σj=1n xj2)1/2 = y/(Σj=1n yj2)1/2 sign(Σj=1n xjyj) = z/(Σj=1n zj2)1/2 sign(Σj=1n xjzj)

in coordinate system Oxyz , and

(x' - Σj=1n x'j / n)/[Σj=1n (x'j - Σj=1n x'j / n)2]1/2 =

(y' - Σj=1n y'j / n)/[Σj=1n (y'j - Σj=1n y'j / n)2]1/2 sign[Σj=1n (x'j - Σj=1n x'j / n)(y'j - Σj=1n y'j / n)] =

(z' - Σj=1n z'j / n)/[Σj=1n (z'j - Σj=1n z'j / n)2]1/2 sign[Σj=1n (x'j - Σj=1n x'j / n)(z'j - Σj=1n z'j / n)]

in coordinate system O'x'y'z' .

To introduce data scatter and trend measures via distances in coordinate system OXYZ , first consider a distance between any point (x'j , y'j , z'j) and any straight line

(x' - x'')/a = (y' - y'')/b = (z' - z'')/c

containing any point (x'' , y'' , z''). Planes which are orthogonal to this straight line have equations of type

ax' + by' + cz' = d .

In particular, the plane which is orthogonal to this straight line and contains point (x'j , y'j , z'j) has equation

a(x' - x'j) + b(y' - y'j) + c(z' - z'j) = 0.

To determine the projection of point (x'j , y'j , z'j) onto this straight line, or the intersection of this straight line and this plane, consider a parametric equation of this straight line via introducing a real parameter

t = (x' - x'')/a = (y' - y'')/b = (z' - z'')/c :

x' = x'' + at ,

y' = y'' + bt ,

z' = z'' + ct .

Substituting these formulae for x' , y' , and z' into the equation of this plane, we obtain

t = [a(x'j - x'') + b(y'j - y'') + c(z'j - z'')]/(a2 + b2 + c2)

and the intersection coordinates

x'nj = x'' + a[a(x'j - x'') + b(y'j - y'') + c(z'j - z'')]/(a2 + b2 + c2),

y'nj = y'' + b[a(x'j - x'') + b(y'j - y'') + c(z'j - z'')]/(a2 + b2 + c2),

z'nj = z'' + c[a(x'j - x'') + b(y'j - y'') + c(z'j - z'')]/(a2 + b2 + c2).

The Euclidean distance between point (x'j , y'j , z'j) and this straight line, or, equivalently, between point (x'j , y'j , z'j) and its projection (x'nj , y'nj , z'nj) on this straight line, is

2dj = [(x'j - x'nj)2 + (y'j - y'nj)2 + (z'j - z'nj)2]1/2 .

The sum of the squared Euclidean distances between all the points (x'j , y'j , z'j) and this straight line, or, equivalently, between all the points (x'j , y'j , z'j) and their projections (x'nj , y'nj , z'nj) on this straight line, is

1|2|2S = Σj=1n 2dj2 = Σj=1n [(x'j - x'nj)2 + (y'j - y'nj)2 + (z'j - z'nj)2].

In our particular case in coordinate system OXYZ , we have

x'' = y'' = z'' = 0,

a = A = 1,

b = B = sign(Σj=1n XjYj) = sign(Σj=1n xjyj),

c = C = sign(Σj=1n XjZj) = sign(Σj=1n xjzj).

The projections of point (Xj , Yj , Zj) onto this straight line

X = Y sign(Σj=1n XjYj) = Z sign(Σj=1n XjZj)

are

Xnj = [Xj + Yj sign(Σj=1n XjYj) + Zj sign(Σj=1n XjZj)]/3,

Ynj = [Xj sign(Σj=1n XjYj) + Yj + Zj sign(Σj=1n YjZj)]/3,

Znj = [Xj sign(Σj=1n XjZj) + Yj sign(Σj=1n YjZj) + Zj]/3.

Now we obtain

1|2|2Smin = Σj=1n 2dj2 = Σj=1n [(Xj - Xnj)2 + (Yj - Ynj)2 + (Zj - Znj)2].

This is the desired least value of 1|2|2S by different straight lines. To check this and to additionally determine the greatest value 1|2|2Smax of 1|2|2S by different straight lines, consider all the 4 sign combinations in A = 1, B = ± 1, and C = ± 1, i.e. all the 4 straight lines

X/A = Y/B = Z/C

with

|A| = |B| = |C| = 1.

Remember, we can freely select the sign of one of these numbers A , B , and C , e.g. consider A positive.

Then for each central normalized data point (Xj , Yj , Zj) and for each of the 4 combinations of the signs of B and C separately, determine 4 projections

Xnj = (Xj + BYj + CZj)/3,

Ynj = (BXj + Yj + BCZj)/3,

Znj = (CXj + BCYj + Zj)/3

of this point (Xj , Yj , Zj) onto these 4 straight lines.

Then determine 4 sums

1|2|2S = Σj=1n 2dj2 = Σj=1n [(Xj - Xnj)2 + (Yj - Ynj)2 + (Zj - Znj)2]

for each of the 4 combinations of the signs of B and C separately, too.

Now determine 2Smin and 2Smax among those 4 values of 2S and, finally, data scatter measure

1|2|2S = (1|2|2Smin / 1|2|2Smax)1/2

and data trend measure

1|2|2T = 1 - 1|2|2S = 1 - (1|2|2Smin / 1|2|2Smax)1/2.

Quadratic mean theories are very efficient in data estimation, approximation, and processing and reliable even by great data scatter.

Acknowledgements to Anatolij Gelimson for our constructive discussions on coordinate system transformation invariances and his very useful remarks.

References

[1] Encyclopaedia of Mathematics. Ed. M. Hazewinkel. Volumes 1 to 10. Kluwer Academic Publ., Dordrecht, 1988-1994

[2] Lev Gelimson. Providing Helicopter Fatigue Strength: Flight Conditions. In: Structural Integrity of Advanced Aircraft and Life Extension for Current Fleets – Lessons Learned in 50 Years After the Comet Accidents, Proceedings of the 23rd ICAF Symposium, Dalle Donne, C. (Ed.), 2005, Hamburg, Vol. II, 405-416

[3] Lev Gelimson. Overmathematics: Fundamental Principles, Theories, Methods, and Laws of Science. The ”Collegium” All World Academy of Sciences Publishers, Munich, 2010

[4] Lev Gelimson. Fundamental Science of Estimation. The ”Collegium” All World Academy of Sciences Publishers, Munich, 2010

[5] Lev Gelimson. Fundamental Science of Approximation. The ”Collegium” All World Academy of Sciences Publishers, Munich, 2010

[6] Lev Gelimson. Fundamental Science of Data Modeling. The ”Collegium” All World Academy of Sciences Publishers, Munich, 2010

[7] Lev Gelimson. Fundamental Science of Data Processing. The ”Collegium” All World Academy of Sciences Publishers, Munich, 2010