Sciweavers

125 search results - page 10 / 25
» ams 2000
Sort
View
SIAMJO
2000
76views more  SIAMJO 2000»
14 years 11 months ago
Superlinear Convergence and Implicit Filtering
In this note we show how the implicit filtering algorithm can be coupled with the BFGS quasi-Newton update to obtain a superlinearly convergent iteration if the noise in the object...
T. D. Choi, C. T. Kelley
SIAMAM
2000
132views more  SIAMAM 2000»
14 years 11 months ago
An Envelope Method for Analyzing Sequential Pattern Formation
We examine sequential spatial pattern formation in a tissue interaction model for skin organ morphogenesis. Pattern formation occurs as a front sweeps across the domain leaving in ...
Gerhard C. Cruywagen, James D. Murray, Philip K. M...
SIAMJO
2000
67views more  SIAMJO 2000»
14 years 11 months ago
Gradient Convergence in Gradient methods with Errors
We consider the gradient method xt+1 = xt + t(st + wt), where st is a descent direction of a function f : n and wt is a deterministic or stochastic error. We assume that f is Lip...
Dimitri P. Bertsekas, John N. Tsitsiklis
HPDC
2000
IEEE
15 years 4 months ago
Creating Large Scale Database Servers
The BaBar experiment at the Stanford Linear Accelerator Center (SLAC) is designed to perform a high precision investigation of the decays of the B-meson produced from electron-pos...
Jacek Becla, Andrew Hanushevsky
FOCS
2000
IEEE
15 years 4 months ago
On the Hardness of Graph Isomorphism
We show that the graph isomorphism problem is hard under DLOGTIME uniform AC0 many-one reductions for the complexity classes NL, PL (probabilistic logarithmic space) for every loga...
Jacobo Torán