Cover may vary - this is a stock image

Sparse Matrix Computations

Format: Hardback

Condition: Poor Condition — £7.03
What do the conditions mean?

Our conditions mean the following:

  • New - a brand new book
  • Almost New - appears new but is actually secondhand.
  • Very Good - only minor imperfections such as minor scuffs to edge or cover or a price written in pencil or shop sticker.
  • Standard Secondhand - Clearly been read before, but not too bad. We do not recommend these for gifting. Spines usually creased. Could also include creases or folds to cover, some writing such as in the cover or elsewhere, underlining or highlighting, but might not do. Possibly some stains or marks. Similar in general to books in any secondhand shop or charity shop.
  • Poor Condition - Usually this will have a specific problem such as writing inside, water damage, missing dust jacket, heavy staining, large creases or cuts. These are readable copies but not nice ones. On other websites this condition is called 'Acceptable' or 'Fair' , but we want to be more honest.
£7.03
£7.03
Sale Sold out
Taxes included. Shipping calculated at checkout.

Low stock: 1 left

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.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.

Format: Hardback
Published: 1976
Pages: 453
Publisher: Academic Press
ISBN: 9780121410506

Payment method

  • American Express
  • Apple Pay
  • Bizum
  • Diners Club
  • Discover
  • Google Pay
  • Maestro
  • Mastercard
  • Shop Pay
  • Union Pay
  • Visa

Our conditions mean the following:

  • New - a brand new book
  • Almost New - appears new but is actually secondhand.
  • Very Good - only minor imperfections such as minor scuffs to edge or cover or a price written in pencil or shop sticker.
  • Standard Secondhand - Clearly been read before, but not too bad. We do not recommend these for gifting. Spines usually creased. Could also include creases or folds to cover, some writing such as in the cover or elsewhere, underlining or highlighting, but might not do. Possibly some stains or marks. Similar in general to books in any secondhand shop or charity shop.
  • Poor Condition - Usually this will have a specific problem such as writing inside, water damage, missing dust jacket, heavy staining, large creases or cuts. These are readable copies but not nice ones. On other websites this condition is called 'Acceptable' or 'Fair' , but we want to be more honest.
  • Free UK shipping over £10.
  • Under £10, shipping is £1.99.
  • Express shipping £2.99.
  • Choose 10 £1 books for £10 including shipping!
  • International shipping available to select countries, proceed to checkout to see prices.

Return books within 14 days if not happy.

View full details