A Convergence Analysis of Newton-Like Method for Singular Equations Using Recurrent Functions

We provide new semilocal convergence results for Newton-like method involving outer or generalized inverses in a Banach space setting. Using our new idea of recurrent functions and the same or weaker conditions than before [5-19 A. Ben-Israel and N.E. Greville ( 1974 ). Generalized Inverses: Theory and Applications, Pure and Applied Mathematics . Wiley-Interscience , New York . X. Chen and T. Yamamoto ( 1989 ). Convergence domains of certain iterative methods for solving nonlinear equations . Numer. Funct. Anal. Optimiz. 10 : 37 – 48 . J.E. Dennis , Jr. ( 1968 ). On Newton-like methods . Numer. Math. 11 : 324 – 330 . P. Deuflhard and C. Heindl ( 1979 ). Convergence theorems for Newton's method and extensions to related methods . SIAM J. Numer. Anal. 16 : 1 – 10 . J.M. Gutiérrez ( 1997 ). A new semilocal convergence theorem for Newton's method . J. Comp. Appl. Math. 79 : 131 – 145 . J.M. Gutiérrez , M.A. Hernández , and M.A. Salanova ( 1995 ). Accessibility of solutions by Newton's method . Internat. J. Comput. Math. 57 : 239 – 247 . W.M. Häubler ( 1986 ). A Kantorovich-type convergence analysis for the Gauss–Newton methods . Numer. Math. 48 : 119 – 125 . L.V. Kantorovich and G.P. Akilov ( 1964 ). Functional Analysis . Pergamon Press , Oxford . M.Z. Nashed and X. Chen ( 1993 ). Convergence of Newton-like methods for singular operator equations using outer inverses . Numer. Math. 66 : 235 – 257 . F.A. Potra and V. Ptàk ( 1980 ). Sharp error bounds for Newton's process . Numer. Math. 34 : 67 – 72 . W.C. Rheinboldt ( 1968 ). A unified convergence theory for a class of iterative processes . SIAM J. Numer. Anal. 5 : 42 – 63 . W.C. Rheinboldt ( 1977 ). An adaptive continuation process for solving systems of nonlinear equations . Polish Academy of Sciences, Banach Ctr. Publ. 3 : 129 – 142 . T. Yamamoto ( 1987 ). A method for finding sharp error bounds for Newton's method under the Kantorovich assumptions . Numer. Math. 49 : 203 – 230 . T. Yamamoto ( 1987 ). A convergence theorem for Newton-like methods in Banach spaces . Numer. Math. 51 : 545 – 557 . T. Yamamoto ( 1989 ). Uniqueness of the solution in a Kantorovich-type theorem of Haubler for the Gauss–Newton method . Japan J. Appl. Math. 6 : 77 – 81 . ], we provide more precise information on the location of the solution and finer bounds on the distances involved. Moreover, since our Newton–Kantorovich-type hypothesis is weaker than before, we can now cover cases not previously possible.

Applications and numerical examples involving a nonlinear integral equation of Chandrasekhar-type and a differential equation with Green's function are also provided in this study.     

Harmonic and Probabilistic Approaches to Zeros of Riemann's Zeta Function

Probability concepts and results are closely related to the study of zeros of the classical Riemann zeta function and its affinity to Gaussian and Gamma distributions. This is elaborated in obtaining the functional and integral equations for the zeta and in the determination first of the nonzero sets and then sets containing almost all (i.e., for the CLT probability measure) nontrivial zeros of the zeta function ζ(·). Also probability distributions determined by the zeta, based on the behavior of their finite dimensional distributions of the ζ(σ +it), σ > 0; as t varies and particularly the results of Denjoy, slightly sharpened, and also one of Salem are included. Several related opinions and comments are discussed.     

Multiscaling for classical nanosystems: Derivation of Smoluchowski & Fokker–Planck equations

Using multiscale analysis and methods of statistical physics, we show that a solution to the N-atom Liouville equation can be decomposed via an expansion in terms of a smallness parameter , wherein the long scale time behavior depends upon a reduced probability density that is a function of slow-evolving order parameters. This reduced probability density is shown to satisfy the Smoluchowski equation up to O(²) for a given range of initial conditions. Furthermore, under the additional assumption that the nanoparticle momentum evolves on a slow time scale, we show that this reduced probability density satisfies a Fokker–Planck equation up to O(²). This approach has applications to a broad range of problems in the nanosciences.     

Martingales, detrending data, and the efficient market hypothesis

We discuss martingales, detrending data, and the efficient market hypothesis (EMH) for stochastic processes x(t) with arbitrary diffusion coefficients D(x,t). Beginning with x-independent drift coefficients R(t) we show that martingale stochastic processes generate uncorrelated, generally non-stationary increments. Generally, a test for a martingale is therefore a test for uncorrelated increments. A detrended process with an x-dependent drift coefficient is generally not a martingale, and so we extend our analysis to include the class of (x,t)-dependent drift coefficients of interest in finance. We explain why martingales look Markovian at the level of both simple averages and 2-point correlations. And while a Markovian market has no memory to exploit and presumably cannot be beaten systematically, it has never been shown that martingale memory cannot be exploited in 3-point or higher correlations to beat the market. We generalize our Markov scaling solutions presented earlier, and also generalize the martingale formulation of the EMH to include (x,t)-dependent drift in log returns. We also use the analysis of this paper to correct a misstatement of the ‘fair game’ condition in terms of serial correlations in Fama's paper on the EMH. We end with a discussion of Levy's characterization of Brownian motion and prove that an arbitrary martingale is topologically inequivalent to a Wiener process.     

Convexity and Haar null sets

It is shown that for every closed, convex and nowhere dense subset of a superreflexive Banach space there exists a Radon probability measure on so that for all . In particular, closed, convex, nowhere dense sets in separable superreflexive Banach spaces are Haar null. This is unlike the situation in separable nonreflexive Banach spaces, where there always exists a closed convex nowhere dense set which is not Haar null.

     

Farey Series and the Riemann Hypothesis III

In this paper we shall make a further study on the the equivalence problem, i.e., equivalent conditions to the Riemann hypothesis in terms of Farey series by developing a rather analytical (-arithmetical) method to establish unexpected short interval results, namely results, therewith simultaneously clarifying the underlying reasons for results obtained in Part I.     

Maximal resolvability of totally bounded and ℵ0-bounded groups

The maximal resolvability of totally bounded groups (and, under the assumption that the generalized continuum hypothesis holds, of ₀-bounded groups) is proved.Translated fromMatematicheskie Zametki, Vol. 63, No. 4, pp. 593–598, April, 1998.This research was supported by the Russian Foundation for Basic Research under grant No. 94-01-01374.     

Higher Order Turán Inequalities

The celebrated Turán inequalities , where denotes the Legendre polynomial of degree , are extended to inequalities for sums of products of four classical orthogonal polynomials. The proof is based on an extension of the inequalities , which hold for the Maclaurin coefficients of the real entire function in the Laguerre-Pólya class, .

     

Groups which do not admit ghosts

A ghost in the stable module category of a group is a map between representations of that is invisible to Tate cohomology. We show that the only non-trivial finite -groups whose stable module categories have no non-trivial ghosts are the cyclic groups and . We compare this to the situation in the derived category of a commutative ring. We also determine for which groups the second power of the Jacobson radical of is stably isomorphic to a suspension of .

     

Small generators of the ideal class group

Assuming the Generalized Riemann Hypothesis, Bach has shown that the ideal class group of a number field can be generated by the prime ideals of having norm smaller than . This result is essential for the computation of the class group and units of by Buchmann's algorithm, currently the fastest known. However, once has been computed, one notices that this bound could have been replaced by a much smaller value, and so much work could have been saved. We introduce here a short algorithm which allows us to reduce Bach's bound substantially, usually by a factor 20 or so. The bound produced by the algorithm is asymptotically worse than Bach's, but favorable constants make it useful in practice.