OnG 2 continuous cubic spline interpolation

In this paper the interpolation byG ² continuous planar cubic Bézier spline curves is studied. The interpolation is based upon the underlying curve points and the end tangent directions only, and could be viewed as an extension of the cubic spline interpolation to the curve case. Two boundary, and two interior points are interpolated per each spline section. It is shown that under certain conditions the interpolation problem is asymptotically solvable, and for a smooth curvef the optimal approximation order is achieved. The practical experiments demonstrate the interpolation to be very satisfactory. Supported in prat by the Ministry of Science and Technology of Slovenjia, and in part by the NSF and SF of National Educational Committee of China.     

A remark on the symplectic blow-up in dimension 4

In this note, we prove that the symplectic blow-up or blow-down in the dimension 4 is rigid, i.e. the symplectic area of the divisor does not exceed the symplectic radius of the neighbourhood on which we do the blow-up or blow-down.Supported in part by the NSF of P. R. China and the Foundation of Chinese Educational Committee for Returned Scholars.     

NURBS approximation of surface/surface intersection curves

We use a combination of both symbolic and numerical techniques to construct degree boundedC ^k -continuous, rational B-spline ε-approximations of real algebraic surface-surface intersection curves. The algebraic surfaces could be either in implicit or rational parametric form. At singular points, we use the classical Newton power series factorizations to determine the distinct branches of the space intersection curve. In addition to singular points, we obtain an adaptive selection of regular points about which the curve approximation yields a small number of curve segments yet achievesC ^k continuity between segments. Details of the implementation of these algorithms and approximation error bounds are also provided. Supported in part by NSF Grants CCR 92.22467, DMS 91-01424, AFOSR Grant F49620-10138 and NASA Grant NAG-1-1473. Supported in part by K.C. Wong Education Foundation, Hong Kong.     

A globally and superlinearly convergent trust region method for LC 1 optimization problems

Abstract. A new trust region algorithm for solving convex LC1 optimization problem is present-ed. It is proved that the algorithm is globally convergent and the rate of convergence is superlin-ear under some reasonable assumptions.     

A parallel method for fast and practical high-order newton interpolation

We present parallel algorithms for the computation and evaluation of interpolating polynomials. The algorithms use parallel prefix techniques for the calculation of divided differences in the Newton representation of the interpolating polynomial. Forn+1 given input pairs, the proposed interpolation algorithm requires only 2 [log(n+1)]+2 parallel arithmetic steps and circuit sizeO(n ²), reducing the best known circuit size for parallel interpolation by a factor of logn. The algorithm for the computation of the divided differences is shown to be numerically stable and does not require equidistant points, precomputation, or the fast Fourier transform. We report on numerical experiments comparing this with other serial and parallel algorithms. The experiments indicate that the method can be very useful for very high-order interpolation, which is made possible for special sets of interpolation nodes.Supported in part by the National Science Foundation under Grant No. NSF DCR-8603722.Supported by the National Science Foundation under Grants No. US NSF MIP-8410110, US NSF DCR85-09970, and US NSF CCR-8717942 and AT&T under Grant AT&T AFFL67Sameh.     

The best Lipschitz constants of Bernstein polynomials and Bezier nets over a given triangle

This paper proved the following three facts about the Lipschitz continuous property of Bernstein polynomials and Bezier nets defined on a triangle: suppose f(P) is a real valued function defined on a triangle T, (1) If f(P) satisfies Lipschitz continuous condition, i.e. f(P)∃Lip_Aα, then the corresponding Bernstein Bezier net f_n∃Lip _Asec ^αφα, here φ is the half of the largest angle of triangle T; (2) If Bernstein Bezier net f_n∃Lip _Bα, then its elevation Bezier net Ef_n∃Lip _Bα; and (3) If f(P)∃Lip _Aα, then the corresponding Bernstein polynomials B_n(f;P)∃Lip _Asec ^αφα, and the constant Asec^αφ is best in some sense. Supported by NSF and SF of National Educational Committee     

An Improved Upper Complexity Bound for the Topology Computation of a Real Algebraic Plane Curve

The computation of the topological shape of a real algebraic plane curve is usually driven by the study of the behavior of the curve around its critical points (which includes also the singular points). In this paper we present a new algorithm computing the topological shape of a real algebraic plane curve whose complexity is better than the best algorithms known. This is due to the avoiding, through a sufficiently good change of coordinates, of real root computations on polynomials with coefficients in a simple real algebraic extension of to deal with the critical points of the considered curve. In fact, one of the main features of this algorithm is that its complexity is dominated by the characterization of the real roots of the discriminant of the polynomial defining the considered curve.     

CONNECTIVITIES OF MINIMAL CAYLEY COSET DIGRAPHS

We prove that the connectivities of minimal Cayley coset digraphs are their regular degrees.     

A B-spline approach for empirical mode decompositions

We propose an alternative B-spline approach for empirical mode decompositions for nonlinear and nonstationary signals. Motivated by this new approach, we derive recursive formulas of the Hilbert transform of B-splines and discuss Euler splines as spline intrinsic mode functions in the decomposition. We also develop the Bedrosian identity for signals having vanishing moments. We present numerical implementations of the B-spline algorithm for an earthquake signal and compare the numerical performance of this approach with that given by the standard empirical mode decomposition. Finally, we discuss several open mathematical problems related to the empirical mode decomposition. Dedicated to Professor Charles A. Micchelli on the occasion of his 60th birthday with friendship and esteem Mathematics subject classification (2000) 94A12. Supported in part by National Aeronautics and Space Administration under grant NAG5-5364, and National Science Foundation under grants NSF0314742 and NSF0312113. Yuesheng Xu: Corresponding author. Supported in part by Natural Science Foundation of China under grant 10371122.     

