摘要
本文通过几何讨论,建立向量标号转轴算法的基本定理,从而每个从人为完备单形出发的计算序列,都由依次联接的完备单形组成。这一情况并不依赖于空间的单纯剖分。
This paper proves geometrically the fundamental theorem of vector labelling complementary pivoting algorithms. It is shown that the feasibility of the algo-rithms is absolute one, no matter whethere there is an underlying simplicial trian-gulation or not. Related discussions are developed.
出处
《应用数学与计算数学学报》
1989年第2期49-55,共7页
Communication on Applied Mathematics and Computation
基金
中山大学高等学术研究中心基金
