1,926 research outputs found
Multi-patch discontinuous Galerkin isogeometric analysis for wave propagation: explicit time-stepping and efficient mass matrix inversion
We present a class of spline finite element methods for time-domain wave
propagation which are particularly amenable to explicit time-stepping. The
proposed methods utilize a discontinuous Galerkin discretization to enforce
continuity of the solution field across geometric patches in a multi-patch
setting, which yields a mass matrix with convenient block diagonal structure.
Over each patch, we show how to accurately and efficiently invert mass matrices
in the presence of curved geometries by using a weight-adjusted approximation
of the mass matrix inverse. This approximation restores a tensor product
structure while retaining provable high order accuracy and semi-discrete energy
stability. We also estimate the maximum stable timestep for spline-based finite
elements and show that the use of spline spaces result in less stringent CFL
restrictions than equivalent piecewise continuous or discontinuous finite
element spaces. Finally, we explore the use of optimal knot vectors based on L2
n-widths. We show how the use of optimal knot vectors can improve both
approximation properties and the maximum stable timestep, and present a simple
heuristic method for approximating optimal knot positions. Numerical
experiments confirm the accuracy and stability of the proposed methods
Efficient Explicit Time Stepping of High Order Discontinuous Galerkin Schemes for Waves
This work presents algorithms for the efficient implementation of
discontinuous Galerkin methods with explicit time stepping for acoustic wave
propagation on unstructured meshes of quadrilaterals or hexahedra. A crucial
step towards efficiency is to evaluate operators in a matrix-free way with
sum-factorization kernels. The method allows for general curved geometries and
variable coefficients. Temporal discretization is carried out by low-storage
explicit Runge-Kutta schemes and the arbitrary derivative (ADER) method. For
ADER, we propose a flexible basis change approach that combines cheap face
integrals with cell evaluation using collocated nodes and quadrature points.
Additionally, a degree reduction for the optimized cell evaluation is presented
to decrease the computational cost when evaluating higher order spatial
derivatives as required in ADER time stepping. We analyze and compare the
performance of state-of-the-art Runge-Kutta schemes and ADER time stepping with
the proposed optimizations. ADER involves fewer operations and additionally
reaches higher throughput by higher arithmetic intensities and hence decreases
the required computational time significantly. Comparison of Runge-Kutta and
ADER at their respective CFL stability limit renders ADER especially beneficial
for higher orders when the Butcher barrier implies an overproportional amount
of stages. Moreover, vector updates in explicit Runge--Kutta schemes are shown
to take a substantial amount of the computational time due to their memory
intensity
Deep convolutional neural networks for estimating porous material parameters with ultrasound tomography
We study the feasibility of data based machine learning applied to ultrasound
tomography to estimate water-saturated porous material parameters. In this
work, the data to train the neural networks is simulated by solving wave
propagation in coupled poroviscoelastic-viscoelastic-acoustic media. As the
forward model, we consider a high-order discontinuous Galerkin method while
deep convolutional neural networks are used to solve the parameter estimation
problem. In the numerical experiment, we estimate the material porosity and
tortuosity while the remaining parameters which are of less interest are
successfully marginalized in the neural networks-based inversion. Computational
examples confirms the feasibility and accuracy of this approach
Discontinuous Galerkin approximations in computational mechanics: hybridization, exact geometry and degree adaptivity
Discontinuous Galerkin (DG) discretizations with exact representation of the geometry and local polynomial degree adaptivity are revisited. Hybridization techniques are employed to reduce the computational cost of DG approximations and devise the hybridizable discontinuous Galerkin (HDG) method. Exact geometry described by non-uniform rational B-splines (NURBS) is integrated into HDG using the framework of the NURBS-enhanced finite element method (NEFEM). Moreover, optimal convergence and superconvergence properties of HDG-Voigt formulation in presence of symmetric second-order tensors are exploited to construct inexpensive error indicators and drive degree adaptive procedures. Applications involving the numerical simulation of problems in electrostatics, linear elasticity and incompressible viscous flows are presented. Moreover, this is done for both high-order HDG approximations and the lowest-order framework of face-centered finite volumes (FCFV).Peer ReviewedPostprint (author's final draft
Explicit local time-stepping methods for time-dependent wave propagation
Semi-discrete Galerkin formulations of transient wave equations, either with
conforming or discontinuous Galerkin finite element discretizations, typically
lead to large systems of ordinary differential equations. When explicit time
integration is used, the time-step is constrained by the smallest elements in
the mesh for numerical stability, possibly a high price to pay. To overcome
that overly restrictive stability constraint on the time-step, yet without
resorting to implicit methods, explicit local time-stepping schemes (LTS) are
presented here for transient wave equations either with or without damping. In
the undamped case, leap-frog based LTS methods lead to high-order explicit LTS
schemes, which conserve the energy. In the damped case, when energy is no
longer conserved, Adams-Bashforth based LTS methods also lead to explicit LTS
schemes of arbitrarily high accuracy. When combined with a finite element
discretization in space with an essentially diagonal mass matrix, the resulting
time-marching schemes are fully explicit and thus inherently parallel.
Numerical experiments with continuous and discontinuous Galerkin finite element
discretizations validate the theory and illustrate the usefulness of these
local time-stepping methods.Comment: overview paper, typos added, references updated. arXiv admin note:
substantial text overlap with arXiv:1109.448
- …