On the applicability of two Newton methods for solving equations in Banach space

In this study we examine the applicability of Newton’s method and the modified Newton’s method for approximating a locally unique solution of a nonlinear equation in a Banach space. We assume that the Newton-Kantorovich hypothesis for Newton’s method is violated, but the corresponding condition for the modified Newton method holds. Under these conditions there is no guarantee that Newton’s method starting from the same initial guess as the modified Newton’s method converges. Hence, it seems that we must always use the modified Newton method under these conditions. However, we provide a numerical example to demonstrate that in practice this may not be a good decision.     

A superconvergence result for the second-order Newton-Cotes formula for certain finite-part integrals

In this paper we investigate the superconvergence phenomenonof the second-order quadrature formula of Newton–Cotestype for the computation of finite-part integrals with a second-ordersingularity on an interval. Superconvergence points are foundand a superconvergence estimate is obtained. The validity ofthe theoretical result is demonstrated by numerical experiments.     

Dynamics of a two-layer fluid sloshing problem

A second-order ordinary differential equation, which is a reducedform of the periodically forced extended Korteweg–de Vries(eKdV) equation, is derived in the physical context of sloshinga two-layer fluid tank. In the limit of small dispersion, numericalevidence is given of multiple periodic solutions displayingfast oscillations superimposed on slow periodic waves and ahigher-order Melnikov method is then used to verify the existenceof such solutions. The dynamical behaviour of a similar equationwith more general coefficients is also examined, demonstratingthe existence of periodic and chaotic behaviour. We highlightnew aspects which arise due to the presence of mixed nonlinearity.     

A theoretical analysis on efficiency of some Newton-PCG methods

In this paper, we study the efficiency issue of inexact Newton-type methods for smooth unconstrained optimization problems under standard assumptions from theoretical point of view by discussing a concrete Newton-PCG algorithm. In order to compare the algorithm with Newton's method, a ratio between the measures of their approximate efficiencies is investigated. Under mild conditions, it is shown that first, this ratio is larger than 1, which implies that the Newton-PCG algorithm is more efficient than Newton's method, and second, this ratio increases when the dimension n of the problem increases and tends to infinity at least at a rate In n/In 2 when n→∞, which implies that in theory the Newton-PCG algorithm is much more efficient for middle- and large-scale problems. These theoretical results are also supported by our preliminary numerical experiments.     

Newton’s method for generalized equations: a sequential implicit function theorem

In an extension of Newton’s method to generalized equations, we carry further the implicit function theorem paradigm and place it in the framework of a mapping acting from the parameter and the starting point to the set of all associated sequences of Newton’s iterates as elements of a sequence space. An inverse function version of this result shows that the strong regularity of the mapping associated with the Newton sequences is equivalent to the strong regularity of the generalized equation mapping.     

Analytic properties for holomorphic matrix-valued maps in ℂ<Superscript>2×2</Superscript>

In this paper, we investigate some analytic properties for a class of holomorphic matrixvalued functions. In particular, we give a Picard type theorem which depicts the characterization of Picard omitting value in these functions. We also study the relation between asymptotic values and Picard omitting values, and the relation between periodic orbits of the canonical extension on C^2×2 and Julia set of one dimensional complex dynamic system.     

Bounds for the tail distribution in a queue with a superposition of general periodic Markov sources: theory and application

An efficient yet accurate estimation of the tail distribution of the queue length has been considered as one of the most important issues in call admission and congestion controls in ATM networks. The arrival process in ATM networks is essentially a superposition of sources which are typically bursty and periodic either due to their origin or their periodic slot occupation after traffic shaping. In this paper, we consider a discrete-time queue where the arrival process is a superposition of general periodic Markov sources. The general periodic Markov source is rather general since it is assumed only to be irreducible, stationary and periodic. Note also that the source model can represent multiple time-scale correlations in arrivals. For this queue, we obtain upper and lower bounds for the asymptotic tail distribution of the queue length by bounding the asymptotic decay constant. The formulas can be applied to a queue having a huge number of states describing the arrival process. To show this, we consider an MPEG-like source which is a special case of general periodic Markov sources. The MPEG-like source has three time-scale correlations: peak rate, frame length and a group of pictures. We then apply our bound formulas to a queue with a superposition of MPEG-like sources, and provide some numerical examples to show the numerical feasibility of our bounds. Note that the number of states in a Markov chain describing the superposed arrival process is more than 1.4 × 10⁸⁸. Even for such a queue, the numerical examples show that the order of the magnitude of the tail distribution can be readily obtained.     

