欧氏空间R^n中求一类容积问题的矩阵分析方法

Matrix Analysis Method for Some Volume Problems in Euclidean Space Rn

由组合拓扑学可知,任意凸多面体均为若干个单纯形的某种组合,两者均为规划论中最重要的基本概念之一,因而在一些计算中对其求积是不可少的。对此,本文提出一个基于矩阵分析的容积计算方法,并举例说明该方法可用于求解欧氏空间中一类容积问题。

According to the viewpoint of combination tope, any convex polyhedron can be composed of some simplexes , and both convex polyhedron and simplex are important concepts of programming theory, so it's necessary to find their volumes in some calculations. Aiming at this problem, a method for volume calculation based on matrix analysis is presented in this paper, and some examples are given to show that this method can be used to solve a class of volume problems in Euclidean space.