Search results for "algorithm."
showing 10 items of 4617 documents
Interior Eigenvalue Density of Jordan Matrices with Random Perturbations
2017
International audience; We study the eigenvalue distribution of a large Jordan block subject to a small random Gaussian perturbation. A result by E. B. Davies and M. Hager shows that as the dimension of the matrix gets large, with probability close to 1, most of the eigenvalues are close to a circle.We study the expected eigenvalue density of the perturbed Jordan block in the interior of that circle and give a precise asymptotic description.; Nous étudions la distribution de valeurs propres d’un grand bloc de Jordan soumis à une petite perturbation gaussienne aléatoire. Un résultat de E. B. Davies et M. Hager montre que quand la dimension de la matrice devient grande, alors avec probabilité…
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.
Automatic detection of P, QRS and T patterns in 12 leads ECG signal based on CWT
2016
International audience; In this paper, a new method based on the continuous wavelet transform is described in order to detect the QRS, P and T waves. QRS, P and T waves may be distinguished from noise, baseline drift or irregular heartbeats. The algorithm, described in this paper, has been evaluated using the Computers in Cardiology (CinC) Challenge 2011 database and also applied on the MIT-BIH Arrhythmia database (MITDB). The data from the CinC Challenge 2011 are standard 12 ECG leads recordings with full diagnostic bandwidth compared to the MITDB which only includes two leads for each ECG signal. Firstly, our algorithm is validated using fifty 12 leads ECG samples from the CinC collection…
Méthodes géometriques en mécanique spatiale et aspects numériques
2005
We present in this thesis two research projectson the optimal control of the space vehicles.In the first, we have dealt with the orbit transferproblem. We study the minimum time control of a satellite that we want to reach a geostationary orbit. Our contribution is of two kinds. Geometric, first, since we study the controllability of the system together with the geometry of the transfer (structure of the command) by means of geometric control without state constraint tools (minimum principle). Then we present shootingalgorithm and homotopy method. These approaches allow the numerical resolution of problems with strong or low thrust satellites.The second project concerns to the calculation o…
A simple algorithm for finding short sigma-definite representatives
2010
We describe a new algorithm which for each braid returns a quasi-geodesic sigma-definite word representative, defined as a braid word in which the generator sigma_i with maximal index i appears either only positively or only negatively.
Les tresses : de la topologie à la cryptographie
2009
International audience; Ce texte est une présentation sur les groupes de tresses destinée à un public de non mathématiciens.
Hyperbolic knots and cyclic branched covers
2021
International audience; We collect several results on the determination of hyperbolic knots by means of their cyclic branched covers. We construct examples of knots having two common cyclic branched covers. Finally, we brie y discuss the problem of determination of hyperbolic links
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.
Computation of conjugate times in smooth optimal control: the COTCOT algorithm
2006
Conjugate point type second order optimality conditions for extremals associated to smooth Hamiltonians are evaluated by means of a new algorithm. Two kinds of standard control problems fit in this setting: the so-called regular ones, and the minimum time singular single-input affine systems. Conjugate point theory is recalled in these two cases, and two applications are presented: the minimum time control of the Kepler and Euler equations.
Recherche Tabou Robuste pour l'allocation de fréquences
2014
National audience; 1. Problématique : depuis le démarrage des réseaux cellulaires (2G, 3G, 3.5G), les opérateurs configuraient manuellement la gestion des paramètres réseau. Avec l'apparition des réseaux 4G/LTE, la notion de Self-Organizing Network (SON) a vu le jour. Les SON introduisent des fonctions avancées de paramétrage automatique du réseau en fonction de la demande. Grâce à cette technologie, les opérateurs peuvent désormais améliorer la flexibilité et les performances du réseau en réduisant les coûts d'exploitation. Notre objectif est de proposer des solutions algorithmiques pouvant s'appliquer au SON. 2. Méthodologie : le problème d'allocation de fréquences est NP-difficile car il…