Šurov komplement i teorija H-matrica

This thesis studies subclasses of the class of H-matrices and their applications, with emphasis on the investigation of the Schur complement properties. The contributions of the thesis are new nonsingularity results, bounds for the maximum norm of the inverse matrix, closure properties of some matrix classes under taking Schur complements, as well as results on localization and separation of the eigenvalues of the Schur complement based on the entries of the original matrix.Докторска дисертација изучава поткласе класе Х-матрица и њихове примене, првенствено у истраживању својстава Шуровог комплемента. Оригиналан допринос тезе представљају нови услови за регуларност матрица, оцене максимум норме инверзне матрице, резултати о затворености појединих класа матрица на Шуров комплемент, као и резултати о локализацији и сепарацији карактеристичних корена Шуровог комплемента на основу елемената полазне матрице.Doktorska disertacija izučava potklase klase H-matrica i njihove primene, prvenstveno u istraživanju svojstava Šurovog komplementa. Originalan doprinos teze predstavljaju novi uslovi za regularnost matrica, ocene maksimum norme inverzne matrice, rezultati o zatvorenosti pojedinih klasa matrica na Šurov komplement, kao i rezultati o lokalizaciji i separaciji karakterističnih korena Šurovog komplementa na osnovu elemenata polazne matrice

An adaptive finite element method for distributed elliptic optimal control problems with variable energy regularization

We analyze the finite element discretization of distributed elliptic optimal control problems with variable energy regularization, where the usual $L^2(\Omega)$ norm regularization term with a constant regularization parameter $\varrho$ is replaced by a suitable representation of the energy norm in $H^{-1}(\Omega)$ involving a variable, mesh-dependent regularization parameter $\varrho(x)$. It turns out that the error between the computed finite element state $\widetilde{u}_{\varrho h}$ and the desired state $\bar{u}$ (target) is optimal in the $L^2(\Omega)$ norm provided that $\varrho(x)$ behaves like the local mesh size squared. This is especially important when adaptive meshes are used in order to approximate discontinuous target functions. The adaptive scheme can be driven by the computable and localizable error norm $\| \widetilde{u}_{\varrho h} - \bar{u}\|_{L^2(\Omega)}$ between the finite element state $\widetilde{u}_{\varrho h}$ and the target $\bar{u}$. The numerical results not only illustrate our theoretical findings, but also show that the iterative solvers for the discretized reduced optimality system are very efficient and robust

Šurov komplement i teorija H-matrica

This thesis studies subclasses of the class of H-matrices and their applications, with emphasis on the investigation of the Schur complement properties. The contributions of the thesis are new nonsingularity results, bounds for the maximum norm of the inverse matrix, closure properties of some matrix classes under taking Schur complements, as well as results on localization and separation of the eigenvalues of the Schur complement based on the entries of the original matrix.Докторска дисертација изучава поткласе класе Х-матрица и њихове примене, првенствено у истраживању својстава Шуровог комплемента. Оригиналан допринос тезе представљају нови услови за регуларност матрица, оцене максимум норме инверзне матрице, резултати о затворености појединих класа матрица на Шуров комплемент, као и резултати о локализацији и сепарацији карактеристичних корена Шуровог комплемента на основу елемената полазне матрице.Doktorska disertacija izučava potklase klase H-matrica i njihove primene, prvenstveno u istraživanju svojstava Šurovog komplementa. Originalan doprinos teze predstavljaju novi uslovi za regularnost matrica, ocene maksimum norme inverzne matrice, rezultati o zatvorenosti pojedinih klasa matrica na Šurov komplement, kao i rezultati o lokalizaciji i separaciji karakterističnih korena Šurovog komplementa na osnovu elemenata polazne matrice

Coulomb Branch Operators and Mirror Symmetry in Three Dimensions

