Advanced Model-Order Reduction Techniques for Large Scale Dynamical Systems
Notice bibliographique
Résumé
Model Order Reduction (MOR) has proven to be a powerful and necessary tool for various applications such as circuit simulation.In the context of MOR, there are some unaddressed issues that prevent its efficient application, such as "reduction of multiport networks" and "optimal order estimation" for both linear and nonlinear circuits.This thesis presents the solutions for these obstacles to ensure successful model reduction of large-scale linear and nonlinear systems.This thesis proposes a novel algorithm for creating efficient reduced-order macromodels from multiport linear systems (e.g.massively coupled interconnect structures).The new algorithm addresses the difficulties associated with the reduction of networks with large numbers of input/output terminals, that often result in large and dense reduced-order models.The application of the proposed reduction algorithm leads to reduced-order models that are sparse and block-diagonal in nature.It does not assume any correlation between the responses at ports; and thereby overcomes the accuracy degradation that is normally associated with the existing (Singular Value Decomposition based) terminal reduction techniques.Estimating an optimal order for the reduced linear models is of crucial importance to ensure accurate and efficient transient behavior.Order determination is known to be a challenging task and is often based on heuristics.Guided by geometrical considerations, a novel and efficient algorithm is presented to determine the minimum sufficient order that ensures the First and foremost, I would sincerely like to express my gratitude to my supervisor, Professor Michel Nakhla.Without his guidance, this thesis would have been impossible.I appreciate his insight into numerous aspects of numerical simulation and circuit theory, as well as his enthusiasm, wisdom, care and attention.I have learned from him many aspects of science and life.Working with him was truly an invaluable experience.I am also sincerely grateful to to my co-supervisor, Professor Ram Achar, for his helpful suggestions and guidance, which was crucial in many stages of the research for this thesis.Most of all I wish to thank him for his motivation and encouragements.I would like to thank my current and past fellow colleagues in our Computer-Aided Design group for keeping a spirit of collaboration and mutual respect.They were always readily available for some friendly deliberations that made my graduate life enjoyable.I will always fondly remember their support and friendship.I am thankful towards the
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.
Comment cette classification a été obtenuedéplier
Prédiction machine sur la base complète
Imitation des enseignantsNi prévalence calibrée, ni vérité terrain. Validation humaine à venir. Le volet Gemma est une étiquette directe du modèle pour chaque travail de la base, lue sur la notice réduite au titre. Le volet Codex est un classifieur appris des 10 348 étiquettes directes de Codex et calibré sur les taux pondérés de l'échantillon; les champs sans appui suffisant ne portent aucun appel Codex. Le mode candidate est l'union des deux volets; le consensus est leur intersection. Ces sorties portent le statut machine_predicted_unvalidated et ne sont pas des étiquettes humaines.
Scores du classifieur distillé par catégorie (deux têtes)
| Catégorie | Codex | Gemma |
|---|---|---|
| Métarecherche | 0,000 | 0,001 |
| Méta-épidémiologie (sens strict) | 0,001 | 0,000 |
| Méta-épidémiologie (sens large) | 0,001 | 0,001 |
| Bibliométrie | 0,000 | 0,000 |
| Études des sciences et des technologies | 0,000 | 0,001 |
| Communication savante | 0,001 | 0,001 |
| Science ouverte | 0,000 | 0,001 |
| Intégrité de la recherche | 0,000 | 0,002 |
| Charge utile insuffisante (le modèle a refusé de juger) | 0,003 | 0,001 |
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écouleClassification
machine, non validéePrédiction automatique; un appel candidat d’une seule source (Gemma direct ou Codex distillé), pas un consensus.
Le détail, modèle par modèle et score par score, se trouve en fin de page sous « Comment cette classification a été obtenue ».