Now showing items 1-10 of 311
Optimizing over the cut cone: A new polyhedral algorithm for the maximum-weight cut problem
Polyhedral cutting-plane algorithms for hard combinatorial problems have scored notable successes. However, computational research on the Maximum-Weight Cut Problem (MCP) on undirected graphs has been inconclusive. In 1988, ...
A class of symmetric two dimensional logarithmic potentials
This thesis discusses the solution of an elliptical conductor problem in two dimensions. This problem can be easily solved in higher dimensions, but in two dimensions, the potential function is logarithmic near infinity. ...
An elementary proof of the spectral theorem for unbounded operators
One of the proofs of the spectral theorem for bounded operators begins by proving that a bounded, positive definite self-adjoint operator on a Hilbert space has a unique positive definite self-adjoint square root. From ...
A PENALTY-GALERKIN METHOD FOR SOLVING THE MISCIBLE DISPLACEMENT PROBLEM
The implementation of an interior penalty Galerkin procedure is described for the simulation of the areal miscible displacement of one incompressible fluid by another in a horizontal porous medium. The method permits ...
Preconditioner schemes for elliptic saddle-point matrices based upon Jacobi multi-band polynomial matrices
Simulation of flow in porous media requires the numerical approximation of elliptic partial differential equations. Mixed finite element methods are frequently employed, because of local mass conservation and accurate ...
ERROR ESTIMATES FOR FINITE-ELEMENT METHODS FOR FOURTH-ORDER BOUNDARY VALUE PROBLEMS
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 ...