Published in honor of his 70th birthday, this volume explores and celebrates the work of G.W. (Pete) Stewart, a world-renowned expert in computational linear algebra. This volume includes: forty-four of Stewart's most influential research papers in two subject areas: matrix algorithms, and rounding and perturbation theory; a biography of Stewart; a complete list of his publications, students, and honors; selected photographs; and commentaries on his works in collaboration with leading experts in the field. G.W. Stewart: Selected Works with Commentaries will appeal to graduate students, practitioners, and researchers in computational linear algebra and the history of mathematics.
This volume is the first in a self-contained five-volume series devoted to matrix algorithms. It focuses on the computation of matrix decompositions--that is, the factorization of matrices into products of similar ones. The first two chapters provide the required background from mathematics and computer science needed to work effectively in matrix computations. The remaining chapters are devoted to the LU and QR decompositions--their computation and applications. The singular value decomposition is also treated, although algorithms for its computation will appear in the second volume of the series. The present volume contains 65 algorithms formally presented in pseudocode. Other volumes in the series will treat eigensystems, iterative methods, sparse matrices, and structured problems. The series is aimed at the nonspecialist who needs more than black-box proficiency with matrix computations. To give the series focus, the emphasis is on algorithms, their derivation, and their analysis. The reader is assumed to have a knowledge of elementary analysis and linear algebra and a reasonable amount of programming experience, typically that of the beginning graduate engineer or the undergraduate in an honors program. Strictly speaking, the individual volumes are not textbooks, although they are intended to teach, the guiding principle being that if something is worth explaining, it is worth explaining fully. This has necessarily restricted the scope of the series, but the selection of topics should give the reader a sound basis for further study.
This book presents the central ideas of modern numerical analysis in a vivid and straightforward fashion with a minimum of fuss and formality. Stewart designed this volume while teaching an upper-division course in introductory numerical analysis. To clarify what he was teaching, he wrote down each lecture immediately after it was given. The result reflects the wit, insight, and verbal craftmanship which are hallmarks of the author. Simple examples are used to introduce each topic, then the author quickly moves on to the discussion of important methods and techniques. With its rich mixture of graphs and code segments, the book provides insights and advice that help the reader avoid the many pitfalls in numerical computation that can easily trap an unwary beginner. Written by a leading expert in numerical analysis, this book is certain to be the one you need to guide you through your favorite textbook.
A fascinating and illuminating account of how George Washington became the dominant force in the creation of the United States of America, from award-winning author David O. Stewart “An outstanding biography . . . [George Washington] has a narrative drive such a life deserves.”—The Wall Street Journal Washington's rise constitutes one of the greatest self-reinventions in history. In his mid-twenties, this third son of a modest Virginia planter had ruined his own military career thanks to an outrageous ego. But by his mid-forties, that headstrong, unwise young man had evolved into an unassailable leader chosen as the commander in chief of the fledgling Continental Army. By his mid-fifties, he was unanimously elected the nation's first president. How did Washington emerge from the wilderness to become the central founder of the United States of America? In this remarkable new portrait, award-winning historian David O. Stewart unveils the political education that made Washington a master politician—and America's most essential leader. From Virginia's House of Burgesses, where Washington mastered the craft and timing of a practicing politician, to his management of local government as a justice of the Fairfax County Court to his eventual role in the Second Continental Congress and his grueling generalship in the American Revolution, Washington perfected the art of governing and service, earned trust, and built bridges. The lessons in leadership he absorbed along the way would be invaluable during the early years of the republic as he fought to unify the new nation.
This book is a comprehensive survey of matrix perturbation theory, a topic of interest to numerical analysts, statisticians, physical scientists, and engineers. In particular, the authors cover perturbation theory of linear systems and least square problems, the eignevalue problem, and the generalized eignevalue problem as wellas a complete treatment of vector and matrix norms, including the theory of unitary invariant norms.
Numerical linear algebra is far too broad a subject to treat in a single introductory volume. Stewart has chosen to treat algorithms for solving linear systems, linear least squares problems, and eigenvalue problems involving matrices whose elements can all be contained in the high-speed storage of a computer. By way of theory, the author has chosen to discuss the theory of norms and perturbation theory for linear systems and for the algebraic eigenvalue problem. These choices exclude, among other things, the solution of large sparse linear systems by direct and iterative methods, linear programming, and the useful Perron-Frobenious theory and its extensions. However, a person who has fully mastered the material in this book should be well prepared for independent study in other areas of numerical linear algebra.
Accuracy and Stability of Numerical Algorithms gives a thorough, up-to-date treatment of the behavior of numerical algorithms in finite precision arithmetic. It combines algorithmic derivations, perturbation theory, and rounding error analysis, all enlivened by historical perspective and informative quotations. This second edition expands and updates the coverage of the first edition (1996) and includes numerous improvements to the original material. Two new chapters treat symmetric indefinite systems and skew-symmetric systems, and nonlinear systems and Newton's method. Twelve new sections include coverage of additional error bounds for Gaussian elimination, rank revealing LU factorizations, weighted and constrained least squares problems, and the fused multiply-add operation found on some modern computer architectures.
