<p>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
Error-Free Polynomial Matrix Computations
✍ Scribed by E.V. Krishnamurthy
- Publisher
- Springer New York
- Year
- 1985
- Tongue
- English
- Leaves
- 170
- Series
- Texts and Monographs in Computer Science; Texts and monographs in computer science
- Edition
- Softcover reprint of the original 1st ed. 1985
- Category
- Library
No coin nor oath required. For personal study only.
✦ Synopsis
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
✦ Table of Contents
Front Matter....Pages i-xv
Algebraic Concepts....Pages 1-37
Polynomial Matrix—Evaluation, Interpolation, Inversion....Pages 38-61
Fourier Evaluation and Interpolation....Pages 62-80
Polynomial Hensel Codes....Pages 81-132
Matrix Computations—Euclidean and Non-Euclidean Domains....Pages 133-145
Back Matter....Pages 146-154
✦ Subjects
Mathematics;Numerical analysis
📜 SIMILAR VOLUMES
Matrix and polynomial computations are fundamental to the theory and practice of computing. The authors present here a systematic treatment of algorithms and complexity in these two related areas. Its study of computations with Toeplitz matrices and other dense structured matrices demonstrates the l