We present a general formula to generate the family of odd-point ternary approximating subdivision schemes with a shape parameter for describing curves. The influence of parameter to the limit curves and the sufficien...We present a general formula to generate the family of odd-point ternary approximating subdivision schemes with a shape parameter for describing curves. The influence of parameter to the limit curves and the sufficient conditions of the continuities from C0 to C5 of 3- and 5-point schemes are discussed. Our family of 3-point and 5-point ternary schemes has higher order of derivative continuity than the family of 3-point and 5-point schemes presented by [Jian-ao Lian, On a-ary subdivision for curve design: II. 3-point and 5-point interpolatory schemes, Applications and Applied Mathematics: An International Journal, 3(2), 2008, 176-187]. Moreover, a 3-point ternary cubic B-spline is special case of our family of 3-point ternary scheme. The visual quality of schemes with examples is also demonstrated.展开更多
In this article, the objective is to introduce an algorithm to produce the quaternary m-point (for any integer m>1) approximating subdivision schemes, which have smaller support and higher smoothness, comparing to ...In this article, the objective is to introduce an algorithm to produce the quaternary m-point (for any integer m>1) approximating subdivision schemes, which have smaller support and higher smoothness, comparing to binary and ternary schemes. The proposed algorithm has been derived from uniform B-spline basis function using the Cox-de Boor recursion formula. In order to determine the convergence and smoothness of the proposed schemes, the Laurent polynomial method has been used.展开更多
In this paper, we propose and analyze a subdivision scheme which unifies 3-point approximating subdivision schemes of any arity in its compact form and has less support, computational cost and error bounds.? The usefu...In this paper, we propose and analyze a subdivision scheme which unifies 3-point approximating subdivision schemes of any arity in its compact form and has less support, computational cost and error bounds.? The usefulness of the scheme is illustrated by considering different examples along with its comparison with the established subdivision schemes. Moreover, B-splines of degree 4and well known 3-point schemes [1, 2, 3, 4, 6, 11, 12, 14, 15] are special cases of our proposed scheme.展开更多
In this paper, we propose a three point approximating subdivision scheme, with three shape parameters, that unifies three different existing three point approximating schemes. Some sufficient conditions for subdivisio...In this paper, we propose a three point approximating subdivision scheme, with three shape parameters, that unifies three different existing three point approximating schemes. Some sufficient conditions for subdivision curve C0 to C3 continuity and convergence of the scheme for generating tensor product surfaces for certain ranges of parameters by using Laurent polynomial method are discussed. The systems of curve and surface design based on our scheme have been developed successfully in garment CAD especially for clothes modelling.展开更多
A general formula for 4-point α-Ary approximating subdivision scheme for curve designing is introduced for any arity α≥2. The new scheme is extension of B-spline of degree 6. Laurent polynomial method is used to in...A general formula for 4-point α-Ary approximating subdivision scheme for curve designing is introduced for any arity α≥2. The new scheme is extension of B-spline of degree 6. Laurent polynomial method is used to investigate the continuity of the scheme. The variety of effects can be achieved in correspondence for different values of parameter. The applications of the proposed scheme are illustrated in comparison with the established subdivision schemes.展开更多
A new method for approximating the inerse Laplace transform is presented. We first change our Laplace transform equation into a convolution type integral equation, where Tikhonov regularization techniques and the Four...A new method for approximating the inerse Laplace transform is presented. We first change our Laplace transform equation into a convolution type integral equation, where Tikhonov regularization techniques and the Fourier transformation are easily applied. We finally obtain a regularized approximation to the inverse Laplace transform as finite sum展开更多
In this paper, we present an algorithm for reconstruction of B-spline surface such that it interpolates the four given bound- ary curves and simultaneously approximates some given inner points. The main idea of our me...In this paper, we present an algorithm for reconstruction of B-spline surface such that it interpolates the four given bound- ary curves and simultaneously approximates some given inner points. The main idea of our method is： first, we construct an initial surface which interpolates the four given boundary curves; then, while keeping the boundary control points of the initial surface un- changed, we reposition the inner control points of the surface with energy optimization method. Examples show that our algorithm is practicable and effective.展开更多
This paper investigates some approximation properties and learning rates of Lipschitz kernel on the sphere. A perfect convergence rate on the shifts of Lipschitz kernel on the sphere, which is faster than O（n-1/2）, ...This paper investigates some approximation properties and learning rates of Lipschitz kernel on the sphere. A perfect convergence rate on the shifts of Lipschitz kernel on the sphere, which is faster than O（n-1/2）, is obtained, where n is the number of parameters needed in the approximation. By means of the approximation, a learning rate of regularized least square algorithm with the Lipschitz kernel on the sphere is also deduced.展开更多
This paper presents an interpolation-based method(IBM)for approximating some trigonometric functions or their integrals as well.It provides two-sided bounds for each function,which also achieves much better approximat...This paper presents an interpolation-based method(IBM)for approximating some trigonometric functions or their integrals as well.It provides two-sided bounds for each function,which also achieves much better approximation effects than those of prevailing methods.In principle,the IBM can be applied for bounding more bounded smooth functions and their integrals as well,and its applications include approximating the integral of sin(x)/x function and improving the famous square root inequalities.展开更多
We consider the problem of approximating two, possibly unrelated probability distributions from a single complex-valued function and its Fourier transform. We show that this problem always has a solution within a spec...We consider the problem of approximating two, possibly unrelated probability distributions from a single complex-valued function and its Fourier transform. We show that this problem always has a solution within a specified degree of accuracy, provided the distributions satisfy the necessary regularity conditions. We describe the algorithm and construction of and provide examples of approximating several pairs of distributions using the algorithm.展开更多
In this paper, the author presents a class of stationary ternary 4-point approximating symmetrical subdivision algorithm that reproduces cubic polynomials. By these subdivision algorithms at each refinement step, new ...In this paper, the author presents a class of stationary ternary 4-point approximating symmetrical subdivision algorithm that reproduces cubic polynomials. By these subdivision algorithms at each refinement step, new insertion control points on a finer grid are computed by weighted sums of already existing control points. In the limit of the recursive process, data is defined on a dense set of point, The objective is to find an improved subdivision approximating algorithm which has a smaller support and a higher approximating order. The author chooses a ternary scheme because the best way to get a smaller support is to pass from the binary to ternary or complex algorithm and uses polynomial reproducing propriety to get higher approximation order. Using the cardinal Lagrange polynomials the author has proposed a 4-point approximating ternary subdivision algorithm and found that a higher regularity of limit function does not guarantee a higher approximating order. The proposed 4-point ternary approximation subdivision family algorithms with the mask a have the limit function in C2 and have approximation order 4. Also the author has demonstrated that in this class there is no algorithm whose limit function is in C3. It can be seen that this stationary ternary 4-point approximating symmetrical subdivision algorithm has a lower computational cost than the 6-point binary approximation subdivision algorithm for a greater range of points.展开更多
In this paper we discuss the problem of approximating distributions in certain discretelife classes.Let X be a random variable（r.v.）taking nonnegative integers,EX=μ.Suppose Yis a geometric r.v.taking nonnegative in...In this paper we discuss the problem of approximating distributions in certain discretelife classes.Let X be a random variable（r.v.）taking nonnegative integers,EX=μ.Suppose Yis a geometric r.v.taking nonnegative integers and with the same mean μ.Denote B<sub>2</sub>=（?）,α=1-（B<sub>2</sub>）/（μ<sup>2</sup>）,Δ（X,Y）=（?）|P（X≥k）-P（Y≥k）|.The main results are:1)If X∈（D） DMRL （discrete decreasing mean residual life）,thenΔ（X,Y）≤max(α,1-e<sup>-2α</sup>).2)If X∈（D） NBUE （discrete new better than use in expectation） thenΔ（X,Y）≤max(α,1-e<sup>-（2α）<sup>1/2</sup></sup>.展开更多
In this paper,we study a class of dynamic games consisting of finite agents under a stochastic growth model with jumps.The jump process in the dynamics of the capital stock of each agent models announcements regarding...In this paper,we study a class of dynamic games consisting of finite agents under a stochastic growth model with jumps.The jump process in the dynamics of the capital stock of each agent models announcements regarding each agent in the game occur at Poisson distributed random times.The aim of each agent is to maximize her objective functional with mean-field interactions by choosing an optimal consumption strategy.We prove the existence of a fixed point related to the so-called consistence condition as the number of agents goes large.Building upon the fixed point,we establish an optimal feedback consumption strategy for all agents which is in fact an approximating Nash equilibrium which describes strategies for each agent such that no agent has any incentive to change her strategy.展开更多
An approximating algorithm on handling 3-D points cloud data was discussed for reconstruction of complicated curved surface. In this algorithm, the coordinate information of nodes both in internal and external regions...An approximating algorithm on handling 3-D points cloud data was discussed for reconstruction of complicated curved surface. In this algorithm, the coordinate information of nodes both in internal and external regions of partition interpolation was used to realize minimized least squares approximation error of surface fitting. The changes between internal and external interpolation regions are continuous and smooth. Meanwhile, surface shape has properties of local controllability, variation reduction, and convex hull. The practical example shows that this algorithm possesses a higher accuracy of curved surface reconstruction and also improves the distortion of curved surface reconstruction when typical approximating algorithms and unstable operation are used.展开更多
In this paper, some approximating analyses are considered in a class of repairable systems.By using the properties and the techniques of partial orderings for random variables, we find some conditions under which some...In this paper, some approximating analyses are considered in a class of repairable systems.By using the properties and the techniques of partial orderings for random variables, we find some conditions under which some reliability indices of a system are less (or larger) than the corresponding indices of another system; and then, we obtain the bounds of the main reliability indices of a general system.展开更多
During the use of robotics in applications such as antiterrorism or combat,a motion-constrained pursuer vehicle,such as a Dubins unmanned surface vehicle(USV),must get close enough(within a prescribed zero or positive...During the use of robotics in applications such as antiterrorism or combat,a motion-constrained pursuer vehicle,such as a Dubins unmanned surface vehicle(USV),must get close enough(within a prescribed zero or positive distance)to a moving target as quickly as possible,resulting in the extended minimum-time intercept problem(EMTIP).Existing research has primarily focused on the zero-distance intercept problem,MTIP,establishing the necessary or sufficient conditions for MTIP optimality,and utilizing analytic algorithms,such as root-finding algorithms,to calculate the optimal solutions.However,these approaches depend heavily on the properties of the analytic algorithm,making them inapplicable when problem settings change,such as in the case of a positive effective range or complicated target motions outside uniform rectilinear motion.In this study,an approach employing a high-accuracy and quality-guaranteed mixed-integer piecewise-linear program(QG-PWL)is proposed for the EMTIP.This program can accommodate different effective interception ranges and complicated target motions(variable velocity or complicated trajectories).The high accuracy and quality guarantees of QG-PWL originate from elegant strategies such as piecewise linearization and other developed operation strategies.The approximate error in the intercept path length is proved to be bounded to h^(2)/(4√2),where h is the piecewise length.展开更多
The paper is the continuation of the previous article in which the stretched field method on is developed to solve the equations for grossly determiners. The first degree result is the same as the Lundgren’s small pa...The paper is the continuation of the previous article in which the stretched field method on is developed to solve the equations for grossly determiners. The first degree result is the same as the Lundgren’s small parameter expansion展开更多
Correlations between magnetic susceptibility and contents of magnetic minerals in rocks are important in interpreting magnetic anomalies in geophysical exploration and understanding magnetic behaviors of rocks in rock...Correlations between magnetic susceptibility and contents of magnetic minerals in rocks are important in interpreting magnetic anomalies in geophysical exploration and understanding magnetic behaviors of rocks in rock magnetism studies. Previous studies were focused on describing such correlations using a sole expression or a set of expressions through statistical analysis. In this paper, we use neural network techniques to approximate the nonlinear relations between susceptibility and magnetite and/or hematite contents in rocks. This is the first time that neural networks are used for such study in rock magnetism and magnetic petrophysics. Three multilayer perceptrons are trained for producing the best possible estimation on susceptibility based on magnetic contents. These trained models are capable of producing accurate mappings between susceptibility and magnetite and/or hematite contents in rocks. This approach opens a new way of quantitative simulation using neural networks in rock magnetism and petrophysical research and applications.展开更多
In this paper, we establish existence and uniqueness of the mild solutions to a class of neutral stochastic evolution equations driven by Poisson random measures in some Hilbert space. Moreover, we adopt the Faedo-Gal...In this paper, we establish existence and uniqueness of the mild solutions to a class of neutral stochastic evolution equations driven by Poisson random measures in some Hilbert space. Moreover, we adopt the Faedo-Galerkin scheme to approximate the solutions.展开更多
We develop efficient and accurate sum-of-exponential(SOE)approximations for the Gaussian using rational approximation of the exponential function on the negative real axis.Six digit accuracy can be obtained with eight...We develop efficient and accurate sum-of-exponential(SOE)approximations for the Gaussian using rational approximation of the exponential function on the negative real axis.Six digit accuracy can be obtained with eight terms and ten digit accuracy can be obtained with twelve terms.This representation is of potential interest in approximation theory but we focus here on its use in accelerating the fast Gauss transform(FGT)in one and two dimensions.The one-dimensional scheme is particularly straightforward and easy to implement,requiring only twenty-four lines of MATLAB code.The two-dimensional version requires some care with data structures,but is significantly more efficient than existing FGTs.Following a detailed presentation of the theoretical foundations,we demonstrate the performance of the fast transforms with several numerical experiments.展开更多
文摘We present a general formula to generate the family of odd-point ternary approximating subdivision schemes with a shape parameter for describing curves. The influence of parameter to the limit curves and the sufficient conditions of the continuities from C0 to C5 of 3- and 5-point schemes are discussed. Our family of 3-point and 5-point ternary schemes has higher order of derivative continuity than the family of 3-point and 5-point schemes presented by [Jian-ao Lian, On a-ary subdivision for curve design: II. 3-point and 5-point interpolatory schemes, Applications and Applied Mathematics: An International Journal, 3(2), 2008, 176-187]. Moreover, a 3-point ternary cubic B-spline is special case of our family of 3-point ternary scheme. The visual quality of schemes with examples is also demonstrated.
文摘In this article, the objective is to introduce an algorithm to produce the quaternary m-point (for any integer m>1) approximating subdivision schemes, which have smaller support and higher smoothness, comparing to binary and ternary schemes. The proposed algorithm has been derived from uniform B-spline basis function using the Cox-de Boor recursion formula. In order to determine the convergence and smoothness of the proposed schemes, the Laurent polynomial method has been used.
文摘In this paper, we propose and analyze a subdivision scheme which unifies 3-point approximating subdivision schemes of any arity in its compact form and has less support, computational cost and error bounds.? The usefulness of the scheme is illustrated by considering different examples along with its comparison with the established subdivision schemes. Moreover, B-splines of degree 4and well known 3-point schemes [1, 2, 3, 4, 6, 11, 12, 14, 15] are special cases of our proposed scheme.
基金Supported by the Indigenous PhD Scholarship Scheme of Higher Education Commission (HEC) Pakistan
文摘In this paper, we propose a three point approximating subdivision scheme, with three shape parameters, that unifies three different existing three point approximating schemes. Some sufficient conditions for subdivision curve C0 to C3 continuity and convergence of the scheme for generating tensor product surfaces for certain ranges of parameters by using Laurent polynomial method are discussed. The systems of curve and surface design based on our scheme have been developed successfully in garment CAD especially for clothes modelling.
文摘A general formula for 4-point α-Ary approximating subdivision scheme for curve designing is introduced for any arity α≥2. The new scheme is extension of B-spline of degree 6. Laurent polynomial method is used to investigate the continuity of the scheme. The variety of effects can be achieved in correspondence for different values of parameter. The applications of the proposed scheme are illustrated in comparison with the established subdivision schemes.
文摘A new method for approximating the inerse Laplace transform is presented. We first change our Laplace transform equation into a convolution type integral equation, where Tikhonov regularization techniques and the Fourier transformation are easily applied. We finally obtain a regularized approximation to the inverse Laplace transform as finite sum
基金Supported by the Natural Science Foundation of Hebei Province
文摘In this paper, we present an algorithm for reconstruction of B-spline surface such that it interpolates the four given bound- ary curves and simultaneously approximates some given inner points. The main idea of our method is： first, we construct an initial surface which interpolates the four given boundary curves; then, while keeping the boundary control points of the initial surface un- changed, we reposition the inner control points of the surface with energy optimization method. Examples show that our algorithm is practicable and effective.
基金Supported by the National Natural Science Foundation of China(61272023,91330118)
文摘This paper investigates some approximation properties and learning rates of Lipschitz kernel on the sphere. A perfect convergence rate on the shifts of Lipschitz kernel on the sphere, which is faster than O（n-1/2）, is obtained, where n is the number of parameters needed in the approximation. By means of the approximation, a learning rate of regularized least square algorithm with the Lipschitz kernel on the sphere is also deduced.
基金Supported by the National Natural Science Foundation of China(61672009,61502130).
文摘This paper presents an interpolation-based method(IBM)for approximating some trigonometric functions or their integrals as well.It provides two-sided bounds for each function,which also achieves much better approximation effects than those of prevailing methods.In principle,the IBM can be applied for bounding more bounded smooth functions and their integrals as well,and its applications include approximating the integral of sin(x)/x function and improving the famous square root inequalities.
文摘We consider the problem of approximating two, possibly unrelated probability distributions from a single complex-valued function and its Fourier transform. We show that this problem always has a solution within a specified degree of accuracy, provided the distributions satisfy the necessary regularity conditions. We describe the algorithm and construction of and provide examples of approximating several pairs of distributions using the algorithm.
文摘In this paper, the author presents a class of stationary ternary 4-point approximating symmetrical subdivision algorithm that reproduces cubic polynomials. By these subdivision algorithms at each refinement step, new insertion control points on a finer grid are computed by weighted sums of already existing control points. In the limit of the recursive process, data is defined on a dense set of point, The objective is to find an improved subdivision approximating algorithm which has a smaller support and a higher approximating order. The author chooses a ternary scheme because the best way to get a smaller support is to pass from the binary to ternary or complex algorithm and uses polynomial reproducing propriety to get higher approximation order. Using the cardinal Lagrange polynomials the author has proposed a 4-point approximating ternary subdivision algorithm and found that a higher regularity of limit function does not guarantee a higher approximating order. The proposed 4-point ternary approximation subdivision family algorithms with the mask a have the limit function in C2 and have approximation order 4. Also the author has demonstrated that in this class there is no algorithm whose limit function is in C3. It can be seen that this stationary ternary 4-point approximating symmetrical subdivision algorithm has a lower computational cost than the 6-point binary approximation subdivision algorithm for a greater range of points.
基金This project was supported by grant No.1880492 from the National Natural Science Foundation of China
文摘In this paper we discuss the problem of approximating distributions in certain discretelife classes.Let X be a random variable（r.v.）taking nonnegative integers,EX=μ.Suppose Yis a geometric r.v.taking nonnegative integers and with the same mean μ.Denote B<sub>2</sub>=（?）,α=1-（B<sub>2</sub>）/（μ<sup>2</sup>）,Δ（X,Y）=（?）|P（X≥k）-P（Y≥k）|.The main results are:1)If X∈（D） DMRL （discrete decreasing mean residual life）,thenΔ（X,Y）≤max(α,1-e<sup>-2α</sup>).2)If X∈（D） NBUE （discrete new better than use in expectation） thenΔ（X,Y）≤max(α,1-e<sup>-（2α）<sup>1/2</sup></sup>.
基金Supported by Natural Science Foundation of China(Grant No.11971368)the Key Research Program of Frontier Sciences,CAS(Grant No.QYZDB-SSW-SYS009)。
文摘In this paper,we study a class of dynamic games consisting of finite agents under a stochastic growth model with jumps.The jump process in the dynamics of the capital stock of each agent models announcements regarding each agent in the game occur at Poisson distributed random times.The aim of each agent is to maximize her objective functional with mean-field interactions by choosing an optimal consumption strategy.We prove the existence of a fixed point related to the so-called consistence condition as the number of agents goes large.Building upon the fixed point,we establish an optimal feedback consumption strategy for all agents which is in fact an approximating Nash equilibrium which describes strategies for each agent such that no agent has any incentive to change her strategy.
基金Supported by the Guangxi Provincial Natural Science Fund of China (No. 0832096)the Scientific Research Project of Education Department of Guangxi Province of China (No. 200708LX151)the Science Fund of Wuzhou University (No. 2008B008)
文摘An approximating algorithm on handling 3-D points cloud data was discussed for reconstruction of complicated curved surface. In this algorithm, the coordinate information of nodes both in internal and external regions of partition interpolation was used to realize minimized least squares approximation error of surface fitting. The changes between internal and external interpolation regions are continuous and smooth. Meanwhile, surface shape has properties of local controllability, variation reduction, and convex hull. The practical example shows that this algorithm possesses a higher accuracy of curved surface reconstruction and also improves the distortion of curved surface reconstruction when typical approximating algorithms and unstable operation are used.
文摘In this paper, some approximating analyses are considered in a class of repairable systems.By using the properties and the techniques of partial orderings for random variables, we find some conditions under which some reliability indices of a system are less (or larger) than the corresponding indices of another system; and then, we obtain the bounds of the main reliability indices of a general system.
基金supported by the National Natural Sci‐ence Foundation of China(Grant No.62306325)。
文摘During the use of robotics in applications such as antiterrorism or combat,a motion-constrained pursuer vehicle,such as a Dubins unmanned surface vehicle(USV),must get close enough(within a prescribed zero or positive distance)to a moving target as quickly as possible,resulting in the extended minimum-time intercept problem(EMTIP).Existing research has primarily focused on the zero-distance intercept problem,MTIP,establishing the necessary or sufficient conditions for MTIP optimality,and utilizing analytic algorithms,such as root-finding algorithms,to calculate the optimal solutions.However,these approaches depend heavily on the properties of the analytic algorithm,making them inapplicable when problem settings change,such as in the case of a positive effective range or complicated target motions outside uniform rectilinear motion.In this study,an approach employing a high-accuracy and quality-guaranteed mixed-integer piecewise-linear program(QG-PWL)is proposed for the EMTIP.This program can accommodate different effective interception ranges and complicated target motions(variable velocity or complicated trajectories).The high accuracy and quality guarantees of QG-PWL originate from elegant strategies such as piecewise linearization and other developed operation strategies.The approximate error in the intercept path length is proved to be bounded to h^(2)/(4√2),where h is the piecewise length.
文摘The paper is the continuation of the previous article in which the stretched field method on is developed to solve the equations for grossly determiners. The first degree result is the same as the Lundgren’s small parameter expansion
文摘Correlations between magnetic susceptibility and contents of magnetic minerals in rocks are important in interpreting magnetic anomalies in geophysical exploration and understanding magnetic behaviors of rocks in rock magnetism studies. Previous studies were focused on describing such correlations using a sole expression or a set of expressions through statistical analysis. In this paper, we use neural network techniques to approximate the nonlinear relations between susceptibility and magnetite and/or hematite contents in rocks. This is the first time that neural networks are used for such study in rock magnetism and magnetic petrophysics. Three multilayer perceptrons are trained for producing the best possible estimation on susceptibility based on magnetic contents. These trained models are capable of producing accurate mappings between susceptibility and magnetite and/or hematite contents in rocks. This approach opens a new way of quantitative simulation using neural networks in rock magnetism and petrophysical research and applications.
基金supported by the LPMC at Nankai University and National Natural Science Foundation of China(Grant No. 10671036)
文摘In this paper, we establish existence and uniqueness of the mild solutions to a class of neutral stochastic evolution equations driven by Poisson random measures in some Hilbert space. Moreover, we adopt the Faedo-Galerkin scheme to approximate the solutions.
基金S.Jiang was supported in part by the United States National Science Foundation under grant DMS-1720405.
文摘We develop efficient and accurate sum-of-exponential(SOE)approximations for the Gaussian using rational approximation of the exponential function on the negative real axis.Six digit accuracy can be obtained with eight terms and ten digit accuracy can be obtained with twelve terms.This representation is of potential interest in approximation theory but we focus here on its use in accelerating the fast Gauss transform(FGT)in one and two dimensions.The one-dimensional scheme is particularly straightforward and easy to implement,requiring only twenty-four lines of MATLAB code.The two-dimensional version requires some care with data structures,but is significantly more efficient than existing FGTs.Following a detailed presentation of the theoretical foundations,we demonstrate the performance of the fast transforms with several numerical experiments.