We develop new techniques for computing exact correlation functions of a class of local operators, including certain monopole operators, in three-dimensional $\mathcal{N} = 4$ abelian gauge theories that have superconformal infrared limits. These operators are position-dependent linear combinations of Coulomb branch operators. They form a one-dimensional topological sector that encodes a deformation quantization of the Coulomb branch chiral ring, and their correlation functions completely fix the ($n\leq 3$)-point functions of all half-BPS Coulomb branch operators. Using these results, we provide new derivations of the conformal dimension of half-BPS monopole operators as well as new and detailed tests of mirror symmetry. Our main approach involves supersymmetric localization on a hemisphere $HS^3$ with half-BPS boundary conditions, where operator insertions within the hemisphere are represented by certain shift operators acting on the $HS^3$ wavefunction. By gluing a pair of such wavefunctions, we obtain correlators on $S^3$ with an arbitrary number of operator insertions. Finally, we show that our results can be recovered by dimensionally reducing the Schur index of 4D $\mathcal{N} = 2$ theories decorated by BPS 't Hooft-Wilson loops.Comment: 92 pages plus appendices, two figures; v2 and v3: typos corrected, references adde

Signal Processing in Large Systems: a New Paradigm

For a long time, detection and parameter estimation methods for signal processing have relied on asymptotic statistics as the number $n$ of observations of a population grows large comparatively to the population size $N$, i.e. $n/N\to \infty$. Modern technological and societal advances now demand the study of sometimes extremely large populations and simultaneously require fast signal processing due to accelerated system dynamics. This results in not-so-large practical ratios $n/N$, sometimes even smaller than one. A disruptive change in classical signal processing methods has therefore been initiated in the past ten years, mostly spurred by the field of large dimensional random matrix theory. The early works in random matrix theory for signal processing applications are however scarce and highly technical. This tutorial provides an accessible methodological introduction to the modern tools of random matrix theory and to the signal processing methods derived from them, with an emphasis on simple illustrative examples

A hybrid FETI-DP method for non-smooth random partial differential equations

A domain decomposition approach exploiting the localization of random parameters in high-dimensional random PDEs is presented. For high efficiency, surrogate models in multi-element representations are computed locally when possible. This makes use of a stochastic Galerkin FETI-DP formulation of the underlying problem with localized representations of involved input random fields. The local parameter space associated to a subdomain is explored by a subdivision into regions where the parametric surrogate accuracy can be trusted and where instead Monte Carlo sampling has to be employed. A heuristic adaptive algorithm carries out a problem-dependent hp refinement in a stochastic multi-element sense, enlarging the trusted surrogate region in local parametric space as far as possible. This results in an efficient global parameter to solution sampling scheme making use of local parametric smoothness exploration in the involved surrogate construction. Adequately structured problems for this scheme occur naturally when uncertainties are defined on sub-domains, e.g. in a multi-physics setting, or when the Karhunen-Loeve expansion of a random field can be localized. The efficiency of this hybrid technique is demonstrated with numerical benchmark problems illustrating the identification of trusted (possibly higher order) surrogate regions and non-trusted sampling regions

Iterative solvers for modeling mantle convection with strongly varying viscosity

