Now showing items 51-60 of 209
A Survey of Model Reduction Methods for Large-Scale Systems
An overview of model reduction methods and a comparison of the resulting algorithms are presented. These approaches are divided into two broad categories, namely SVD based and moment matching based methods. It turns out ...
The Total Variation Regularized L1 Model for Multiscale Decomposition
This paper studies the total variation regularization model with an L1 fidelity term (TV-L1) for decomposing an image into features of different scales. We first show that the images produced by this model can be formed ...
Characteristic Shape Sequences for Measures on Images
Researchers in many fields often need to quantify the similarity between images using metrics that measure qualities of interest in a robust quantitative manner. We present here the concept of image dimension reduction ...
Designing and Analyzing Computational Experiments for Global Optimization
We consider a variety of issues that arise when designing and analyzing computational experiments for global optimization. We describe a probability model for objective functions and a method for generating pseudorandom ...
Balancing Neumann-Neumann Methods for Elliptic Optimal Control Problems
We present Neumann-Neumann domain decomposition (DD) preconditioners for the solution of elliptic linear quadratic optimal control problems. The preconditioner is applied to the optimality system. A Schur complement ...
A Globally Convergent Primal-Dual Interior-Point Filter Method for Nonconvex Nonlinear Programming
In this paper, the filter technique of Fletcher and Leyffer (1997) is used to globalize the primal-dual interior-point algorithm for nonlinear programming, avoiding the use of merit functions and the updating of penalty ...
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 ...
Generalized Newton Methods for Crack Problems with Non-Penetration Condition
A class of semismooth Newton methods for unilaterally constrained variational problems modelling cracks under a non-penetration condition are introduced and investigated. On the continuous level, a penalization technique ...
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 Geometric Build-Up Algorithm for Soving the Molecular Distance Geometry Problem with Sparse Distance Data
Nuclear magnetic resonance (NMR) structure modeling usually produces a sparse set of inter-atomic distances in protein. In order to calculate the three-dimensional structure of protein, current approaches need to estimate ...