Proceedings of an International Conference held in Vancouver, B.C., August 1993, to commemorate the 50th anniversary of the founding of the journal Mathematics of Computation. It consisted of a Symposium on Numerical Analysis and a Minisymposium of Computational Number Theory. This proceedings contains 14 invited papers, including two not presented at the conference--an historical essay on integer factorization, and a paper on componentwise perturbation bounds in linear algebra. The invited papers present surveys on the various subdisciplines covered by Mathematics of Computation, in a historical perspective and in a language accessible to a wide audience. The 46 contributed papers address contemporary specialized work. Annotation copyright by Book News, Inc., Portland, OR

This book differs from traditional numerical analysis texts in that it focuses on the motivation and ideas behind the algorithms presented rather than on detailed analyses of them. It presents a broad overview of methods and software for solving mathematical problems arising in computational modeling and data analysis, including proper problem formulation, selection of effective solution algorithms, and interpretation of results. In the 20 years since its original publication, the modern, fundamental perspective of this book has aged well, and it continues to be used in the classroom. This Classics edition has been updated to include pointers to Python software and the Chebfun package, expansions on barycentric formulation for Lagrange polynomial interpretation and stochastic methods, and the availability of about 100 interactive educational modules that dynamically illustrate the concepts and algorithms in the book. Scientific Computing: An Introductory Survey, Second Edition is intended as both a textbook and a reference for computationally oriented disciplines that need to solve mathematical problems.

This book presents written versions of the eight lectures given during the AMS Short Course held at the Joint Mathematics Meetings in Washington, D.C. The objective of this course was to share with the scientific community the many exciting mathematical challenges arising from the new field of quantum computation and quantum information science. The course was geared toward demonstrating the great breadth and depth of this mathematically rich research field. Interrelationships withexisting mathematical research areas were emphasized as much as possible. Moreover, the course was designed so that participants with little background in quantum mechanics would, upon completion, be prepared to begin reading the research literature on quantum computation and quantum informationscience. Based on audience feedback and questions, the written versions of the lectures have been greatly expanded, and supplementary material has been added. The book features an overview of relevant parts of quantum mechanics with an introduction to quantum computation, including many potential quantum mechanical computing devices; introduction to quantum algorithms and quantum complexity theory; in-depth discussion on quantum error correcting codes and quantum cryptography; and finally,exploration into diverse connections between quantum computation and various areas of mathematics and physics.

Computer algebra systems are now ubiquitous in all areas of science and engineering. This highly successful textbook, widely regarded as the 'bible of computer algebra', gives a thorough introduction to the algorithmic basis of the mathematical engine in computer algebra systems. Designed to accompany one- or two-semester courses for advanced undergraduate or graduate students in computer science or mathematics, its comprehensiveness and reliability has also made it an essential reference for professionals in the area. Special features include: detailed study of algorithms including time analysis; implementation reports on several topics; complete proofs of the mathematical underpinnings; and a wide variety of applications (among others, in chemistry, coding theory, cryptography, computational logic, and the design of calendars and musical scales). A great deal of historical information and illustration enlivens the text. In this third edition, errors have been corrected and much of the Fast Euclidean Algorithm chapter has been renovated.

Taking readers from elementary number theory, via algorithmic, to applied number theory in computer science, this text introduces basic concepts, results, and methods, before going on to discuss their applications in the design of hardware and software, cryptography, and security. Aimed at undergraduates in computing and information technology, and presupposing only high-school math, this book will also interest mathematics students concerned with applications. XXXXXXX Neuer Text This is an essential introduction to number theory for computer scientists. It treats three areas, elementary-, algorithmic-, and applied number theory in a unified and accessible manner. It introduces basic concepts and methods, and discusses their applications to the design of hardware, software, cryptography, and information security. Aimed at computer scientists, electrical engineers and students the presentation presupposes only an understanding of high-school math.

R. V. M. Zahar* The sixty-fifth birthday of Walter Gautschi provided an opportune moment for an international symposium in his honor, to recognize his many contributions to mathematics and computer sciences. Conceived by John Rice and sponsored by Purdue University, the conference took place in West Lafayette from December 2 to 5, 1993, and was organized around the four main themes representing Professor Gautschi's principal research interests: Approximation, Orthogonal Polynomials, Quadrature and Special Functions. Thirty-eight speakers - colleagues, co-authors, research collaborators or doctoral students of Professor Gautschi - were invited to present articles at the conference, their lectures providing an approximately equal representation of the four disciplines. Five invited speakers, Germund Dahlquist, Philip Davis, Luigi Gatteschi, Werner Rheinboldt and Stephan Ruscheweyh, were unable to present their talks because of illness or other commitments, although Professors Dahlquist, Gatteschi and Ruscheweyh subsequently contributed arti cles to these proceedings. Thus, the final program contained thirty-three technical lectures, ten of which were plenary sessions. Approximately eighty scientists attended the conference, and for some ses sions - in particular, Walter's presentation of his entertaining and informative Reflections and Recollections - that number was complemented by many visitors and friends, as well as the family of the honoree. A surprise visit by Paul Erdos provided one of the highlights of the conference week. The ambiance at the sym posium was extremely collegial, due no doubt to the common academic interests and the personal friendships shared by the participants.