نتایج جستجو برای: non homogeneous linear recursions
تعداد نتایج: 1756898 فیلتر نتایج به سال:
We provide a proof of a conjecture in [2] on the existence and form of linear recursions for moments of powers of the Bessel function K0.
Suction caisson foundations provide options for new foundation systems offshore structures, particularly wind turbine applications. During the design process, it is necessary to make reliable predictions of stiffness foundation, since this has an important influence on dynamic performance overall support structure. The characteristics structure, in turn, its fatigue life. This paper describes a...
to evaluate the earth seismic response due to earthquake effects, ground response analyses are used to predict ground surface motions for development of design response spectra, to compute dynamic stresses and strains for evaluation of liquefaction hazards, and to determine the earthquake induced forces that can lead to instability of earth and earth-retaining structures. most of the analytical...
This paper presents a new algorithm that ensures low complexity implementation of a blind ST Rake receiver for DS-CDMA. The algorithm is applicable for both periodic and non-periodic spreading sequences provided that the system utilizes two layers of code separation: a spreading code layer and a scrambling code layer. The new method consists of two kinds of recursions: PAST recursions for a des...
Application of variational iteration method to non-homogeneous non-linear dissipative wave equations
A new algorithm is presented to solve both the finitehorizon time-varying and infinite-horizon timeinvariant discrete-time optimal reduced-order linear quadratic Gaussian (LQG) problem. In both cases the first order necessary optimality conditions can be represented by two non-linearly coupled discrete-time Lyapunov equations, which run forward and backward in discrete time. The algorithm itera...
We apply a tree-based methodology to solve new, very broadly defined families of nested recursions of the general form R(n) = ∑k i=1R(n − ai − ∑p j=1R(n − bij)), where ai are integers, bij are natural numbers, and k, p are natural numbers that we use to denote “arity” and “order,” respectively, and with some specified initial conditions. The key idea of the tree-based solution method is to asso...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید