Now showing items 1-10 of 15
Generalized Pattern Searches with Derivative Information
A common question asked by users of direct search algorithms is how to use derivative information at iterates where it is available. This paper addresses that question with respect to Generalized Pattern Search (GPS) ...
Programming the Nanocell, a Random Array of Molecules
The emerging field of molecular electronics seeks to create computational function from individual molecules or arrays of molecules. These nanoscale devices would then enable the production of faster, denser, cheaper ...
Bounds on Eigenvalue Decay Rates and Sensitivity of Solutions to Lyapunov Equations
Balanced model reduction is a technique for producing a low dimensional approximation to a linear time invariant system. An important feature of balanced reduction is the existence of an error bound that is closely related ...
Hundred Digit Challenge Solutions
This paper details our solutions to the "Hundred-dollar, Hundred-digit Challenge", which appeared in Volume 35, Number 1 of SIAM News.
A Successive Linear Programming Approach to IMRT Optimization Problem
We propose to solve the IMRT optimization problem through a successive linear programming approach. Taking advantage of the sensitivity information in linear programming and the re-optimization ability of simplex methods, ...
A New Global Optimization Strategy for the Molecular Replacement Problem
The primary technique for determining the three-dimensional structure of a protein is X-ray crystallography, in which the molecular replacement (MR) problem arises as a critical step. Knowledge of protein structures is ...
Solving the Inverse Problem of Electrocardiography Using a Duncan and Horn Formulation of the Kalman Filter
Numeric regularization methods most often used to solve the ill-posed inverse problem of electrocardiography are spatial and ignore the temporal nature of the problem. In this study, a reformulation of the Kalman filter ...
Passivity Preserving Model Reduction via Interpolation of Spectral Zeros
An algorithm is developed for passivity preserving model reduction of LTI systems. The derivation is justified analytically and implementation schemes are developed for both medium scale (dense) and large scale (sparse) ...
Computational Experience with Lenstra's Algorithm
Integer programming is an important mathematical approach for many decision-making problems. In this field, a major theoretical breakthrough came in 1983 when H. W. Lenstra, Jr. proposed a polynomial-time algorithm for a ...
A Variational Study of the Electrical Impedance Tomography Problem
This research is focused on the numerical solution of the inverse conductivity problem, widely known as electrical impedance tomography (EIT). The EIT problem is concerned with imaging electrical properties, such as ...