Near-optimal approximation methods for elliptic PDEs with lognormal coefficients

cedure involves, for each sample, κ (m) (x), two main steps: the set-up and the resolution. In the set-up step, one goes through the subdomains to a) construct the local operator of

Based on the LOCAL calibration algorithm (Shenk et al., 1997) and the Locally Weighted Regression (LWR ; Naes et al., 1990), we developed a powerful routine associating local

The method, based on a least-squares approach, generalizes Newton type methods and guarantees the convergence whatever be the initial element of the sequence..

As previously, we can solve the governing equation by seeking similarity solutions, but a full analytical solution to the boundary initial value problem can be worked out by using

In order to exemplify the behavior of least-squares methods for policy iteration, we apply two such methods (offline LSPI and online, optimistic LSPI) to the car-on- the-hill

نزنب ورتن يثلاث نيب سامتلا حطس ىوتسم ىلع ةيرظنلا ءايميكلاب ةصاخ ةيباسح قرط مادختساب تينيلواكلا حطس ىلع ONIOM ةقيرطو Hartree-Fock و TFD

Approximation of null controls for semilinear heat equations using a least-squares approach.. Jérôme Lemoine, Irene Marín-Gayte,

We introduce a special metric space in which the Feynman - Kac map- ping is contracted. Taking this into account we show the fixed-point theorem for this mapping and we show that