An intelligent numerical algorithm for solving system of linear algebraic equations

Authors:
Bai. V. Ramani;S. N. Sivanandam
Affiliations:
SAINTGITS College of Engineering, Kottayam, Kerala, India;PSG College of Technology, Coimbatore, TamilNadu, India
Venue:
Proceedings of the 1st Amrita ACM-W Celebration on Women in Computing in India
Year:
2010

Citing 6
Cited 0

Numerical recipes: the art of scientific computing

Numerical recipes: the art of scientific computing
Solving sparse linear equations over finite fields

IEEE Transactions on Information Theory
Applied numerical linear algebra

Applied numerical linear algebra
Algorithm 583: LSQR: Sparse Linear Equations and Least Squares Problems

ACM Transactions on Mathematical Software (TOMS)
Introduction to Algorithms

Introduction to Algorithms
Approximate algorithms to derive exact solutions to systems of linear equations

EUROSAM '79 Proceedings of the International Symposiumon on Symbolic and Algebraic Computation

Quantified Score

Hi-index	0.01

Visualization

Abstract

In this paper, a computationally simplified numerical algorithm is presented to solve the system of algebraic equations Ax = b directly, where A is an n x n real-coefficient matrix which may be ill-conditioned. The proposed method reduces the n order augmented matrix [A:b] using a simple procedure to single order augmented matrix [A':b'] and xis' will be determined using back substitution. We improve the condition of ill-conditioned system first and then solve the well-conditioned one. Numerical simulations show that the proposed method is comparable to the existing direct methods.