Thesis (Ph. D.)--University of Chicago, 1918. / Vita. "Private edition, distributed by the University of Chicago Libraries, Chicago, Illinois." "Reprinted from American journal of mathematics, Vol. XLII, No. 1, January, 1920." Includes bibliographical references. Also available on the Internet.

Thesis (M.S.)--Oregon State University, 2008. / Printout. Includes bibliographical references (leaves 54-56). Also available on the World Wide Web.

Thesis (Ph. D.)--University of Washington, 2000. / Vita. Includes bibliographical references (leaves 150-154).

Dissertação (mestrado) - Universidade Federal de Santa Catarina, Centro Tecnológico. Programa de Pós-graduação em Engenharia Mecânica. / Made available in DSpace on 2012-10-15T19:08:36Z (GMT). No. of bitstreams: 0

Dissertação (mestrado) - Universidade Federal de Santa Catarina, Centro Tecnológico. Programa de Pós-Graduação em Engenharia de Produção / Made available in DSpace on 2012-10-15T22:52:08Z (GMT). No. of bitstreams: 0Bitstream added on 2013-07-16T17:00:58Z : No. of bitstreams: 1 262046.pdf: 2454665 bytes, checksum: 00c52d2473bdcfc6d80f57f8976036db (MD5)

Dissertação (mestrado) - Universidade Federal de Santa Catarina, Centro de Ciencias Fisicas e Matematicas / Made available in DSpace on 2012-10-15T23:24:23Z (GMT). No. of bitstreams: 0Bitstream added on 2016-01-08T15:13:01Z : No. of bitstreams: 1 101489.pdf: 3157232 bytes, checksum: 674de463b85e578a837edfa2cdf5cfbc (MD5) / Este trabalho apresenta um algorítmo alternativo para resolver modelos básicos de programação linear, que apresentam instabilidade numérica quando são efetuadas operações com as matrizes que os compõem, objetivando minimizar os erros gerados por tais operações. Para tanto, utiliza-se a decomposição de matrizes em valores singulares e sua aplicação no cálculo da inversa de uma matriz. Mostram-se resultados de várias aplicações, onde podem ser vistas as vantagens do algorítmo quando comparado com o simplex usual.

Dissertação (mestrado) - Universidade Federal de Santa Catarina, Centro Tecnológico. Programa de Pós-Graduação em Engenharia de Produção. / Made available in DSpace on 2012-10-16T20:54:32Z (GMT). No. of bitstreams: 0Bitstream added on 2013-07-16T16:47:13Z : No. of bitstreams: 1 261798.pdf: 1340207 bytes, checksum: 8f4e0e585996c5c65e67259ea090dcf0 (MD5)

Dissertação (mestrado) - Universidade Federal de Santa Catarina, Centro Tecnológico. Programa de Pós-Graduação em Engenharia de Produção / Made available in DSpace on 2012-10-16T21:19:50Z (GMT). No. of bitstreams: 0Bitstream added on 2013-07-16T16:51:48Z : No. of bitstreams: 1 261416.pdf: 1438065 bytes, checksum: 815c98e56a9b2c7e29064a112aa5a1be (MD5)

Thesis (M.A.)--Boston University / It has been noted that the writing of a system of linear equations in matrix form quite naturally suggests the computation of an inverse matrix which may then be used to compute solutions to a system of equations in which the coefficients remain the same but the constants have been changed. The elementary properties of matrices and determinants have been reviewed and a general method of matrix inversion based on these properties was considered. The very considerable practical deficiencies of this theoretically attractive method suggested that the method would be almost completely worthless for a system larger than two by two [TRUNCATED]

Thesis (M.A.)--Boston University / This paper, utilizing the properties of Vector spaces, describes an approach to polynomial approximations of functions defined analytically or by a set of observations over some interval. If the function and its approximation are both considered tobe elements of a linear normed vector space, a weighted sum or integral of the square of the discrepancy between the function and its approximation is to be a minimum. When this condition is satisfied, and depending upon the interval of interest, the polynomial approximation to the function becomes either the Legendre, Chebyshev, Laguerre, or hermite approximation formulas. An investigation into the properties and applications of these formulas is included, and it is shown that these formulas give the best polynomial approximations to certain functions in the sense of least squares.