Automatic computing has undergone drastic changes since the pioneering days of the early Fifties, one of the most obvious being that today the majority of computer programs are no longer written in machine code but in some programming language like FORTRAN or ALGOL. However, as desirable as the time-saving achieved in this way may be, still a high proportion of the preparatory work must be attributed to activities such as error estimates, stability investigations and the like, and for these no programming aid whatsoever can be of help. In this respect, ALGOL, as an internationally standardized notation which avoids computer-oriented concepts, provides another advantage, not often mentioned, but one which was already the guiding principle at the very beginning of the programming language venture: indeed, a correct ALGOL program is the abstractum of a computing process for which the necessary analyses have already been performed. It is the very purpose of this Handbook to establish such abstract formulations of certain computing processes. Therefore, numerical methods given in this Hand book in the form of ALGOL procedures may be put to immediate use wherever ALGOL is known and understood; in fact, application of such a method reduces to little more than calling the corresponding procedure.

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.

Problem oriented programming languages as they have developed over the last ten years essentially serve two purposes which somewhat crudely can be described by the terms man-man communication and man-machine communication, respectively. As a carrier of information between humans, the problem oriented programming language is designed to express the essence of an algorithm in a way which is un ambiguous and concise as well as independent of (and therefore meaning ful without any reference to) the changing details of computing machine ry. As a carrier of information from man to computer, the language permits the human programmer to express his computational needs in a compact way adapted to the general characteristics of computers, but freed from the burdening details of specific computer facilities. This presupposes the existence of algorithms, or programs, which permit the computer itself to transform efficiently programs written in the problem oriented language into machine programs. Thus the entire computing community profits from the work of the individual programmer. The primary purpose of the Handbook is to present a set of algorithms of broad utility from the domain of numerical mathematics written in the problem oriented language ALGOL 60. Therefore, volumes I a and I b are in a sense supplementary as they serve to introduce this language. Volume I a gives a description of the language proper and of its use for writing correct programs. Thus, volume I a primarily covers the aspect of man-man communication by means of ALGOL 60.

Engineering has long been thought of by the public as a profession tra ditionally categorized into such branches as electrical, mechanical, chemical, industrial, civil, etc. This classification has served its purpose for the past half century; but the last decade has witnessed a tremendous change. A continuous transition from the practical to the theoretical has made technology overlap with science, and the enlargement of scope and broad ened diversification have smeared the boundaries between traditional engi neering and scientific fields. Engineering is rapidly becoming a diversified, multidisciplinary field of scientific endeavor. This has prompted us to regard modern engineering as a science, which has as its ingredients materials, energy, and information. In our complex and technologically-oriented society organizations are flooded with an enormous amount of management information. We are now faced with problems concerning the efficient use of communicated knowledge. The steady growth in the magnitude and complexity of informa tion systems necessitates the development of new theories and techniques for solving these information problems. We demand instant access to pre viously recorded information for decision making, and we require new meth ods for analysis, recognition, processing, and display. As a consequence, information science has evolved out of necessity. Concerned with the theoretical basis of the organization, control, stor age, retrieval, processing, and communication of information both by natural and artificial systems, information science is multidisciplinary in character. It covers a vast area of subject matter in the physical and biological sciences.

History of Programming Languages presents information pertinent to the technical aspects of the language design and creation. This book provides an understanding of the processes of language design as related to the environment in which languages are developed and the knowledge base available to the originators. Organized into 14 sections encompassing 77 chapters, this book begins with an overview of the programming techniques to use to help the system produce efficient programs. This text then discusses how to use parentheses to help the system identify identical subexpressions within an expression and thereby eliminate their duplicate calculation. Other chapters consider FORTRAN programming techniques needed to produce optimum object programs. This book discusses as well the developments leading to ALGOL 60. The final chapter presents the biography of Adin D. Falkoff. This book is a valuable resource for graduate students, practitioners, historians, statisticians, mathematicians, programmers, as well as computer scientists and specialists.

This expansive volume describes the history of numerical methods proposed for solving linear algebra problems, from antiquity to the present day. The authors focus on methods for linear systems of equations and eigenvalue problems and describe the interplay between numerical methods and the computing tools available at the time. The second part of the book consists of 78 biographies of important contributors to the field. A Journey through the History of Numerical Linear Algebra will be of special interest to applied mathematicians, especially researchers in numerical linear algebra, people involved in scientific computing, and historians of mathematics.