Abstract
Computational efficiencies of seven different algorithms for the solution of sparse linear equation systems have been compared. The comparison was made both by using randomly generated equation sets and by linking the algorithms to an equation-based flowsheeting package and by solving real simulation problems.
Original language | English |
---|---|
Pages (from-to) | 433-439 |
Journal | Computers and Chemical Engineering |
Volume | 13 |
Issue number | 4-5 |
DOIs | |
Publication status | Published - 1989 |
MoE publication type | A1 Journal article-refereed |