Polynomial and Matrix Computations


Book Description

Our Subjects and Objectives. This book is about algebraic and symbolic computation and numerical computing (with matrices and polynomials). It greatly extends the study of these topics presented in the celebrated books of the seventies, [AHU] and [BM] (these topics have been under-represented in [CLR], which is a highly successful extension and updating of [AHU] otherwise). Compared to [AHU] and [BM] our volume adds extensive material on parallel com putations with general matrices and polynomials, on the bit-complexity of arithmetic computations (including some recent techniques of data compres sion and the study of numerical approximation properties of polynomial and matrix algorithms), and on computations with Toeplitz matrices and other dense structured matrices. The latter subject should attract people working in numerous areas of application (in particular, coding, signal processing, control, algebraic computing and partial differential equations). The au thors' teaching experience at the Graduate Center of the City University of New York and at the University of Pisa suggests that the book may serve as a text for advanced graduate students in mathematics and computer science who have some knowledge of algorithm design and wish to enter the exciting area of algebraic and numerical computing. The potential readership may also include algorithm and software designers and researchers specializing in the design and analysis of algorithms, computational complexity, alge braic and symbolic computing, and numerical computation.




Structured Matrices and Polynomials


Book Description

This user-friendly, engaging textbook makes the material accessible to graduate students and new researchers who wish to study the rapidly exploding area of computations with structured matrices and polynomials. The book goes beyond research frontiers and, apart from very recent research articles, includes previously unpublished results.




Matrix Computations


Book Description




Numerical Polynomial Algebra


Book Description

This book is the first comprehensive treatment of numerical polynomial algebra, an area which so far has received little attention.




Matrix Analysis and Computations


Book Description

This comprehensive book is presented in two parts; the first part introduces the basics of matrix analysis necessary for matrix computations, and the second part presents representative methods and the corresponding theories in matrix computations. Among the key features of the book are the extensive exercises at the end of each chapter. Matrix Analysis and Computations provides readers with the matrix theory necessary for matrix computations, especially for direct and iterative methods for solving systems of linear equations. It includes systematic methods and rigorous theory on matrix splitting iteration methods and Krylov subspace iteration methods, as well as current results on preconditioning and iterative methods for solving standard and generalized saddle-point linear systems. This book can be used as a textbook for graduate students as well as a self-study tool and reference for researchers and engineers interested in matrix analysis and matrix computations. It is appropriate for courses in numerical analysis, numerical optimization, data science, and approximation theory, among other topics




Matrices, Moments and Quadrature with Applications


Book Description

This computationally oriented book describes and explains the mathematical relationships among matrices, moments, orthogonal polynomials, quadrature rules, and the Lanczos and conjugate gradient algorithms. The book bridges different mathematical areas to obtain algorithms to estimate bilinear forms involving two vectors and a function of the matrix. The first part of the book provides the necessary mathematical background and explains the theory. The second part describes the applications and gives numerical examples of the algorithms and techniques developed in the first part. Applications addressed in the book include computing elements of functions of matrices; obtaining estimates of the error norm in iterative methods for solving linear systems and computing parameters in least squares and total least squares; and solving ill-posed problems using Tikhonov regularization. This book will interest researchers in numerical linear algebra and matrix computations, as well as scientists and engineers working on problems involving computation of bilinear forms.




Error-Free Polynomial Matrix Computations


Book Description

This book is written as an introduction to polynomial matrix computa tions. It is a companion volume to an earlier book on Methods and Applications of Error-Free Computation by R. T. Gregory and myself, published by Springer-Verlag, New York, 1984. This book is intended for seniors and graduate students in computer and system sciences, and mathematics, and for researchers in the fields of computer science, numerical analysis, systems theory, and computer algebra. Chapter I introduces the basic concepts of abstract algebra, including power series and polynomials. This chapter is essentially meant for bridging the gap between the abstract algebra and polynomial matrix computations. Chapter II is concerned with the evaluation and interpolation of polynomials. The use of these techniques for exact inversion of poly nomial matrices is explained in the light of currently available error-free computation methods. In Chapter III, the principles and practice of Fourier evaluation and interpolation are described. In particular, the application of error-free discrete Fourier transforms for polynomial matrix computations is consi dered.




Linear Algebra and Matrix Computations with MATLAB®


Book Description

This book focuses the solutions of linear algebra and matrix analysis problems, with the exclusive use of MATLAB. The topics include representations, fundamental analysis, transformations of matrices, matrix equation solutions as well as matrix functions. Attempts on matrix and linear algebra applications are also explored.




Mathematics and Computation


Book Description

From the winner of the Turing Award and the Abel Prize, an introduction to computational complexity theory, its connections and interactions with mathematics, and its central role in the natural and social sciences, technology, and philosophy Mathematics and Computation provides a broad, conceptual overview of computational complexity theory—the mathematical study of efficient computation. With important practical applications to computer science and industry, computational complexity theory has evolved into a highly interdisciplinary field, with strong links to most mathematical areas and to a growing number of scientific endeavors. Avi Wigderson takes a sweeping survey of complexity theory, emphasizing the field’s insights and challenges. He explains the ideas and motivations leading to key models, notions, and results. In particular, he looks at algorithms and complexity, computations and proofs, randomness and interaction, quantum and arithmetic computation, and cryptography and learning, all as parts of a cohesive whole with numerous cross-influences. Wigderson illustrates the immense breadth of the field, its beauty and richness, and its diverse and growing interactions with other areas of mathematics. He ends with a comprehensive look at the theory of computation, its methodology and aspirations, and the unique and fundamental ways in which it has shaped and will further shape science, technology, and society. For further reading, an extensive bibliography is provided for all topics covered. Mathematics and Computation is useful for undergraduate and graduate students in mathematics, computer science, and related fields, as well as researchers and teachers in these fields. Many parts require little background, and serve as an invitation to newcomers seeking an introduction to the theory of computation. Comprehensive coverage of computational complexity theory, and beyond High-level, intuitive exposition, which brings conceptual clarity to this central and dynamic scientific discipline Historical accounts of the evolution and motivations of central concepts and models A broad view of the theory of computation's influence on science, technology, and society Extensive bibliography




Numerical Methods in Matrix Computations


Book Description

Matrix algorithms are at the core of scientific computing and are indispensable tools in most applications in engineering. This book offers a comprehensive and up-to-date treatment of modern methods in matrix computation. It uses a unified approach to direct and iterative methods for linear systems, least squares and eigenvalue problems. A thorough analysis of the stability, accuracy, and complexity of the treated methods is given. Numerical Methods in Matrix Computations is suitable for use in courses on scientific computing and applied technical areas at advanced undergraduate and graduate level. A large bibliography is provided, which includes both historical and review papers as well as recent research papers. This makes the book useful also as a reference and guide to further study and research work.