954 research outputs found
Piecewise Extended Chebyshev Spaces: a numerical test for design
Given a number of Extended Chebyshev (EC) spaces on adjacent intervals, all
of the same dimension, we join them via convenient connection matrices without
increasing the dimension. The global space is called a Piecewise Extended
Chebyshev (PEC) Space. In such a space one can count the total number of zeroes
of any non-zero element, exactly as in each EC-section-space. When this number
is bounded above in the global space the same way as in its section-spaces, we
say that it is an Extended Chebyshev Piecewise (ECP) space. A thorough study of
ECP-spaces has been developed in the last two decades in relation to blossoms,
with a view to design. In particular, extending a classical procedure for
EC-spaces, ECP-spaces were recently proved to all be obtained by means of
piecewise generalised derivatives. This yields an interesting constructive
characterisation of ECP-spaces. Unfortunately, except for low dimensions and
for very few adjacent intervals, this characterisation proved to be rather
difficult to handle in practice. To try to overcome this difficulty, in the
present article we show how to reinterpret the constructive characterisation as
a theoretical procedure to determine whether or not a given PEC-space is an
ECP-space. This procedure is then translated into a numerical test, whose
usefulness is illustrated by relevant examples
Multi-index Stochastic Collocation convergence rates for random PDEs with parametric regularity
We analyze the recent Multi-index Stochastic Collocation (MISC) method for
computing statistics of the solution of a partial differential equation (PDEs)
with random data, where the random coefficient is parametrized by means of a
countable sequence of terms in a suitable expansion. MISC is a combination
technique based on mixed differences of spatial approximations and quadratures
over the space of random data and, naturally, the error analysis uses the joint
regularity of the solution with respect to both the variables in the physical
domain and parametric variables. In MISC, the number of problem solutions
performed at each discretization level is not determined by balancing the
spatial and stochastic components of the error, but rather by suitably
extending the knapsack-problem approach employed in the construction of the
quasi-optimal sparse-grids and Multi-index Monte Carlo methods. We use a greedy
optimization procedure to select the most effective mixed differences to
include in the MISC estimator. We apply our theoretical estimates to a linear
elliptic PDEs in which the log-diffusion coefficient is modeled as a random
field, with a covariance similar to a Mat\'ern model, whose realizations have
spatial regularity determined by a scalar parameter. We conduct a complexity
analysis based on a summability argument showing algebraic rates of convergence
with respect to the overall computational work. The rate of convergence depends
on the smoothness parameter, the physical dimensionality and the efficiency of
the linear solver. Numerical experiments show the effectiveness of MISC in this
infinite-dimensional setting compared with the Multi-index Monte Carlo method
and compare the convergence rate against the rates predicted in our theoretical
analysis
Which spline spaces for design?
International audienceWe recently determined the largest class of spaces of sufficient regularity which are suitable for design. How can weconnect different such spaces, possibly with the help of connection matrices, to produce the largest class of splinesusable for design? We present the answer to this question, along with some of the major difficulties encountered toestablish it.We would like to stress that the results we announce are far from being a straightforward generalisationof previous work on piecewise Chebyshevian splines
- …