the star-mesh transformation allows the reduction of nodes in an electrical circuit. the gauss elimination method allows the reduction of unknowns in a system of linear equations . triangular decomposition can be used to find the inverse of a matrix. in this paper the coherence between these methods are discussed. it is shown that the gauss elimination method gives the same formula for star-mes...

‎Triangular matrix rings are examples of trivial extensions‎. ‎In this article we determine the structure of derivations and biderivations of the trivial extensions‎, ‎and thereby we describe the derivations and biderivations of the upper triangular matrix rings‎. ‎Some related results are also obtained‎.

an ideal i of a ring r is called right baer-ideal if there exists an idempotent e 2 r such that r(i) = er. we know that r is quasi-baer if every ideal of r is a right baer-ideal, r is n-generalized right quasi-baer if for each i e r the ideal in is right baer-ideal, and r is right principaly quasi-baer if every principal right ideal of r is a right baer-ideal. therefore the concept of baer idea...

An ideal I of a ring R is called right Baer-ideal if there exists an idempotent e 2 R such that r(I) = eR. We know that R is quasi-Baer if every ideal of R is a right Baer-ideal, R is n-generalized right quasi-Baer if for each I E R the ideal In is right Baer-ideal, and R is right principaly quasi-Baer if every principal right ideal of R is a right Baer-ideal. Therefore the concept of Baer idea...

The design, implementation and performance of a parallel algorithm for reduction of a matrix pair in block upper Hessenberg-Triangular form (Hr, T ) to upper Hessenberg-triangular form (H, T ) is presented. This reduction is the second stage in a two-stage reduction of a regular matrix pair (A, B) to upper Hessenberg-Triangular from. The desired upper Hessenberg-triangular form is computed usin...