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 ...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.展开更多
基金The authors sincerely appreciate the referees for acknowledging the manuscript and providing valuable comments and suggestions that benefit their manuscript. This work was supported by the National Natural Science Foundation of China （Grant Nos. 11131008, 11271157, 11201453, 11471141）, the 973 Program （2011CB302400）, the Open Project Program of the State Key Lab of CAD＆CG （A1302） of Zhejiang University, and the Scientific Research Foundation for Returned Scholars, Ministry of Education of China. They also wish to thank the High Performance Computing Center of Jilin University and Computing Center of Jilin Province for essential computing support.
文摘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.
