2,486 research outputs found
Adaptive Mesh Refinement for Coupled Elliptic-Hyperbolic Systems
We present a modification to the Berger and Oliger adaptive mesh refinement
algorithm designed to solve systems of coupled, non-linear, hyperbolic and
elliptic partial differential equations. Such systems typically arise during
constrained evolution of the field equations of general relativity. The novel
aspect of this algorithm is a technique of "extrapolation and delayed solution"
used to deal with the non-local nature of the solution of the elliptic
equations, driven by dynamical sources, within the usual Berger and Oliger
time-stepping framework. We show empirical results demonstrating the
effectiveness of this technique in axisymmetric gravitational collapse
simulations. We also describe several other details of the code, including
truncation error estimation using a self-shadow hierarchy, and the
refinement-boundary interpolation operators that are used to help suppress
spurious high-frequency solution components ("noise").Comment: 31 pages, 15 figures; replaced with published versio
A multiresolution space-time adaptive scheme for the bidomain model in electrocardiology
This work deals with the numerical solution of the monodomain and bidomain
models of electrical activity of myocardial tissue. The bidomain model is a
system consisting of a possibly degenerate parabolic PDE coupled with an
elliptic PDE for the transmembrane and extracellular potentials, respectively.
This system of two scalar PDEs is supplemented by a time-dependent ODE modeling
the evolution of the so-called gating variable. In the simpler sub-case of the
monodomain model, the elliptic PDE reduces to an algebraic equation. Two simple
models for the membrane and ionic currents are considered, the
Mitchell-Schaeffer model and the simpler FitzHugh-Nagumo model. Since typical
solutions of the bidomain and monodomain models exhibit wavefronts with steep
gradients, we propose a finite volume scheme enriched by a fully adaptive
multiresolution method, whose basic purpose is to concentrate computational
effort on zones of strong variation of the solution. Time adaptivity is
achieved by two alternative devices, namely locally varying time stepping and a
Runge-Kutta-Fehlberg-type adaptive time integration. A series of numerical
examples demonstrates thatthese methods are efficient and sufficiently accurate
to simulate the electrical activity in myocardial tissue with affordable
effort. In addition, an optimalthreshold for discarding non-significant
information in the multiresolution representation of the solution is derived,
and the numerical efficiency and accuracy of the method is measured in terms of
CPU time speed-up, memory compression, and errors in different norms.Comment: 25 pages, 41 figure
Block Structured Adaptive Mesh and Time Refinement for Hybrid, Hyperbolic + N-body Systems
We present a new numerical algorithm for the solution of coupled collisional
and collisionless systems, based on the block structured adaptive mesh and time
refinement strategy (AMR). We describe the issues associated with the
discretization of the system equations and the synchronization of the numerical
solution on the hierarchy of grid levels. We implement a code based on a higher
order, conservative and directionally unsplit Godunov's method for
hydrodynamics; a symmetric, time centered modified symplectic scheme for
collisionless component; and a multilevel, multigrid relaxation algorithm for
the elliptic equation coupling the two components. Numerical results that
illustrate the accuracy of the code and the relative merit of various
implemented schemes are also presented.Comment: 40 pages, 10 figures, JPC in press. Extended the code test section,
new convergence tests, several typos corrected. Full resolution version
available at http://www.exp-astro.phys.ethz.ch/miniati/charm.pd
Gravitational Collapse and Fragmentation in Molecular Clouds with Adaptive Mesh Refinement
We describe a powerful methodology for numerical solution of 3-D
self-gravitational hydrodynamics problems with extremely high resolution. Our
method utilizes the technique of local adaptive mesh refinement (AMR),
employing multiple grids at multiple levels of resolution. These grids are
automatically and dynamically added and removed as necessary to maintain
adequate resolution. This technology allows for the solution of problems in a
manner that is both more efficient and more versatile than other fixed and
variable resolution methods. The application of AMR to simulate the collapse
and fragmentation of a molecular cloud, a key step in star formation, is
discussed. Such simulations involve many orders of magnitude of variation in
length scale as fragments form. In this paper we briefly describe the
methodology and present an illustrative application for nonisothermal cloud
collapse. We describe the numerical Jeans condition, a criterion for stability
of self-gravitational hydrodynamics problems. We show the first well-resolved
nonisothermal evolutionary sequence beginning with a perturbed dense molecular
cloud core that leads to the formation of a binary system consisting of
protostellar cores surrounded by distinct protostellar disks. The scale of the
disks, of order 100 AU, is consistent with observations of gaseous disks
surrounding single T-Tauri stars and debris disks surrounding systems such as
Pictoris.Comment: 10 pages, 6 figures (color postscript). To appear in the proceedings
of Numerical Astrophysics 1998, Tokyo, March 10-13, 199
hp-adaptive discontinuous Galerkin solver for elliptic equations in numerical relativity
A considerable amount of attention has been given to discontinuous Galerkin methods for hyperbolic problems in numerical relativity, showing potential advantages of the methods in dealing with hydrodynamical shocks and other discontinuities. This paper investigates discontinuous Galerkin methods for the solution of elliptic problems in numerical relativity. We present a novel hp-adaptive numerical scheme for curvilinear and non-conforming meshes. It uses a multigrid preconditioner with a Chebyshev or Schwarz smoother to create a very scalable discontinuous Galerkin code on generic domains. The code employs compactification to move the outer boundary near spatial infinity. We explore the properties of the code on some test problems, including one mimicking Neutron stars with phase transitions. We also apply it to construct initial data for two or three black holes
Adjoint-Based Error Estimation and Mesh Adaptation for Hybridized Discontinuous Galerkin Methods
We present a robust and efficient target-based mesh adaptation methodology,
building on hybridized discontinuous Galerkin schemes for (nonlinear)
convection-diffusion problems, including the compressible Euler and
Navier-Stokes equations. Hybridization of finite element discretizations has
the main advantage, that the resulting set of algebraic equations has globally
coupled degrees of freedom only on the skeleton of the computational mesh.
Consequently, solving for these degrees of freedom involves the solution of a
potentially much smaller system. This not only reduces storage requirements,
but also allows for a faster solution with iterative solvers. The mesh
adaptation is driven by an error estimate obtained via a discrete adjoint
approach. Furthermore, the computed target functional can be corrected with
this error estimate to obtain an even more accurate value. The aim of this
paper is twofold: Firstly, to show the superiority of adjoint-based mesh
adaptation over uniform and residual-based mesh refinement, and secondly to
investigate the efficiency of the global error estimate
- …