Convergence analysis for the Secant method based on new recurrence relations

A new convergence theorem for the Secant method in Banach spaces based on new recurrence relations is established for approximating a solution of a nonlinear operator equation. It is assumed that the divided difference of order one of the nonlinear operator is Lipschitz continuous. The convergence conditions differ from some existing ones and are easily satisfied. The results of the paper are justified by numerical examples that cannot be handled by earlier works.

Explicit Relations of Physical Potentials Through Generalized Hypervirial and Kramers' Recurrence Relations

Based on a Hamfltonian identity, we study one-dimensional generalized hypervirial theorem, Blanchardlike （non-diagonal case） and Kramers＇ （diagonal case） recurrence relations for arbitrary x^k which is independent of the central potential V（x）. Some significant results in diagonal case are obtained for special k in xk （k ≥2）. In particular, we find the orthogonal relation 〈n1｜n2〉 = δh1,n2 （k = 0）, 〈n1[V＇（x）｜n2〉 = （En1-En2）^2〈n1｜x｜n2〉 （k = 1）, En = （n｜V＇（x）x/2｜n〉 ＋ （n｜V（x）｜n〉 （k = 2） and -4En（n｜x｜n） ~ 〈n｜V＇（x）x^2｜n〉 ＋ 4〈n｜V（x）x｜n〉 =0 （k=3）. The latter two formulas can be used directly to calculate the energy levels. We present useYul explicit relations for some well known physical potentials without requiring the energy spectra of quantum system.

A General Solution for a Class of Non-Homogeneous Recurrence Relations with Two Indices

In this paper,we present the formula of a solution for a class of recurrence relations with two indices by applying iteration and induction according to the principle of solving algebraic equa-tions. It provides a concrete model to solve the concerned prob-lems with modern computing tools.

On Relations for Moments of Generalized Order Statistics for Lindley–Weibull Distribution

Moments of generalized order statistics appear in several areas of science and engineering.These moments are useful in studying properties of the random variables which are arranged in increasing order of importance,for example,time to failure of a computer system.The computation of these moments is sometimes very tedious and hence some algorithms are required.One algorithm is to use a recursive method of computation of these moments and is very useful as it provides the basis to compute higher moments of generalized order statistics from the corresponding lower-order moments.Generalized order statistics pro-vides several models of ordered data as a special case.The moments of general-ized order statistics also provide moments of order statistics and record values as a special case.In this research,the recurrence relations for single,product,inverse and ratio moments of generalized order statistics will be obtained for Lindley–Weibull distribution.These relations will be helpful for obtained moments of gen-eralized order statistics from Lindley–Weibull distribution recursively.Special cases of the recurrence relations will also be obtained.Some characterizations of the distribution will also be obtained by using moments of generalized order statistics.These relations for moments and characterizations can be used in differ-ent areas of computer sciences where data is arranged in increasing order.

Solution of the Energy Level of Hydrogen-Like Atom for the Debye Shielding Potential

The first-order revision and the approximation analytical formula of the energy levels for hydrogen-like atoms under the condition of Debye shielding potential are achieved by means of the Rayleigh–Schr?dinger perturbation theory; meanwhile, the corresponding recurrence relations are obtained from the use of the solution of power series. Based on the above solutions and with the use of energy consistent method the equivalent value of second-order reversion under the condition of Debye shielding potential is produced as well and the result is compared with the data obtained by the numerical method. Besides, the critical bond-state and corresponding cut-off conditions are discussed.

Improvement of the minimal residual method for solving nonsymmetric linear systems

In this paper, the minimal residual （MRES） method for solving nonsymmetric equation systems was improved, the recurrence relation was deduced between the approximate solutions of the linear equation system Ax = b, and a more effective method was presented, which can reduce the operational count and the storage.

A new class of three-variable orthogonal polynomials and their recurrences relations

A new class of three-variable orthogonal polynomials, defined as eigenfunctions of a second order PDE operator, is studied. These polynomials are orthogonal over a curved tetrahedron region, which can be seen as a mapping from a traditional tetrahedron, and can be taken as an extension of the 2-D Steiner domain. The polynomials can be viewed as Jacobi polynomials on such a domain. Three-term relations are derived explicitly. The number of the individual terms, involved in the recurrences relations, are shown to be independent on the total degree of the polynomials. The numbers now are determined to be five and seven, with respect to two conjugate variables z, $ \bar z $ and a real variable r, respectively. Three examples are discussed in details, which can be regarded as the analogues of the Chebyshev polynomials of the first and the second kinds, and Legendre polynomials.

The dynamics of one-dimensional random quantum XY system with Dzyaloshinskii-Moriya interaction

In this paper,the effects of random variables on the dynamics of the s = 1/2 XY model with the Dzyaloshinskii-Moriya interaction are studied.By means of the recurrence relation method in the high-temperature limit,we calculate the spin autocorrelation functions as well as the corresponding spectral densities for the cases that the exchange couplings between spins or external magnetic fields satisfy the double-Gaussian distribution.It is found that when the standard deviation of random exchange coupling δJ（or the standard deviation of random external field δB） is small,the dynamics of the system undergoes a crossover from a collective-mode behavior to a central-peak one.However,when δJ（or δB） is large,the crossover vanishes,and the system shows a central-peak behavior or the most disordered one.We also analyze the cases in which the exchange couplings or the external fields satisfy the bimodal and the Gaussian distributions.Our results show that for all the cases considered,the dynamics of the above system is similar to that of the one-dimensional random XY model.

Solving the spin-weighted spheroidal wave equation

In this paper we solve spin-weighted spheroidal wave equations through super-symmetric quantum mechanics with a different expression of the super-potential. We use the shape invariance property to compute the ＂excited＂ eigenvalues and eigenfunctions. The results are beneficial to researchers for understanding the properties of the spin-weighted spheroidal wave more deeply, especially its integrability.

On Degenerate Array Type Polynomials

In the paper,with the help of the Fa′a di Bruno formula and an identity of the Bell polynomials of the second kind,the authors define degenerateλ-array type polynomials,establish two explicit formulas,and present several recurrence relations of degenerateλ-array type polynomials and numbers.

A Formula of Solution for a Class of Linear Recurence with Two Indices

It is very difficult, sometimes impossible, to get a formula solution of recurrence relation, even for the case of homogeneous recurrence with one indite. In this paper, according to the principle of soluting algebraic equation, we present the formula of solution for a class of recurrnce relations with two indices by appling iteration and induction. It provides a concrete model to solve the concerning problems with modern computing tools.

Cumulative frequency b value without upper bound magnitude and its regression determination

This paper points out that it is theoretically wrong for the traditional method to determine cumulatiove b value using linear regression and derive earthquake recurrence relation according to probability distribution or density function. As a result, it always systematically overestimated b value so as to underestimate the frequencies of the part of larger earthquakes. The smaller the actual b in the research area, or the smaller the magnitude range of the data in regression, or the smaller the magnitude interval, the larger the above deviation. So for an area with lower upper bound magnitude, if only historic earthquake data are used to determine b value by regression method, the b value will be obviously overestimated and systematic deviation of seismic hazard will be arised because the lower bound magnitude of reliable data is high and the magnitude range of data is small. In this paper, it is suggested to substitude cumulative b value without upper bound magnitude for conventional cumulative b value with upper bound magnitude, and the regression method is devloped to determine b value without upper bound magnitude.

Volterra Integral Equation of Hermite Matrix Polynomials

The primary purpose of this paper is to present the Volterra integral equa- tion of the two-variable Hermite matrix polynomials. Moreover, a new representation of these matrix polynomials are established here.

SOME PROPERTIES OF GALTON-WATSON BRANCHING PROCESSES IN VARYING ENVIRONMENTS

This article deals with some properties of Galton-Watson branching processes in varying environments. A necessary and suffcient condition for relative recurrent state is presented, and a series of ratio limit properties of the transition probabilities are showed.

Nonlinear Inverse Relations of the Bell Polynomials via the Lagrange Inversion Formula (Ⅱ)

In this paper,by means of the classical Lagrange inversion formula,the authors establish a general nonlinear inverse relation as the solution to the problem proposed in the paper[J.Wang,Nonlinear inverse relations for the Bell polynomials via the Lagrange inversion formula,J.Integer Seq.,Vol.22(2019),Article 19.3.8].As applications of this inverse relation,the authors not only find a short proof of another nonlinear inverse relation due to Birmajer,et al.(2012),but also set up a few convolution identities concerning the Mina polynomials.

A Unified Approach for Developing EfficientAlgorithmic Programs

A unified approach called partition-and-recur for developing efficient and correct algorithmic programs is presented. An algorithm (represented by recurrence and initiation) is separated from program, and special attention is paid to algorithm manipulation rather than program calculus. An algorithm is exactly a set of mathematical formulae. It is easier for formal derivation and proof. After getting efficient and correct algorithm, a trivial transformation is used to get a final program. The approach covers several known algorithm design techniques, e.g. dynamic programming, greedy, divide-and-conquer and enumeration, etc. The techniques of partition and recurrence are not new. Partition is a general approach for dealing with complicated objects and is typically used in divide-and-conquer approach. Recurrence is used in algorithm analysis, in developing loop invariants and dynamic programming approach. The main contribution is combining two techniques used in typical algorithm development into a unified and systematic approach to develop general efficient algorithmic programs and presenting a new representation of algorithm that is easier for understanding and demonstrating the correctness and ingenuity of algorithmic programs.

Two New Strategies for Developing Loop Invariants and Their Applications

The loop invariants take a very important role in the design,proof and derivation of the algorithmic program.We point out the limitations of the traditional standard strategy for developing loop invariants, and propose two new strategies for proving the existing algorithmic program and developing new ones. The strategies use recurrence as vehicle and integrate some effective methods of designing algorithms, e.g.Dynamic Programming,Greedy and Divide Conquer,into the recurrence relation of problem solving sequence.This lets us get straightforward an approach for solving a variety of complicated prob- lems,and makes the standard proof and formal derivation of their algorithmic programs possible.We show the method and advantages of applying the strategies with several typical nontrivial examples.

Sun's Log-concavity Conjecture on the Catalan–Larcombe–French Sequence

Let {Pn},n≥0 denote the Catalan-Larcombe-French sequence, which naturally came from the series expansion of the complete elliptic integral of the first kind. In this paper, we prove the strict log-concavity of the sequence { n√Pn}n≥1, which was originally conjectured by Z. W. Sun. We also obtain the strict log-concavity of the sequence {n√Vn}n≥1, where {Vn}n≥0 is the Fennessey-Larcombe- French sequence arising from the series expansion of the complete elliptic integral of the second kind.

The Number of Perfect Matchings in (3,6)-Fullerene

A(3,6)-fullerene is a connected cubic plane graph whose faces are only triangles and hexagons,and has the connectivity 2 or 3.The(3,6)-fullerenes with connectivity 2 are the tubes consisting of l concentric hexagonal layers such that each layer consists of two hexangons,capped on each end by two adjacent triangles,denoted by T_(l)(l≥1).A(3,6)-fullerene Tl with n vertices has exactly 2n/4+1 perfect matchings.The structure of a(3,6)-fullerene G with connectivity 3 can be determined by only three parameters r,s and t,thus we denote it by G=(r,s,t),where r is the radius(number of rings),s is the size(number of spokes in each layer,s(≥4,s is even),and t is the torsion(0≤t<s,t≡r mod 2).In this paper,the counting formula of the perfect matchings in G=n+1,4,t)is given,and the number of perfect matchpings is obtained.Therefore,the correctness of the conclusion that every bridgeless cubic graph with p vertices has at least 2p/3656perfect matchings proposed by Esperet et al is verified for(3,6)-fullerene G=(n+1,4,t).

A property of Pisot numbers and Fourier transforms of self-similar measures

For any Pisot number β it is known that the set F（β） ={t ： limn→∞‖tβn‖ = 0} is countable, where ‖α‖ is the distance between a real number a and the set of integers. In this paper it is proved that every member in this set is of the form cβn, where n is a nonnegative integer and e is determined by a linear system of equations. Furthermore, for some self-similar measures μ associated with β, the limit at infinity of the Fourier transforms limn→μ（tβn）≠0 if and only if t is in a certain subset of F（β）. This generalizes a similar result of Huang and Strichartz.