Necessary and sufficient nonnegativity conditions for second-order coordinate trigonometric splines

Necessary and sufficient nonnegativity conditions for continuous differentiable coordinate trigonometric splines of the second order are obtained; the convexity and concavity intervals of these splines are determined. The method of investigation consists in recognizing concavity in intervals adjacent to the endpoints of the support of a coordinate spline under consideration and applying arguments related to the number of zeros of the solution of the corresponding boundary value problem for a second-order differential equation.     

Properties of functions in an auxiliary spline space

Summary This note examines functions in an auxiliary spline space related to geometrically continuous splines. Previous work [3, 4] required results about the existence and number of zeros of certain functions in this space, as well as results on how to combine these functions. This note provides improved versions of these results.     

Real zeros of the zero-dimensional parametric piecewise algebraic variety

The piecewise algebraic variety is the set of all common zeros of multivariate splines. We show that solving a parametric piecewise algebraic variety amounts to solve a finite number of parametric polynomial systems containing strict inequalities. With the regular decomposition of semi-algebraic systems and the partial cylindrical algebraic decomposition method, we give a method to compute the supremum of the number of torsion-free real zeros of a given zero-dimensional parametric piecewise algebraic variety, and to get distributions of the number of real zeros in every n-dimensional cell when the number reaches the supremum. This method also produces corresponding necessary and sufficient conditions for reaching the supremum and its distributions. We also present an algorithm to produce a necessary and sufficient condition for a given zero-dimensional parametric piecewise algebraic variety to have a given number of distinct torsion-free real zeros in every n-cell in the n-complex. This work was supported by National Natural Science Foundation of China (Grant Nos. 10271022, 60373093, 60533060), the Natural Science Foundation of Zhejiang Province (Grant No. Y7080068) and the Foundation of Department of Education of Zhejiang Province (Grant Nos. 20070628 and Y200802999)     

A refined Gallai-Edmonds structure theorem for weighted matching polynomials

In this work, we prove a refinement of the Gallai-Edmonds structure theorem for weighted matching polynomials by Ku and Wong. Our proof uses a connection between matching polynomials and branched continued fractions. We also show how this is related to a modification by Sylvester of the classical Sturm's theorem on the number of zeros of a real polynomial in an interval. In addition, we obtain some other results about zeros of matching polynomials.     

周期变号减少核确定的完全样条与最优取样点的唯一性

证明了具有给定零点的完全样条的唯一性，证明了在卷积类上最优取样点的唯一性．     

Characterizations of the Optimal Descartes' Rules of Signs

A system of functions satisfies Descartes' rule of signs if the number of zeros (with multiplicities) of a linear combination of these functions is less than or equal to the number of variations of strict sign in the sequence of the coefficients. In this paper we characterize the systems of functions satisfying a stronger property than the above mentioned Descartes' rule: The difference between the number of zeros and the changes of sign in the sequence of coefficients must be always a nonnegative even number. We show that the approximation to the number of zeros given by these systems of functions is better than the approximation provided by any other systems of functions satisfying a Descartes' rule of signs. This last result improves, in the particular case of polynomials, the main theorem of [14].     

On zeros of Hecke <Emphasis Type="Italic">L</Emphasis>-functions and their linear combinations on the critical line

In this paper two theorems were obtained. In the first theorem it is proved that a positive proportion of non-trivial zeros lie on the critical line for L-functions attached to automorphic cusp forms for congruence-subgroups. Therefore, the class of functions satisfying a variant of Selberg’s theorem was extended. In the second theorem a new lower bound was obtained for the number of zeros of linear combinations of Hecke L-functions on the intervals of the critical line. This theorem essentially improves the previously known S.A. Gritsenko’s result of 1997.     

On Siegel zeros of Hecke-Landau zeta-functions

The primary concern of this paper is to deal with Siegel zeros of Hecke-Landau zeta-functions in an algebraic number field of finite degree over the rationals. As in the rational case with DirichletL-functions, the location of such zeros is closely connected with lower bounds for the corresponding zeta-functions at the points=1. This will be the theme in the first part of the paper. In this second part we first derive a form of the Brun-Titchmarsh theorem in the setting of a number field which is appropriate in our context. Then we turn our attention to the fact that an improvement of the constant in this inequality would lead to the nonexistence of Siegel zeros. The procedure is based on a weighted algebraic form of Selberg's upper bound sieve.     

Upper estimates for the number of periodic solutions to multi-dimensional systems

The maximal number of zeros of multi-dimensional real analytic maps with small parameter is studied by means of the multi-dimensional generalization of Rouché's theorem. The obtained result is applied to study the maximal number of periodic solutions to multi-dimensional differential systems. An application to a class of three-dimensional autonomous systems is given.     

Enclosing clusters of zeros of polynomials

Lagrange interpolation and partial fraction expansion can be used to derive a Gerschgorin-type theorem that gives simple and powerful a posteriori error bounds for the zeros of a polynomial if approximations to all zeros are available. Compared to bounds from a corresponding eigenvalue problem, a factor of at least two is gained.The accuracy of the bounds is analyzed, and special attention is given to ensure that the bounds work well not only for single zeros but also for multiple zeros and clusters of close zeros.A Rouché-type theorem is also given, that in many cases reduces the bound even further.     

Finite-Part Integrals and Modified Splines

We first state a uniform convergence theorem for finite-part integrals which are derivatives of weighted Cauchy principal value integrals. We then give a two-stage process to modify approximating splines and optimal nodal splines in such a way that the conditions of this theorem are satisfied. Consequently, these modified splines can be used in the numerical evaluation of these finite-part integrals.     

