Approximation of conic section by quartic Bzier curve with endpoints continuity condition

A new method for approximation of conic section by quartic B′ezier curve is presented, based on the quartic B′ezier approximation of circular arcs. Here we give an upper bound of the Hausdorff distance between the conic section and the approximation curve, and show that the error bounds have the approximation order of eight. Furthermore, our method yields quartic G2 continuous spline approximation of conic section when using the subdivision scheme,and the effectiveness of this method is demonstrated by some numerical examples.     

CAN A CUBIC SPLINE CURVE BE G3

This paper proposes a method to construct an G³cubic spline curve from any given open control polygon.For any two inner Bezier points on each edge of a control polygon,we can de ne each Bezier junction point such that the spline curve is G2-continuous.Then by suitably choosing the inner Bezier points,we can construct a global G³spline curve.The curvature combs and curvature plots show the advantage of the G³cubic spline curve in contrast with the traditional C2 cubic spline curve.     

The Nother and Riemann-Roch type theorems for piecewise algebraic curve

A piecewise algebraic curve is a curve determined by the zero set of a bivariate spline function. In this paper, the Nother type theorems for Cμpiecewise algebraic curves are obtained. The theory of the linear series of sets of places on the piecewise algebraic curve is also established. In this theory, singular cycles are put into the linear series, and a complete series of the piecewise algebraic curves consists of all effective ordinary cycles in an equivalence class and all effective singular cycles which are equivalent specifically to any effective ordinary cycle in the equivalence class. This theory is a generalization of that of linear series of the algebraic curve. With this theory and the fundamental theory of multivariate splines on smoothing cofactors and global conformality conditions, and the results on the general expression of multivariate splines, we get a formula on the index, the order and the dimension of a complete series of the irreducible Cμpiecewise algebraic curves and the degree, the genus and the smoothness of the curves, hence the Riemann-Roch type theorem of the Cμpiecewise algebraic curve is established.     

Estimation of the Bezout number for piecewise algebraic curve

A piecewise algebraic curve is a curve determined by the zero set of a bivariate spline function.In this paper.a coniecture on trianguation is confirmed The relation between the piecewise linear algebraiccurve and four-color conjecture is also presented.By Morgan-Scott triangulation, we will show the instabilityof Bezout number of piecewise algebraic curves. By using the combinatorial optimization method,an upper     

Existence and Blowup of Solutions for Neutral Partial Integro-differential Equations with State-dependent Delay

In this paper, we study the existence and blowup of solutions for a neutral partial functional integro-differential equation with state-dependent delay in Banach space. The mild solutions are obtained by Sadovskii fixed point theorem under compactness condition for the resolvent operator, the theory of fractional power and α-norm are also used in the discussion since the nonlinear terms of the system involve spacial derivatives. The strong solutions are obtained under the lipschitz condition. In addition, based on the local existence result and a piecewise extended method, we achieve a blowup alternative result as well for the considered equation. Finally, an example is provided to illustrate the application of the obtained results.     

Degree elevation from Bzier curve to C-Bzier curve with corner cutting form

The existing results of curve degree elevation mainly focus on the degree of algebraic polynomials. The paper considers the elevation of degree of the trigonometric polynomial, from a Bzier curve on the algebraic polynomial space, to a C-B′ezier curve on the algebraic and trigonometric polynomial space. The matrix of degree elevation is obtained by an operator presentation and a derivation pyramid. It possesses not a recursive presentation but a direct expression. The degree elevation process can also be represented as a corner cutting form.     

THE REDUCED BASIS TECHNIQUE AS A COARSE SOLVER FOR PARAREAL IN TIME SIMULATIONS

