Search
Now showing items 1-10 of 21
The SAC-1 Polynomial GCD and Resultant System
(University of Wisconsin-Madison Department of Computer Sciences, 1972)
This is the eighth in the series of SAC-1 subsystems for Symbolic and Algebraic Calculation. The present subsystem provides programs for computing the greatest common divisors and resultants of multivariate polynomials, ...
Necessary and Sufficient Criteria for A-Stability of Linear Multi-Step Integration Formulae
(University of Wisconsin-Madison Department of Computer Sciences, 1972)
Natural Convection in an Enclosure with Localized Heating From Below
(University of Wisconsin-Madison Department of Computer Sciences, 1972)
A Numerical Approach to Wind-Driven Ocean Circulation
(University of Wisconsin-Madison Department of Computer Sciences, 1972)
A numerical method is developed for a widely studied, wind-driven ocean circulation model. Examples of flow patterns of the northern Pacific, which include large nonlinear effects, are given.
Computer Simulation of Language Contact Models
(University of Wisconsin-Madison Department of Computer Sciences, 1972)
Second and Higher Order Duality in Nonlinear Programming
(University of Wisconsin-Madison Department of Computer Sciences, 1972)
A dual problem associated with a primal nonlinear programming problem is presented that involves second derivatives of the functions constituting the primal problem. Duality results are derived for this pair of problems. ...
Discrete Solitary Waves
(University of Wisconsin-Madison Department of Computer Sciences, 1972)
The Evolution of a Compiler: PUFFT 1964-1972
(University of Wisconsin-Madison Department of Computer Sciences, 1972)
The evolution of a compiler: PUFFT 1964-1972. The Purdue University Fast Fortran Translator PUFFT went into operation on a 7090 in 1964. It has since then been used in many environments and subject to many extensions and ...
Discrete Bars, Conductive Heat Transfer, and Elasticity
(University of Wisconsin-Madison Department of Computer Sciences, 1972)
Quadratic Convergence of a Newton Method for Nonlinear Programming
(University of Wisconsin-Madison Department of Computer Sciences, 1972)
A Newton algorithm for solving the problem minimize f(x) subject to g(x) - 0, where f:Rn - R and g:Rn - Rm is given for the case when g is concave. At each step a convex quadractic program with linear constraints is solved ...