k=LIST(k) LIST(ksave)=0 Sum+=U(j)y(k) enddo // j y(i)=b(i)Sum LIST(k)=0 The loop ends after this substitution. i Solving follows the same pattern, but columns are processed in the reverse Ux=z order. Adding and parameters allows the same code handle both Lshift Ushift cases and equally easily. A=AT AAT R.E. Bank and R.K. Smith, General sparse elimination requires no permanent SIAM J. Sci. Stat. Comp., (1987), pp. 574-584 and the SMMP 8 integer storage, and Madpack2 packages in the Free Software section of my home web. 4. Solution of Nonlinear Equations
k=LIST(k) LIST(ksave)=0 Sum+=U(j)y(k) enddo // j y(i)=b(i)Sum LIST(k)=0 The i loop ends after this substitution. Solving Ux=z follows the same pattern, but columns are processed in the reverse order. Adding Lshift and Ushift parameters allows the same code handle both cases A=AT and AAT equally easily. R.E. Bank and R.K. Smith, General sparse elimination requires no permanent integer storage, SIAM J. Sci. Stat. Comp., 8 (1987), pp. 574-584 and the SMMP and Madpack2 packages in the Free Software section of my home web. 4. Solution of Nonlinear Equations
2013sw.docx