Open Access. Powered by Scholars. Published by Universities.®

Applied Mathematics Commons

Open Access. Powered by Scholars. Published by Universities.®

Articles 1 - 5 of 5

Full-Text Articles in Applied Mathematics

Tschebyscheff Fitting With Polynomials And Nonlinear Functions, George F. Luffel Jan 1965

Tschebyscheff Fitting With Polynomials And Nonlinear Functions, George F. Luffel

Masters Theses

"It is the purpose of this study to survey the properties of the Tschebyscheff polynomials with particular reference to how they are employed as approximants and interpolants. The survey is extended to include the process known as "Tschebyscheff Approximation" or "Tschebyscheff Fitting" of a function by functions other than polynomials. One such fitting technique which will be of particular interest in this study is that of fitting f(x) by the function abx + c where a, b, c are real and b ≠ 1. In addition to a survey of the properties of the Tschebyscheff polynomials and of Tschebyscheff …


Latent Class Analysis And Information Retrieval, George Loyd Jensen Jan 1965

Latent Class Analysis And Information Retrieval, George Loyd Jensen

Masters Theses

"Information retrieval may be defined roughly as a procedure to either locate or physically retrieve a document or documents containing information on a given topic with a high degree of reliability. Information retrieval is one of the newest fields in computing science. Being so new there are many unexplored areas. The research that has been done has not been standardized beyond the point of the effort which has been slanted toward solving the "Library Problem" ... Several different information retrieval methods have been suggested and some research done on them to try and solve the "Library Problem". Of these methods …


Linear And Quadratic Programming With More Than One Objective Function, William John Lodholz Jan 1965

Linear And Quadratic Programming With More Than One Objective Function, William John Lodholz

Masters Theses

"A computational procedure is presented for determining optimal solutions to the linear and quadratic programming problem when there is more than one objective function subject to linear constraints. In general a unique solution does not exist and a set of "best" or "efficient" points is determined and presented in graphical or tabular form. To solve the mathematical programming problems the simplex method is used for linear objective functions and Wolfe's method is used for quadratic objective functions"--Abstract, page ii.


A Study Of Certain Conservative Sets For Parameters In The Linear Statistical Model, Roger Alan Chapin Jan 1965

A Study Of Certain Conservative Sets For Parameters In The Linear Statistical Model, Roger Alan Chapin

Masters Theses

"In the case of the linear statistical model, it has been shown that under certain conditions the confidence intervals obtained by considering the parameters one at a time are conservative when used as a joint confidence region, using the product of confidences as the confidence. However, nothing had been known of how conservative they are. This research provides accurate estimates of the true confidence for these cases.

Also, it has not yet been proved that they are indeed conservative for all cases. It is thought that they are, and the results of this research support this conjecture"--Abstract, page ii.


Comparison Of Methods To Select A Probability Model, Howard Lyndal Colburn Jan 1965

Comparison Of Methods To Select A Probability Model, Howard Lyndal Colburn

Masters Theses

"A comparison is made between the estimates of the parameters in a gamma distribution obtained by the method of moments with those obtained by a numerical approximation to the maximum likelihood estimates. The estimates obtained by the numerical approximation had a smaller mean squared error from the true value than the estimates obtained by the method of moments. Modifications to tests of fit are made in order to develop methods to select a distribution from a set of possible distributions for a population with an unknown distribution. These selection methods are compared in their ability to make correct selections. Although …