This paper presents a simple unifying algorithm for solving systems of linear equations. Solving a system of linear equations will be interpreted as an interpolation problem. This new approach led us to a general algorithm called the recursive interpolation algorithm R1A. In Part I we gave the conne
Recursive interpolation algorithm: a formalism for solving systems of linear equations—I. Direct methods
✍ Scribed by A. Messaoudi
- Publisher
- Elsevier Science
- Year
- 1996
- Tongue
- English
- Weight
- 793 KB
- Volume
- 76
- Category
- Article
- ISSN
- 0377-0427
No coin nor oath required. For personal study only.
✦ Synopsis
This paper presents a simple unifying algorithm for solving systems of linear equations. Solving a system of linear equations will be interpreted as an interpolation problem. This new approach leads us to a general algorithm called the recursive interpolation algorithm RIA, which includes the direct methods and some of the iterative methods. A version of the RIA with pivoting strategy will be given. We will also show how to choose two free sets of parameters in the RIA for recovering known direct methods. Other choices of these parameters yield some new methods.
📜 SIMILAR VOLUMES
In this paper, we discuss the solution of a system of fuzzy linear equations, X = AX + U , and its iteration algorithms where A is a real n × n matrix, the unknown vector X and the constant U are all vectors consisting of n fuzzy numbers, and the addition, scale-multiplication are deÿned by Zadeh's