Newton’s method and high-order algorithms for the nth root computation

Two modifications of Newton’s method to accelerate the convergence of the n$n$th root computation of a strictly positive real number are revisited. Both modifications lead to methods with prefixed order of convergence p∈N,p≥2$p\in \mathbb{N},p\ge 2$. We consider affine combinations of the two modified p$p$th-order methods which lead to a family of methods of order p$p$ with arbitrarily small asymptotic constants. Moreover the methods are of order p+1$p+1$ for some specific values of a parameter. Then we consider affine combinations of the three methods of order p+1$p+1$ to get methods of order p+1$p+1$ again with arbitrarily small asymptotic constants. The methods can be of order p+2$p+2$ with arbitrarily small asymptotic constants, and also of order p+3$p+3$ for some specific values of the parameters of the affine combination. It is shown that infinitely many p$p$th-order methods exist for the n$n$th root computation of a strictly positive real number for any p≥3$p\ge 3$.     

Improved Newton’s method with exact line searches to solve quadratic matrix equation

In this paper, we study the matrix equation AX²+BX+C=0$A{X}^2+BX+C=0$, where A,B$A,B$ and C$C$ are square matrices. We give two improved algorithms which are better than Newton’s method with exact line searches to calculate the solution. Some numerical examples are reported to illustrate our algorithms.     

A note on distance-regular graphs with a small number of vertices compared to the valency

In this note we study distance-regular graphs with a small number of vertices compared to the valency. We show that for a given α>2$\alpha >2$, there are finitely many distance-regular graphs Γ$\Gamma$ with valency k$k$, diameter D≥3$D\ge 3$ and v$v$ vertices satisfying v≤αk$v\le \alpha k$ unless (D=3$D=3$ and Γ$\Gamma$ is imprimitive) or (D=4$D=4$ and Γ$\Gamma$ is antipodal and bipartite). We also show, as a consequence of this result, that there are finitely many distance-regular graphs with valency k≥3$k\ge 3$, diameter D≥3$D\ge 3$ and _c2≥εk$c_2\ge \epsilon k$ for a given 0<ε<1$0<\epsilon <1$ unless (D=3$D=3$ and Γ$\Gamma$ is imprimitive) or (D=4$D=4$ and Γ$\Gamma$ is antipodal and bipartite).     

A unified proof of Brooks’ theorem and Catlin’s theorem

Brooks’ theorem is a fundamental result in the theory of graph coloring. Catlin proved the following strengthening of Brooks’ theorem: Let d$d$ be an integer at least 3, and let G$G$ be a graph with maximum degree d$d$. If G$G$ does not contain _Kd+1$K_{d+1}$ as a subgraph, then G$G$ has a d$d$-coloring in which one color class has size α(G)$\alpha \left(G\right)$. Here α(G)$\alpha \left(G\right)$ denotes the independence number of G$G$. We give a unified proof of Brooks’ theorem and Catlin’s theorem.     

Modules satisfying the weak Nakayama property

Let R$R$ be a commutative ring with identity. We will say that an R$R$-module M$M$ satisfies the weak Nakayama property, if IM=M$IM=M$, where I$I$ is an ideal of R$R$, implies that for any x∈M$x\in M$ there exists a∈I$a\in I$ such that (a−1)x=0$(a-1)x=0$. In this paper, we will study modules satisfying the weak Nakayama property. It is proved that if R$R$ is a local ring, then R$R$ is a Max ring if and only if J(R)$J\left(R\right)$, the Jacobson radical of R$R$, is T$T$-nilpotent if and only if every R$R$-module satisfies the weak Nakayama property.     

Asymptotic average shadowing property on compact metric spaces

We prove that if for a continuous map f$f$ on a compact metric space X$X$, the chain recurrent set, R(f)$R\left(f\right)$ has more than one chain component, then f$f$ does not satisfy the asymptotic average shadowing property. We also show that if a continuous map f$f$ on a compact metric space X$X$ has the asymptotic average shadowing property and if A$A$ is an attractor for f$f$, then A$A$ is the single attractor for f$f$ and we have A=R(f)$A=R\left(f\right)$. We also study diffeomorphisms with asymptotic average shadowing property and prove that if M$M$ is a compact manifold which is not finite with dimM=2$dimM=2$, then the C¹$C^1$ interior of the set of all C¹$C^1$ diffeomorphisms with the asymptotic average shadowing property is characterized by the set of Ω$\Omega$-stable diffeomorphisms.     

On topological entropy of commuting tree maps

