In this paper we use the simplex B-spline representation of polynomials or piecewise polynomials in terms of their polar forms to construct several differential or discrete bivariate quasi interpolants which have an o...In this paper we use the simplex B-spline representation of polynomials or piecewise polynomials in terms of their polar forms to construct several differential or discrete bivariate quasi interpolants which have an optimal approximation order.This method provides an efficient tool for describing many approximation schemes involving values and(or) derivatives of a given function.展开更多
This paper, we develop a numerical method for solving a unilateral obstacle problem by using the cubic spline collocation method and the generalized Newton method. This method converges quadratically if a relation-shi...This paper, we develop a numerical method for solving a unilateral obstacle problem by using the cubic spline collocation method and the generalized Newton method. This method converges quadratically if a relation-ship between the penalty parameter and the discretization parameter h is satisfied. An error estimate between the penalty solution and the discret penalty solution is provided. To validate the theoretical results, some numerical tests on one dimensional obstacle problem are presented.展开更多
文摘In this paper we use the simplex B-spline representation of polynomials or piecewise polynomials in terms of their polar forms to construct several differential or discrete bivariate quasi interpolants which have an optimal approximation order.This method provides an efficient tool for describing many approximation schemes involving values and(or) derivatives of a given function.
文摘This paper, we develop a numerical method for solving a unilateral obstacle problem by using the cubic spline collocation method and the generalized Newton method. This method converges quadratically if a relation-ship between the penalty parameter and the discretization parameter h is satisfied. An error estimate between the penalty solution and the discret penalty solution is provided. To validate the theoretical results, some numerical tests on one dimensional obstacle problem are presented.
