Seshadri constants and Okounkov bodies revisited

In recent years, the interaction between the local positivity of divisors and Okounkov bodies has attracted considerable attention, and there have been attempts to find a satisfactory theory of positivity of divisors in terms of convex geometry of Okounkov bodies. Many interesting results in this direction have been established by Choi–Hyun–Park–Won [4] and Küronya–Lozovanu [17], [18], [19] separately. The first aim of this paper is to give uniform proofs of these results. Our approach provides not only a simple new outlook on the theory but also proofs for positive characteristic in the most important cases. Furthermore, we extend the theorems on Seshadri constants to graded linear series setting. Finally, we introduce the integrated volume function to investigate the relation between Seshadri constants and filtered Okounkov bodies introduced by Boucksom–Chen [3].     

Okounkov bodies and Seshadri constants

Okounkov bodies, which are closed convex sets defined for big line bundles, have rich information on the line bundles. On the other hand, Seshadri constants are invariants which measure the positivity of line bundles. In this paper, we prove that Okounkov bodies give lower bounds of Seshadri constants.     

One‐level Newton–Krylov–Schwarz algorithm for unsteady non‐linear radiation diffusion problem

In this paper, we present a parallel Newton–Krylov–Schwarz (NKS)‐based non‐linearly implicit algorithm for the numerical solution of the unsteady non‐linear multimaterial radiation diffusion problem in two‐dimensional space. A robust solver technology is required for handling the high non‐linearity and large jumps in material coefficients typically associated with simulations of radiation diffusion phenomena. We show numerically that NKS converges well even with rather large inflow flux boundary conditions. We observe that the approach is non‐linearly scalable, but not linearly scalable in terms of iteration numbers. However, CPU time is more important than the iteration numbers, and our numerical experiments show that the algorithm is CPU‐time‐scalable even without a coarse space given that the mesh is fine enough. This makes the algorithm potentially more attractive than multilevel methods, especially on unstructured grids, where course grids are often not easy to construct. Copyright © 2004 John Wiley & Sons, Ltd.     

Newton’s method’s basins of attraction revisited

In this paper, we revisit the chaotic number of iterations needed by Newton’s method to converge to a root. Here, we consider a simple modified Newton method depending on a parameter. It is demonstrated using polynomiography that even in the simple algorithm the presence and the position of the convergent regions, i.e. regions where the method converges nicely to a root, can be complicatedly a function of the parameter.     

Convergence analysis of the Newton–Shamanskii method for a nonsymmetric algebraic Riccati equation

In this paper, we consider the nonsymmetric algebraic Riccati equation arising in transport theory. An important feature of this equation is that its minimal positive solution can be obtained via computing the minimal positive solution of a vector equation. We apply the Newton–Shamanskii method to solve the vector equation. Convergence analysis shows that the sequence of vectors generated by the Newton–Shamanskii method is monotonically increasing and converges to the minimal positive solution of the vector equation. Numerical experiments show that the Newton–Shamanskii method is feasible and effective, and outperforms the Newton method. Copyright © 2008 John Wiley & Sons, Ltd.     

Closed Newton–Cotes trigonometrically-fitted formulae of high order for long-time integration of orbital problems

The connection between closed Newton–Cotes, trigonometrically-fitted differential methods and symplectic integrators is studied in this paper. Several one-step symplectic integrators have been obtained based on symplectic geometry, as is shown in the literature. However, the study of multi-step symplectic integrators is very limited. The well-known open Newton–Cotes differential methods are presented as multilayer symplectic integrators by Zhu et al. [W. Zhu, X. Zhao, Y. Tang, Journal of Chem. Phys. 104 (1996), 2275]. The construction of multi-step symplectic integrators based on the open Newton–Cotes integration methods is investigated by Chiou and Wu [J.C. Chiou, S.D. Wu, Journal of Chemical Physics 107 (1997), 6894]. The closed Newton–Cotes formulae are studied in this paper and presented as symplectic multilayer structures. We also develop trigonometrically-fitted symplectic methods which are based on the closed Newton–Cotes formulae. We apply the symplectic schemes in order to solve Hamilton’s equations of motion which are linear in position and momentum. We observe that the Hamiltonian energy of the system remains almost constant as the integration proceeds. Finally we apply the new developed methods to an orbital problem in order to show the efficiency of this new methodology.     

Studying Baskakov–Durrmeyer operators and quasi-interpolants via special functions

