Brasil
For the Gauss solution of linear systems of equations, Ansx = b, with nonsymmetric and banded coefficient matrix (CM) Ans, it is constructed an algorithm that takes advantage of the fact that Ans remains banded during the solution. In this paper, it is shown a procedure that considers upper half band (UHB) and the transpose of the lower half band (LHB) elements, respectively, stored as rectangular arrays in the first and second levels of a three-dimensional array At (i, j, L) with L = 1,2. Considerable savings of computer storage and time solution are achieved.
© 2008-2024 Fundación Dialnet · Todos los derechos reservados