this paper presents an auto redundant technique for analysis of grid with curved members.this technique is based on the force method, but in the technique choice of the redundant iscompletely eliminated. the analysis technique is found very effective, accurate andprogrammable. a comprehensive c++ program has been developed to compute internalforces at the end of each member of the grid for diff...

Flexibility-rigidity index (FRI) has been developed as a robust, accurate, and efficient method for macromolecular thermal fluctuation analysis and B-factor prediction. The performance of FRI depends on its formulations of rigidity index and flexibility index. In this work, we introduce alternative rigidity and flexibility formulations. The structure of the classic Gaussian surface is utilized ...

‎the global fom and gmres algorithms are among the effective‎ ‎methods to solve sylvester matrix equations‎. ‎in this paper‎, ‎we‎ ‎study these algorithms in the case that the coefficient matrices‎ ‎are real symmetric (real symmetric positive definite) and extract‎ ‎two cg-type algorithms for solving generalized sylvester matrix‎ ‎equations‎. ‎the proposed methods are iterative projection metho...

in this paper, we give some determinantal and permanental representations of generalized lucas polynomials, which are a general form of generalized bivariate lucas p-polynomials, ordinary lucas and perrin sequences etc., by using various hessenberg matrices. in addition, we show that determinant and permanent of these hessenberg matrices can be obtained by using combinations. then we show, the ...

the object of this paper is to establish a summability factor theorem for summabilitya, , k  1 k  where a is the lower triangular matrix with non-negative entries satisfying certain conditions.

several representations of the generalized drazin inverse of an anti-triangular block matrix in banach algebra are given in terms of the generalized banachiewicz--schur form.

the rank-k numerical range has a close connection to the construction of quantum error correction code for a noisy quantum channel. for noisy quantum channel, a quantum error correcting code of dimension k exists if and only if the associated joint rank-k numerical range is non-empty. in this paper the notion of joint rank-k numerical range is generalized and some statements of [2011, generaliz...

in the present paper‎, ‎we propose an iterative algorithm for‎ ‎solving the generalized $(p,q)$-reflexive solution of the quaternion matrix‎ ‎equation $overset{u}{underset{l=1}{sum}}a_{l}xb_{l}+overset{v} ‎{underset{s=1}{sum}}c_{s}widetilde{x}d_{s}=f$‎. ‎by this iterative algorithm‎, ‎the solvability of the problem can be determined automatically‎. ‎when the‎ ‎matrix equation is consistent over...