3,553 research outputs found

    Discontinuous Galerkin Methods for Solving Acoustic Problems

    Get PDF
    Parciální diferenciální rovnice hrají důležitou v inženýrských aplikacích. Často je možné tyto rovnice řešit pouze přibližně, tj. numericky. Z toho důvodu vzniklo množství diskretizačních metod pro řešení těchto rovnic. Uvedená nespojitá Galerkinova metoda se zdá jako velmi obecná metoda pro řešení těchto rovnic, především pak pro hyperbolické systémy. Naším cílem je řešit úlohy aeroakustiky, přičemž šíření akustických vln je popsáno pomocí linearizovaných Eulerových rovnic. A jelikož se jedná o hyperbolický systém, byla vybrána právě nespojitá Galerkinova metoda. Mezi nejdůležitější aspekty této metody patří schopnost pracovat s geometricky složitými oblastmi, možnost dosáhnout metody vysokého řádu a dále lokální charakter toho schématu umožnuje efektivní paralelizaci výpočtu. Nejprve uvedeme nespojitou Galerkinovu metodu v obecném pojetí pro jedno- a dvoudimenzionalní úlohy. Algoritmus následně otestujeme pro řešení rovnice advekce, která byla zvolena jako modelový případ hyperbolické rovnice. Metoda nakonec bude testována na řadě verifikačních úloh, které byly formulovány pro testování metod pro výpočetní aeroakustiku, včetně oveření okrajových podmínek, které, stejně jako v případě teorie proudění tekutin, jsou nedílnou součástí výpočetní aeroakustiky.Partial differential equations play an important role in engineering applications. It is often possible to solve these equations only approximately, i.e. numerically. Therefore number of successful discretization techniques has been developed to solve these equations. The presented discontinuous Galerkin method seems to be very general method to solve this type of equations, especially useful for hyperbolic systems. Our aim is to solve aeroacoustic problems, where propagation of acoustic waves is described using linearized Euler equations. This system of equations is indeed hyperbolic and therefore the discontinuous Galerkin method was chosen. The most important aspects of this method is ability to deal with complex geometries, possibility of high-order method and its local character enabling efficient computation parallelization. We first introduce the discontinuous Galerkin method in general for one- and two-dimensional problems. We then test the algorithm to solve advection equation, which was chosen as a model case of hyperbolic equation. The method will be finally tested using number of verification problems, which were formulated to test methods for computational equations, including verification of boundary conditions, which, similarly to computational fluid dynamics, are important part of computational aeroacoustics.

    Tropical Severi Varieties

    Full text link
    We study the tropicalizations of Severi varieties, which we call tropical Severi varieties. In this paper, we give a partial answer to the following question, ``describe the tropical Severi varieties explicitly.'' We obtain a description of tropical Severi varieties in terms of regular subdivisions of polygons. As an intermediate step, we construct explicit parameter spaces of curves. These parameter spaces are much simpler objects than the corresponding Severi variety and they are closely related to flat degenerations of the Severi variety, which in turn describes the tropical Severi variety. As an application, we understand G.Mikhalkin's correspondence theorem for the degrees of Severi varieties in terms of tropical intersection theory. In particular, this provides a proof of the independence of point-configurations in the enumeration of tropical nodal curves.Comment: 25 pages, Final version accepted to Portugal. Mat

    Polynomial systems supported on circuits and dessins d'enfants

    Full text link
    We study polynomial systems whose equations have as common support a set C of n+2 points in Z^n called a circuit. We find a bound on the number of real solutions to such systems which depends on n, the dimension of the affine span of the minimal affinely dependent subset of C, and the "rank modulo 2" of C. We prove that this bound is sharp by drawing so-called dessins d'enfant on the Riemann sphere. We also obtain that the maximal number of solutions with positive coordinates to systems supported on circuits in Z^n is n+1, which is very small comparatively to the bound given by the Khovanskii fewnomial theorem.Comment: 19 pages, 5 figures, Section 3.1 revised, minor changes in other section

    Exponential torsion growth for random 3-manifolds

    No full text
    We show that a random 3-manifold with positive first Betti number admits a tower of cyclic covers with exponential torsion growth
    corecore