Computational Technology Resources - CCP

A. Recurero, J.P. Gutierrez, "Static Condensation for Symmetric Banded Matrices with Minimum Memory Requirements", in B.H.V. Topping, (Editor), "Proceedings of the Second International Conference on Civil and Structural Engineering Computing", Civil-Comp Press, Edinburgh, UK, pp 105-109, 1985. doi:10.4203/ccp.2.18.2

Abstract

An algorithm is presented which solves the following problem: Given a system of linear equations, with symmetric banded matrix, of which we are only interested in learning the values of a limited number of variables, we need to determine an equivalent system of equations - which we shall call condensed - in which only the variables of interest to us will figure.

The algorithm described makes it possible to solve this problem, using the least possible main memory. The algorithm has been implemented through a subroutine, written in BASIC, working exclusively on main memory. A second subroutine is also available, taking the data of the matrix to be condensed from a disk.

purchase the full-text of this paper (price £20)

go to the previous paper
go to the next paper
return to the table of contents
return to the book description
purchase this book (price £90 +P&P)

	Computational & Technology Resources an online resource for computational, engineering & technology publications
	not logged in - login
Front Page Browse CCP CSETS CTR IJRT Other Authors Search Purchase Guide FAQ Contact us	Civil-Comp Proceedings ISSN 1759-3433 CCP: 2/3 PROCEEDINGS OF THE SECOND INTERNATIONAL CONFERENCE ON CIVIL AND STRUCTURAL ENGINEERING COMPUTING Edited by: B.H.V. Topping Paper XVIII.2 Static Condensation for Symmetric Banded Matrices with Minimum Memory Requirements A. Recurero and J.P. Gutierrez Eduardo Torroja Institute, Madrid, Spain doi:10.4203/ccp.2.18.2 purchase the full-text of this paper Full Bibliographic Reference for this paper A. Recurero, J.P. Gutierrez, "Static Condensation for Symmetric Banded Matrices with Minimum Memory Requirements", in B.H.V. Topping, (Editor), "Proceedings of the Second International Conference on Civil and Structural Engineering Computing", Civil-Comp Press, Edinburgh, UK, pp 105-109, 1985. doi:10.4203/ccp.2.18.2 Abstract An algorithm is presented which solves the following problem: Given a system of linear equations, with symmetric banded matrix, of which we are only interested in learning the values of a limited number of variables, we need to determine an equivalent system of equations - which we shall call condensed - in which only the variables of interest to us will figure. The algorithm described makes it possible to solve this problem, using the least possible main memory. The algorithm has been implemented through a subroutine, written in BASIC, working exclusively on main memory. A second subroutine is also available, taking the data of the matrix to be condensed from a disk. purchase the full-text of this paper (price £20) go to the previous paper go to the next paper return to the table of contents return to the book description purchase this book (price £90 +P&P)
Back to top	©Civil-Comp Limited 2023 - terms & conditions