A note on the complexity of an algorithm for chebyshev approximation |
| |
Authors: | A. A. Goldstein |
| |
Affiliation: | (1) Department of Mathematics, University of Washington, 98195 Seattle, Washington, USA |
| |
Abstract: | Some remarks are given concerning the complexity of an exchange algorithm for Chebyshev Approximation.Dedicated to Germund Dahlquist on the occasion of his 60th birthday.Supported in part by NIH Grant RR01243 at the University of Washington. — The paper was revised at the Naval Postgraduate School, Monterey, California. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|