eCommons

 

A Note on the Evaluation of Matrix Polynomials

Other Titles

Abstract

The problem of evaluating a polynomial p(x) in a matrix A arises in many applications, e.g. the Taylor approximation of eA. The O(qn3) algorithm of Paterson and Stockmeyer has the drawback that it requires O(qn2) storage, where q is the degree of p and n is the dimension of A. An algorithm which greatly reduces this storage requirement without undue loss of speed is presented.

Journal / Series

Volume & Issue

Description

Sponsorship

Date Issued

1978-09

Publisher

Cornell University

Keywords

computer science; technical report

Location

Effective Date

Expiration Date

Sector

Employer

Union

Union Local

NAICS

Number of Workers

Committee Chair

Committee Co-Chair

Committee Member

Degree Discipline

Degree Name

Degree Level

Related Version

Related DOI

Related To

Related Part

Based on Related Item

Has Other Format(s)

Part of Related Item

Related To

Related Publication(s)

Link(s) to Related Publication(s)

References

Link(s) to Reference(s)

Previously Published As

http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR78-353

Government Document

ISBN

ISMN

ISSN

Other Identifiers

Rights

Rights URI

Types

technical report

Accessibility Feature

Accessibility Hazard

Accessibility Summary

Link(s) to Catalog Record