我们基于 C++ 日益增多地开发二个平行算法计算一个三角操作员问题,它在舒伯特演算的学习起一个重要作用。我们也由使用组合数量分析每个算法的计算复杂性,例如加泰隆人的数字, Motzkin 数字,和中央二项式的系数。我们的算法的精确性和效率被数字实验认为正当。
We develop two parallel algorithms progressively based on C++ to compute a triangle operator problem, which plays an important role in the study of Schubert calculus. We also analyse the computational complexity of each algorithm by using combinatorial quantities, such as the Catalan number, the Motzkin number, and the central binomial coefficients. The accuracy and efficiency of our algorithms have been justified by numerical experiments.