期刊文献+
共找到2篇文章
< 1 >
每页显示 20 50 100
A Posteriori Error Estimate of Weak Galerkin FEM for Stokes Problem Using Auxiliary Subspace Techniques
1
作者 jiachuan zhang Ran zhang Xiaoshen Wang 《Communications in Computational Physics》 SCIE 2023年第2期511-537,共27页
Based on the auxiliary subspace techniques,a posteriori error estimator of nonconforming weak Galerkin finite element method(WGFEM)for Stokes problem in two and three dimensions is presented.Without saturation assumpt... Based on the auxiliary subspace techniques,a posteriori error estimator of nonconforming weak Galerkin finite element method(WGFEM)for Stokes problem in two and three dimensions is presented.Without saturation assumption,we prove that the WGFEM approximation error is bounded by the error estimator up to an oscillation term.The computational cost of the approximation and the error problems is considered in terms of size and sparsity of the system matrix.To reduce the computational cost of the error problem,an equivalent error problem is constructed by using diagonalization techniques,which needs to solve only two diagonal linear algebraic systems corresponding to the degree of freedom(d.o.f)to get the error estimator.Numerical experiments are provided to demonstrate the effectiveness and robustness of the a posteriori error estimator. 展开更多
关键词 Auxiliary subspace techniques diagonalization techniques weak Galerkin A posteriori error estimate Stokes problem.
原文传递
Effective algorithms for computing triangular operator in Schubert calculus
2
作者 Kai zhang jiachuan zhang +1 位作者 Haibao DUAN Jingzhi LI 《Frontiers of Mathematics in China》 SCIE CSCD 2015年第1期221-237,共17页
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. 展开更多
关键词 Triangular operator Schubert calculus parallel algorithm centralbinomial coemcient
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部