Linear programming and the calculation of maximum norm approximations
This thesis examines methods for the solution of a number of approximation problems which include multivariate approximation and the approximate solution of differential equations. After a brief discussion of the literature in Chapter 1, the best linear Chebyshev approximation prob l em is discussed in Chapter 2. A brief introduc ti on to the genera l theory is given, which includes a number of characterization theorems . The di screte linear Chebys hev approximation problem is...[Show more]
|Collections||Open Access Theses|
|b1148925x_Anderson, David Hunter.pdf||58.68 MB||Adobe PDF|
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.