Sciweavers

1997 search results - page 108 / 400
» On the convergence of Hill's method
Sort
View
INFOCOM
1995
IEEE
15 years 10 months ago
Complexity of Gradient Projection Method for Optimal Routing in Data Networks
—In this paper, we derive a time-complexity bound for the gradient projection method for optimal routing in data networks. This result shows that the gradient projection algorith...
Wei Kang Tsai, John K. Antonio, Garng M. Huang
TSP
2008
91views more  TSP 2008»
15 years 6 months ago
Nonlinear and Nonideal Sampling: Theory and Methods
We study a sampling setup where a continuous-time signal is mapped by a memoryless, invertible and nonlinear transformation, and then sampled in a nonideal manner. Such scenarios a...
Tsvi G. Dvorkind, Yonina C. Eldar, Ewa Matusiak
CCE
2004
15 years 6 months ago
A decomposition method for synthesizing complex column configurations using tray-by-tray GDP models
This paper describes an optimization procedure for the synthesis of complex distillation configurations. A superstructure based on the Reversible Distillation Sequence Model (RDSM...
Mariana Barttfeld, Pío A. Aguirre, Ignacio ...
MMAS
2010
Springer
15 years 1 months ago
A Nonlinear PDE-Based Method for Sparse Deconvolution
In this paper, we introduce a new nonlinear evolution partial differential equation for sparse deconvolution problems. The proposed PDE has the form of continuity equation that ar...
Yu Mao, Bin Dong, Stanley Osher
SIAMSC
2010
145views more  SIAMSC 2010»
15 years 1 months ago
An "hp" Certified Reduced Basis Method for Parametrized Elliptic Partial Differential Equations
We present a new "hp" parameter multi-domain certified reduced basis method for rapid and reliable online evaluation of functional outputs associated with parametrized el...
Jens L. Eftang, Anthony T. Patera, Einar M. R&osla...