
Descripción del editor: "Direct Methods for Sparse Matrices, second edition, is a complete rewrite of the first edition published 30 years ago. Much has changed since that time. Problems have grown greatly in size and complexity; nearly all our examples were of order less than 5,000 in the first edition, and are often more than a million in the second edition. Computer architectures are now much more complex, requiring new ways of adapting algorithms to parallel environments with memory hierarchies. Because the area is such an important one to all of computational science and engineering, a huge amount of research has been done since the first edition, some of it by the authors. This new research is integrated into the text with a clear explanation of the underlying mathematics and algorithms. New research that is described includes new techniques for scaling and error control, new orderings, new combinatorial techniques for partitioning both symmetric and unsymmetric problems, and a detailed description of the multifrontal approach to solving systems that was pioneered by the research of the authors and colleagues. This includes a discussion of techniques for exploiting parallel architectures and new work for indefinite and unsymmetric systems" ( OXFORD UNIVERSITY PRESS).
Page Count:
464
Publication Date:
2017-01-01
ISBN-10:
0191746428
ISBN-13:
9780191746420
No comments yet. Be the first to share your thoughts!