Jump to ContentJump to Main Navigation
Direct Methods for Sparse Matrices$
Users without a subscription are not able to see the full content.

I. S. Duff, A. M. Erisman, and J. K. Reid

Print publication date: 2017

Print ISBN-13: 9780198508380

Published to Oxford Scholarship Online: April 2017

DOI: 10.1093/acprof:oso/9780198508380.001.0001

Show Summary Details
Page of

PRINTED FROM OXFORD SCHOLARSHIP ONLINE (www.oxfordscholarship.com). (c) Copyright Oxford University Press, 2019. All Rights Reserved. An individual user may print out a PDF of a single chapter of a monograph in OSO for personal use. date: 16 October 2019

Introduction

Introduction

Chapter:
(p.1) 1 Introduction
Source:
Direct Methods for Sparse Matrices
Author(s):

I. S. Duff

A. M. Erisman

J. K. Reid

Publisher:
Oxford University Press
DOI:10.1093/acprof:oso/9780198508380.003.0001

The use of graph theory to ‘visualize’ the relationship between sparsity patterns and Gaussian elimination is introduced. The potential of significant savings from the exploitation of sparsity is illustrated by one example. The effect of computer hardware on efficient computation is discussed. Realization of sparsity means more than faster solutions; it affects the formulation of mathematical models and the feasibility of solving them.

Keywords:   Gaussian elimination, graph theory, exploitation of sparsity, Computer hardware, standard test problems

Oxford Scholarship Online requires a subscription or purchase to access the full text of books within the service. Public users can however freely search the site and view the abstracts and keywords for each book and chapter.

Please, subscribe or login to access full text content.

If you think you should have access to this title, please contact your librarian.

To troubleshoot, please check our FAQs , and if you can't find the answer there, please contact us .