in this parer the iteration method (kani's method) is developed for the analysis of arch - frames. the method takes the effect of linear displacements of joints automatically into account. therefore, it is more efficient than moment distribution method. the iteration procedure can be applied to any kind of framed structure. a hand calculator or a computer may be used in the analysis of fra...

In this paper, two new hybrid algorithms are proposed for decoding Low Density Parity Check (LDPC) codes. Original version of the proposed algorithms named Search Based Weighted Multi Bit Flipping (SWMBF). The main idea of these algorithms is flipping variable multi bits in each iteration, change in which leads to the syndrome vector with least hamming weight. To achieve this, the proposed algo...

In this paper, two new hybrid algorithms are proposed for decoding Low Density Parity Check (LDPC) codes. Original version of the proposed algorithms named Search Based Weighted Multi Bit Flipping (SWMBF). The main idea of these algorithms is flipping variable multi bits in each iteration, change in which leads to the syndrome vector with least hamming weight. To achieve this, the proposed algo...

We investigate compositional iteration of fractional order for transseries. For any large positive transseries T of exponentiality 0, there is a family T [s] indexed by real numbers s corresponding to iteration of order s. It is based on Abel’s Equation. We also investigate the question of whether there is a family T [s] all sharing a single support set. A subset of the transseries of exponenti...

a definition of two jointly asymptotically nonexpansive mappings s and t on uniformly convex banach space e is studied to approximate common fixed points of two such mappings through weak and strong convergence of an ishikawa type iteration scheme generated by s and t on a bounded closed and convex subset of e. as a consequence of the notion of two jointly asymptotically nonexpansive maps, we c...

Many analyses and transformations in a parallelizing compiler can bene t from the ability to compare arbitrary symbolic expressions. In this paper, we describe how one can compare expressions by using symbolic ranges of variables. A range is a lower and upper bound on a variable. We will also describe how these ranges can be e ciently computed from the program text. Symbolic range propagation h...

in this paper, we represent an inexact inverse subspace iteration method for com- puting a few eigenpairs of the generalized eigenvalue problem ax = bx[q. ye and p. zhang, inexact inverse subspace iteration for generalized eigenvalue problems, linear algebra and its application, 434 (2011) 1697-1715 ]. in particular, the linear convergence property of the inverse subspace iteration is preserved.