Let T$T$ be a tree with s$s$ ends and f,g$f,g$ be continuous maps from T$T$ to T$T$ with f°g=g°f$f°g=g°f$. In this note we show that if there exists a positive integer m≥2$m\ge 2$ such that gcd(m,l)=1$gcd(m,l)=1$ for any 2≤l≤s$2\le l\le s$ and f,g$f,g$ share a periodic point which is a km$km$-periodic point of f$f$ for some positive integer k$k$, then the topological entropy of f°g$f°g$ is positive.     

On probabilistic results for the discrepancy of a hybrid-Monte Carlo sequence

In many applications it has been observed that hybrid-Monte Carlo sequences perform better than Monte Carlo and quasi-Monte Carlo sequences, especially in difficult problems. For a mixed s$s$-dimensional sequence m$m$, whose elements are vectors obtained by concatenating d$d$-dimensional vectors from a low-discrepancy sequence q$q$ with (s−d)$(s-d)$-dimensional random vectors, probabilistic upper bounds for its star discrepancy have been provided. In a paper of G. Ökten, B. Tuffin and V. Burago [G. Ökten, B. Tuffin, V. Burago, J. Complexity 22 (2006), 435–458] it was shown that for arbitrary ε>0$\epsilon >0$ the difference of the star discrepancies of the first N$N$ points of m$m$ and q$q$ is bounded by ε$\epsilon$ with probability at least 1−2exp(−ε²N/2)$1-2exp(-{\epsilon }^{2}N/2)$ for N$N$ sufficiently large. The authors did not study how large N$N$ actually has to be and if and how this actually depends on the parameters s$s$ and ε$\epsilon$. In this note we derive a lower bound for N$N$, which significantly depends on s$s$ and ε$\epsilon$. Furthermore, we provide a probabilistic bound for the difference of the star discrepancies of the first N$N$ points of m$m$ and q$q$, which holds without any restrictions on N$N$. In this sense it improves on the bound of Ökten, Tuffin and Burago and is more helpful in practice, especially for small sample sizes N$N$. We compare this bound to other known bounds.     

New expansions of numerical eigenvalues by Wilson’s element

The paper explores new expansions of eigenvalues for −Δu=λρu$-\Delta u=\lambda \rho u$ in S$S$ with Dirichlet boundary conditions by Wilson’s element. The expansions indicate that Wilson’s element provides lower bounds of the eigenvalues. By the extrapolation or the splitting extrapolation, the O(h⁴)$O\left(h^4\right)$ convergence rate can be obtained, where h$h$ is the maximal boundary length of uniform rectangles. Numerical experiments are carried to verify the theoretical analysis made. It is worth pointing out that these results are new, compared with the recent book, Lin and Lin [Q. Lin, J. Lin, Finite Element Methods; Accuracy and Improvement, Science Press, Beijing, 2006].     

An extension of Draghicescu’s fast tree-code algorithm to the vortex method on a sphere

A fast and accurate algorithm to compute interactions between N$N$ point vortices and between N$N$ vortex blobs on a sphere is proposed. It is an extension of the fast tree-code algorithm developed by Draghicescu for the vortex method in the plane. When we choose numerical parameters in the fast algorithm suitably, the computational cost of O(N²)$O\left(N^2\right)$ is reduced to O(N(logN)⁴)$O\left(N{(logN)}^4\right)$ and the approximation error decreases like O(1/N)$O(1/N)$ when N→∞$N\to \infty$, as demonstrated in the present article. We also apply the fast method to long-time evolution of two vortex sheets on the sphere to see the efficiency. A key point is to describe the equation of motion for the N$N$ points in the three-dimensional Cartesian coordinates.     

On functional limits of short- and long-memory linear processes with GARCH(1,1) noises

