Krawtchouk polynomials are frequently applied in modern physics. Based on the results which were educed by Li and Wong, the asymptotic expansions of Krawtchouk polynomials are improved by using Airy function, and unif...Krawtchouk polynomials are frequently applied in modern physics. Based on the results which were educed by Li and Wong, the asymptotic expansions of Krawtchouk polynomials are improved by using Airy function, and uniform asymptotic expansions are got. Furthermore, the asymptotic expansions of the zeros for Krawtchouk polynomials are again deduced by using the property of the zeros of Airy function, and their corresponding error bounds axe discussed. The obtained results give the asymptotic property of Krawtchouk polynomials with their zeros, which are better than the results educed by Li and Wong.展开更多
We consider some classes of generalized gap functions for two kinds of generalized variational inequality problems. We obtain error bounds for the underlying variational inequalities using the generalized gap function...We consider some classes of generalized gap functions for two kinds of generalized variational inequality problems. We obtain error bounds for the underlying variational inequalities using the generalized gap functions under the condition that the involved mapping F is g-strongly monotone with respect to the solution, but not necessarily continuous differentiable, even not locally Lipschitz.展开更多
Similar to having done for the mid-point and trapezoid quadrature rules,we obtain alternative estimations of error bounds for the Simpson＇s quadrature rule involving n-time（1 ≤ n ≤ 4） differentiable mappings and ...Similar to having done for the mid-point and trapezoid quadrature rules,we obtain alternative estimations of error bounds for the Simpson＇s quadrature rule involving n-time（1 ≤ n ≤ 4） differentiable mappings and then to the estimations of error bounds for the adaptive Simpson＇s quadrature rule.展开更多
We consider the abstract linear inequality system （A, C, b） and give a sufficient condition for the system （A, C, b） to have an error bound, which extends the previous result.
In this paper,the kernel of the cubic spline interpolation is given.An optimal error bound for the cu- bic spline interpolation of lower smooth functions is obtained.
In this paper we develop periodic quartic spline interpolation theory which,in general,gives better fus to continuous functions than does the existing quintic spline interpolation theory.The main theorem of the paper ...In this paper we develop periodic quartic spline interpolation theory which,in general,gives better fus to continuous functions than does the existing quintic spline interpolation theory.The main theorem of the paper is to establish that r=0,1,2,3.Also,the nanperiodic cases cannot be constructed empoly-ing the methodology of this paper because that will involve several other end conditions entirely different than(1,10).展开更多
Many fields require the zeros of orthogonal polynomials. In this paper, the middle variable was improved to give a new asymptotic approximation, with error bounds, for the Jacobi polynomials P (α,β) n(cosθ) (...Many fields require the zeros of orthogonal polynomials. In this paper, the middle variable was improved to give a new asymptotic approximation, with error bounds, for the Jacobi polynomials P (α,β) n(cosθ) (0≤θ≤π/2,α,β>-1), as n→+∞. An accurate approximation with error bounds is also constructed for the zero θ n,s of P (α,β) n(cosθ)(α≥0,β>-1).展开更多
The study of zeros of orthogonal functions is an important topic. In this paper, by improving the middle variable x（t）, we＇ve got a new form of asymptotic approximation, completed with error bounds, it is construct...The study of zeros of orthogonal functions is an important topic. In this paper, by improving the middle variable x（t）, we＇ve got a new form of asymptotic approximation, completed with error bounds, it is constructed for the Jacobi functions φu^（α,β）（t）（α 〉 -1） as μ→∞. Besides, an accurate approximation with error bounds is also constructed correspondingly for the zeros tμ,s of φu^（α,β）（t）（α≥ 0） as μ→∞, uniformly with respect to s = 1, 2,....展开更多
In this paper,by using scalarization techniques and a minimax strategy,error bound results in terms of gap functions for a generalized mixed vector equilibrium problem are established,where the solutions for vector pr...In this paper,by using scalarization techniques and a minimax strategy,error bound results in terms of gap functions for a generalized mixed vector equilibrium problem are established,where the solutions for vector problems may be general sets under natural assumptions,but are not limited to singletons.The other essentially equivalent approach via a separation principle is analyzed.Special cases to the classical vector equilibrium problem and vector variational inequality are also discussed.展开更多
In last century, D. Hoff and J. Smoller derived the error bounds for the Glimm difference approximations of the solutions to scalar conservation laws with convexity. Our work is to extend the corresponding result of t...In last century, D. Hoff and J. Smoller derived the error bounds for the Glimm difference approximations of the solutions to scalar conservation laws with convexity. Our work is to extend the corresponding result of them to the case without convexity.展开更多
In this paper, we study the approximation of identity operator and the convolution inte- gral operator Bm by Fourier partial sum operators, Fejer operators, Vallee--Poussin operators, Ces^ro operators and Abel mean op...In this paper, we study the approximation of identity operator and the convolution inte- gral operator Bm by Fourier partial sum operators, Fejer operators, Vallee--Poussin operators, Ces^ro operators and Abel mean operators, respectively, on the periodic Wiener space （C1 （R）, W°） and obtaia the average error estimations.展开更多
In this paper we consider(hierarchical,Lagrange)reduced basis approximation and a posteriori error estimation for potential flows in affinely parametrized geometries.We review the essential ingredients:i)a Galerkin pr...In this paper we consider(hierarchical,Lagrange)reduced basis approximation and a posteriori error estimation for potential flows in affinely parametrized geometries.We review the essential ingredients:i)a Galerkin projection onto a lowdimensional space associated with a smooth“parametric manifold”in order to get a dimension reduction;ii)an efficient and effective greedy sampling method for identification of optimal and numerically stable approximations to have a rapid convergence;iii)an a posteriori error estimation procedure:rigorous and sharp bounds for the linearfunctional outputs of interest and over the potential solution or related quantities of interest like velocity and/or pressure;iv)an Offline-Online computational decomposition strategies to achieve a minimum marginal computational cost for high performance in the real-time and many-query(e.g.,design and optimization)contexts.We present three illustrative results for inviscid potential flows in parametrized geometries representing a Venturi channel,a circular bend and an added mass problem.展开更多
We estimate error bounds between ternary subdivision curves/surfaces and their control polygons after k-fold subdivision in terms of the maximal differences of the initial control point sequences and constants that de...We estimate error bounds between ternary subdivision curves/surfaces and their control polygons after k-fold subdivision in terms of the maximal differences of the initial control point sequences and constants that depend on the subdivision mask. The bound is independent of the process of subdivision and can be evaluated without recursive subdivision. Our technique is independent of parametrization therefore it can be easily and efficiently implemented. This is useful and important for pre-computing the error bounds of subdivision curves/surfaces in advance in many engineering applications such as surface/surface intersection, mesh generation, NC machining, surface rendering and so on.展开更多
In this paper, we study error bounds for lower semicontinuous functions defined on Banach space and linear regularity for finitely many closed subset in Banach spaces. By using Clarke＇s subd- ifferentials and Ekeland...In this paper, we study error bounds for lower semicontinuous functions defined on Banach space and linear regularity for finitely many closed subset in Banach spaces. By using Clarke＇s subd- ifferentials and Ekeland variational principle, we establish several sufficient conditions ensuring error bounds and linear regularity in Banach spaces.展开更多
In the paper we investigate smoothing method for solving semi-infinite minimax problems. Not like most of the literature in semi-infinite minimax problems which are concerned with the continuous time version（i.e., th...In the paper we investigate smoothing method for solving semi-infinite minimax problems. Not like most of the literature in semi-infinite minimax problems which are concerned with the continuous time version（i.e., the one dimensional semi-infinite minimax problems）, the primary focus of this paper is on multi- dimensional semi-infinite minimax problems. The global error bounds of two smoothing approximations for the objective function are given and compared. It is proved that the smoothing approximation given in this paper can provide a better error bound than the existing one in literature.展开更多
The authors modify a method of Olde Daalhuis and Temme for representing the remainder and coefficients in Airy-type expansions of integrals.By using a class of rational functions,they express these quantities in terms...The authors modify a method of Olde Daalhuis and Temme for representing the remainder and coefficients in Airy-type expansions of integrals.By using a class of rational functions,they express these quantities in terms of Cauchy-type integrals;these expressions are natural generalizations of integral representations of the coe?cients and the remainders in the Taylor expansions of analytic functions.By using the new representation,a computable error bound for the remainder in the uniform asymptotic expansion of the modified Bessel function of purely imaginary order is derived.展开更多
Because of its vital role of the trust-region subproblem （TRS） in various applications, for example, in optimization and in ill-posed problems, there are several factorization-free algorithms for solving the large-s...Because of its vital role of the trust-region subproblem （TRS） in various applications, for example, in optimization and in ill-posed problems, there are several factorization-free algorithms for solving the large-scale sparse TRS. The truncated Lanczos approach proposed by N. I. M. Gould, S. Lucidi, M. Roma, and P. L. Toint [SIAM J. Optim., 1999, 9： 504-525] is a natural extension of the classical Lanczos method for the symmetric linear system and eigenvalue problem and, indeed follows the classical Rayleigh-Ritz procedure for eigenvalue computations. It consists of 1） projecting the original TRS to the Krylov subspa^es to yield smaller size TRS＇s and then 2） solving the resulted TRS＇s to get the approximates of the original TRS. This paper presents a posterior error bounds for both the global optimal value and the optimal solution between the original TRS and their projected counterparts. Our error bounds mainly rely on the factors from the Lanczos process as well as the data of the original TRS and, could be helpful in designing certain stopping criteria for the truncated Lanczos approach.展开更多
Based on the concept of constitutive relation error along with the residual of both origin and dual problems, a goal-oriented error estimation method with extended degrees of freedom is developed in this paper. It lea...Based on the concept of constitutive relation error along with the residual of both origin and dual problems, a goal-oriented error estimation method with extended degrees of freedom is developed in this paper. It leads to high quality local error bounds in the problem of fracture mechanics simulation with extended finite element method （XFEM）, which involves enrichment to solve a stress singularity in the crack. Since goal-oriented error estimation with enriched degrees of freedom gives us a chance to evaluate the XFEM simulation, the stress intensity factor calculated by two kinds of XFEM programs developed by ourselves and by commercial code ABAQUS are compared in this work. By comparing the reliability of the stress intensity factor calculation, the accuracy of two programs in different cases is evaluated and the source of error is discussed. A 2-dimensional XFEM example is given to illustrate the computational procedure.展开更多
This paper investigates double sampling series derivatives for bivariate functions defined on R2 that are in the Bernstein space. For this sampling series, we estimate some of the pointwise and uniform bounds when the...This paper investigates double sampling series derivatives for bivariate functions defined on R2 that are in the Bernstein space. For this sampling series, we estimate some of the pointwise and uniform bounds when the function satisfies some decay conditions. The truncated series of this formula allow us to approximate any order of partial derivatives for function from Bernstein space using only a finite number of samples from the function itself. This sampling formula will be useful in the approximation theory and its applications, especially after having the truncation error well-established. Examples with tables and figures are given at the end of the paper to illustrate the advantages of this formula.展开更多
Due to their complex structure,2-D models are challenging to work with;additionally,simulation,analysis,design,and control get increasingly difficult as the order of the model grows.Moreover,in particular time interva...Due to their complex structure,2-D models are challenging to work with;additionally,simulation,analysis,design,and control get increasingly difficult as the order of the model grows.Moreover,in particular time intervals,Gawronski and Juang’s time-limited model reduction schemes produce an unstable reduced-order model for the 2-D and 1-D models.Researchers revealed some stability preservation solutions to address this key flaw which ensure the stability of 1-D reduced-order systems;nevertheless,these strategies result in large approximation errors.However,to the best of the authors’knowledge,there is no literature available for the stability preserving time-limited-interval Gramian-based model reduction framework for the 2-D discrete-time systems.In this article,2-D models are decomposed into two separate sub-models(i.e.,two cascaded 1-D models)using the condition of minimal rank-decomposition.Model reduction procedures are conducted on these obtained two 1-D sub-models using limited-time Gramian.The suggested methodology works for both 2-D and 1-D models.Moreover,the suggested methodology gives the stability of the reduced model as well as a priori error-bound expressions for the 2-D and 1-D models.Numerical results and comparisons between existing and suggested methodologies are provided to demonstrate the effectiveness of the suggested methodology.展开更多
基金Project supported by Scientific Research Common Program of Beijing Municipal Commission of Education of China (No.KM200310015060)
文摘Krawtchouk polynomials are frequently applied in modern physics. Based on the results which were educed by Li and Wong, the asymptotic expansions of Krawtchouk polynomials are improved by using Airy function, and uniform asymptotic expansions are got. Furthermore, the asymptotic expansions of the zeros for Krawtchouk polynomials are again deduced by using the property of the zeros of Airy function, and their corresponding error bounds axe discussed. The obtained results give the asymptotic property of Krawtchouk polynomials with their zeros, which are better than the results educed by Li and Wong.
基金supported by the National Natural Science Foundation of China (No. 10671050)the Natural Science Foundation of Heilongjiang Province of China (No. A200607)
文摘We consider some classes of generalized gap functions for two kinds of generalized variational inequality problems. We obtain error bounds for the underlying variational inequalities using the generalized gap functions under the condition that the involved mapping F is g-strongly monotone with respect to the solution, but not necessarily continuous differentiable, even not locally Lipschitz.
基金Supported by the Natural Science Foundation of Zhejiang Province（Y6090361）
文摘Similar to having done for the mid-point and trapezoid quadrature rules,we obtain alternative estimations of error bounds for the Simpson＇s quadrature rule involving n-time（1 ≤ n ≤ 4） differentiable mappings and then to the estimations of error bounds for the adaptive Simpson＇s quadrature rule.
基金Supported by the National Science Foundation of China（10361008） Supported by the Natural Science Foundation of Yunnan Province（2003A0002M）
文摘We consider the abstract linear inequality system （A, C, b） and give a sufficient condition for the system （A, C, b） to have an error bound, which extends the previous result.
文摘In this paper,the kernel of the cubic spline interpolation is given.An optimal error bound for the cu- bic spline interpolation of lower smooth functions is obtained.
文摘In this paper we develop periodic quartic spline interpolation theory which,in general,gives better fus to continuous functions than does the existing quintic spline interpolation theory.The main theorem of the paper is to establish that r=0,1,2,3.Also,the nanperiodic cases cannot be constructed empoly-ing the methodology of this paper because that will involve several other end conditions entirely different than(1,10).
基金Supported by the Natural Science Foundation of Beijing
文摘Many fields require the zeros of orthogonal polynomials. In this paper, the middle variable was improved to give a new asymptotic approximation, with error bounds, for the Jacobi polynomials P (α,β) n(cosθ) (0≤θ≤π/2,α,β>-1), as n→+∞. An accurate approximation with error bounds is also constructed for the zero θ n,s of P (α,β) n(cosθ)(α≥0,β>-1).
基金Supported by Developing Key Subject Item of Beijing
文摘The study of zeros of orthogonal functions is an important topic. In this paper, by improving the middle variable x（t）, we＇ve got a new form of asymptotic approximation, completed with error bounds, it is constructed for the Jacobi functions φu^（α,β）（t）（α 〉 -1） as μ→∞. Besides, an accurate approximation with error bounds is also constructed correspondingly for the zeros tμ,s of φu^（α,β）（t）（α≥ 0） as μ→∞, uniformly with respect to s = 1, 2,....
基金This research was supported by the National Natural Science Foundation of China(Nos.11301567 and 11571055)the Fundamental Research Funds for the Central Universities(No.106112015CDJXY100002).
文摘In this paper,by using scalarization techniques and a minimax strategy,error bound results in terms of gap functions for a generalized mixed vector equilibrium problem are established,where the solutions for vector problems may be general sets under natural assumptions,but are not limited to singletons.The other essentially equivalent approach via a separation principle is analyzed.Special cases to the classical vector equilibrium problem and vector variational inequality are also discussed.
基金the foundations of the National Natural Science Committee(10171112)the Natural Science Committee of Guangdong Province(05003348)
文摘In last century, D. Hoff and J. Smoller derived the error bounds for the Glimm difference approximations of the solutions to scalar conservation laws with convexity. Our work is to extend the corresponding result of them to the case without convexity.
文摘In this paper, we study the approximation of identity operator and the convolution inte- gral operator Bm by Fourier partial sum operators, Fejer operators, Vallee--Poussin operators, Ces^ro operators and Abel mean operators, respectively, on the periodic Wiener space （C1 （R）, W°） and obtaia the average error estimations.
文摘In this paper we consider(hierarchical,Lagrange)reduced basis approximation and a posteriori error estimation for potential flows in affinely parametrized geometries.We review the essential ingredients:i)a Galerkin projection onto a lowdimensional space associated with a smooth“parametric manifold”in order to get a dimension reduction;ii)an efficient and effective greedy sampling method for identification of optimal and numerically stable approximations to have a rapid convergence;iii)an a posteriori error estimation procedure:rigorous and sharp bounds for the linearfunctional outputs of interest and over the potential solution or related quantities of interest like velocity and/or pressure;iv)an Offline-Online computational decomposition strategies to achieve a minimum marginal computational cost for high performance in the real-time and many-query(e.g.,design and optimization)contexts.We present three illustrative results for inviscid potential flows in parametrized geometries representing a Venturi channel,a circular bend and an added mass problem.
基金This work was supported in part by NSF of China(No. 10201030)the TRAPOYT in Higher Education Institute of MOE of chinathe Doctoral Program of MOE of china(No. 20010358003)
文摘We estimate error bounds between ternary subdivision curves/surfaces and their control polygons after k-fold subdivision in terms of the maximal differences of the initial control point sequences and constants that depend on the subdivision mask. The bound is independent of the process of subdivision and can be evaluated without recursive subdivision. Our technique is independent of parametrization therefore it can be easily and efficiently implemented. This is useful and important for pre-computing the error bounds of subdivision curves/surfaces in advance in many engineering applications such as surface/surface intersection, mesh generation, NC machining, surface rendering and so on.
基金Supported by National Natural Science Foundation of China(Grant No.11261067)the Scientifc Research Foundation of Yunnan University(Grant No.2011YB29)Supported by IRTSTYN
文摘In this paper, we study error bounds for lower semicontinuous functions defined on Banach space and linear regularity for finitely many closed subset in Banach spaces. By using Clarke＇s subd- ifferentials and Ekeland variational principle, we establish several sufficient conditions ensuring error bounds and linear regularity in Banach spaces.
基金Supported by the National Natural Science Foundation of China(No.10671203,No.70621001) and the faculty research grant at MSU
文摘In the paper we investigate smoothing method for solving semi-infinite minimax problems. Not like most of the literature in semi-infinite minimax problems which are concerned with the continuous time version（i.e., the one dimensional semi-infinite minimax problems）, the primary focus of this paper is on multi- dimensional semi-infinite minimax problems. The global error bounds of two smoothing approximations for the objective function are given and compared. It is proved that the smoothing approximation given in this paper can provide a better error bound than the existing one in literature.
文摘The authors modify a method of Olde Daalhuis and Temme for representing the remainder and coefficients in Airy-type expansions of integrals.By using a class of rational functions,they express these quantities in terms of Cauchy-type integrals;these expressions are natural generalizations of integral representations of the coe?cients and the remainders in the Taylor expansions of analytic functions.By using the new representation,a computable error bound for the remainder in the uniform asymptotic expansion of the modified Bessel function of purely imaginary order is derived.
基金The authors would like to thank the anonymous referees for their careful reading and comments. This work of the first author was supported in part by the National Natural Science Foundation of China （Grant Nos. 11671246, 91730303, 11371102） and the work of the second author was supported in part by the National Natural Science Foundation of China （Grant Nos. 91730304, 11371102, 91330201）.
文摘Because of its vital role of the trust-region subproblem （TRS） in various applications, for example, in optimization and in ill-posed problems, there are several factorization-free algorithms for solving the large-scale sparse TRS. The truncated Lanczos approach proposed by N. I. M. Gould, S. Lucidi, M. Roma, and P. L. Toint [SIAM J. Optim., 1999, 9： 504-525] is a natural extension of the classical Lanczos method for the symmetric linear system and eigenvalue problem and, indeed follows the classical Rayleigh-Ritz procedure for eigenvalue computations. It consists of 1） projecting the original TRS to the Krylov subspa^es to yield smaller size TRS＇s and then 2） solving the resulted TRS＇s to get the approximates of the original TRS. This paper presents a posterior error bounds for both the global optimal value and the optimal solution between the original TRS and their projected counterparts. Our error bounds mainly rely on the factors from the Lanczos process as well as the data of the original TRS and, could be helpful in designing certain stopping criteria for the truncated Lanczos approach.
基金Project supported by the National Natural Science Foundation of China(No.10876100)
文摘Based on the concept of constitutive relation error along with the residual of both origin and dual problems, a goal-oriented error estimation method with extended degrees of freedom is developed in this paper. It leads to high quality local error bounds in the problem of fracture mechanics simulation with extended finite element method （XFEM）, which involves enrichment to solve a stress singularity in the crack. Since goal-oriented error estimation with enriched degrees of freedom gives us a chance to evaluate the XFEM simulation, the stress intensity factor calculated by two kinds of XFEM programs developed by ourselves and by commercial code ABAQUS are compared in this work. By comparing the reliability of the stress intensity factor calculation, the accuracy of two programs in different cases is evaluated and the source of error is discussed. A 2-dimensional XFEM example is given to illustrate the computational procedure.
文摘This paper investigates double sampling series derivatives for bivariate functions defined on R2 that are in the Bernstein space. For this sampling series, we estimate some of the pointwise and uniform bounds when the function satisfies some decay conditions. The truncated series of this formula allow us to approximate any order of partial derivatives for function from Bernstein space using only a finite number of samples from the function itself. This sampling formula will be useful in the approximation theory and its applications, especially after having the truncation error well-established. Examples with tables and figures are given at the end of the paper to illustrate the advantages of this formula.
文摘Due to their complex structure,2-D models are challenging to work with;additionally,simulation,analysis,design,and control get increasingly difficult as the order of the model grows.Moreover,in particular time intervals,Gawronski and Juang’s time-limited model reduction schemes produce an unstable reduced-order model for the 2-D and 1-D models.Researchers revealed some stability preservation solutions to address this key flaw which ensure the stability of 1-D reduced-order systems;nevertheless,these strategies result in large approximation errors.However,to the best of the authors’knowledge,there is no literature available for the stability preserving time-limited-interval Gramian-based model reduction framework for the 2-D discrete-time systems.In this article,2-D models are decomposed into two separate sub-models(i.e.,two cascaded 1-D models)using the condition of minimal rank-decomposition.Model reduction procedures are conducted on these obtained two 1-D sub-models using limited-time Gramian.The suggested methodology works for both 2-D and 1-D models.Moreover,the suggested methodology gives the stability of the reduced model as well as a priori error-bound expressions for the 2-D and 1-D models.Numerical results and comparisons between existing and suggested methodologies are provided to demonstrate the effectiveness of the suggested methodology.
