Improving the convergence rate of the inverse iteration method

Solution of generalized eigenproblem, K phi = lambda M phi, by the classical inverse iteration method exhibits slow convergence for some eigenproblems. In this paper, a modified inverse iteration algorithm is presented for improving the convergence rate. At every iteration, an optimal linear combination of the latest and the preceding iteration vectors is used as the input vector for the next iteration. The effectiveness of the proposed algorithm is demonstrated for three typical eigenproblems, i.e. eigenproblems with distinct, close and repeated eigenvalues. The algorithm yields 29, 96 and 23% savings in computational time, respectively, for these problems. The algorithm is simple and easy to implement, and this renders the algorithm even more attractive.

Influence of clofibrate administration on the rate of synthesis of macromolecules in regenerating rat liver

Administration of the antihypercholesterolaemic drug clofibrate stimulates the rates of synthesis of nucleic acids and proteins in rat liver. The biosynthesis of mitochondrial proteins also is enhanced by the drug. In drug-fed animals, the rates of incorporation in vivo of radioactive precursors into DNA, RNA and proteins are stimulated even when the liver undergoes regeneration following partial hepatectomy. The rate of synthesis of mitochondrial proteins in the regenerative phase is higher in clofibrate-fed animals. These effects are consistent with the hepatomegalic and mitochondria-proliferating property of the drug.

Multiaction learning automata possessing ergodicity of the mean

Multiaction learning automata which update their action probabilities on the basis of the responses they get from an environment are considered in this paper. The automata update the probabilities according to whether the environment responds with a reward or a penalty. Learning automata are said to possess ergodicity of the mean if the mean action probability is the state probability (or unconditional probability) of an ergodic Markov chain. In an earlier paper [11] we considered the problem of a two-action learning automaton being ergodic in the mean (EM). The family of such automata was characterized completely by proving the necessary and sufficient conditions for automata to be EM. In this paper, we generalize the results of [11] and obtain necessary and sufficient conditions for the multiaction learning automaton to be EM. These conditions involve two families of probability updating functions. It is shown that for the automaton to be EM the two families must be linearly dependent. The vector defining the linear dependence is the only vector parameter which controls the rate of convergence of the automaton. Further, the technique for reducing the variance of the limiting distribution is discussed. Just as in the two-action case, it is shown that the set of absolutely expedient schemes and the set of schemes which possess ergodicity of the mean are mutually disjoint.

Influence of Lithium Fluoride on the Burning Rate of AP-Polyester Propellant

THE addition of catalysts normally serves the purpose of imparting a desired burning rate change in a composite propellant. These may either retard or enhance the burning rate. Some often quoted catalysts are oxides, chromites and chromates of metals. A lot of work has been done on rinding the effect of the addition of some of these catalysts on the burning rate; however, none seems to have appeared on the influence of lithium fluoride (LiF). Only qualitative reduction in the burning rate of composite propellants with the addition of LiF was reported by Williams et al.1 Dickinson and Jackson2 reported a slight decrease in the specific impulse of composite propellant with the addition of LiF; however, they made no mention of the effect of its addition on the burning rate. We have studied the effect of the addition of varying amounts of LiF on the burning rate of Ammonium Perchlorate (AP)-Polyester propellant.

Numerical study of heat transfer in laminar film boiling by the finite-difference method

The finite-difference form of the basic conservation equations in laminar film boiling have been solved by the false-transient method. By a judicious choice of the coordinate system the vapour-liquid interface is fitted to the grid system. Central differencing is used for diffusion terms, upwind differencing for convection terms, and explicit differencing for transient terms. Since an explicit method is used the time step used in the false-transient method is constrained by numerical instability. In the present problem the limits on the time step are imposed by conditions in the vapour region. On the other hand the rate of convergence of finite-difference equations is dependent on the conditions in the liquid region. The rate of convergence was accelerated by using the over-relaxation technique in the liquid region. The results obtained compare well with previous work and experimental data available in the literature.

Rate of ribonucleic acid chain growth in Mycobacterium tuberculosis H37Rv.