Abundant periodic and aperiodic solutions of a discontinuous three-term recurrence relation

In this note, we study a discontinuous three-term recurrence relation which arises from seeking the steady states of a cellular neural network with step control function. Several collections of periodic solutions are found. A necessary and sufficient condition for a solution to be periodic is stated and aperiodic solutions are found as consequences. We also show that any periodic solution can be derived from a primary periodic solution with least period not divisible by 5. Although the periodic or aperiodic solutions we found are not exhaustive, they are quite abundant and may reflect some of the rich physical phenomena in true biological systems. Our method in this note may also provide a general approach to analyze the periodicity of solutions of similar recurrence relations.     

An explicit characterization of Calogero-Moser systems

Combining theorems of Halphen, Floquet, and Picard and a Frobenius type analysis, we characterize rational, meromorphic simply periodic, and elliptic KdV potentials. In particular, we explicitly describe the proper extension of the Airault-McKean-Moser locus associated with these three classes of algebro-geometric solutions of the KdV hierarchy with special emphasis on the case of multiple collisions between the poles of solutions. This solves a problem left open since the mid-1970s.

     

Concerning the radius of convergence of Newton’s method and applications

We present local and semilocal convergence results for Newton’s method in a Banach space setting. In particular, using Lipschitz-type assumptions on the second Fréchet-derivative we find results concerning the radius of convergence of Newton’s method. Such results are useful in the context of predictor-corrector continuation procedures. Finally, we provide numerical examples to show that our results can apply where earlier ones using Lipschitz assumption on the first Fréchet-derivative fail.     

带不完美界面的双曲问题均匀化的一个注记

本文研究了一类二分区域上的具有非周期系数的双曲问题.利用周期Unfolding方法,得到了均匀化及其矫正结果,推广了Donato,Faella和Monsurrò的工作.     

Simple geometric constructions of quadratically and cubically convergent iterative functions to solve nonlinear equations

In this paper, we derive one-parameter families of Newton, Halley, Chebyshev, Chebyshev-Halley type methods, super-Halley, C-methods, osculating circle and ellipse methods respectively for finding simple zeros of nonlinear equations, permitting f ′ (x) = 0 at some points in the vicinity of the required root. Halley, Chebyshev, super-Halley methods and, as an exceptional case, Newton method are seen as the special cases of the family. All the methods of the family and various others are cubically convergent to simple roots except Newton’s or a family of Newton’s method.      

Newton’s Method for Computing the Nearest Correlation Matrix with a Simple Upper Bound

The standard nearest correlation matrix can be efficiently computed by exploiting a recent development of Newton’s method (Qi and Sun in SIAM J. Matrix Anal. Appl. 28:360–385, 2006). Two key mathematical properties, that ensure the efficiency of the method, are the strong semismoothness of the projection operator onto the positive semidefinite cone and constraint nondegeneracy at every feasible point. In the case where a simple upper bound is enforced in the nearest correlation matrix in order to improve its condition number, it is shown, among other things, that constraint nondegeneracy does not always hold, meaning Newton’s method may lose its quadratic convergence. Despite this, the numerical results show that Newton’s method is still extremely efficient even for large scale problems. Through regularization, the developed method is applied to semidefinite programming problems with simple bounds.     

Swift-Hohenberg方程的打靶法

§ 1　IntroductionIn this paper we shall study the formation of spatially periodic patterns in extendedsystems described by Swift- Hohenberg equationut=ku - 1 +2x22 u - u3 ,k∈ R. (1.1)This equation was first proposed in 1976 by Swiftand Hohenberg[12 ] as a simple model forthe Rayleigh- B nard instability of roll waves.However,since then an effective m odel e-quation has been proved for a variety of system s in physics and mechanics.The Swift- Hohenberg equation has been studied a …     

Approximation Methods for Solving the Cauchy Problem

