Results 131 to 140 of about 12,305 (165)

Intermediate-Level Synthesis of a Gauss-Jordan Elimination Linear Solver

2015 IEEE International Parallel and Distributed Processing Symposium Workshop, 2015
As the world of computing goes more and more parallel, reconfigurable computing can enable interesting compromises in terms of processing speed and power consumption between CPUs and GPUs. Yet, from a developer's perspective, programming Field-Programmable Gate Arrays to implement application specific processors still represents a significant challenge.
Marc-Andre Daigneault, Jean Pierre David
openaire   +2 more sources

BALANCING CHEMICAL EQUATIONS USING GAUSS-JORDAN ELIMINATION AIDED BY MATRIX CALCULATOR

Innovative Technology and Management Journal, 2020
Balancing equations is among the most complex topics in Chemistry. Teachers find it difficult to teach while the students find it challenging to understand. The way it was taught in Chemistry class is the trial and error approach, which could be tedious and complicated for the students.
Zussette Candelario-Aplaon
openaire   +2 more sources

Computation of weighted Moore–Penrose inverse through Gauss–Jordan elimination on bordered matrices

Applied Mathematics and Computation, 2018
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Xingping Sheng
openaire   +2 more sources

A new method for computing Moore–Penrose inverse through Gauss–Jordan elimination

Applied Mathematics and Computation, 2014
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ji, Jun, Chen, Xuzhou
openaire   +3 more sources

NTRU inverse polynomial algorithm based on circulant matrices using gauss-jordan elimination

2017 6th ICT International Student Project Conference (ICT-ISPC), 2017
Inverses in the Nth Degree Truncated Polynomial Ring (NTRU) are computed using an adaptation of the Almost Inverse Algorithm, defined in the field of polynomials with binary and ternary coefficients. This research study solves the problem of finding inverses using an elaborate algorithm which is extensible to polynomials with coefficients in varied ...
Gaithuru Juliet Nyokabi, Mazleena Salleh, Ismail Mohamad   +2 more
openaire   +2 more sources

On hardware solution of dense linear systems via Gauss-Jordan Elimination

2015 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (PACRIM), 2015
Gauss-Jordan Elimination (GJE) is a popular method for solving systems of linear equations. Much work has been done to design high throughput, low cost, FPGA-based architectures for GJE. However, as the interest in energy efficient designs increases, power consumption becomes a prevalent metric that must be considered in any FPGA-based implementation ...
M. Tarek Ibn Ziad, Yousra Alkabani, M. Watheq El-Kharashi   +2 more
openaire   +2 more sources

FPGA implementation of floating-point complex matrix inversion based on GAUSS-JORDAN elimination

2013 26th IEEE Canadian Conference on Electrical and Computer Engineering (CCECE), 2013
This work presents the architecture of an optimized complex matrix inversion using GAUSS-JORDAN elimination (GJ-elimination) on FPGA with single precision floating-point representation to be used in MIMO-OFDM receiver. This module consists of single precision floating point arithmetic components and control unit which perform the GJ-elimination ...
Sherif Moussa, Ahmed M. Abdel Razik, Adel Omar Dahmane, Habib Hamam   +3 more
openaire   +2 more sources

Parallel Gauss-Jordan elimination for the solution of dense linear systems

Parallel Computing, 1987
A parallel Gauss-Jordan elimination algorithm (for dense systems) is presented and shown to be as efficient as an optimal parallel implementation of the Gauss elimination on certain computational networks.
R. Melhem
openaire   +2 more sources

A Note on the Stability of Gauss-Jordan Elimination for Diagonally Dominant Matrices

Computing, 2000
The author proves that Gauss-Jordan elimination is backward stable for matrices diagonally dominant by rows but not for matrices diagonally dominant by columns.
A. Malyshev
openaire   +2 more sources

Methods of Gauss–Jordan elimination to compute core inverse and dual core inverse

Linear and multilinear algebra, 2020
In this paper, two formulas, which were studied by Wang and Liu (2015) and Ma and Li (2019), respectively, for the core inverse, are simplified. Then two methods for computing the core inverse and dual core inverse are investigated through Gauss–Jordan ...
Xingping Sheng, Dawei Xin
semanticscholar   +1 more source