## Search

Now showing items 1-10 of 35

#### REDUCIBLE NONLINEAR PROGRAMMING PROBLEMS (SEPARABLE LEAST SQUARES)

(1985)

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 ...

#### Global convergence of trust region methods for minimizing a nondifferentiable function

(1989)

Three fundamental convergence properties of trust region (TR) methods for solving nonsmooth unconstrained minimization problems are considered in this paper. The first is to prevent the false termination of the TR iterates, ...

#### INTEGRAL EQUATIONS' APPROACH TO SCATTERING PROBLEMS

(1982)

In the present thesis, the classical potential theory is used to derive systems of second kind integral equations corresponding to scattering of acoustic and elastic waves from both fluid and solid inclusions. These systems ...

#### Error estimates for Godunov mixed methods for nonlinear parabolic equations

(1988)

Many computational fluids problems are described by nonlinear parabolic partial differential equations. These equations generally involve advection (transport) and a small diffusion term, and in some cases, chemical ...

#### ANALYSIS ON SUPERMANIFOLDS

(1987)

In this thesis a theory of differential analysis for complex supermanifolds is developed analogous to that for complex manifolds. A natural association is set up between complex supermanifolds and smooth supermanifolds ...

#### DOMAIN DECOMPOSITION FOR TWO-DIMENSIONAL ELLIPTIC OPERATORS ON VECTOR AND PARALLEL MACHINES (SUBSTRUCTURING)

(1986)

The efficient computation of the solution to self-adjoint elliptic operators is the subject of this dissertation. Discretization of this equation by finite differences or finite elements yields a large, sparse, symmetric ...

#### A GLOBAL CONVERGENCE THEORY FOR ARBITRARY NORM TRUST REGION METHODS FOR NONLINEAR EQUATIONS

(1987)

In this research we extend the Levenberg-Marquardt algorithm for approximating zeros of the nonlinear system F(x) = 0, where F is continuously differentiable from ${\rm I\!R}\sp{n}$ to ${\rm I\!R}\sp{n}.$ Instead of the ...

#### A VARIABLE-METRIC VARIANT OF THE KARMARKAR ALGORITHM FOR LINEAR PROGRAMMING

(1987)

The most time-consuming part of the Karmarkar algorithm for linear programming is computation of the step direction, which requires the projection of a vector onto the nullspace of a matrix that changes at each iteration. ...

#### EGOROV'S THEOREM FOR A DIFFRACTIVE BOUNDARY PROBLEM

(1980)

Let (TRIANGLE) be the Laplacian on R('n)(FDIAG)K with Dirichlet boundary conditions. Assume K is smoothly bounded with strictly convex boundary. By the spectral theorem define e('itSQRT.(-)(TRIANGLE)(' )and extend this ...

#### ERROR ESTIMATES FOR FINITE-ELEMENT METHODS FOR FOURTH-ORDER BOUNDARY VALUE PROBLEMS

(1981)

Let u be the solution to a general boundary value problem which is fourth order in the one-dimension space variable x. We consider various dependencies in the time variable t. We define a finite element approximation U to ...