Mechanism for Forward Backward Substitution in Matrix
Original Publication Date: 1980-Dec-01
Included in the Prior Art Database: 2005-Feb-14
Numerical analysis by computers requires looping through lists of numbers. Arithmetical operation is performed on the list to produce another list. Sometimes these lists take on a geometry, a vector, a matrix or some n-space. No matter how these lists are viewed by the experimentor, they are seen by the computer as a list. If the experimentor can see the list as the computer does, he can present the list to the computer more efficiently. Three problems have been defined as being important to a numerical method of analysis known as "The Finite Element Method" Matrix Decomposition, Forward-Backward substitution and DOT product. Code reordering to minimize the branch penalty will be shown. The programs discussed are run on the IBM System/370 where General Registers are used for manipulating data and for address generation.