Sparse Matrix Computations is a collection of papers presented at the 1975 Symposium by the same title, held at Argonne National Laboratory. This book is composed of six parts encompassing 27 chapters that contain contributions in several areas of matrix computations and some of the most potential research in numerical linear algebra.
Five years have passed since the battle for the Verinian Forest. Kia, Keota, the wolves and Ionan have been living peacefully since, though things aren't as happy as they appear. Ionan longs for the shores of Nesting's Haven, the isle of Changers that he left long ago, and the eyes of his first love, Vera. Things…
The papers are organized into general categories that deal, respectively, with sparse elimination, sparse eigenvalue calculations, optimization, mathematical software for sparse matrix computations, partial differential equations, and applications involving sparse matrix technology. This text presents research on applied numerical analysis but with considerable influence from computer science. In particular, most of the papers deal with the design, analysis, implementation, and application of computer algorithms. Such an emphasis includes the establishment of space and time complexity bounds and to understand the algorithms and the computing environment.
This book will prove useful to mathematicians and computer scientists.
How to download book
Buy this book
You can buy this book now only for $52.59. This is the lowest price for this book.
Download book free
If you want to download this book for free, please register, approve your account and get one book for free.
After that you may download book «Sparse Matrix Computations»: