Research On Algorithm For The Distarice Between Two Linear Manifolds

The concept of the distance between two linear manifolds is given, and the algorithms are designed.At the beginning of this thesis, the development and application of the concep-t of manifold are introduced. In Chapter1, the distance, co-perpendicular linear manifold between two linear manifolds are defined, and their two algorithms are re-spectively presented by perpendicularity and paralleling property of linear manifolds, and some examples are computed for illustration of feasibility of the algorithms. In chapter2, the distance between two linear manifolds is characterized by a convex quadratic program, and its algorithm is given by optimal conditions, and some ex-ample are computed to illustrate its feasibility. In Chapter3, a conclusion is made and some problems which are researched in the future are presented.