Adaptive boundary element methods with convergence rates

This paper presents adaptive boundary element methods for positive, negative, as well as zero order operator equations, together with proofs that they converge at certain rates. The convergence rates are quasi-optimal in a certain sense under mild assumptions that are analogous to what is typically assumed in the theory of adaptive finite element methods. In particular, no saturation-type assumption is used. The main ingredients of the proof that constitute new findings are some results on a posteriori error estimates for boundary element methods, and an inverse-type inequality involving boundary integral operators on locally refined finite element spaces.Comment: 48 pages. A journal version. The previous version (v3) is a bit lengthie

Learning probability distributions generated by finite-state machines

We review methods for inference of probability distributions generated by probabilistic automata and related models for sequence generation. We focus on methods that can be proved to learn in the inference in the limit and PAC formal models. The methods we review are state merging and state splitting methods for probabilistic deterministic automata and the recently developed spectral method for nondeterministic probabilistic automata. In both cases, we derive them from a high-level algorithm described in terms of the Hankel matrix of the distribution to be learned, given as an oracle, and then describe how to adapt that algorithm to account for the error introduced by a finite sample.Peer ReviewedPostprint (author's final draft

Computing periods of rational integrals

A period of a rational integral is the result of integrating, with respect to one or several variables, a rational function over a closed path. This work focuses particularly on periods depending on a parameter: in this case the period under consideration satisfies a linear differential equation, the Picard-Fuchs equation. I give a reduction algorithm that extends the Griffiths-Dwork reduction and apply it to the computation of Picard-Fuchs equations. The resulting algorithm is elementary and has been successfully applied to problems that were previously out of reach.Comment: To appear in Math. comp. Supplementary material at http://pierre.lairez.fr/supp/periods

Existence and instability of steady states for a triangular cross-diffusion system: a computer-assisted proof

In this paper, we present and apply a computer-assisted method to study steady states of a triangular cross-diffusion system. Our approach consist in an a posteriori validation procedure, that is based on using a fxed point argument around a numerically computed solution, in the spirit of the Newton-Kantorovich theorem. It allows us to prove the existence of various non homogeneous steady states for different parameter values. In some situations, we get as many as 13 coexisting steady states. We also apply the a posteriori validation procedure to study the linear stability of the obtained steady states, proving that many of them are in fact unstable

Self-concatenated code design and its application in power-efficient cooperative communications

In this tutorial, we have focused on the design of binary self-concatenated coding schemes with the help of EXtrinsic Information Transfer (EXIT) charts and Union bound analysis. The design methodology of future iteratively decoded self-concatenated aided cooperative communication schemes is presented. In doing so, we will identify the most important milestones in the area of channel coding, concatenated coding schemes and cooperative communication systems till date and suggest future research directions