BIBLIO is the largest independent book marketplace in the world, with over 100 million books.

Skip to content

Error-Free Polynomial Matrix Computations (Monographs in Computer Science)

Error-Free Polynomial Matrix Computations (Monographs in Computer Science)

Error-Free Polynomial Matrix Computations (Monographs in Computer Science)
Stock photo: cover may vary

Error-Free Polynomial Matrix Computations (Monographs in Computer Science) Paperback - 2012

by E. V. Krishnamurthy

Add to wish list
  • New
  • Paperback
New

Description

Springer, 2012. Paperback. New. reprint edition. 171 pages. 9.25x6.10x0.47 inches.
Ask the seller a question Add to wish list
A$125.24
A$29.28 Delivery to USA
Standard delivery: 7 to 14 days
More delivery options
Ships from Revaluation Books (Devon, United Kingdom)

Details

About Revaluation Books Devon, United Kingdom

Biblio member since 2020

General bookseller of both fiction and non-fiction.

Terms of Sale: 30 day return guarantee, with full refund including original shipping costs for up to 30 days after delivery if an item arrives misdescribed or damaged.

Browse books from Revaluation Books

Reader reviews for Error-Free Polynomial Matrix Computations (Monographs in Computer Science)

From the publisher

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.
tracking-