Finite-element time-domain methods for nonlinear dispersive media
Pourquoi ce travail est dans la base
Une base qui oublie comment elle a trouvé un travail ne peut pas être vérifiée. Voici les voies qui ont admis celui-ci.
Notice bibliographique
Résumé
Today’s telecommunications infrastructure is increasingly reliant upon complex material interactions with the electromagnetic field. For instance, effects such as dispersion, in which a material’s response to an applied field depends on its frequency, and nonlinearity, where the response is a complex function of field strength, form the cornerstones of fields such as nonlinear fibre optics. In consequence, efficient, accurate, and reliable numerical simulation tools capable of modeling these complex interactions are increasingly in demand, as cost effective alternatives to physical experimentation and prototyping.In this thesis, a family of Finite-Element Time-Domain (FETD) based numerical methods for the simulation of electromagnetic problems containing electrically complex material interactions is presented. Making use of both the mixed and vector wave equation formulations, the derived methods are capable of modeling very general combinations of linear dispersion,instantaneous nonlinearity, and dispersive nonlinearity within the nonlinear Maxwell’s Equations, free from any simplifying assumptions about the nature of the field solutions. In contrast to existing methods, these techniques permit increased geometric freedom, improved stability, and are capable of handling arbitrarily high nonlinear and dispersive orders.This thesis also presents several additional tools and methods to increase the effectiveness and versatility of these techniques. For instance, a Perfectly Matched Layer (PML) is derived which is compatible with nonlinear dispersive media, permitting the emulation of infinite domains as well as the truncation of finite systems within the nonlinear FETD method. More specifically, by utilizing the stretched coordinate formulation of the PML, the resulting technique not only saves computational resources, but does so without significantly altering the original underlying algorithms.Furthermore, while the derived techniques permit a much more accurate and general solution to Maxwell’s Equations for complex media, they unfortunately do so with a significant added computational burden. To mitigate this fact, this thesis also presents an analysis and breakdown of the computational overhead and bottlenecks associated with these methods. Building upon this analysis, a scheme is then presented by which these algorithms may be accelerated via parallelism and implemented on Graphics Processing Units (GPUs) to help alleviate some of the burden they pose.Lastly, in each case the FETD, PML, and GPU algorithms proposed in this dissertation are tested via numerical studies to verify their proper functioning, convergence, and accuracy. These include convergence studies as well as the demonstration of several well-known and physically significant nonlinear phenomena, such as spatial solitons, temporal solitons, and supercontinuum generation. Moreover, a parallel GPU implementation of the nonlinear algorithm is benchmarked against an equivalent traditional serial Central Processing Unit (CPU) version, and is shown to perform up to 150 times faster, significantly increasing the applicability and usefulness of these algorithms
Récupéré en direct depuis OpenAlex et désinversé. Les résumés ne sont pas conservés dans cette base de données : les index inversés représentent 8,6 Go des 9,3 Go de texte de la base, et le serveur dispose de 13 Go libres.
Prédiction distillée sur la base complète
Imitation des enseignantsNi prévalence calibrée, ni vérité terrain. Validation humaine à venir. Apprise à partir de 10 348 étiquettes directes de Codex et de 10 348 étiquettes directes de Gemma. Le mode candidate est l'union des têtes enseignantes seuillées; le consensus est leur intersection. Ces sorties portent le statut machine_predicted_unvalidated et ne sont ni des étiquettes humaines ni des étiquettes directes de modèles de pointe.
Scores Codex et Gemma par catégorie
| Catégorie | Codex | Gemma |
|---|---|---|
| Métarecherche | 0,001 | 0,002 |
| Méta-épidémiologie (sens strict) | 0,000 | 0,000 |
| Méta-épidémiologie (sens large) | 0,001 | 0,000 |
| Bibliométrie | 0,000 | 0,001 |
| Études des sciences et des technologies | 0,000 | 0,000 |
| Communication savante | 0,000 | 0,000 |
| Science ouverte | 0,000 | 0,000 |
| Intégrité de la recherche | 0,000 | 0,001 |
| Charge utile insuffisante (le modèle a refusé de juger) | 0,001 | 0,000 |
Scores machine (provisoires)
Les deux têtes enseignantes du modèle étudiant, lues sur ce travail. Un score ordonne la base pour la relecture; il n'affirme jamais une catégorie, et le statut de validation accompagne chaque rangée tel quel.
Scores de référence d'un modèle non mature (critères de maturité non atteints, 7 itérations). Un score ordonne; il n'affirme jamais une catégorie.
score_only:v0-immature-baseline · tel quel depuis la passe de notation : score_only signifie que le nombre peut ordonner les travaux, et qu'aucune étiquette de catégorie n'en découle