We prove that the kernels of the Baskakov–Durrmeyer and the Szász–Mirakjan–Durrmeyer operators are completely monotonic functions. We establish a Bernstein type inequality for these operators and apply the results to the quasi-interpolants recently introduced by Abel. For the Baskakov–Durrmeyer quasi-interpolants, we give a representation as linear combinations of the original Baskakov–Durrmeyer operators and prove an estimate of Jackson–Favard type and a direct theorem in terms of an appropriate K-functional.     

Discrete behavior of Seshadri constants on surfaces

Working over , we show that, apart possibly from a unique limit point, the possible values of multi-point Seshadri constants for general points on smooth projective surfaces form a discrete set. In addition to its theoretical interest, this result is of practical value, which we demonstrate by giving significantly improved explicit lower bounds for Seshadri constants on and new results about ample divisors on blow ups of at general points.     

Gap orders of rational functions on plane curves with few singular points

We prove that certain integers n cannot occur as degrees of linear series without base points on the normalization of a plane curve whose only singularities are a “small” number of nodes and ordinary cusps. As a consequence we compute the gonality of such a curve. Work done with financial support of M.U.R.S.T. while the authors were members of C.N.R.     

Hall–Littlewood functions and the Rogers–Ramanujan identities

We prove an identity for Hall–Littlewood symmetric functions labelled by the Lie algebra A₂. Through specialization this yields a simple proof of the A₂ Rogers–Ramanujan identities of Andrews, Schilling and the author.     

Seshadri constants on rational surfaces with anticanonical pencils

We study a Seshadri constant at a general point on a rational surface whose anticanonical linear system contains a pencil. First, we describe a Seshadri constant of an ample line bundle on such a rational surface explicitly by the numerical data of the ample line bundle. Second, we classify log del Pezzo surfaces which are special in terms of the Seshadri constants of the anticanonical divisors when the anticanonical degree is between 4 and 9.     

M‐constants in Orlicz–Lorentz function spaces

In this paper some lower and upper estimates of M‐constants for Orlicz–Lorentz function spaces for both, the Luxemburg and the Amemiya norms, are given. Since degenerated Orlicz functions φ and degenerated weighted sequences ω are also admitted, this investigations concern the most possible wide class of Orlicz–Lorentz function spaces. M‐constants were defined in 1969 by E. A. Lifshits, and used by many authors in the study of lattice structures on Banach spaces, as well as in the fixed point theory.     

Optimal management of the machine repair problem with working vacation: Newton’s method

This paper studies the M/M/1 machine repair problem with working vacation in which the server works with different repair rates rather than completely terminating the repair during a vacation period. We assume that the server begins the working vacation when the system is empty. The failure times, repair times, and vacation times are all assumed to be exponentially distributed. We use the MAPLE software to compute steady-state probabilities and several system performance measures. A cost model is derived to determine the optimal values of the number of operating machines and two different repair rates simultaneously, and maintain the system availability at a certain level. We use the direct search method and Newton’s method for unconstrained optimization to repeatedly find the global minimum value until the system availability constraint is satisfied. Some numerical examples are provided to illustrate Newton’s method.     

Seshadri constants in a family of surfaces

The aim of this note is to study local and global Seshadri constants for a family of smooth surfaces with prescribed polarization. Received: 16 April 2001 / Published online: 26 April 2002     

Weighted Hermite–Hadamard–Mercer type inequalities for convex functions

In this paper, first, we prove the weighted Hermite–Hadamard–Mercer inequalities for convex functions, after we establish some new weighted inequalities connected with the right‐sides of weighted Hermite–Hadamard–Mercer type inequalities for differentiable functions whose derivatives in absolute value at certain powers are convex. The results presented here would provide extensions of those given in earlier works.     

Maximal ideals of regulous functions are not finitely generated

We prove that every maximal ideal in the ring of k-regulous functions, $k\in \mathbb{N}$, on a smooth real affine algebraic variety of dimension $d\ge 2$ is not finitely generated.     

Certain improvements of Newton’s method with fourth-order convergence

In this paper we present two new schemes, one is third-order and the other is fourth-order. These are improvements of second-order methods for solving nonlinear equations and are based on the method of undetermined coefficients. We show that the fourth-order method is more efficient than the fifth-order method due to Kou et al. [J. Kou, Y. Li, X. Wang, Some modifications of Newton’s method with fifth-order covergence, J. Comput. Appl. Math., 209 (2007) 146–152]. Numerical examples are given to support that the methods thus obtained can compete with other iterative methods.