Skip to main content
SpringerLink
Log in

Error-Free Polynomial Matrix Computations

  • Book
  • © 1985

Overview

Authors:
  1. E. V. Krishnamurthy

    1. Department of Computer Science, University of Waikato, Hamilton, New Zealand

    View author publications

    You can also search for this author in PubMed   Google Scholar

Part of the book series: Monographs in Computer Science (MCS)

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
eBook USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (5 chapters)

  1. Front Matter

    Pages i-xv
    Download chapter PDF

  2. Algebraic Concepts

    • E. V. Krishnamurthy
    Pages 1-37

  3. Polynomial Matrix—Evaluation, Interpolation, Inversion

    • E. V. Krishnamurthy
    Pages 38-61

  4. Fourier Evaluation and Interpolation

    • E. V. Krishnamurthy
    Pages 62-80

  5. Polynomial Hensel Codes

    • E. V. Krishnamurthy
    Pages 81-132

  6. Matrix Computations—Euclidean and Non-Euclidean Domains

    • E. V. Krishnamurthy
    Pages 133-145

  7. Back Matter

    Pages 146-154
    Download chapter PDF
Back to top

Keywords

About this book

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.

Authors and Affiliations

  • Department of Computer Science, University of Waikato, Hamilton, New Zealand

    E. V. Krishnamurthy

Bibliographic Information

  • Book Title: Error-Free Polynomial Matrix Computations

  • Authors: E. V. Krishnamurthy

  • Series Title: Monographs in Computer Science

  • DOI: https://doi.org/10.1007/978-1-4612-5118-7

  • Publisher: Springer New York, NY

  • eBook Packages: Springer Book Archive

  • Copyright Information: Springer-Verlag New York Inc. 1985

  • Softcover ISBN: 978-1-4612-9572-3Published: 26 September 2011

  • eBook ISBN: 978-1-4612-5118-7Published: 06 December 2012

  • Series ISSN: 0172-603X

  • Series E-ISSN: 2512-5486

  • Edition Number: 1

  • Number of Pages: XVI, 155

  • Topics: Numerical Analysis

  • Industry Sectors: Energy, Utilities & Environment, IT & Software

Publish with us

Policies and ethics

Back to top

Search

Navigation