Fonction de Bessel

Résumé

En mathématiques, et plus précisément en analyse, les fonctions de Bessel, appelées aussi quelquefois fonctions cylindriques, découvertes par le mathématicien suisse Daniel Bernoulli, portent le nom du mathématicien allemand Friedrich Wilhelm Bessel. Bessel développa l'analyse de ces fonctions en 1816 dans le cadre de ses études du mouvement des planètes induit par l'interaction gravitationnelle, généralisant les découvertes antérieures de Bernoulli. Ces fonctions sont des solutions canoniques y(x) de l'équation différentielle de Bessel : :x^2 \frac{\mathrm d^2 y}{\mathrm dx^2} + x \frac{\mathrm dy}{\mathrm dx} + (x^2 - \alpha^2)y = 0 pour tout nombre réel ou complexe α. Le plus souvent, α est un entier naturel (alors appelé lordre de la fonction), ou un demi-entier. Il existe deux sortes de fonctions de Bessel :

les fonctions de Bessel de première espèce, Jn, solutions de l'équation différentielle ci-dessus qui sont définies en 0 ;
les fonctions de Bessel de seco

Source officielle

https://fr.wikipedia.org/wiki/Fonction_de_Bessel

À propos de ce résultat

Cette page est générée automatiquement et peut contenir des informations qui ne sont pas correctes, complètes, à jour ou pertinentes par rapport à votre recherche. Il en va de même pour toutes les autres pages de ce site. Veillez à vérifier les informations auprès des sources officielles de l'EPFL.

Publications associées (37)

Publications associées

Chargement

Personnes associées (3)

Personnes associées

Chargement

Unités associées (3)

Unités associées

Chargement

Concepts associés (45)

thumb|Portrait de Joseph Fourier. En mathématiques, plus précisément en analyse, la transformation de Fourier est une extension, pour les fonctions non périodiques, du développement en série de Fou

En mathématiques, la fonction gamma (notée par Γ la lettre grecque majuscule gamma de l'alphabet grec) est une fonction utilisée communément, qui prolonge de la fonction factorielle à l'ensemble des

L'analyse mathématique regroupe sous le terme de fonctions spéciales un ensemble de fonctions analytiques non élémentaires, qui sont apparues au comme solutions d'équations de la physique mathématiq

Afficher plus

Concepts associés

Chargement

Cours associés (146)

Cours associés

Chargement

Séances de cours associées (369)

Afficher plus

Séances de cours associées

Chargement

A central limit theorem for integrals of random waves

Matthew De Courcy-Ireland, Marius Christopher Lemm

We derive a central limit theorem for the mean-square of random waves in the high-frequency limit over shrinking sets. Our proof applies to any compact Riemannian manifold of arbitrary dimension, thanks to the universality of the local Weyl law. The key technical step is an estimate capturing some cancellation in a triple integral of Bessel functions, which we achieve using Gegenbauer's addition formula.

2019

Chargement

To meet strict requirements of the information society technologies, antennas and circuit elements are becoming increasingly complex. Frequently, their electromagnetic (EM) properties cannot be anymore expressed in closed-form analytical expressions mainly because of the multitude of irregular geometries found in actual devices. Therefore, accurate and efficient (in terms of computational time and memory) electromagnetic models coupled with the robust optimization techniques, are needed in order to be able to predict and optimize the behavior of the innovative antennas in complex environments. The contribution of this thesis consists in the development and improvement of accurate electromagnetic modeling and optimization algorithms for an ubiquitous class of antennas, the planar printed antennas. The approach most commonly used to model and analyze this type of structures is the Integral Equation (IE) technique numerically solved using the Method of Moments (MoM). From the computational point of view, the main challenge is to develop techniques for efficient numerical evaluation of spatial-domain Green's functions, which are commonly expressed in terms of the well-known Sommerfeld integrals (SIs), i.e., semi-infinite range integrals with Bessel function kernels. Generally, the analytical solution of the SIs is not available, and their numerical evaluation is notoriously difficult and time-consuming because the integrands are both oscillatory and slowly decaying, and might possess singularities on and/or near the integration path. Due to the key role that SIs play in many EM problems, the development of fast and accurate techniques for their evaluation is of paramount relevance. This problem is studied in detail and several efficient methods are developed. Finally, the applicability of one of these methods, namely the Weighted Averages (WA) technique, is extended to the challenging case appearing in many practical EM problems: the evaluation of semi-infinite integrals involving products of Bessel functions. However, the development of effective analysis codes is only one aspect. At least equally important is the availability of reliable optimization techniques for an adequate design of antennas. For that purpose, the Particle Swarm Optimization (PSO) algorithm is introduced in the context of our analysis codes. Moreover, the innovative hybrid version of the PSO algorithm, called the Tournament Selection PSO, has been proposed with the aim of even further improving convergence performances of the classical PSO algorithm. Detailed theoretical description of this socially inspired evolutionary algorithm is given in the thesis. Finally, the characteristics of both algorithms are compared throughout several EM optimization problems.

EPFL2011

Chargement

3D Face Recognition with Sparse Spherical Representations

Pascal Frossard, Effrosyni Kokiopoulou, Roser Sala Llonch, Ivana Tosic

This paper addresses the problem of 3D face recognition using simultaneous sparse approximations on the sphere. The 3D face point clouds are first aligned with a novel and fully automated registration process. They are then represented as signals on the 2D sphere in order to preserve depth and geometry information. Next, we implement a dimensionality reduction process with simultaneous sparse approximations and subspace projection. It permits to represent each 3D face by only a few spherical functions that are able to capture the salient facial characteristics, and hence to preserve the discriminant facial information. We eventually perform recognition by effective matching in the reduced space, where Linear Discriminant Analysis can be further activated for improved recognition performance. The 3D face recognition algorithm is evaluated on the FRGC v.1.0 data set, where it is shown to outperform classical state-of-the-art solutions that work with depth images.

2010

Chargement

EPFL2011