## Search

Now showing items 11-19 of 19

#### On Numerical Solution of the Maximum Volume Ellipsoid Problem

(2001-08)

In this paper we study practical solution methods for finding the maximum-volume ellipsoid inscribing a given full-dimensional polytope in R n defined by a finite set of affine inequalities. Our goal is to design a ...

#### A Modified Low-Rank Smith Method for Large-Scale Lyapunov Equations

(2001-05)

In this note we present a modified cyclic low-rank Smith method to compute low-rank approximations to solutions of Lyapunov equations arising from large-scale dynamical systems. Unlike the original cyclic low-rank Smith ...

#### On Characterizing Graphs with Branchwidth at Most Four

(2001-04)

There are several ways in which we can characterize classes of graphs. One such way of classifying graphs is by their brachwidth. In working to characterize the class of graphs with brachwidth at most four beta4 we have ...

#### On the Decay Rate of Hankel Singular Values and Related Issues

(2001-05)

This paper investigates the decay rate of the Hankel singular values of linear dynamical systems. This issue is of considerable interest in model reduction by means of balanced truncation, for instance, since the sum of ...

#### Solving the Double Digestion Problem as a Mixed-Integer Linear Program

(2001-08)

The double digestion problem for DNA restriction mapping is known to be NP-complete. Several approaches to the problem have been used including exhaustive search, simulated annealing, branch-and-bound. In this paper, we ...

#### A Linear-Time Algorithm for Solving the Molecular Distance Geometry Problem with Exact Inter-Atomic Distances

(2001-06)

We describe a linear-time algorithm for solving the molecular distance geometry problem with exact distances between all pairs of atoms. This problem needs to be solved in every iteration of general distance geometry ...

#### Approximation of large-scale dynamical systems: An Overview

(2001-02)

In this paper we review the state of affairs in the area of approximation of large-scale systems. We distinguish among three basic categories, namely the SVD-based, the Krylov-based and the SVD-Krylov-based approximation ...

#### The Steepest Descent Minimization of Double-Well Stored Energies Does Not Yield Vectorial Microstructures

(2001-03)

We prove that the Steepest Descent algorithm applied to the minimization of total stored energies with rank-one related rotationally symmetric energy wells does not produce relaxing vectorial microstructures with non-trivial ...

#### An Efficient Algorithm for Calculating the Heat Capacity of a Large-scale Molecular System

(2001-02)

We present an efficient algorithm for computing the heat capacity of a large-scale molecular system. The new algorithm is based on a special Gaussian quadrature whose abscissas and weights are obtained by a simple Lanczos ...