In this paper, we extend the reduced basis methods for parameter dependent problems to the parareal in time algorithm introduced by Lions et al. [12] and solve a nonlinear evolutionary parabolic partial differential equation. The fine solver is based on the finite element method or spectral element method in space and a semi-implicit Runge-Kutta scheme in time. The coarse solver is based on a semi-implicit scheme in time and the reduced basis approximation in space. Of[line-online procedures are developed, and it is proved that the computational complexity of the on-line stage depends only on the dimension of the reduced basis space （typically small）. Parareal in time algorithms based on a multi-grids finite element method and a multi-degrees finite element method are also presented. Some numerical results are reported.     

Adaptive local linear quantile regression

In this paper we propose a new method of local linear adaptive smoothing for nonparametric conditional quantile regression. Some theoretical properties of the procedure are investigated. Then we demonstrate the performance of the method on a simulated example and compare it with other methods. The simulation results demonstrate a reasonable performance of our method proposed especially in situations when the underlying image is piecewise linear or can be approximated by such images. Generally speaking, our method outperforms most other existing methods in the sense of the mean square estimation (MSE) and mean absolute estimation (MAE) criteria. The procedure is very stable with respect to increasing noise level and the algorithm can be easily applied to higher dimensional situations.     

Approximation for counts of head runs

In this paper, we study the count of head runs up to a fixed time in a two-state stationary Markov chain. We prove that in total variance distance, the negative binomial, Poisson and binomial distributions are appropriate approximations according to the relation of the variance and mean of the count, generalizing earlier results in previous literatures. The proof is based on Stein’s method and coupling.     

A FINITE DIFFERENCE SCHEME FOR SOLVING THE NONLINEAR POISSON-BOLTZMANN EQUATION MODELING CHARGED SPHERES

In this work, we propose an efficient numerical method for computing the electrostaticinteraction between two like-charged spherical particles which is governed by the nonlinearPoisson-Boltzmann equation. The nonlinear problem is solved by a monotone iterativemethod which leads to a sequence of linearized equations. A modified central finite differ-ence scheme is developed to solve the linearized equations on an exterior irregular domainusing a uniform Cartesian grid. With uniform grids, the method is simple, and as aconsequence, multigrid solvers can be employed to speed up the convergence. Numericalexperiments on cases with two isolated spheres and two spheres confined in a chargedcylindrical pore are carried out using the proposed method. Our numerical schemes arefound efficient and the numerical results are found in good agreement with the previouspublished results.     

$G^0$条件下最接近给定平面B\'ezier曲线的PH曲线

本文讨论了分别利用Gauss-Legendre多边形和Gauss-Lobatto多边形, 在$G^0$条件下找到最接近给定平面B\''ezier曲线的五次PH曲线,无论是否指定弧长.通过计算给定B\''ezier曲线的Gauss-Legendre或Gauss-Lobatto多边形的顶点与PH曲线的顶点之间的平方差之和,可以将此问题表述为带有两个或三个二次约束的多项式优化问题,并且此问题由拉格朗日乘子法和牛顿-拉弗森迭代法有效地解决.文中给出了几个计算实例来说明优化方法的实现.计算结果表明,与B\''ezier控制多边形相比,使用Gauss-Legendre和Gauss-Lobatto多边形的方法可以在$G^0$条件下产生更接近给定B\''ezier曲线的PH曲线,且弧长更接近.此外,还可以实现具有预定弧长的良好近似.     

Interpolation by $G^2$ Quintic Pythagorean-Hodograph Curves

In this paper, the $G^2$ interpolation by Pythagorean-hodograph (PH) quintic curves in $\mathbb{R}^d$, $d ≥2$, is considered. The obtained results turn out as a useful tool in practical applications. Independently of the dimension $d$, they supply a $G^2$ quintic PH spline that locally interpolates two points, two tangent directions and two curvature vectors at these points. The interpolation problem considered is reduced to a system of two polynomial equations involving only tangent lengths of the interpolating curve as unknowns. Although several solutions might exist, the way to obtain the most promising one is suggested based on a thorough asymptotic analysis of the smooth data case. The numerical algorithm traces this solution from a particular set of data to the general case by a homotopy continuation method. Numerical examples confirm the efficiency of the proposed method.     

平面三次Pythagorean-Hodograph Hyperbolic曲线

本文基于Pythagorean-hodograph (PH)曲线和代数双曲线的良好几何特性,构造了Pythagorean-Hodograph Hyperbolic (PH-H)曲线,并给出了PH-H曲线的定义以及相应性质.同时,分别利用Hyperbolic基函数和Algebraic Hyperbolic (AH) B\''ezier基函数,得到了平面三次AH B\''ezier曲线为PH曲线的两个不同的充要条件.此外,三次PH-H曲线也被用于求解具有确定解的$G^1$ Hermite插值问题.文中给出了具体实例来说明我们的方法.     

树和单圈图的斜谱矩

给定图$G$,对图$G$的每条边确定一个方向,称为$G$的定向图$G^\sigma$, $G$称为$G^\sigma$的基础图. $G^\sigma$的斜邻接矩阵$S(G^\sigma)$是反对称矩阵,其特征值是0或纯虚数. $S(G^\sigma)$所有特征值的$k$次幂之和称为$G^\sigma$的$k$阶斜谱矩,其中$k$是非负整数.斜谱矩序列可用于对图进行排序.本文主要研究定向树和定向单圈图的斜谱矩,并对这两类图的斜谱矩序列依照字典序进行排序.首先确定了直径为$d$的树作为基础图的所有定向树中,斜谱矩序最大的$2\lfloor\frac{d}{4}\rfloor$个图; 然后确定以围长为$g$的单圈图作为基础图的所有定向单圈图中, 斜谱矩序最大的$2\lfloor\frac{g}{4}\rfloor+1$个图.     

三次Pythagorean Hodograph 曲线在给定总弧长下的$G^2$拼接

Pythagorean-hodograph (PH)曲线因其在弧长和等距线计算方面的优势而被广泛应用于曲线建模中.本文讨论了在总弧长约束下的三次PH曲线$G^2$连续拼接问题.具体地说,给定两个端点和一个拼接点,构造两条三次PH曲线,使其在指定总弧长下插值两个端点,并且在连接点处是$G^2$连续的.这也可以看作是一个曲线延拓问题.根据三次PH曲线的弧长公式和$G^2$连续条件,最终将问题转化为了一个带有约束的极小值问题,同时我们给出了几个具体例子来说明该方法.     

A weak Galerkin method for second order elliptic problems with polynomial reduction

The second order elliptic equation, which is also know as the diffusion-convection equation, is of great interest in many branches of physics and industry. In this paper, we use the weak Galerkin finite element method to study the general second order elliptic equation. A weak Galerkin finite element method is proposed and analyzed. This scheme features piecewise polynomials of degree $k\geq 1$ on each element and piecewise polynomials of degree $k-1\geq 0$ on each edge or face of the element. Error estimates of optimal order of convergence rate are established in both discrete $H^1$ and standard $L^2$ norm. The paper also presents some numerical experiments to verify the efficiency of the method.     

A path-transformation for random walks and the Robinson-Schensted correspondence

The author and Marc Yor recently introduced a path-transformation with the property that, for belonging to a certain class of random walks on , the transformed walk has the same law as the original walk conditioned never to exit the Weyl chamber . In this paper, we show that is closely related to the Robinson-Schensted algorithm, and use this connection to give a new proof of the above representation theorem. The new proof is valid for a larger class of random walks and yields additional information about the joint law of and . The corresponding results for the Brownian model are recovered by Donsker's theorem. These are connected with Hermitian Brownian motion and the Gaussian Unitary Ensemble of random matrix theory. The connection we make between the path-transformation and the Robinson-Schensted algorithm also provides a new formula and interpretation for the latter. This can be used to study properties of the Robinson-Schensted algorithm and, moreover, extends easily to a continuous setting.

     

Piecewise Rational Approximations of Real Algebraic Curves

1.IntroductionAnaJgebraicplanecurveCofdegreedinn2isimplicitlydefinedbyasinglepolynomialequationf(x,y)=Oofdegreedwithcoefficientsinn.Arationalalgebraiccurveofdegreedinn2canadditionaJlybedefinedbyrationalparametricequationswhicharegivenas(x=G1(u),y=G2(u)),whereG1andG2arerationalfunctionsinuofdegreed,i.e-,eachisaquotientofpolynomiaJ8inuofmtalmumdegreedwithcoefficientsinn.ffetionalcurvesaxeonlyasubsetofimplicitalgebraiccurvesofdegreed+1.Whi1eaJldegreetwocurves(conics)arerational,oIilyasubsetof…     

RECOVERY BASED FINITE ELEMENT METHOD FOR BIHARMONIC EQUATION IN 2D

We design and numerically validate a recovery based linear finite element method for solving the biharmonic equation.The main idea is to replace the gradient operator▽on linear finite element space by G(▽)in the weak formulation of the biharmonic equation,where G is the recovery operator which recovers the piecewise constant function into the linear finite element space.By operator G,Laplace operator△is replaced by▽·G(▽).Furthermore,the boundary condition on normal derivative▽u-n is treated by the boundary penalty method.The explicit matrix expression of the proposed method is also introduced.Numerical examples on the uniform and adaptive meshes are presented to illustrate the correctness and effectiveness of the proposed method.     

和图、整和图与模和图的几个结果

Let N denote the set of positive integers. The sum graph G^＋（S） of a finite subset S belong to N is the graph （S, E） with uv ∈ E if and only if u ＋ v ∈ S. A graph G is said to be a sum graph if it is isomorphic to the sum graph of some S belong to N. By using the set Z of all integers instead of N, we obtain the definition of the integral sum graph. A graph G = （V, E） is a mod sum graph if there exists a positive integer z and a labelling, λ, of the vertices of G with distinct elements from {0, 1, 2,..., z - 1} so that uv ∈ E if and only if the sum, modulo z, of the labels assigned to u and v is the label of a vertex of G. In this paper, we prove that flower tree is integral sum graph. We prove that Dutch m-wind-mill （Dm） is integral sum graph and mod sum graph, and give the sum number of Dm.