Search results for "convergence"
showing 10 items of 655 documents
On the projected increase of Sahel rainfall during the late rainy season
2016
Thirteen CMIP5 models are used to analyse changes in climate over the West African monsoon region between the near future (2031–2070 under the RCP4.5 emission scenario), and a control period (1960–1999 under the historical emission scenario), with a focus on the late rainy season. The monsoon circulation is projected to strengthen and to shift northward leading to more rainfall during the Sahelian season. The results show an increase of the Rainfall amounts in September–October and a delay in the monsoon withdrawal. The increased moisture that fuels the rainfall anomalies is associated with an increase in moisture flux convergence and with local moisture recycling. The moisture transport do…
Rates of convergence to equilibrium for collisionless kinetic equations in slab geometry
2017
This work deals with free transport equations with partly diffuse stochastic boundary operators in slab geometry. Such equations are governed by stochastic semigroups in $L^{1}$ spaces$.\ $We prove convergence to equilibrium at the rate $O\left( t^{-\frac{k}{2(k+1)+1}}\right) \ (t\rightarrow +\infty )$ for $L^{1}$ initial data $g$ in a suitable subspace of the domain of the generator $T$ where $k\in \mathbb{N}$ depends on the properties of the boundary operators near the tangential velocities to the slab. This result is derived from a quantified version of Ingham's tauberian theorem by showing that $F_{g}(s):=\lim_{\varepsilon \rightarrow 0_{+}}\left( is+\varepsilon -T\right) ^{-1}g$ exists…
A high-resolution layer-wise discontinuous Galerkin formulation for multilayered composite plates
2020
Abstract In this work, a novel high-resolution formulation for multilayered composite plates is presented. The formulations is referred to as high-resolution since it combines (i) Layer-Wise plate theories, which are based on a per-layer, high-order expansion of the primary variables throughout the plate’s thickness, providing a detailed layer-level description of the sought solution; (ii) The discontinuous Galerkin method, a numerical approach based on a discontinuous representation of the unknown fields over the mesh elements and on the introduction of boundary integral operators enforcing inter-element continuity, which allow the natural treatment of high-order mesh elements and provide …
Convergence and applications of vector rational approximations
1992
The Padé approximants and their generalizations are for many years the matter of intense researchs .Yet , many theoritical problems stay in suspense : problems of exitence and unicity , problems of convergence and acceleration of convergence .The purpose of the present work vas to give answers to such questions .In the first section we take an in terest in vector Padé approximants of matrix series .Conditions of existence and unicity ,results of convergence are given ,as also the link with the theory of Lanczos method for the resolution of linear Systems . We utilize also the vector Padé approximants to provide a simultaneous approximation of a function and its derivative .In the second sec…
Polarities and Generalized Extremal Convolutions
2016
International audience;
Spectral approach to D-bar problems
2017
We present the first numerical approach to D-bar problems having spectral convergence for real analytic, rapidly decreasing potentials. The proposed method starts from a formulation of the problem in terms of an integral equation that is numerically solved with Fourier techniques. The singular integrand is regularized analytically. The resulting integral equation is approximated via a discrete system that is solved with Krylov methods. As an example, the D-bar problem for the Davey-Stewartson II equations is considered. The result is used to test direct numerical solutions of the PDE.© 2017 Wiley Periodicals, Inc.
Convergence Rates for Persistence Diagram Estimation in Topological Data Analysis
2014
International audience; Computational topology has recently seen an important development toward data analysis, giving birth to the field of topological data analysis. Topological persistence, or persistent homology, appears as a fundamental tool in this field. In this paper, we study topological persistence in general metric spaces, with a statistical approach. We show that the use of persistent homology can be naturally considered in general statistical frameworks and that persistence diagrams can be used as statistics with interesting convergence properties. Some numerical experiments are performed in various contexts to illustrate our results.
Coplanar control of a satellite around the Earth
2001
We investigate the minimum time transfer of a satellite around the Earth. Using an optimal control model, we study the controllability of the system and propose a geometrical analysis of the optimal command structure. Furthermore, in order to solve the problem numerically, a new parametric technique is introduced for which convergence properties are established.
Regularization of chattering phenomena via bounded variation controls
2018
In control theory, the term chattering is used to refer to strong oscillations of controls, such as an infinite number of switchings over a compact interval of times. In this paper we focus on three typical occurences of chattering: the Fuller phenomenon, referring to situations where an optimal control switches an infinite number of times over a compact set; the Robbins phenomenon, concerning optimal control problems with state constraints, meaning that the optimal trajectory touches the boundary of the constraint set an infinite number of times over a compact time interval; the Zeno phenomenon, referring as well to an infinite number of switchings over a compact set, for hybrid optimal co…
Convergence rate of a relaxed inertial proximal algorithm for convex minimization
2018
International audience; In a Hilbert space setting, the authors recently introduced a general class of relaxed inertial proximal algorithms that aim to solve monotone inclusions. In this paper, we specialize this study in the case of non-smooth convex minimization problems. We obtain convergence rates for values which have similarities with the results based on the Nesterov accelerated gradient method. The joint adjustment of inertia, relaxation and proximal terms plays a central role. In doing so, we highlight inertial proximal algorithms that converge for general monotone inclusions, and which, in the case of convex minimization, give fast convergence rates of values in the worst case.