Advertisement

Sparse Matrices and their Applications

Proceedings of a Symposium on Sparse Matrices and Their Applications, held September 9–10, 1971, at the IBM Thomas J. Watson Research Center, Yorktown Heights, New York, and sponsored by the Office of Naval Research, the National Science Foundation, IBM World Trade Corporation, and the IBM Research Mathematical Sciences Department.

  • Donald J. Rose
  • Ralph A. Willoughby

Part of the The IBM Research Symposia Series book series (IRSS)

Table of contents

  1. Front Matter
    Pages i-xii
  2. Introduction

    1. Front Matter
      Pages 1-1
    2. Donald J. Rose, Ralph A. Willoughby
      Pages 3-22
  3. Computational Circuit Design

  4. Linear Programming

    1. Front Matter
      Pages 65-65
    2. Eli Hellerman, Dennis C. Rarick
      Pages 67-76
  5. Partial Differential Equations

  6. Special Topics

    1. Front Matter
      Pages 133-133
    2. Gary H. Glaser, Michael S. Saliba
      Pages 135-146
    3. Gerhard E. Hoernes
      Pages 147-154
  7. Combinatorics and Graph Theory

    1. Front Matter
      Pages 155-155
    2. Werner C. Rheinboldt, Victor R. Basili, Charles K. Mesztenyi
      Pages 167-176
    3. Donald J. Rose, James R. Bunch
      Pages 177-187
  8. Back Matter
    Pages 189-215

About this book

Introduction

This book contains papers on sparse matrices and their appli­ cations which were presented at a Symposium held at the IBM Thomas J. Watson Research Center, Yorktown Heights, New York on September 9-10, 1971. This is a very active field of research since efficient techniques for handling sparse matrix calculations are an important aspect of problem solving. In large scale problems, the feasibility of the calculation depends critically on the efficiency of the underlying sparse matrix algorithms. An important feature of the conference and its proceedings is the cross-fertilization achieved among a broad spectrum of application areas, and among combinatorialists, numerical analysts, and computer scientists. The mathematical, programming, and data management features of these techniques provide a unifying theme which can benefit readers in many fields. The introduction summarizes the major ideas in each paper. These ideas are interspersed with a brief survey of sparse matrix technology. An extensive unified bibliography is provided for the reader interested in more systematic information. The editors wish to thank Robert K. Brayton for his many helpful suggestions as chairman of the organizing committee and Redmond O'Brien for his editorial and audio-visual assistance. We would also like to thank Mrs. Tiyo Asai and Mrs. Joyce Otis for their help during the conference and on the numerous typing jobs for the manuscript. A special thanks goes to William J. Turner for establishing the IBM Research Symposia Series with Plenum Press.

Keywords

Mathematica algorithms computation efficiency graph algorithm graph theory information linear optimization network programming

Editors and affiliations

  • Donald J. Rose
    • 1
  • Ralph A. Willoughby
    • 2
  1. 1.Department of MathematicsUniversity of DenverDenverUSA
  2. 2.Mathematical Sciences DepartmentIBM Thomas J. Watson Research CenterYorktown HeightsUSA

Bibliographic information