Results 141 to 150 of about 12,305 (165)

Systolic Gauss-Jordan elimination for dense linear systems

Parallel Computing, 1989
Abstract A systolic network for the Gauss-Jordan algorithms is presented for the solution of dense linear systems. This network compares favorably with Melhem's network since its execution time (4 n − 1) is the same and the number of cells is decreased from n 2 2 to 3n 2 8 .
Michel Cosnard, Maurice Tchuente, Bernard Tourancheau   +2 more
openaire   +1 more source

Solving Fully Fuzzy Linear Programming Problem using Triangular Fuzzy Number by Gauss Jordan Elimination Method

International Journal For Multidisciplinary Research
In this paper presents a method for solving Fully Fuzzy Linear Programming Problems (FFLPP) using triangular fuzzy numbers (TFNs) and the Gauss-Jordan Elimination Method. The fuzzy coefficients in the constraints and objective function are represented as
S.SARAVANAN, P.ELUMALAI
semanticscholar   +1 more source

TEACHING MATERIAL DESIGN FOR SOLVING 2 & 3 LOOP ELECTRICAL CIRCUITS USING THE GAUSS-JORDAN ELIMINATION METHOD

Journal of Teaching and Learning Physics
This research aims to teaching materials for solving 2 and 3 loop electrical circuits using the Gauss-Jordan elimination method as an innovative alternative in physics learning.
Sima Ni'mah, Lailatul Nuraini
semanticscholar   +1 more source

AN ANALYSIS OF INTERNAL FORCES IN A SIMPLE TRUSS STRUCTURE: GAUSS-JORDAN ELIMINATION METHOD AND THE EFFECT OF NUMERICAL ERRORS

Jurnal Teknik Sipil
This study analyzes the internal forces in a simple truss structure using the Gauss-Jordan method. The truss structure is analyzed through a mathematical approach by formulating a mathematical model of the simple truss structure in the form of a system ...
Rif’atul Khusniah, Kharisma Nur Cahyani, Rofila El Maghfiroh, 1 3   +3 more
semanticscholar   +1 more source

Simultaneous backward stability of Gauss and Gauss–Jordan elimination

Numerical Linear Algebra with Applications, 2002
AbstractIt is well known that some pivoting strategies are backward stable for Gauss elimination but are not backward stable for Gauss–Jordan elimination (GJE) when these procedures are used to solve a linear system Ax=b. We analyse the simultaneous backward stability for Gauss and GJE of several pivoting strategies, including a pivoting strategy which
openaire   +1 more source

On the backward stability of Gauss-Jordan elimination

Computing, 1991
The author modifies the method proposed by \textit{V. V. Voevodin} and him [A new method of round-off error estimation. Proc. Workshop on Parallel and Distributed Processing, March 1990, Sofia, 315ff. (1990)] to study backward stability of the Gauss-Jordan elimination using the graph of the algorithm and its parallel structure.
openaire   +2 more sources

Gauss-Jordan Elimination By VLSI Mech-Connected Processors

1979
It is shown that a mesh-connected n x (n+m) toroidal array of processors can perform Gauss-Jordan elimination without pivoting, on an n x (n+m) matrix, in 4n+m-1 steps, each step involving at most two artithmetic operations for every processor.
openaire   +2 more sources

Fill-in comparisons between Gauss-Jordan and Gaussian eliminations

IEEE Transactions on Circuits and Systems, 1974
The method is described for evaluating the ratio of total nonzeros created between Gauss-Jordan elimination (GJE) and Gaussian elimination (GE) for large random sparse matrices. It has been found that, within the lower and upper bounds of nonzero densities for the matrices, an approximate constant fill-in ratio of two has been verified.
openaire   +1 more source

GPU Accelerated Gauss‐Jordan Elimination on the OpenPOWER platform – A case study

PAMM, 2017
AbstractThe solution of linear systems is still one of the basic building blocks in scientific computing. Therefore, it needs to be adapted to each new hardware platform in order to exploit the new features of the platform in an optimal way. During the last decade many of these building blocks were accelerated by the usage of GPUs and similar ...
Martin Köhler, Jens Saak
openaire   +3 more sources

A comparison of gaussian and gauss-jordan elimination in regular algebra

International Journal of Computer Mathematics, 1982
A comparison is presented in regular algebra of the Gaussian and Gauss-Jordon elimination techniques for solving sparse systems of simultaneous equations. Specifically, the elimination form and product form of the star A* of a matrix A are defined and it is then shown that the product form is never more sparse than the elimination form.
R.C. Backhouse, B. A. Carre
openaire   +1 more source