作者: I. S. Duff , J. K. Reid
DOI: 10.1137/0905045
关键词:
摘要: We show that general sparse sets of linear equations whose pattern is symmetric (or nearly so) can be solved efficiently by a multifrontal technique. The main advantages are the analysis time small compared to factorization and performed in predictable amount storage. Additionally, there scope for extra performance during solution on vector or parallel machine. figures examples run IBM 3081K CRAY-1 computers.