This paper considers the short- and long-memory linear processes with GARCH (1,1) noises. The functional limit distributions of the partial sum and the sample autocovariances are derived when the tail index α$\alpha$ is in (0,2)$(0,2)$, equal to 2, and in (2,∞)$(2,\infty )$, respectively. The partial sum weakly converges to a functional of α$\alpha$-stable process when α<2$\alpha <2$ and converges to a functional of Brownian motion when α≥2$\alpha \ge 2$. When the process is of short-memory and α<4$\alpha <4$, the autocovariances converge to functionals of α/2$\alpha /2$-stable processes; and if α≥4$\alpha \ge 4$, they converge to functionals of Brownian motions. In contrast, when the process is of long-memory, depending on α$\alpha$ and β$\beta$ (the parameter that characterizes the long-memory), the autocovariances converge to either (i) functionals of α/2$\alpha /2$-stable processes; (ii) Rosenblatt processes (indexed by β$\beta$, 1/2<β<3/4$1/2<\beta <3/4$); or (iii) functionals of Brownian motions. The rates of convergence in these limits depend on both the tail index α$\alpha$ and whether or not the linear process is short- or long-memory. Our weak convergence is established on the space of càdlàg functions on [0,1]$[0,1]$ with either (i) the _J1$J_1$ or the _M1$M_1$ topology (Skorokhod, 1956); or (ii) the weaker form S$S$ topology (Jakubowski, 1997). Some statistical applications are also discussed.     

Parametric inference for discretely observed multidimensional diffusions with small diffusion coefficient

We consider a multidimensional diffusion X$X$ with drift coefficient b(α,_Xt)$b(\alpha ,X_t)$ and diffusion coefficient ?σ(β,_Xt)$?\sigma (\beta ,X_t)$. The diffusion sample path is discretely observed at times _tk=kΔ$t_k=k\Delta$ for k=1…n$k=1\dots n$ on a fixed interval [0,T]$[0,T]$. We study minimum contrast estimators derived from the Gaussian process approximating X$X$ for small ?$?$. We obtain consistent and asymptotically normal estimators of α$\alpha$ for fixed Δ$\Delta$ and ?→0$?\to 0$ and of (α,β)$(\alpha ,\beta )$ for Δ→0$\Delta \to 0$ and ?→0$?\to 0$ without any condition linking ?$?$ and Δ$\Delta$. We compare the estimators obtained with various methods and for various magnitudes of Δ$\Delta$ and ?$?$ based on simulation studies. Finally, we investigate the interest of using such methods in an epidemiological framework.     

Matchings in graphs of odd regularity and girth

We establish lower bounds on the matching number of graphs of given odd regularity d$d$ and odd girth g$g$, which are sharp for many values of d$d$ and g$g$. For d=g=5$d=g=5$, we characterize all extremal graphs.     

Critical exponents for non-simultaneous blow-up in a localized parabolic system

The paper deals with the radially symmetric solutions of _ut=Δu+u^m(x,t)vⁿ(0,t)$u_t=\Delta u+u^m(x,t)v^n(0,t)$, _vt=Δv+u^p(0,t)v^q(x,t)$v_t=\Delta v+u^p(0,t)v^q(x,t)$, subject to null Dirichlet boundary conditions. For the blow-up classical solutions, we propose the critical exponents for non-simultaneous blow-up by determining the complete and optimal classification for all the non-negative exponents: (i) There exist initial data such that u$u$ (v$v$) blows up alone if and only if m>p+1$m>p+1$ (q>n+1$q>n+1$), which means that any blow-up is simultaneous if and only if m≤p+1$m\le p+1$, q≤n+1$q\le n+1$. (ii) Any blow-up is u$u$ (v$v$) blowing up with v$v$ (u$u$) remaining bounded if and only if m>p+1$m>p+1$, q≤n+1$q\le n+1$ (m≤p+1$m\le p+1$, q>n+1$q>n+1$). (iii) Both non-simultaneous and simultaneous blow-up may occur if and only if m>p+1$m>p+1$, q>n+1$q>n+1$. Moreover, we consider the blow-up rate and set estimates which were not obtained in the previously known work for the same model.     

Differential inequalities and equations in Banach spaces with a cone

A class of second-order abstract dissipative evolution differential operators D$D$ with 0∈kerD$0\in kerD$ is shown for which the fact that a non-zero t?u(t)$t?u\left(t\right)$ belongs to a cone and −Du$-Du$ to a dual cone may hold only on time intervals whose length is less than or equal to a defined number. Then oscillatory functions are dealt with in the framework of Banach spaces with a cone and conditions for the existence of a uniform oscillatory time for solutions of the equation Du=0$Du=0$ are given.     

Smale’s point estimate theory for Newton’s method on Lie groups

We introduce the notion of the (one-parameter subgroup) γ$\gamma$-condition for a map f$f$ from a Lie group to its Lie algebra and establish α$\alpha$-theory and γ$\gamma$-theory for Newton’s method for a map f$f$ satisfying this condition. Applications to analytic maps are provided, and Smale’s α$\alpha$-theory and γ$\gamma$-theory are extended and developed. Examples arising from initial value problems on Lie group are presented to illustrate applications of our results.