Die Dissertation beschreibt Verbesserungen der FEM-Diskretisierung und des Lösers der Stokes-Gleichungen im sphärischen Mantelkonvektionsmodell Terra. Zunächst wurde in einem zweidimensionalen quadratischen Gitter mit jeweils stückweise linearen Ansatzfunktionen für Druck und Geschwindigkeit eine stabilisierte Diskretisierung nach Dohrmann & Bochev (2004) mit Projektionen auf stückweise konstante Druckfunktionen implementiert. Deren spektrale Eigenschaften wurden systematisch untersucht. Die Stabilisierung bewirkt eine Gitterunabhängigkeit des Spektrums des Schurkomplements S. Die Viskositätsunabhängigkeit wird durch Präkonditionierung von S mit einer viskositätsabhängigen Massenmatrix Mη bzw. durch Skalierung mit deren Diagonale erreicht. Damit wurden drei Krylov-Unterraumverfahren hinsichtlich ihrer Robustheit gegenüber Viskositätsvariationen und Lösertoleranzen untersucht: Druckkorrektur- (PC), Minimierte Residuen- (MINRES) und ein konjugiertes Gradientenverfahren (BPCG) mit einem von Bramble and Pasciak (1988) entwickelten Blockpräkonditionierer. PC und BPCG wurden in einer äußeren Schleife mit aus Eigenwertabschätzungen berechneten Abbruchkriterien mehrfach gestartet. In der Rechenzeit unterscheiden sich die Löser um weniger als Faktor 2. Bei starken Viskositätskontrasten ist PC der einfachste und schnellste Löser. In Terra kann die o.g. Stabilisierung ohne Einschränkung auf Gittern mit mindestens 85 Millionen Knoten verwendet werden. Für gröbere Gitter wurde eine adaptive Wichtung entwickelt. Das PC-Verfahren in Terra wurde gemäß der o.g. Ergebnisse optimiert. Die Diagonalskalierung von S mit Mη bewirkt eine Rechenzeitreduktion um Faktor 4 bei starken lateralen Viskositätsvariationen. Bei Verwendung eines optimalen Multigrid-Lösers für den Impulsoperator wäre es Faktor 30. Diese Verbesserungen sind wesentliche Schritte zur Verwendung realitätsnäherer Erdmantelmodelle

Isogeometric Analysis and Iterative Solvers for Shear Bands

Numerical modeling of shear bands present several challenges, primarily due to strain softening, strong nonlinear multiphysics coupling, and steep solution gradients with fine solution features. In general it is not known a priori where a shear band will form or propagate, thus adaptive refinement is sometimes necessary to increase the resolution near the band. In this work we first explore the use of isogeometric analysis for shear band problems by constructing and testing several combinations of NURBS elements for a mixed finite element shear band formulation. Owing to the higher order continuity of the NURBS basis, fine solution features such as shear bands can be resolved accurately and efficiently without adaptive refinement. The results are compared to a mixed element formulation with linear functions for displacement and temperature and Pian–Sumihara shape functions for stress. We find that an element based on high order NURBS functions for displacement, temperature and stress, combined with gauss point sampling of the plastic strain leads to attractive results in terms of rate of convergence, accuracy and cpu time. This element is implemented with a Bbar strain projection method and is shown to be nearly locking free. Second we develop robust parallel preconditioners to GMRES in order to solve the Jacobian systems arising at each time step of the problem efficiently. The main idea is to design Schur complements tailored to the specific block structure of the system and that account for the varying stages of shear bands. We develop multipurpose preconditioners that apply to standard irreducible discretizations as well as our recent work on isogeometric discretizations of shear bands. The proposed preconditioners are tested on benchmark examples and compared to standard state of practice solvers such as GMRES/ILU and LU direct solvers. Nonlinear and linear iterations counts as well as CPU times and computational speedups are reported and it is shown that the proposed preconditioners are robust, efficient and outperform traditional state of the art solvers. Finally, we extend the preconditioners to further take advantage the physics of the problem. That is most of the deformation and plasticity is localized in a narrow band while out of this domain only small deformations and minor plasticity is observed. Hence, a preconditioner that decomposes the domain and concentrate more effort in the shear band domain while reusing information away from the band may lead to a significantly improved computational performance. To this end, we first propose a schur complement strategy which takes advantage of the gauss point history variables conveniently. Then, a general overlapping domain decomposition procedure is performed, partitioning the domain into so called 'shear band subdomain' and a 'healthy subdomain', which is used to precondition the Schur complement system. The shear band subdomain preconditioner is then solved exactly with an LU solver while the healthy subdomain preconditioner is only solved once in the elastic region and reused throughout the simulation. This localization awareness approach is shown to be very efficient and leads to an attractive solver for shear bands