• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 12
  • 1
  • 1
  • 1
  • Tagged with
  • 15
  • 15
  • 3
  • 3
  • 3
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.

An experimental investigation of the properties of simultaneous equations estimators /

Westbrook, Mark Daniel, January 1978 (has links)
Thesis (Ph. D.)--Ohio State University, 1978. / Includes vita. Includes bibliographical references (leaves 90-92). Available online via OhioLINK's ETD Center.

Automatic computer generation of solution precedures to large sets of nonlinear simultaneous equations via GENDER

Cunningham, James Richard, January 1972 (has links)
Thesis--University of Florida. / Description based on print version record. Typescript. Vita. Bibliography: leaf 510.

Untersuchungen über involutorische gleichungensysteme ...

Cornely, Anton, January 1892 (has links)
Inaug.-diss.--Würzburg. / Vita.

Efficient supernodal sparse Cholesky factorization

Mascarenhas, Adrian. January 2002 (has links)
Thesis (M.S.)--University of Florida, 2002. / Title from title page of source document. Document formatted into pages; contains xi, 84 p.; also contains graphics. Includes vita. Includes bibliographical references.

Numerical methods for box-constrained integer least squares problems

Yang, Xiaohua, January 1900 (has links)
Thesis (Ph.D.). / Written for the School of Computer Science. Title from title page of PDF (viewed 2008/03/12). Includes bibliographical references.

Systems of linear inequalities and equations

Unknown Date (has links)
"This paper is a study of finite systems of homogenous linear inequalities, homogeneous linear equations, and nonhomogeneous equations. To each inequality or equation in one system there corresponds a nonnegative or unrestricted variable in the other and conversely. The array of coefficients in one system is the negative transpose in the other system. This duality furnishes the foundation for the duality of matrix games and linear programming"--Introduction. / Typescript. / "June, 1959." / "Submitted to the Graduate Council of Florida State University in partial fulfillment of the requirements for the degree of Master of Science." / Advisor: Paul J. McCarthy, Professor Directing Paper. / Includes bibliographical references (leaves 38-39).

Simultaneous equations a Bayesian approach.

Harkema, Rinse. January 1971 (has links)
Proefschrift--Nederlandse Economische Hogeschool, Rotterdam. / Text in English, summary and inserted notes in Dutch. Stellingen: [1] p. inserted. Bibliography: p. 105-106.

Best simultaneous approximation in normed linear spaces

Johnson, Solomon Nathan January 2018 (has links)
In this thesis we consider the problem of simultaneously approximating elements of a set B C X by a single element of a set K C X. This type of a problem arises when the element to be approximated is not known precisely but is known to belong to a set.Thus, best simultaneous approximation is a natural generalization of best approximation which has been studied extensively. The theory of best simultaneous approximation has been studied by many authors, see for example [4], [8], [25], [28], [26] and [12] to name but a few.

Numerical solution algorithms in the DLANET program

Bhalala, Ashesh, 1964- January 1989 (has links)
Several methods to solve a system of linear equations with real and complex coefficients exist. The most popular methods are Gauss-Jordan, L-U Decomposition, Gauss-Seidel, and Matrix Reduction. These methods are utilized to optimize run-time of the DLANET circuit analysis program. As concluded by this study, the Matrix Reduction method which is presently utilized in the DLANET program, results in run-times which are faster than the other solution methods studied in this paper for lower order systems. Similarly, the L-U Decomposition and Gauss-Jordan methods result in faster run-times than the other techniques for higher order systems. Finally, the Gauss-Seidel Iterative method, when incorporated into the DLANET program, has proven to be much slower than the other solution methods considered in this paper.

Partial L's a precise gross score solution of partial and multiple correlation /

Alluisi, Earl A. January 1950 (has links) (PDF)
Thesis (M.A.)--Ohio State University, 1950. / Advisor: John R. Kinzer. Text made available in compliance with Section 108 of the Copyright Revision Act of 1976. Includes bibliographical references (leaves 73-77). Online version of print reproduction.

Page generated in 0.1133 seconds