Numerical Analysis and Computation Commons^™

Computation Of Planar Store Trajectories Using An Adaptive Grid Procedure, William D. Hack

Theses and Dissertations

The objective of this research was to compare a quasi-analytical, potential flow/three-degree-of-freedom model to an implicit-Euler algorithm for the calculation of store trajectories. The implicity algorithm uses a cell- centered, finite-volume, spatial discretization applied to the Euler equations, written in time-dependent, curvilinear-coordinates. A flux-differencing Roe scheme is employed to find the split-fluxes and the Steger/Warming flux-vector method is used to calculate the flux-Jacobians. The potential flow and implicit- Euler algorithm are combined with a three-degree-of-freedom algorithm to evaluate the planar, freefall trajectories of a simple store shape. The research uses two different grid-modification techniques in the implicit algorithm evaluation. Data …

Miscellaneous Publication 17/91 - Mudas - Model Of An Uncertain Dryland Agricultural System: A Description, R. S. Kingwell, A. D. Bathgate

Farm Systems and Economics research reports

In the early 1980s, the Department of Agriculture developed a mixed integer whole-farm mathematical programming model of the dryland farming system in the eastern wheatbelt of Western Australia (Morrison et al. 1986). The model named MIDAS (Model of an Integrated Dryland Agricultural System) was constructed, tested and scrutinised by a multi-disciplinary team of researchers, advisers, farm management consultants and farmers (Kingwell 1987a). The model described in some detail the biology and finances of the dryland farming system in an average season and calculated profit-maximising farm plans.

MIDAS remains an often used tool in research and extension, being applied to many …

Mapping Efficient Numerical Methods To The Solution Of Multiple Objective Linear Programs, Michael A. Shields

Theses and Dissertations

This investigation was initiated to increase the speed, accuracy and capacity of m-simplex algorithms for solving multiple objective linear programming problems. Specifically, improvements were sought through the application of general numerical techniques. It soon became apparent that the m- simplex algorithm, like the simplex algorithm, is heavily dependent upon the technology of solving related systems of linear equations. The numerical arguments for the application of LU triangular matrix factorization techniques to simplex computations are well known. OF special significance to m-simplex performance is the case of rank-k updates to basis factorizations. A stable and efficient LU approach to the rank-k …

A Duality Approach To Best Uniform Convex Approximation, S. E. Weinstein, Yuesheng Xu

Mathematics & Statistics Faculty Publications

Let C[a, b] be the space of continuous functions on [a, b] endowed with the uniform norm llƒll _∞ = sup{ Iƒ(x)1 :x∈ [a, b]}. Let K be the set of convex functions defined on [a, b]. A function g* ∈ K is said to be a best uniform convex approximation to ƒ ∈ C[a, b] if ∥ƒ - g*∥ _∞ = inf { ∥ƒ - g∥_∞ : g ∈ K}.