Digital Commons Network^™

Tchebycheff Approximation On A Discrete Point Set: Algorithms Old And New, William Edward Mcbride

Doctoral Dissertations

"Several linear and nonlinear algorithms for solving the discrete Tchebycheff problem are compared in this study. The Lawson algorithm is compared with two more well-known methods of linear Tchebycheff approximation. A new acceleration scheme for the Lawson algorithm is introduced and its performance is tested with an already existing acceleration technique. The new version is found to be better than the previous one but not as effective as the traditional Exchange method.

A nonlinear version of Lawson's algorithm is proposed for the solution of problems having approximating functions which are varisolvent. Some linear theorems of Lawson are extended to the …

Some Results On Quasi-Uniform Spaces, Karen Sylvia Carter

Doctoral Dissertations

"An example of a quasi-uniform space which is complete but not strongly complete is constructed. We also give an example to show that a T₁ space does not necessarily have a T₁ strong completion.

The definition of Cauchy filter is discussed. An alternate definition, referred to as C-filter, is considered. A construction of a C-completion is given and it is shown that if a quasi-pseudometric is complete, then the corresponding quasi-uniform structure is C-complete.

Conjugate quasi-uniform spaces are discussed. A theorem relating a transitive base of a quasi-uniform structure to a transitive base of the conjugate structure is …