On linear regression in three-dimensional Euclidean space

Abstract

The three-dimensional linear regression problem is a problem of finding a spacial straight line best fitting a group of points in three-dimensional Euclidean space. This problem is considered in the present paper and a solution to it is given in a coordinate-free form.

AmSTeX, 4 pages, amsppt style

References in corpus (3)

• Least square ellipsoid fitting using iterative orthogonal transformations
• Algorithms for laying points optimally on a plane and a circle
• Direct ellipsoidal fitting of discrete multi-dimensional data

Cited by in corpus (2)

• Improvement of the NOvA Near Detector Event Reconstruction and Primary Vertexing through the Application of Machine Learning Methods
• On cylindrical regression in three-dimensional Euclidean space