20,305 research outputs found

    Uniform L∞L^\infty-bounds for energy-conserving higher-order time integrators for the Gross-Pitaevskii equation with rotation

    Full text link
    In this paper, we consider an energy-conserving continuous Galerkin discretization of the Gross-Pitaevskii equation with a magnetic trapping potential and a stirring potential for angular momentum rotation. The discretization is based on finite elements in space and time and allows for arbitrary polynomial orders. It was first analyzed in [O. Karakashian, C. Makridakis; SIAM J. Numer. Anal. 36(6):1779-1807, 1999] in the absence of potential terms and corresponding a priori error estimates were derived in 2D. In this work we revisit the approach in the generalized setting of the Gross-Pitaevskii equation with rotation and we prove uniform L∞L^\infty-bounds for the corresponding numerical approximations in 2D and 3D without coupling conditions between the spatial mesh size and the time step size. With this result at hand, we are in particular able to extend the previous error estimates to the 3D setting while avoiding artificial CFL conditions

    Harmonic density interpolation methods for high-order evaluation of Laplace layer potentials in 2D and 3D

    Full text link
    We present an effective harmonic density interpolation method for the numerical evaluation of singular and nearly singular Laplace boundary integral operators and layer potentials in two and three spatial dimensions. The method relies on the use of Green's third identity and local Taylor-like interpolations of density functions in terms of harmonic polynomials. The proposed technique effectively regularizes the singularities present in boundary integral operators and layer potentials, and recasts the latter in terms of integrands that are bounded or even more regular, depending on the order of the density interpolation. The resulting boundary integrals can then be easily, accurately, and inexpensively evaluated by means of standard quadrature rules. A variety of numerical examples demonstrate the effectiveness of the technique when used in conjunction with the classical trapezoidal rule (to integrate over smooth curves) in two-dimensions, and with a Chebyshev-type quadrature rule (to integrate over surfaces given as unions of non-overlapping quadrilateral patches) in three-dimensions

    Efficient Explicit Time Stepping of High Order Discontinuous Galerkin Schemes for Waves

    Full text link
    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

    Krylov implicit integration factor discontinuous Galerkin methods on sparse grids for high dimensional reaction-diffusion equations

    Full text link
    Computational costs of numerically solving multidimensional partial differential equations (PDEs) increase significantly when the spatial dimensions of the PDEs are high, due to large number of spatial grid points. For multidimensional reaction-diffusion equations, stiffness of the system provides additional challenges for achieving efficient numerical simulations. In this paper, we propose a class of Krylov implicit integration factor (IIF) discontinuous Galerkin (DG) methods on sparse grids to solve reaction-diffusion equations on high spatial dimensions. The key ingredient of spatial DG discretization is the multiwavelet bases on nested sparse grids, which can significantly reduce the numbers of degrees of freedom. To deal with the stiffness of the DG spatial operator in discretizing reaction-diffusion equations, we apply the efficient IIF time discretization methods, which are a class of exponential integrators. Krylov subspace approximations are used to evaluate the large size matrix exponentials resulting from IIF schemes for solving PDEs on high spatial dimensions. Stability and error analysis for the semi-discrete scheme are performed. Numerical examples of both scalar equations and systems in two and three spatial dimensions are provided to demonstrate the accuracy and efficiency of the methods. The stiffness of the reaction-diffusion equations is resolved well and large time step size computations are obtained

    Benchmark of FEM, Waveguide and FDTD Algorithms for Rigorous Mask Simulation

    Full text link
    An extremely fast time-harmonic finite element solver developed for the transmission analysis of photonic crystals was applied to mask simulation problems. The applicability was proven by examining a set of typical problems and by a benchmarking against two established methods (FDTD and a differential method) and an analytical example. The new finite element approach was up to 100 times faster than the competing approaches for moderate target accuracies, and it was the only method which allowed to reach high target accuracies.Comment: 12 pages, 8 figures (see original publication for images with a better resolution
    • 

    corecore