Now showing items 21-30 of 126
Reducible Nonlinear Programming Problems
In this thesis we are concerned with general nonlinear programming problems in which the variables can be naturally separated into two groups. This separation has the property that if the variables in one of the groups are ...
Simultaneous Determination of Source Wavelet and Velocity Profile Using Impulsive Point-Source Reflections from a Layered Fluid
The determination of source signature is a major calibration problem in reflection seismology. This "deconvolution" problem is conventionally approached by way of statistical methods, by direct measurement, or by the ...
Deflated Krylov Subspace Methods for Nearly Singular Linear Systems
This paper concerns the use of Krylov subspace methods for the solution of nearly singular nonsymmetric linear systems. We show that the Incomplete Orthogonalization Methods (IOM) in conjunction with certain deflation ...
A Short Proof of the Truemper-Tseng Theorem on Max-Flow Min-Cut Matroids
Seymour has characterized the matroids satisfying the integral max-flow min-cut property with respect to a fixed element. Truemper and Tseng subsequently proved a decomposition theorem for this class, similar in spirit to ...
ønix: A Unix Emulator for VAX/VMS
A Global Convergence Theory for a Class of Trust Region Algorithms for Constrained Optimization
In this research we present a trust region algorithm for solving the equality constrained optimization problem. This algorithm is a variant of the 1984 Celis-Dennis-Tapia algorithm. The augmented Lagrangian function is ...
Generalized Conjugate Directions
This paper presents a simple unifying framework for a wide class of conjugate directions algorithms whose iterates minimize some quadratic functional over a subspace. Our approach is motivated by its advantages for nonlinear ...
A Multi-Level Domain Decomposition Algorithm Suitable for the Solution of Three-Dimensional Elliptic Partial Differential Equations
A three-dimensional, nonsymmetric, domain decomposition algorithm is developed. The algorithm is based upon the use of a lower dimensional problem as a correction to the preconditioned generalized conjugate residual method ...
PFC: A Program to Convert Fortran to Parallel Form
The recent success of vector computers like the Cray-1 and array processors such as those manufactured by Floating Point Systems has increased interest in making vector operations available to the Fortran programmer. The ...
On the Successive Projections Approach to Least-Squares Problems
In this paper, we suggest a generalized Gauss-Seidel approach to sparse linear and nonlinear least-squares problems. The algorithm, closely related to one given by Elfving (1980), uses the work of Curtis, Powell, and Reid ...