NASA Logo

NTRS

NTRS - NASA Technical Reports Server

Collections About News Help Login
Back to Results
Optimal Chebyshev polynomials on ellipses in the complex planeThe design of iterative schemes for sparse matrix computations often leads to constrained polynomial approximation problems on sets in the complex plane. For the case of ellipses, we introduce a new class of complex polynomials which are in general very good approximations to the best polynomials and even optimal in most cases.
Document ID
19920002504
Acquisition Source
Legacy CDMS
Document Type
Contractor Report (CR)
Authors
Fischer, Bernd (Research Inst. for Advanced Computer Science Moffett Field, CA, United States)
Freund, Roland (Wuerzburg Univ. Germany, F.R. , United States)
Date Acquired
September 6, 2013
Publication Date
February 1, 1989
Subject Category
Numerical Analysis
Report/Patent Number
RIACS-TR-89-5
NAS 1.26:188836
NASA-CR-188836
Accession Number
92N11722
Funding Number(s)
CONTRACT_GRANT: NCC2-387
Distribution Limits
Public
Copyright
Work of the US Gov. Public Use Permitted.

Related Records

There are no records associated with this record.
No Preview Available