Two methods were employed to measure the rate of ribonucleic acid (RNA) chain growth in vivo in Mycobacterium tuberculosis H37Rv cultures growing in Sauton medium at 37 degrees C, with a generation time of 10 h. In the first, the bacteria were allowed to assimilate [3H]uracil or [3H]guanine into their RNA for short time periods. The RNA was then extracted and hydrolyzed with alkali, and the radioactivity in the resulting nucleotides and nucleosides was measured. The data obtained by this method allowed the calculation of the individual nucleotide step times during the growth of RNA chains, from which the average rate of RNA chain elongation was estimated to be about 4 nucleotides per s. The second method employed the antibiotic rifampin, which specifically inhibits the initiation of RNA synthesis without interfering with the elongation and completion of nascent RNA chains. Usint this method, the transcription time of the 16S, 23S, and 5S ribosomal RNA genes was estimated to be 7.6 min, which corresponds to a ribosomal RNA chain growth rate of 10 nucleotides per s.

The effect of lecithin on the burning rate of AP-Al---polyester propellant

Abstract is not available.

A Proof of Convergence of the B-RED and P-RED Algorithms for Random Early Detection

In [8], we recently presented two computationally efficient algorithms named B-RED and P-RED for random early detection. In this letter, we present the mathematical proof of convergence of these algorithms under general conditions to local minima.

On the maximal rate of non-square STBCs from complex orthogonal designs

A Linear Processing Complex Orthogonal Design (LPCOD) is a p x n matrix epsilon, (p >= n) in k complex indeterminates x(1), x(2),..., x(k) such that (i) the entries of epsilon are complex linear combinations of 0, +/- x(i), i = 1,..., k and their conjugates, (ii) epsilon(H)epsilon = D, where epsilon(H) is the Hermitian (conjugate transpose) of epsilon and D is a diagonal matrix with the (i, i)-th diagonal element of the form l(1)((i))vertical bar x(1)vertical bar(2) + l(2)((i))vertical bar x(2)vertical bar(2)+...+ l(k)((i))vertical bar x(k)vertical bar(2) where l(j)((i)), i = 1, 2,..., n, j = 1, 2,...,k are strictly positive real numbers and the condition l(1)((i)) = l(2)((i)) = ... = l(k)((i)), called the equal-weights condition, holds for all values of i. For square designs it is known. that whenever a LPCOD exists without the equal-weights condition satisfied then there exists another LPCOD with identical parameters with l(1)((i)) = l(2)((i)) = ... = l(k)((i)) = 1. This implies that the maximum possible rate for square LPCODs without the equal-weights condition is the same as that or square LPCODs with equal-weights condition. In this paper, this result is extended to a subclass of non-square LPCODs. It is shown that, a set of sufficient conditions is identified such that whenever a non-square (p > n) LPCOD satisfies these sufficient conditions and do not satisfy the equal-weights condition, then there exists another LPCOD with the same parameters n, k and p in the same complex indeterminates with l(1)((i)) = l(2)((i)) = ... = l(k)((i)) = 1.

Performance Analysis of Guidance Laws Based on Timescale Gap

An analytical treatment of performance analysis of guidance laws is possible only in simplistic scenarios. As the complexity of the guidance system increases, a search for analytical solutions becomes quite impractical. In this paper, a new performance measure, based upon the notion of a timescale gap that can be computed through numerical simulations, is developed for performance analysis of guidance laws. Finite time Lyapunov exponents are used to define the timescale gap. It is shown that the timescale gap can be used for quantification of the rate of convergence of trajectories to the collision course. Comparisonbetween several guidance laws, based on the timescale gap, is presented. Realistic simulations to study the effect of aerodynamicsand atmospheric variations on the timescale gap of these guidance laws are also presented.

On the maximal rate of (n+1) x n and (n+2) x n complex orthogonal designs

For p x n complex orthogonal designs in k variables, where p is the number of channels uses and n is the number of transmit antennas, the maximal rate L of the design is asymptotically half as n increases. But, for such maximal rate codes, the decoding delay p increases exponentially. To control the delay, if we put the restriction that p = n, i.e., consider only the square designs, then, the rate decreases exponentially as n increases. This necessitates the study of the maximal rate of the designs with restrictions of the form p = n+1, p = n+2, p = n+3 etc. In this paper, we study the maximal rate of complex orthogonal designs with the restrictions p = n+1 and p = n+2. We derive upper and lower bounds for the maximal rate for p = n+1 and p = n+2. Also for the case of p = n+1, we show that if the orthogonal design admit only the variables, their negatives and multiples of these by root-1 and zeros as the entries of the matrix (other complex linear combinations are not allowed), then the maximal rate always equals the lower bound.