On Optimal Error Bounds for Derivatives of Interpolating Splines on a Uniform Partition

Based on Peano kernel technique, explicit error bounds (optimal for the highest order derivative) are proved for the derivatives of cardinal spline interpolation (interpolating at the knots for odd degree splines and at the midpoints between two knots for even degree splines). The results are based on a new representation of the Peano kernels and on a thorough investigation of their zero distributions. The bounds are given in terms of Euler–Frobenius polynomials and their zeros.     

Finding a Cluster of Zeros of Univariate Polynomials

A method to compute an accurate approximation for a zero cluster of a complex univariate polynomial is presented. The theoretical background on which this method is based deals with homotopy, Newton's method, and Rouché's theorem. First the homotopy method provides a point close to the zero cluster. Next the analysis of the behaviour of the Newton method in the neighbourhood of a zero cluster gives the number of zeros in this cluster. In this case, it is sufficient to know three points of the Newton sequence in order to generate an open disk susceptible to contain all the zeros of the cluster. Finally, an inclusion test based on a punctual version of the Rouché theorem validates the previous step. A specific implementation of this algorithm is given. Numerical experiments illustrate how this method works and some figures are displayed.     

On the Modification of Rouche's Theorem for the Queueing Theory Problems

In analytic queueing theory, Rouche's theorem is frequently used to prove the existence of a certain number of zeros in the domain of regularity of a given function. If the theorem can be applied it leads in a simple way to results concerning the ergodicity condition and the construction of the solution of the functional equation for the generating function of the stationary distribution. Unfortunately, the verification of the conditions needed to apply Rouche's theorem is frequently quite difficult. We prove the theorem which allows to avoid some difficulties arising in applying classical Rouche's theorem to an analysis of queueing models.     

Uniform bounds for cardinal Hermite spline operators with double knots

A method is given for computing the uniform norm of the cardinal Hermite spline operator. This is the operator that takes two bounded biinfinite sequences of numbers into the unique bounded spline of degree 2k − 1(k 2) with knots of multiplicity two at the integers and that interpolates the two given sequences for both functional and first derivative values at the integers. The computational schema relies on knowledge of the Bernoulli splines, while the theoretical aspects make use of some properties of zeros of periodic splines.     

Classification theorems for operators preserving zeros in a strip

We characterize all linear operators which preserve certain spaces of entire functions whose zeros lie in a closed strip. Necessary and sufficient conditions are obtained for the related problem with real entire functions, and some classical theorems of de Bruijn and Pólya are extended. Specifically, we reveal new differential operators which map real entire functions whose zeros lie in a strip to real entire functions whose zeros lie in a narrower strip; this is one of the properties that characterize a “strong universal factor” as defined by de Bruijn. Using elementary methods, we prove a theorem of de Bruijn and extend a theorem of de Bruijn and Ilieff which states a sufficient condition for a function to have a Fourier transform with only real zeros.     

Relative oscillation theory for Dirac operators

We develop relative oscillation theory for one-dimensional Dirac operators which, rather than measuring the spectrum of one single operator, measures the difference between the spectra of two different operators. This is done by replacing zeros of solutions of one operator by weighted zeros of Wronskians of solutions of two different operators. In particular, we show that a Sturm-type comparison theorem still holds in this situation and demonstrate how this can be used to investigate the number of eigenvalues in essential spectral gaps. Furthermore, the connection with Krein's spectral shift function is established. As an application we extend a result by K.M. Schmidt on the finiteness/infiniteness of the number of eigenvalues in essential spectral gaps of perturbed periodic Dirac operators.     

Distribution of zeta zeros and the oscillation of the error term of the prime number theorem

An 84-year-old classical result of Ingham states that a rather general zero-free region of the Riemann zeta function implies an upper bound for the absolute value of the remainder term of the prime number theorem. In 1950 Tur´an proved a partial conversion of the mentioned theorem of Ingham. Later the author proved sharper forms of both Ingham’s theorem and its conversion by Tur´an. The present work shows a very general theorem which describes the average and the maximal order of the error terms by a relatively simple function of the distribution of the zeta zeros. It is proved that the maximal term in the explicit formula of the remainder term coincides with high accuracy with the average and maximal order of the error term.     

On the existence of zeros of monotone operators in reflexive Banach spaces

This paper is devoted to the investigation on the existence of zeros of monotone operators in reflexive Banach spaces. We first present a sufficient condition under which single-valued monotone operators have zeros. The obtained theorem includes a previous result as a special case. A necessary and sufficient condition for the existence of zeros of maximal monotone operators is presented.     

Cone Spline Surfaces and Spatial Arc Splines – a Sphere Geometric Approach

Basic sphere geometric principles are used to analyze approximation schemes of developable surfaces with cone spline surfaces, i.e., G ¹-surfaces composed of segments of right circular cones. These approximation schemes are geometrically equivalent to the approximation of spatial curves with G ¹-arc splines, where the arcs are circles in an isotropic metric. Methods for isotropic biarcs and isotropic osculating arc splines are presented that are similar to their Euclidean counterparts. Sphere geometric methods simplify the proof that two sufficiently close osculating cones of a developable surface can be smoothly joined by a right circular cone segment. This theorem is fundamental for the construction of osculating cone spline surfaces. Finally, the analogous theorem for Euclidean osculating circular arc splines is given.