42,463 research outputs found
A variational approach to modeling slow processes in stochastic dynamical systems
The slow processes of metastable stochastic dynamical systems are difficult
to access by direct numerical simulation due the sampling problem. Here, we
suggest an approach for modeling the slow parts of Markov processes by
approximating the dominant eigenfunctions and eigenvalues of the propagator. To
this end, a variational principle is derived that is based on the maximization
of a Rayleigh coefficient. It is shown that this Rayleigh coefficient can be
estimated from statistical observables that can be obtained from short
distributed simulations starting from different parts of state space. The
approach forms a basis for the development of adaptive and efficient
computational algorithms for simulating and analyzing metastable Markov
processes while avoiding the sampling problem. Since any stochastic process
with finite memory can be transformed into a Markov process, the approach is
applicable to a wide range of processes relevant for modeling complex
real-world phenomena
B-spline quasi-interpolant representations and sampling recovery of functions with mixed smoothness
Let be a grid of points in the -cube
{\II}^d:=[0,1]^d, and a family of functions
on {\II}^d. We define the linear sampling algorithm for
an approximate recovery of a continuous function on {\II}^d from the
sampled values , by .
For the Besov class of mixed smoothness
(defined as the unit ball of the Besov space \MB), to study optimality of
in L_q({\II}^d) we use the quantity
, where the infimum is taken
over all grids and all families in L_q({\II}^d). We explicitly constructed linear
sampling algorithms on the grid \xi = \ G^d(m):=
\{(2^{-k_1}s_1,...,2^{-k_d}s_d) \in \II^d : \ k_1 + ... + k_d \le m\}, with
a family of linear combinations of mixed B-splines which are mixed
tensor products of either integer or half integer translated dilations of the
centered B-spline of order . The grid is of the size
and sparse in comparing with the generating dyadic coordinate cube grid of the
size . For various and , we
proved upper bounds for the worst case error which coincide with the asymptotic order of
in some cases. A key role in constructing these
linear sampling algorithms, plays a quasi-interpolant representation of
functions by mixed B-spline series
A Primer on Reproducing Kernel Hilbert Spaces
Reproducing kernel Hilbert spaces are elucidated without assuming prior
familiarity with Hilbert spaces. Compared with extant pedagogic material,
greater care is placed on motivating the definition of reproducing kernel
Hilbert spaces and explaining when and why these spaces are efficacious. The
novel viewpoint is that reproducing kernel Hilbert space theory studies
extrinsic geometry, associating with each geometric configuration a canonical
overdetermined coordinate system. This coordinate system varies continuously
with changing geometric configurations, making it well-suited for studying
problems whose solutions also vary continuously with changing geometry. This
primer can also serve as an introduction to infinite-dimensional linear algebra
because reproducing kernel Hilbert spaces have more properties in common with
Euclidean spaces than do more general Hilbert spaces.Comment: Revised version submitted to Foundations and Trends in Signal
Processin
- …