APPROXIMATE COMMON DIVISORS OF POLYNOMIALS AND DEGREE REDUCTION FOR RATIONAL CURVES

This paper deals with how to perturb a given set of polynomials so as to include a common linear factor. An algorithm is derived for determining such a set of perturbation polyrlomials which are subject to certain constrains at the endpoints of a prescribed parametric interval and minimized in a certain sense. This result can be combined with subdivision technique to obtain a continuous piecewise approximation to a rational curve.     

On the Topology of Real Algebraic Plane Curves

We revisit the problem of computing the topology and geometry of a real algebraic plane curve. The topology is of prime interest but geometric information, such as the position of singular and critical points, is also relevant. A challenge is to compute efficiently this information for the given coordinate system even if the curve is not in generic position. Previous methods based on the cylindrical algebraic decomposition use sub-resultant sequences and computations with polynomials with algebraic coefficients. A novelty of our approach is to replace these tools by Gröbner basis computations and isolation with rational univariate representations. This has the advantage of avoiding computations with polynomials with algebraic coefficients, even in non-generic positions. Our algorithm isolates critical points in boxes and computes a decomposition of the plane by rectangular boxes. This decomposition also induces a new approach for computing an arrangement of polylines isotopic to the input curve. We also present an analysis of the complexity of our algorithm. An implementation of our algorithm demonstrates its efficiency, in particular on high-degree non-generic curves.     

HAMILTONIAN CYCLES AND DECOMPOSITIONS OFCAYLEY DIGRAPHS OF FINITE ABELIAN GROUPS

In this paper, Hamiltonian cycles and decompositions of Cayley digraphs are investigat-ed. Sufficient conditions are given for these two problems respectively. Furthermore, the conditions are also necesaary for 2-regular Cayley disraphs, In addition, some known results about theCartesian products of two directed cycles are also deduced.     

Approximation of infinite delay and Volterra type equations

Summary We consider a class of infinite delay equations of neutral type which includes Volterrra type integral und integrodifferential equations. Using abstract approximation results (cf. Trotter-Kato-type) for strongly continuous semigroups we develop an approximation scheme which is based on approximation of the system state by Laguerre (and Legendre) polynomials. Numerical examples demonstrate the feasibility of the scheme and show infinite order convergence for smooth data.Supported in part by the Air Force Office of Scientific Research under Contracts AFORS-84-0398 and AFORS-85-0303 and the National Aeronautics and Space Administration under NASA Grant NAG-1-517 and by NSF under Grant UINT-8521208Supported in part by the Air Force Office of Scientific Research under Contract AFORS-84-0398 and in part by the Fonds zur Förderung der wissenschaftlichen Forschung, Austria, under project No. S3206     

ON CIRCULANT DIGRAPHS WITH REGULAR AUTOMORPHISM GROUPS

Abstract. We prove that the cyclic group Zn(n≥3) has a k-regular digraph regular     

Almost all Cayley graphs are hamiltonian

It has been conjectured that there is a hamiltonian cycle in every finite connected Cayley graph. In spite of the difficulty in proving this conjecture, we show that almost all Cayley graphs are hamiltonian. That is, as the order n of a groupG approaches infinity, the ratio of the number of hamiltonian Cayley graphs ofG to the total number of Cayley graphs ofG approaches 1.Supported by the National Natural Science Foundation of China, Xinjiang Educational Committee and Xinjiang University.     

Transformation of certain bilinear generating functions

Summary Erdélyi's generalizations of the Hardy-Hille formula are extended to series involving arbitrary coefficients; see(1.6), …,(1.9) below. These identities may be thought of as identities in formal power series. The proofs are simple: each identity in shown to be equivalent to an algebraic identity that is easily verified. Supported in part by NSF grant GP-7855. Entrata in Redazione il 18 novembre 1969.     

Current research on algebraic combinatorics

This paper gives an account of recent activity in the field of algebraic combinatorics and thus updates our book, Algebraic Combinatorics I (Benjamin/Cummings, 1984).Supported in part by NSF grant DMS 8503761.     

Julia and John

Using a recent result of Mañé [Ma] we give a classification of polynomials whose Fatou components are John domains.Supported in part by NSF Grant DMS-8916968     

Universal algebraic equivalences between tautological cycles on Jacobians of curves

We present a collection of algebraic equivalences between tautological cycles on the Jacobian J of a curve, i.e., cycles in the subring of the Chow ring of J generated by the classes of certain standard subvarieties of J. These equivalences are universal in the sense that they hold for all curves of given genus. We show also that they are compatible with the action of the Fourier transform on tautological cycles and compute this action explicitly. Supported in part by NSF grant DMS-0302215.     

P.L.-Spheres,convex polytopes,and stress

We describe here the notion of generalized stress on simplicial complexes, which serves several purposes: it establishes a link between two proofs of the Lower Bound Theorem for simplicial convex polytopes; elucidates some connections between the algebraic tools and the geometric properties of polytopes; leads to an associated natural generalization of infinitesimal motions; behaves well with respect to bistellar operations in the same way that the face ring of a simplicial complex coordinates well with shelling operations, giving rise to a new proof that p.l.-spheres are Cohen-Macaulay; and is dual to the notion of McMullen's weights on simple polytopes which he used to give a simpler, more geometric proof of theg-theorem. Supported in part by NSF Grants DMS-8504050 and DMS-8802933, by NSA Grant MDA904-89-H-2038, by the Mittag-Leffier Institute, by DIMACS (Center for Discrete Mathematics and Theoretical Computer Science), a National Science Foundation Science and Technology Center, NSF-STC88-09648, and by a grant from the EPSRC.