Electronic Resource
Springer
BIT
17 (1977), S. 249-261
ISSN:
1572-9125
Source:
Springer Online Journal Archives 1860-2000
Topics:
Mathematics
Notes:
Abstract A numerically stable simplex algorithm for calculating the restricted Chebyshev solution of overdetermined systems of linear equations is described. In this algorithm minimum computer storage is required and no conditions are imposed on the coefficient matrix or on the right hand side of the system of equations. Also a new way of implementing a triangular decomposition method to the basis matrix is used. The ordinary Chebyshev solution, the one-sided Chebyshev solutions and the Chebyshev approximation by non-negative functions are obtained as special cases in this algorithm. Numerical results are given.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1007/BF01932145
Library |
Location |
Call Number |
Volume/Issue/Year |
Availability |