On spectra of Diophantine approximation exponents
Abstract
Exponents of Diophantine approximation are defined to study specific sets of real numbers for which Dirichlet's pigeonhole principle can be improved. Khintchine stated a transference principle between the two exponents in the cases of simultaneous approximation and approximation by linear forms. This shows that exponents of Diophantine approximation are related, and these relations can be studied via so called spectra. In this talk, we provide an optimal bound for the ratio between ordinary and uniform exponents of Diophantine approximation for both simultaneous approximation and approximation by linear forms. This is joint work with Nikolay Moshchevitin.
Weakly-normal basis vector fields in RKHS with an application to shape Newton methods
Abstract
We construct a space of vector fields that are normal to differentiable curves in the plane. Its basis functions are defined via saddle point variational problems in reproducing kernel Hilbert spaces (RKHSs). First, we study the properties of these basis vector fields and show how to approximate them. Then, we employ this basis to discretise shape Newton methods and investigate the impact of this discretisation on convergence rates.
Randomized algorithms for computing full, rank-revealing factorizations
Abstract
Over the past decade, the randomized singular value decomposition (RSVD)
algorithm has proven to be an efficient, reliable alternative to classical
algorithms for computing low-rank approximations in a number of applications.
However, in cases where no information is available on the singular value
decay of the data matrix or the data matrix is known to be close to full-rank,
the RSVD is ineffective. In recent years, there has been great interest in
randomized algorithms for computing full factorizations that excel in this
regime. In this talk, we will give a brief overview of some key ideas in
randomized numerical linear algebra and introduce a new randomized algorithm for
computing a full, rank-revealing URV factorization.
Discontinuous Galerkin method for the Oseen problem with mixed boundary conditions: a priori and aposteriori error analyses
Abstract
We introduce and analyze a discontinuous Galerkin method for the Oseen equations in two dimension spaces. The boundary conditions are mixed and they are assumed to be of three different types:
the vorticity and the normal component of the velocity are given on a first part of the boundary, the pressure and the tangential component of the velocity are given on a second part of the boundary and the Dirichlet condition is given on the remainder part . We establish a priori error estimates in the energy norm for the velocity and in the L2 norm for the pressure. An a posteriori error estimate is also carried out yielding optimal convergence rate. The analysis is based on rewriting the method in a non-consistent manner using lifting operators in the spirit of Arnold, Brezzi, Cockburn and Marini.
Analysis of discontinuous Galerkin methods for anti-diffusive fractional equations
Abstract
We consider numerical methods for solving time dependent partial differential equations with convection-diffusion terms and anti-diffusive fractional operator of order $\alpha \in (1,2)$. These equations are motivated by two distinct applications: a dune morphodynamics model and a signal filtering method.
We propose numerical schemes based on local discontinuous Galerkin methods to approximate the solutions of these equations. Numerical stability and convergence of these schemes are investigated.
Finally numerical experiments are given to illustrate qualitative behaviors of solutions for both applications and to confirme the convergence results.