Krishnamurthy E. Error-Free Polynomial Matrix Computations 1985
Category
Uploaded
2024-02-26 14:29:56 GMT
Size
16.66 MiB (17467208 Bytes)
Files
2
Seeders
2
Leechers
0
Hash
3B0D3D02B480E934D9093DD592C841A2277455BA

Textbook in PDF format

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. Algebraic Concepts Polynomial Matrix—Evaluation, Interpolation, Inversion Fourier Evaluation and Interpolation Polynomial Hensel Codes Matrix Computations—Euclidean and Non-Euclidean Domains

Gomagnet 2023.
The data comes from Pirate Bay.