Direct Methods for Sparse Matrices.by I. S. Duff; A. M. Erisman; J. K. Reid

Direct methods for sparse matrices: I. S

Direct methods for sparse matrices: I. S. Duff, A. M. Erisman and J. K. Reid

✍ A.J. Osiadacz 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 360 KB

THERE are a great number of engineers who regard the application of microprocessors in control to be a highly topical subject, but who, on the other hand, have not been provided with proper previous training to acquire an adequate basis for solving this type of problem. The needs of these engineers

Direct methods for sparse matrices

✍ Iain S. Duff, A. M. Erisman, John Ker Reid 📂 Library 📅 1987 🏛 Oxford University Press, USA 🌐 English ⚖ 2 MB

This book provides practical approaches to the efficient use of sparsity--a key to solving large problems in many fields, including computational science and engineering, where mathematical models give rise to very large systems of linear equations. The emphasis is on practicality, with conclusions

Direct methods for sparse matrices

✍ Iain S. Duff, A. M. Erisman, John Ker Reid 📂 Library 📅 1986 🏛 Clarendon Press; Oxford University Press 🌐 English ⚖ 3 MB

This book provides practical approaches to the efficient use of sparsity--a key to solving large problems in many fields, including computational science and engineering, where mathematical models give rise to very large systems of linear equations. The emphasis is on practicality, with conclusions

The design of MA48: a code for the direc

The design of MA48: a code for the direct solution of sparse unsymmetric linear systems of equations

✍ Duff, I. S.; Reid, J. K. 📂 Article 📅 1996 🏛 Association for Computing Machinery 🌐 English ⚖ 453 KB

The design of MA48: a code for the direc

The design of MA48: a code for the direct solution of sparse unsymmetric linear systems of equations

✍ Duff, I. S.; Reid, J. K. 📂 Article 📅 1996 🏛 Association for Computing Machinery 🌐 English ⚖ 453 KB

We describe the design of a new code for the direct solution of sparse unsymmetric linear systems of equations. The new code utilizes a novel restructuring of the symbolic and numerical phases, which increases speed and saves storage without sacrifice of numerical stability. Other features include s

On George’s Nested Dissection Method

✍ Duff, I. S.; Erisman, A. M.; Reid, J. K. 📂 Article 📅 1976 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 911 KB