10 results on '"eigenvalue separation"'
Search Results
2. Stability analysis of linear time-invariant dynamic systems using the matrix sign function and the Adomian decomposition method
- Author
-
Fatoorehchi, Hooman and Djilali, Salih
- Published
- 2023
- Full Text
- View/download PDF
3. Assessment of numerical methods for the evaluation of higher-order harmonics in diffusion theory.
- Author
-
Abrate, Nicolò, Bruna, Giovanni, Dulla, Sandra, and Ravetto, Piero
- Subjects
- *
EVALUATION methodology , *NUCLEAR reactors , *ANALYTICAL solutions , *DIFFUSION - Abstract
Highlights • Methods for the numerical evaluation of higher order modes are assessed. • Simple configurations that allow for an analytical solution are analysed. • Iteration processes of filtered power, of sub-space iteration and of implicitly restarted Arnoldi methods are compared. • The methods are then applied to two benchmarks, C5G7 and UAM. • The analysis of the results shows better computational performances of IRA as compared to SSI. Abstract The knowledge of higher-order harmonics beyond the fundamental mode is important and useful in the prediction of the spatial behaviour of nuclear reactors. Previous works have evidenced that the information on higher-order modes is of great relevance in the interpretation, by means of perturbation techniques (Gandini, 1978), of flux tilts in large cores. In order to assess the performance of the methods that are available to evaluate such modes in nuclear systems, simple configurations that allow for an analytical solution are analysed, and the iteration processes of filtered power, of sub-space iteration and of implicitly restarted Arnoldi methods are compared and discussed. The drawbacks of the filtered power method are highlighted. The implicitly restarted Arnoldi and the sub-space iteration methods are then applied to two benchmarks, the C5G7 and the more realistic UAM configurations, in order to draw some practical indications on their performances. The analysis of the results for all the different configurations considered allow highlighting the better computational performance of the implicitly restarted Arnoldi method as compared to the sub-space iteration method. [ABSTRACT FROM AUTHOR]
- Published
- 2019
- Full Text
- View/download PDF
4. Model reduction in vehicle dynamic systems.
- Author
-
Singh, R., Singh, M., and Bera, T. K.
- Abstract
A mathematical model describing the dynamic characteristics of the vehicle needs to be solved for predicting the future position and orientation of vehicle relative to the changing environment. By reducing the time consumed to solve the complex model, the cycle time for the overall process can be decreased. The work done in this paper, attempts to reduce the computational time by mathematically finding the redundant elements, which do not add to the major dynamics of the system but increase the calculation time by increasing the system complexity. Here, in this paper, eigenvalue separation and eigenvalue sensitivity methods have been applied to the different bond graph models of bicycle vehicle with suspension system, antilock braking system, steering system and four wheel vehicle models. The reduced system behaviour is similar to the response from the actual bond graph model. This method is applicable to linear systems as well as for the non-linear systems after certain modifications. [ABSTRACT FROM PUBLISHER]
- Published
- 2017
- Full Text
- View/download PDF
5. AN ALGORITHM TO COMPUTE Sepλ.
- Author
-
Ming Gu and Overton, Michael L.
- Subjects
- *
SQUARE , *QUADRILATERALS , *EIGENVALUES , *MATRICES (Mathematics) , *ALGORITHMS , *PERTURBATION theory - Abstract
The following problem is addressed: given square matrices A and B, compute the smallest ∊ such that A + E and B + F have a common eigenvalue for some E, F with max(∥E∥2, ∥F∥2) ⩽ ∊. An algorithm to compute this quantity to any prescribed accuracy is presented, assuming that eigenvalues can be computed exactly. [ABSTRACT FROM AUTHOR]
- Published
- 2006
- Full Text
- View/download PDF
6. Eigenvalue separation and eigenmode analysis by matrix-filling Monte Carlo methods.
- Author
-
Vitali, Vito, Chevallier, Florent, Jinaphanh, Alexis, Blaise, Patrick, and Zoia, Andrea
- Subjects
- *
EIGENVALUES , *BOLTZMANN'S equation , *RESEARCH reactors , *EIGENFUNCTIONS , *MATHEMATICAL decoupling - Abstract
• We investigate some aspects of the k and α eigenvalues and eigenfunctions. • We use matrix-filling Monte Carlo methods. • We apply these methods to the EPILOGUE experimental campaign in the EOLE facility. Matrix-filling Monte Carlo methods can be successfully used to estimate higher-order k - and α -eigenmodes and eigenvalues of the Boltzmann equation. A novel matrix-filling Monte Carlo approach has been recently developed in T ripoli -4® in order to solve the α -eigenvalue problem, as a complement to the standard fission matrix method. The behavior of the fundamental and higher-order eigenpairs in the presence of decoupling factors is illustrated through a few relevant homogeneous and heterogeneous numerical benchmarks, with special emphasis on eigenvalue separation. We then revisit a selected experiment carried out during the EPILOGUE program in the EOLE critical facility of CEA Cadarache. Using spectral analysis by Monte Carlo as a 'numerical experiment' might help, e.g., in conceiving a future campaign in a zero-power research reactor. [ABSTRACT FROM AUTHOR]
- Published
- 2021
- Full Text
- View/download PDF
7. Extremal hypergraph theory and algorithmic regularity lemma for sparse graphs
- Author
-
Hàn, Hiêp, Kang, Mihyun, Taraz, Anuschirawan, and Lefmann, Hanno
- Subjects
Hamiltonkreise ,Hypergraphen ,perfekte Matchings ,Diskrepanz ,Quasizufälligkeit ,004 Informatik ,perfect matchings ,algorithmisches Regularitätslemma ,Eigenwertseparation ,hypergraphs ,eigenvalue separation ,28 Informatik, Datenverarbeitung ,discrepancy ,ddc:004 ,quasi-randomness ,Hamilton cycles ,algorithmic regularity lemma - Abstract
Einst als Hilfssatz für Szemerédis Theorem entwickelt, hat sich das Regularitätslemma in den vergangenen drei Jahrzehnten als eines der wichtigsten Werkzeuge der Graphentheorie etabliert. Im Wesentlichen hat das Lemma zum Inhalt, dass dichte Graphen durch eine konstante Anzahl quasizufälliger, bipartiter Graphen approximiert werden können, wodurch zwischen deterministischen und zufälligen Graphen eine Brücke geschlagen wird. Da letztere viel einfacher zu handhaben sind, stellt diese Verbindung oftmals eine wertvolle Zusatzinformation dar. Vom Regularitätslemma ausgehend gliedert sich die vorliegende Arbeit in zwei Teile. Mit Fragestellungen der Extremalen Hypergraphentheorie beschäftigt sich der erste Teil der Arbeit. Es wird zunächst eine Version des Regularitätslemmas Hypergraphen angewandt, um asymptotisch scharfe Schranken für das Auftreten von Hamiltonkreisen in uniformen Hypergraphen mit hohem Minimalgrad herzuleiten. Nachgewiesen werden des Weiteren asymptotisch scharfe Schranken für die Existenz von perfekten und nahezu perfekten Matchings in uniformen Hypergraphen mit hohem Minimalgrad. Im zweiten Teil der Arbeit wird ein neuer, Szemerédis ursprüngliches Konzept generalisierender Regularitätsbegriff eingeführt. Diesbezüglich wird ein Algorithmus vorgestellt, welcher zu einem gegebenen Graphen ohne zu dichte induzierte Subgraphen eine reguläre Partition in polynomieller Zeit berechnet. Als eine Anwendung dieses Resultats wird gezeigt, dass das Problem MAX-CUT für die oben genannte Graphenklasse in polynomieller Zeit bis auf einen multiplikativen Faktor von (1+o(1)) approximierbar ist. Der Untersuchung von Chung, Graham und Wilson zu quasizufälligen Graphen folgend wird ferner der sich aus dem neuen Regularitätskonzept ergebende Begriff der Quasizufälligkeit studiert und in Hinsicht darauf eine Charakterisierung mittels Eigenwertseparation der normalisierten Laplaceschen Matrix angegeben. Once invented as an auxiliary lemma for Szemerédi''s Theorem the regularity lemma has become one of the most powerful tools in graph theory in the last three decades which has been widely applied in several fields of mathematics and theoretical computer science. Roughly speaking the lemma asserts that dense graphs can be approximated by a constant number of bipartite quasi-random graphs, thus, it narrows the gap between deterministic and random graphs. Since the latter are much easier to handle this information is often very useful. With the regularity lemma as the starting point two roads diverge in this thesis aiming at applications of the concept of regularity on the one hand and clarification of several aspects of this concept on the other. In the first part we deal with questions from extremal hypergraph theory and foremost we will use a generalised version of Szemerédi''s regularity lemma for uniform hypergraphs to prove asymptotically sharp bounds on the minimum degree which ensure the existence of Hamilton cycles in uniform hypergraphs. Moreover, we derive (asymptotically sharp) bounds on minimum degrees of uniform hypergraphs which guarantee the appearance of perfect and nearly perfect matchings. In the second part a novel notion of regularity will be introduced which generalises Szemerédi''s original concept. Concerning this new concept we provide a polynomial time algorithm which computes a regular partition for given graphs without too dense induced subgraphs. As an application we show that for the above mentioned class of graphs the problem MAX-CUT can be approximated within a multiplicative factor of (1+o(1)) in polynomial time. Furthermore, pursuing the line of research of Chung, Graham and Wilson on quasi-random graphs we study the notion of quasi-randomness resulting from the new notion of regularity and concerning this we provide a characterisation in terms of eigenvalue separation of the normalised Laplacian matrix.
- Published
- 2011
8. Extremal hypergraph theory and algorithmic regularity lemma for sparse graphs
- Author
-
Kang, Mihyun, Taraz, Anuschirawan, Lefmann, Hanno, Hàn, Hiêp, Kang, Mihyun, Taraz, Anuschirawan, Lefmann, Hanno, and Hàn, Hiêp
- Abstract
Einst als Hilfssatz für Szemerédis Theorem entwickelt, hat sich das Regularitätslemma in den vergangenen drei Jahrzehnten als eines der wichtigsten Werkzeuge der Graphentheorie etabliert. Im Wesentlichen hat das Lemma zum Inhalt, dass dichte Graphen durch eine konstante Anzahl quasizufälliger, bipartiter Graphen approximiert werden können, wodurch zwischen deterministischen und zufälligen Graphen eine Brücke geschlagen wird. Da letztere viel einfacher zu handhaben sind, stellt diese Verbindung oftmals eine wertvolle Zusatzinformation dar. Vom Regularitätslemma ausgehend gliedert sich die vorliegende Arbeit in zwei Teile. Mit Fragestellungen der Extremalen Hypergraphentheorie beschäftigt sich der erste Teil der Arbeit. Es wird zunächst eine Version des Regularitätslemmas Hypergraphen angewandt, um asymptotisch scharfe Schranken für das Auftreten von Hamiltonkreisen in uniformen Hypergraphen mit hohem Minimalgrad herzuleiten. Nachgewiesen werden des Weiteren asymptotisch scharfe Schranken für die Existenz von perfekten und nahezu perfekten Matchings in uniformen Hypergraphen mit hohem Minimalgrad. Im zweiten Teil der Arbeit wird ein neuer, Szemerédis ursprüngliches Konzept generalisierender Regularitätsbegriff eingeführt. Diesbezüglich wird ein Algorithmus vorgestellt, welcher zu einem gegebenen Graphen ohne zu dichte induzierte Subgraphen eine reguläre Partition in polynomieller Zeit berechnet. Als eine Anwendung dieses Resultats wird gezeigt, dass das Problem MAX-CUT für die oben genannte Graphenklasse in polynomieller Zeit bis auf einen multiplikativen Faktor von (1+o(1)) approximierbar ist. Der Untersuchung von Chung, Graham und Wilson zu quasizufälligen Graphen folgend wird ferner der sich aus dem neuen Regularitätskonzept ergebende Begriff der Quasizufälligkeit studiert und in Hinsicht darauf eine Charakterisierung mittels Eigenwertseparation der normalisierten Laplaceschen Matrix angegeben., Once invented as an auxiliary lemma for Szemerédi''s Theorem the regularity lemma has become one of the most powerful tools in graph theory in the last three decades which has been widely applied in several fields of mathematics and theoretical computer science. Roughly speaking the lemma asserts that dense graphs can be approximated by a constant number of bipartite quasi-random graphs, thus, it narrows the gap between deterministic and random graphs. Since the latter are much easier to handle this information is often very useful. With the regularity lemma as the starting point two roads diverge in this thesis aiming at applications of the concept of regularity on the one hand and clarification of several aspects of this concept on the other. In the first part we deal with questions from extremal hypergraph theory and foremost we will use a generalised version of Szemerédi''s regularity lemma for uniform hypergraphs to prove asymptotically sharp bounds on the minimum degree which ensure the existence of Hamilton cycles in uniform hypergraphs. Moreover, we derive (asymptotically sharp) bounds on minimum degrees of uniform hypergraphs which guarantee the appearance of perfect and nearly perfect matchings. In the second part a novel notion of regularity will be introduced which generalises Szemerédi''s original concept. Concerning this new concept we provide a polynomial time algorithm which computes a regular partition for given graphs without too dense induced subgraphs. As an application we show that for the above mentioned class of graphs the problem MAX-CUT can be approximated within a multiplicative factor of (1+o(1)) in polynomial time. Furthermore, pursuing the line of research of Chung, Graham and Wilson on quasi-random graphs we study the notion of quasi-randomness resulting from the new notion of regularity and concerning this we provide a characterisation in terms of eigenvalue separation of the normalised Laplacian matrix.
- Published
- 2011
9. Absolute and relative perturbation bounds for invariant subspaces of matrices
- Author
-
Ilse C. F. Ipsen
- Subjects
Numerical Analysis ,Pure mathematics ,Algebra and Number Theory ,010102 general mathematics ,Mathematical analysis ,Invariant subspace ,Matrix norm ,Perturbation (astronomy) ,Absolute error ,010103 numerical & computational mathematics ,01 natural sciences ,Linear subspace ,Square matrix ,Matrix (mathematics) ,Eigenvalue separation ,Angle between subspaces ,Discrete Mathematics and Combinatorics ,Geometry and Topology ,0101 mathematics ,Invariant (mathematics) ,Relative error ,Subspace topology ,Mathematics - Abstract
Absolute and relative perturbation bounds are derived for angles between invariant subspaces of complex square matrices, in the two-norm and in the Frobenius norm. The absolute bounds can be considered extensions of Davis and Kahan's sinθ theorem to general matrices and invariant subspaces of any dimension. The relative bounds are the most general relative bounds for invariant subspaces because they place no restrictions on the matrix or the perturbation. When the perturbed subspace has dimension one, the relative bound is implied by the absolute bound.
- Full Text
- View/download PDF
10. Conception de configurations innovantes en maquette critique pour la modélisation des phénomènes de couplages / découplages : Application aux transitoires cinétiques
- Author
-
Kornilios Routsonis, CEA Cadarache, Commissariat à l'énergie atomique et aux énergies alternatives (CEA), Université Grenoble Alpes [2020-....], Patrick Blaise, Jean Tommasi, and STAR, ABES
- Subjects
SVP ,Coupling ,Eigenvalue separation ,Couplage ,Multipoint Kinetics ,Kinetics transients ,Transient Fission Matrix ,[SPI.GCIV.GCN] Engineering Sciences [physics]/Civil Engineering/Génie civil nucléaire ,Dominance ratio ,Valeurs propres ,[SPI.GCIV.GCN]Engineering Sciences [physics]/Civil Engineering/Génie civil nucléaire - Abstract
The study of space-time neutronic behavior of a nuclear reactor is the subject of both computational and experimental fields. Future and existing experimental facilities are called to answer questions on issues such as core stability and response to perturbations, that are commonly seen in large power reactors and are related to spatial decoupling. Calculations with accurate neutron kinetics models are required to characterize such decoupling effects in nuclear systems, both at small and large scales. The end goal of this work is to propose an innovative approach to analyze and reproduce such spatial effects in smaller ZPR (Zero Power Reactor) configurations. This is achieved by using the dominance ratio or eigenvalue separation as design criteria and connecting them to the characteristics of the system.The methodology followed here relies on two main approaches. A hybrid stochastic – deterministic method based on the Transient Fission Matrix (TFM) model, implemented in the Serpent 2 Monte Carlo code and a deterministic calculation scheme based on Kobayashi’s multipoint kinetics model, running on the ERANOS 2.4 system of codes. The two approaches complement each other well, each covering the other’s limitations and enable the evaluation of both complex geometries and the design of decoupled high dominance ratio configurations. At their core, both methods track the neutron population across the system and relate it to its kinetic behavior. This allows one to access higher source distribution modes related to the flux harmonics, whose study is key to understanding nuclear reactor spatial effects.The TFM model, permitting one-dimensional analysis with a fine nodal mesh, is an ideal tool for determining the dominance ratio and getting a detailed look at how prompt and delayed neutrons propagate in a geometry. On the other hand, the deterministic calculation scheme based on Kobayashi’s model allows for a lower calculation time and memory requirements, while enabling the study of three-dimensional coupling effects at the cost of a reduced number of nodes.A fast/thermal coupled core ZPR concept, developed at CEA Cadarache in the context of the ZEPHYR versatile facility, unfortunately frozen at the moment, is analyzed using the above methodology. This complicated geometry offers a good way to both test the validity of the models and gain an understanding of the associated coupling effects. Additionally, a simple coupled fuel assemblies benchmark problem was developed, for testing coupled core systems calculations, models, and methodologies. The system’s kinetic behavior is analyzed in response to geometry and material changes. The distance between the assemblies is changed, fuels of different reactivities are used, control rods are introduced to parts of the system and finally, different levels of boron dilution in the moderator are tested. This study enables us to better understand how the coupling is affected by various parameters and it deals with commonly encountered scenarios, in both experimental programs and power reactor operation.Finally, the developed methodology is applied towards producing high dominance ratio configurations in the VENUS-F zero power reactor of the SCK-CEN, in support of a larger experimental campaign between CEA and SCK-CEN, part of which is focused around developing a better understanding of space-time kinetics effects. This is done through a progressive optimization process that aims to gradually redesign the VENUS-F core, while keeping certain considerations in mind., Le comportement neutronique d’un réacteur nucléaire en transitoire est étudié à la fois de façon théorique et expérimentale. Les installations de type « maquettes critiques » existantes ainsi que les futures installations sont sollicitées afin de répondre aux questions concernant des problématiques telles que la stabilité de la nappe de puissance ou les diverses réponses aux perturbations, souvent observées dans des grands cœurs, et liées au découplage spatial. Afin de pouvoir caractériser de tels découplages au sein de systèmes nucléaires, il est nécessaire de se baser sur des modèles de cinétique spatiale à la fois en grande et petite échelle. L’objectif des études menées dans le cadre de cette thèse est de proposer une approche innovante d’analyse et de reproduction de tels effets spatiaux au sein de plus petites configurations (maquettes critiques). L’approche proposée est basée sur l’utilisation du facteur de séparation des valeurs propres (SVP) dans la conception des configurations expérimentales.La méthodologie suivie dans cette étude s’appuie sur deux approches principales: une méthode hybride stochastique / déterministe basée sur le modèle Transient Fission Matrix (TFM), implémentée dans le code Serpent 2 et un schéma de calcul déterministe basé sur le modèle cinétique multipoint de Kobayashi, implémenté dans le système de codes ERANOS 2,4. Ces deux approches sont complémentaires, chacune remédiant aux limitations de l’autre, permettant l’analyse de géométries complexes et de la conception de configurations à haute SVP. Essentiellement, les deux méthodes suivent les neutrons à travers le système nucléaire et les relient au paramètres cinétiques. Ceci permet d’accéder à des modes de distribution de sources relatives aux harmoniques du flux, essentielles à la compréhension des effets spatiaux nucléaires.Le modèle TFM, permettant une analyse unidimensionnelle détaillée, est l’outil idéal pour déterminer la SVP et ainsi permettre de visualiser en détail la propagation des neutrons prompts et des neutrons retardés au sein d’une géométrie. Au delà, le schéma déterministe basé sur le modèle de Kobayashi permet de réduire les temps de calcul et les besoins en mémoire, tout en rendant possible l’étude des effets de couplage tridimensionnels, mais au détriment du nombre de zones traitées.La méthodologie d’approche combinée est utilisée pour l’analyse d’un concept de maquette critique à cœur rapide / thermique développé au sein du programme ZEPHYR au CEA Cadarache, actuellement à l’arrêt. Cette géométrie complexe constitue un excellent test de la validité des modèles ainsi qu’un outil pour la compréhension des effets de couplage associés. De plus, un benchmark d’assemblages REP couplés a été développé, afin de permettre de tester des calculs sur les systèmes couplés, les modèles et méthodologies associées. Le comportement cinétique du système est analysé en réponse à des changements géométriques et matériels. La distance entre les assemblages est modifiée, des combustibles de compositions différentes sont employés, les barres de contrôle sont introduites dans certaines parties du système et, enfin, plusieurs niveaux de dilution de bore dans le modérateur sont examinés. Cette étude permet de mieux comprendre comment le couplage est affecté par divers paramètres et explore divers cas de figure courants, à la fois au sein de programmes expérimentaux et du fonctionnement des réacteurs de puissance.Pour finir, la méthodologie est appliquée à la conception préliminaire de configurations à haute SVP au sein de la maquette critique VENUS-F du SCK-CEN, en soutien à une potentielle campagne expérimentale commune entre le CEA et le SCK-CEN, centrée en partie autour d’une meilleure compréhension des effets de cinétique spatiale des cœurs. Ceci est réalisé à l’aide d’un processus d'optimisation progressive permettant de redesigner le cœur de VENUS-F.
Catalog
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.