Now showing items 41-50 of 451
Obstructions to the Concordance of Satellite Knots
Formulas which derive common concordance invariants for satellite knots tend to lose information regarding the axis a of the satellite operation R(a,J). The Alexander polynomial, the Blanchfield linking form, and Casson-Gordon ...
Ritz values and Arnoldi convergence for nonsymmetric matrices
The restarted Arnoldi method, useful for determining a few desired eigenvalues of a matrix, employs shifts to refine eigenvalue estimates. In the symmetric case, using selected Ritz values as shifts produces convergence ...
Dynamic multiple pattern matching
Pattern matching algorithms are among the most important and practical contribution of theoretical computer science. Pattern matching is used in a wide variety of applications such as text editing, information retrieval, ...
Invariants of graphs
We address a classical problem in low dimensional topology: the classification of tamely embedded, finite, connected graphs $G$ in $S\sp3$ up to ambient isotopy. In the case that the graph $G$ is homeomorphic to $S\sp1$, ...
REDUCIBLE NONLINEAR PROGRAMMING PROBLEMS (SEPARABLE LEAST SQUARES)
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 ...
A dynamic model for survival data with longitudinal covariates
Analyses involving both longitudinal and time-to-event data are quite common in medical research. The primary goal of such studies may be to simultaneously study the effect of treatment on both the longitudinal covariate ...
Integral equations and the cooling problem for several media
Abstract Not Available.
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, ...
Reoptimization in interior-point methods with application to integer programming
This thesis examines current reoptimization techniques for interior-point methods available in the literature and studies their efficacy in a branch-and-bound framework for 0/1 mixed integer programming problems. This work ...