In this paper we give some new results concerning solvability of the 1-dimensional differential equation y′ = f(x, y) with initial conditions. We study the basic theorem due to Picard. First we prove that the existence and uniqueness result remains true if f is a Lipschitz function with respect to the first argument. In the second part we give a contractive method for the proof of Picard theorem. These considerations allow us to develop two new methods for finding an approximation sequence for the solution. Finally, some applications are given.     

Solving triangular algebraic systems by means of simultaneous iterations

Our aim in this paper is to extend a variant of the Weierstrass method for the simultaneous computation of the solutions of a triangular algebraic system of equations. The appropriate tools are the symmetric functions of the roots of a polynomial. Using these symmetric functions we give another equivalent formulation for the search of all the roots of a triangular algebraic system. Using the latter formulation our method consists in solving a more simple system (where partial degrees of all the equations do not exceed 1) by Newton’s method. The quadratic convergence of our method is an immediate consequence of Newton’s method and need not be proved explicitly. This revised version was published online in June 2006 with corrections to the Cover Date.     

Self-correspondences of K3 surfaces via moduli of sheaves and arithmetic hyperbolic reflection groups

In a series of our papers with Carlo Madonna (2002–2008), we described self-correspondences of a K3 surface over ℂ via moduli of sheaves with primitive isotropic Mukai vectors for the Picard number 1 or 2 of the K3 surfaces. Here we give a natural and functorial answer to the same problem for an arbitrary Picard number. As an application, we characterize, in terms of self-correspondences via moduli of sheaves, K3 surfaces with reflective Picard lattice, that is, when the automorphism group of the lattice is generated by reflections up to finite index. It is known since 1981 that the number of reflective hyperbolic lattices is finite. We also formulate some natural unsolved related problems.     

Explicit periodic travelling waves for a discrete lambda–omega reaction–diffusion system

In 1973, Kopell and Howard introduced a λ–ω reaction–diffusion system and found an explicit family of periodic travelling wave solutions lying on circles with radius less than 1. Since λ–ω systems represent universal models for studying chemical processes, and onset of turbulent behaviour, etc., explicit solutions of λ–ω systems with delays or discrete λ–ω systems can be of further help when the only method for obtaining other solutions is through numerical computation. There are now much investigations of various λ–ω systems. However, it is of interest to note that none attempts to find explicit travelling wave solutions. In this paper, we investigate the existence of explicit solutions for the simplest Euler scheme of a λ–ω system with delays or advancements which is described as a coupled pair of partial difference equations. We are able to provide necessary as well as sufficient conditions for the existence of numerical periodic travelling wave solutions. Additionally, we also provide some examples to show that our explicit solutions are qualitatively different from those found by Kopell and Howard and hence they may be of interests for specialists in the area of reaction–diffusion systems.     

On smoothers for multigrid of the second kind

We study smoothers for the multigrid method of the second kind arising from Fredholm integral equations. Our model problems use nonlocal governing operators that enforce local boundary conditions. For discretization, we utilize the Nyström method with the trapezoidal rule. We find the eigenvalues of matrices associated to periodic, antiperiodic, and Dirichlet problems in terms of the nonlocality parameter and mesh size. Knowing explicitly the spectrum of the matrices enables us to analyze the behavior of smoothers. Although spectral analyses exist for finding effective smoothers for 1D elliptic model problems, to the best of our knowledge, a guiding spectral analysis is not available for smoothers of a multigrid of the second kind. We fill this gap in the literature. The Picard iteration has been the default smoother for a multigrid of the second kind. Jacobi‐like methods have not been considered as viable options. We propose two strategies. The first one focuses on the most oscillatory mode and aims to damp it effectively. For this choice, we show that weighted‐Jacobi relaxation is equivalent to the Picard iteration. The second strategy focuses on the set of oscillatory modes and aims to damp them as quickly as possible, simultaneously. Although the Picard iteration is an effective smoother for model nonlocal problems under consideration, we show that it is possible to find better than ones using the second strategy. We also shed some light on internal mechanism of the Picard iteration and provide an example where the Picard iteration cannot be used as a smoother.     

On a nonsmooth version of Newton’s method using locally lipschitzian operators

In this study we are concerned with the problem of approximating a locally unique solution of an operator equation in Banach space using Newton’s method. The differentiability of the operator involved is not assumed. We provide a semilocal convergence analysis utilized to solve problems that were not covered before. Numerical examples are also provided to justify our approach.