Diagonally loaded SMI algorithm based on inverse matrix recursion

The derivation of a diagonally loaded sample-matrix inversion （LSMI） algorithm on the busis of inverse matrix recursion （i.e.LSMI-IMR algorithm） is conducted by reconstructing the recursive formulation of covariance matrix. For the new algorithm, diagonal loading is by setting initial inverse matrix without any addition of computation. In addition, a corresponding improved recursive algorithm is presented, which is low computational complexity. This eliminates the complex multiplications of the scalar coefficient and updating matrix, resulting in significant computational savings. Simulations show that the LSMI-IMR algorithm is valid.

Fuzzy Shape Control Based on El man Dynamic Recursion Network Prediction Model

In the strip rolling process, shape control system possesses the characteristics of nonlinearity, strong coupling, time delay and time variation. Based on self adapting Elman dynamic recursion network prediction model, the fuzzy control method was used to control the shape on four-high cold mill. The simulation results showed that the system can be applied to real time on line control of the shape.

THE RECURSION OPERATOR FOR A CONSTRAINED CKP HIERARCHY

This paper gives a recursion operator for a 1-constrained CKP hierarchy, and by the recursion operator it proves that the 1-constrained CKP hierarchy can be reduced to the mKdV hierarchy under condition q = r.

Recursion Least Square Method to Study the Fault Diagnosis and Its Model of Hydraulic Equipment

In this paper establishing model of the fault diagnosis of hydraulic equipment isdescribed in details. It also studies the advantage of the recursion least square method. When theLSM is used in compuring the fault of hydraulic equipment, not only does it save the computerCPU-time and memory, but it also has a high computation speed and,makes it easy to identifythe estimation parameters.

用Recursion方法计算晶格声子谱

用Recursion方法计算了体心、面心、金刚石结构晶体的声子谱。计算结果表明了这种方法计算复杂晶格结构谱密度的有效性。 这一工作也为用Recursion方法处理复杂结构无序体系问题提供了准备。

Construction of Recursion Formulas for Lax Pairs of (2+1)-Dimensional Equation: Modified Generalized Dispersive Long Wave Equation

In this article, we study the Lax pairs of -dimensional equation: the modified generalized dispersive long wave (MGDLW) equation. Based on the well-known binary Darboux transformation, we dig out the recursion formulas of the first part of the Lax pairs. Then by further discussion and doing some revisional work, we make the recursion formulas fit for the second part of Lax pairs. At last, some solutions to the MGDLW equation are worked out by using the recursion formula.

Recursion Operators of Two Supersymmetric Equations

From Lax representations,recursion operators for the supersymmetric KdV and the supersymmetric Kaup-Kupershimdt (SKK) equations are proposed explicitly.Under some special conditions,the recursion operator of the supersymmetric Sawada-Kotera equation can be recovered by the one of the SKK equation.

NONLOCAL SYMMETRIES AND NONLOCAL RECURSION OPERATORS

An expose about covering method on differential equations was given. The general formulae to determine nonlocal symmetries were derived which are analogous to the prolongation formulae of generalized symmetries. In addition., a new definition of nonlocal recursion operators was proposed, which gave a satisfactory explaination in covering theory for the integro-differential recursion operators.

Recursion Formulae for Obtaining Surfaces with Constant MeanCurvature inR^2,1

Though the Bǎcklund transformation on time-like surfaces with constant mean curvature surfaces in R^2,1 has been obtained, it is not easy to obtain corresponding surfaces because the procedure of solving the related integrable system cannot be avoided when the Bǎcklund transformation is used, For sake of this, in this article, some special work is done to reform the Bǎcklund transformation to a recursion formula, by which we can construct time-like surfaces with constant mean curvature form known ones just by quadrature procedure.

A GENERALIZATION OF RECURSION OPERATORSOFDIFFERENTIAL EQUATIONS

Most important recursion operators of differential equations are integro-differential operators. One often runs into difficulties in trying to obtain a full hierarchy of symmetries. The lack of precision sometimes leads to bogus symmetries. In this paper, a generalization of recursion operators is given, which eliminates the problem. Several examples are also given to demonstrate the generalization and the significance of the generalization is shown simultaneously.

OPTIMAL SCHEME FOR SEQUENTIAL COMPUTATIONS OF F_m(z) INTEGRALS IN AB INITIO CALCULATIONS----COMBINATORY USE OF UPWARD AND DOWNWARD RECURSIONS

The quantitative rules of the transfer and variation of errors,when the Gaussian integral functions F.(z) are evaluated sequentially by recurring,have been expounded.The traditional viewpoint to negate the applicability and reliability of upward recursive formula in principle is amended.An optimal scheme of upward-and downward-joint recursions has been developed for the sequential F(z) computations.No additional accuracy is needed with the fundamental term of recursion because the absolute error of Fn(z) always decreases with the recursive approach.The scheme can be employed in modifying any of existent subprograms for Fn<z> computations.In the case of p-d-f-and g-type Gaussians,combining this method with Schaad's formulas can reduce,at least,the additive operations by a factor 40%;the multiplicative and exponential operations by a factor 60%.

