Handbook for Automatic Computation

Volume II: Linear Algebra

  • J. H. Wilkinson
  • C. Reinsch
  • F. L. Bauer
  • A. S. Householder
  • F. W. J. Olver
  • H. Rutishauser
  • K. Samelson
  • E. Stiefel

Part of the Die Grundlehren der mathematischen Wissenschaften book series (GL, volume 186)

Table of contents

  1. Front Matter
    Pages I-IX
  2. Linear Systems, Least Squares and Linear Programming

    1. Front Matter
      Pages 1-8
    2. R. S. Martin, G. Peters, J. H. Wilkinson
      Pages 9-30
    3. R. S. Martin, G. Peters, J. H. Wilkinson
      Pages 31-44
    4. R. S. Martin, J. H. Wilkinson
      Pages 50-56
    5. T. Ginsburg
      Pages 57-69
    6. H. J. Bowdler, R. S. Martin, G. Peters, J. H. Wilkinson
      Pages 93-110
    7. P. Businger, G. H. Golub
      Pages 111-118
    8. G. H. Golub, C. Reinsch
      Pages 134-151
    9. R. H. Bartels, J. Stoer, Ch. Zenger
      Pages 152-190
  3. The Algebraic Eigenvalue Problem

    1. Front Matter
      Pages 191-201
    2. H. Rutishauser
      Pages 202-211
    3. R. S. Martin, C. Reinsch, J. H. Wilkinson
      Pages 212-226
    4. H. Bowdler, R. S. Martin, C. Reinsch, J. H. Wilkinson
      Pages 227-240
    5. A. Dubrulle, R. S. Martin, J. H. Wilkinson
      Pages 241-248

About this book

Introduction

The development of the internationally standardized language ALGOL has made it possible to prepare procedures which can be used without modification whenever a computer with an ALGOL translator is available. Volume Ia in this series gave details of the restricted version of ALGOL which is to be employed throughout the Handbook, and volume Ib described its implementation on a computer. Each of the subsequent volumes will be devoted to a presentation of the basic algorithms in some specific areas of numerical analysis. This is the first such volume and it was feIt that the topic Linear Algebra was a natural choice, since the relevant algorithms are perhaps the most widely used in numerical analysis and have the advantage of forming a weil defined dass. The algorithms described here fall into two main categories, associated with the solution of linear systems and the algebraic eigenvalue problem respectively and each set is preceded by an introductory chapter giving a comparative assessment.

Keywords

ALGOL Algol W Calculation Finite Natural algebra algorithms computer eigenvalue problem equation numerical analysis programming

Authors and affiliations

  • J. H. Wilkinson
    • 1
  • C. Reinsch
    • 2
  1. 1.Division of Numerical & Applied MathematicsNational Physical LaboratoryTeddington, MiddlesexGreat Britain
  2. 2.Mathematisches InstitutTechnischen Universität8 München 2Deutschland

Editors and affiliations

  • F. L. Bauer
    • 1
  • A. S. Householder
  • F. W. J. Olver
  • H. Rutishauser
    • 2
  • K. Samelson
  • E. Stiefel
  1. 1.Mathematisches InstitutTechnichen Universität8 München 2Deutschland
  2. 2.Fachgruppe Computer-WissenschaftenEidgenössische Technische Hochschule ZürichZürichSchweiz

Bibliographic information

  • DOI https://doi.org/10.1007/978-3-642-86940-2
  • Copyright Information Springer-Verlag Berlin Heidelberg 1971
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Springer Book Archive
  • Print ISBN 978-3-642-86942-6
  • Online ISBN 978-3-642-86940-2
  • Series Print ISSN 0072-7830
  • About this book