Stabbers of line segments in the plane

The problem of computing a representation of the stabbing lines of a set S of segments in the plane was solved by Edelsbrunner et al. We provide efficient algorithms for the following problems: computing the stabbing wedges for S, finding a stabbing wedge for a set of parallel segments with equal length, and computing other stabbers for S such as a double-wedge and a zigzag. The time and space complexities of the algorithms depend on the number of combinatorially different extreme lines, critical lines, and the number of different slopes that appear in S.     

A result about the density of iterated line intersections in the plane

Let S be a finite set of points in the plane and let be the set of intersection points between pairs of lines passing through any two points in S. We characterize all configurations of points S such that iteration of the above operation produces a dense set. We also discuss partial results on the characterization of those finite point-sets with rational coordinates that generate all of through iteration of .     

A Beurling-Carleson set which is a uniqueness set for a given weighted space of analytic functions

Let be a sequence of positive real numbers. We define as the space of functions which are analytic in the unit disc , continuous on and such that

where is the Fourier coefficient of the restriction of to the unit circle . Let be a closed subset of . We say that is a Beurling-Carleson set if

where denotes the distance between and . In 1980, A. Atzmon asked whether there exists a sequence of positive real numbers such that for all and that has the following property: for every Beurling-Carleson set , there exists a non-zero function in that vanishes on . In this note, we give a negative answer to this question.

     

A penalty-free method with line search for nonlinear equality constrained optimization

A new line search method is introduced for solving nonlinear equality constrained optimization problems. It does not use any penalty function or a filter. At each iteration, the trial step is determined such that either the value of the objective function or the measure of the constraint violation is sufficiently reduced. Under usual assumptions, it is shown that every limit point of the sequence of iterates generated by the algorithm is feasible, and there exists at least one limit point that is a stationary point for the problem. A simple modification of the algorithm by introducing second order correction steps is presented. It is shown that the modified method does not suffer from the Maratos’ effect, so that it converges superlinearly. The preliminary numerical results are reported.     

Nonmonotone filter DQMM method for the system of nonlinear equations

In this paper, we propose a nonmonotone filter Diagonalized Quasi-Newton Multiplier (DQMM) method for solving system of nonlinear equations. The system of nonlinear equations is transformed into a constrained nonlinear programming problem which is then solved by nonmonotone filter DQMM method. A nonmonotone criterion is used to speed up the convergence progress in some ill-conditioned cases. Under reasonable conditions, we give the global convergence properties. The numerical experiments are reported to show the effectiveness of the proposed algorithm.     

A moment approach to analyze zeros of triangular polynomial sets

Let be a zero-dimensional ideal of such that its associated set of polynomial equations for all is in triangular form. By introducing multivariate Newton sums we provide a numerical characterization of polynomials in . We also provide a necessary and sufficient (numerical) condition for all the zeros of to be in a given set , without explicitly computing the zeros. In addition, we also provide a necessary and sufficient condition on the coefficients of the 's for to have (a) only real zeros, (b) to have only real zeros, all contained in a given semi-algebraic set . In the proof technique, we use a deep result of Curto and Fialkow (2000) on the -moment problem, and the conditions we provide are given in terms of positive definiteness of some related moment and localizing matrices depending on the 's via the Newton sums of . In addition, the number of distinct real zeros is shown to be the maximal rank of a related moment matrix.

     

Moments of an exponential functional of random walks and permutations with given descent sets

The exponential functional of simple, symmetric random walks with negative drift is an infinite polynomial Y = 1 + ξ₁ + ξ₁ξ₂ + ξ₁ξ₂ξ₃ + ⋯ of independent and identically distributed non-negative random variables. It has moments that are rational functions of the variables μ _k = E(ξ ^k ) < 1 with universal coefficients. It turns out that such a coefficient is equal to the number of permutations with descent set defined by the multiindex of the coefficient. A recursion enumerates all numbers of permutations with given descent sets in the form of a Pascal-type triangle. This revised version was published online in August 2006 with corrections to the Cover Date.     

On a loss system with a given number of customers

A one-server loss system with Poisson arrival stream and deterministic service times is considered conditional on the number of customers who appeared up to a givenT. This condition implies that the arrival times form a sample of the uniform distribution on (0,T]. We derive several characteristics of interest, such as the blocking probability at any given timet (0,T], the probability that exactlyi of the customers in (0,T] are served and, as a generalization, the distribution of the number of served customers arriving in any subinterval of (0,T].     

A smoothing-type algorithm for solving system of inequalities

In this paper we consider system of inequalities. By constructing a new smoothing function, the problem is approximated via a family of parameterized smooth equations. A Newton-type algorithm is applied to solve iteratively the smooth equations so that a solution of the problem concerned is found. We show that the algorithm is globally and locally quadratically convergent under suitable assumptions. Preliminary numerical results are reported.     

Three fixed-sign solutions of system model with Sturm-Liouville type conditions

We consider the following system of differential equations

     

A homotopy perturbation algorithm to solve a system of Fredholm–Volterra type integral equations

In this paper, an application of He’s homotopy perturbation (HPM) method is applied to solve the system of Fredholm and Volterra type integral equations, the results revealing that the HPM is very effective and simple.     

A new family of iterative methods for solving system of nonlinear algebric equations

Homotopy perturbation method (HPM) is applied to construct a new iterative method for solving system of nonlinear algebric equations. Comparison of the result obtained by the present method with that obtained by revised Adomian decomposition method [Hossein Jafari, Varsha Daftardar-Gejji, Appl. Math. Comput. 175 (2006) 1–7] reveals that the accuracy and fast convergence of the new method.     

On multiple fixed-sign solutions of a discrete system with Hermite boundary conditions

We consider the discrete system

     

A system of integral equations on half space

Let be the n-dimensional upper half Euclidean space, and let α be any real number satisfying 0<α<n, we study positive solutions of the following system of integral equations in :

     

A global characterization of the Fu?ík spectrum for a system of ordinary differential equations

The Fu?ík spectrum for systems of second order ordinary differential equations with Dirichlet or Neumann boundary values is considered: it is proved that the Fu?ík spectrum consists of global C¹ surfaces, and that through each eigenvalue of the linear system pass exactly two of these surfaces. Further qualitative, asymptotic and symmetry properties of these spectral surfaces are given. Finally, related problems with nonlinearities which cross asymptotically some eigenvalues, as well as linear-superlinear systems are studied.     

The blow-up rate for a system of heat equations with neumann boundary conditions

This paper deals with the blow-up properties of solutions to a system of heat equations u _t=Δu, v _t=Δv in B _R×(0, T) with the Neumann boundary conditions εu/εη=e ^v, εv/εη=e ^u on S _R×[0, T). The exact blow-up rates are established. It is also proved that the blow-up will occur only on the boundary. This work is supported by the National Natural Science Foundation of China     

Multiple fixed-sign solutions for a system of generalized right focal problems with deviating arguments

We consider the following system of generalized right focal boundary value problems

     

An exact formula for the mean number of claims served by a one-channel queuing system with rejections on a given time interval

An exact formula for the mean number of claims served by a one-channel queuing system (QS) with rejections on a given time interval is obtained, which makes it possible, in particular, to calculate exactly the QS efficiency indexes on an arbitrary time interval.