Asymptotics on Two-dimensional Recursion Sequences

In this paper, we give precise formulas for the general two-dimensional recursion sequences by generating function method, and make use of the multivariate generating functions asymptotic estimation technique to compute their asymptotic values.

On the Use of the Initial Values of Recursions

In this paper we make a study of the use of the iniiai values of a recursion skilfully, so that the count for finding a solution of any recursion will be more simplified. Finally, we give out the "moving forth prineiple" of initial values of a recursion.

Carleman Linearization and Systems of Arbitrary Depth Polynomial Recursions

New approach to systems of polynomial recursions is developed based on the Carleman linearization procedure. The article is divided into two main sections: firstly, we focus on the case of uni-variable depth-one polynomial recurrences. Subsequently, the systems of depth-one polynomial recurrence relations are discussed. The corresponding transition matrix is constructed and upper triangularized. Furthermore, the powers of the transition matrix are calculated using the back substitution procedure. The explicit expression for a solution to a broad family of recurrence relations is obtained. We investigate to which recurrences the framework can be applied and construct sufficient conditions for the method to work. It is shown how introduction of auxiliary variables can be used to reduce arbitrary depth systems to the depth-one system of recurrences dealt with earlier. Finally, the limitations of the method are discussed, outlining possible directions for future research.

Nonlinear Program Construction and Verification Method Based on Partition Recursion and Morgan's Refinement Rules

The traditional program refinement strategy cannot be refined to an executable program,and there are issues such as low verification reliability and automation.To solve the above problems,this paper proposes a nonlinear program construction and verification method based on partition recursion and Morgan’s refinement rules.First,we use recursive definition technique to characterize the initial specification.The specification is then transformed into GCL(Guarded Command Language)programs using loop invariant derivation and Morgan’s refinement rules.Furthermore,VCG(Verification Condition Generator)is used in the GCL program to generate the verification condition automatically.The Isabelle theorem prover then validates the GCL program’s correctness.Finally,the GCL code generates a C++executable program automatically via the conversion system.The effectiveness of this method is demonstrated using binary tree preorder traversal program construction and verification as an example.This method addresses the problem that the construction process’s loop invariant is difficult to obtain and the refinement process is insufficiently detailed.At the same time,the method improves verification process automation and reduces the manual verification workload.

An introduction to on-shell recursion relations

This article provides an introduction to on-shell recursion relations for calculations of tree-level amplitudes. Starting with the basics, such as spinor notations and color decompositions, we ex- pose analytic properties of gauge-boson amplitudes, BCFW-deformations, the large z-behavior of amplitudes, and on-shell recursion relations of gluons. We discuss further developments of on-shell recursion relations, including generalization to other quantum field theories, supersymmetric theo- ties in particular, recursion relations for off-shell currents, recursion relation with nonzero boundary contributions, bonus relations, relations for rational parts of one-loop amplitudes, recursion relations in 3D and a proof of CSW rules. Finally, we present samples of applications, including solutions of split helicity amplitudes and of Af = 4 SYM theories, consequences of consistent conditions under re- cursion relation, Kleiss-Kuijf （KK） and Bern-Carrasco-Johansson （BCJ） relations for color-ordered gluon tree amplitudes, Kawai-Lewellen-Tye （KLT） relations.

Recursion Relations for the Constrained Multi-component KP Hierarchy

In this paper, we define a new constrained multi-component KP （cMKP） hierarchy which contains the constrained KP （cKP） hierarchy as a special case. We derive the recursion operator of the constrained multi-component KP hierarchy. As a special example, we also give the recursion operator of the constrained two-component KP hierarchy.

On Recursion Operator of the q-KP Hierarchy

It is the aim of the present article to give a general expression of flow equations of the q-KP hierarchy.The distinct difference between the q-KP hierarchy and the KP hierarchy is due to q-binomial and the action of q-shift operator θ, which originates from the Leibnitz rule of the quantum calculus. We further show that the n-reduction leads to a recursive scheme for these flow equations. The recursion operator for the flow equations of the q-KP hierarchy under the n-reduction is also derived.

Topological Recursion Relations from Pixton Relations

We propose an algorithm to derive tautological relations from Pixton relations. We carry out this algorithm explicitly to derive some results in genus 0, 1, 2, 3 and analyze the possibility to generalize to higher genera. As an application, some results about reconstruction of Gromov–Witten invariants can be derived.

Recursions for the Individual Risk Model

In the actuarial literature, several exact and approximative recursive methods have been proposed for calculating the distribution of a sum of mutually independent compound Bernoulli distributed random variables. In this paper, we give an overview of these methods. We compare their performance with the straight- forward convolution technique by counting the number of dot operations involved in each method. It turns out that in many practicle situations, the recursive methods outperform the convolution method.