20 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

    HDGlab: An Open-Source Implementation of the Hybridisable Discontinuous Galerkin Method in MATLAB

    Get PDF
    This paper presents HDGlab, an open source MATLAB implementation of the hybridisable discontinuous Galerkin (HDG) method. The main goal is to provide a detailed description of both the HDG method for elliptic problems and its implementation available in HDGlab. Ultimately, this is expected to make this relatively new advanced discretisation method more accessible to the computational engineering community. HDGlab presents some features not available in other implementations of the HDG method that can be found in the free domain. First, it implements high-order polynomial shape functions up to degree nine, with both equally-spaced and Fekete nodal distributions. Second, it supports curved isoparametric simplicial elements in two and three dimensions. Third, it supports non-uniform degree polynomial approximations and it provides a flexible structure to devise degree adaptivity strategies. Finally, an interface with the open-source high-order mesh generator Gmsh is provided to facilitate its application to practical engineering problems

    Predicting nonlinear dynamics of optical solitons in optical fiber via the SCPINN

    Full text link
    The strongly-constrained physics-informed neural network (SCPINN) is proposed by adding the information of compound derivative embedded into the soft-constraint of physics-informed neural network(PINN). It is used to predict nonlinear dynamics and the formation process of bright and dark picosecond optical solitons, and femtosecond soliton molecule in the single-mode fiber, and reveal the variation of physical quantities including the energy, amplitude, spectrum and phase of pulses during the soliton transmission. The adaptive weight is introduced to accelerate the convergence of loss function in this new neural network. Compared with the PINN, the accuracy of SCPINN in predicting soliton dynamics is improved by 5-11 times. Therefore, the SCPINN is a forward-looking method to study the modeling and analysis of soliton dynamics in the fiber

    Operator compression with deep neural networks

    Get PDF

    The Hybrid High-Order Method for Polytopal Meshes: Design, Analysis, and Applications

    Get PDF
    International audienceHybrid High-Order (HHO) methods are new generation numerical methods for models based on Partial Differential Equations with features that set them apart from traditional ones. These include: the support of polytopal meshes including non star-shaped elements and hanging nodes; the possibility to have arbitrary approximation orders in any space dimension; an enhanced compliance with the physics; a reduced computational cost thanks to compact stencil and static condensation. This monograph provides an introduction to the design and analysis of HHO methods for diffusive problems on general meshes, along with a panel of applications to advanced models in computational mechanics. The first part of the monograph lays the foundation of the method considering linear scalar second-order models, including scalar diffusion, possibly heterogeneous and anisotropic, and diffusion-advection-reaction. The second part addresses applications to more complex models from the engineering sciences: non-linear Leray-Lions problems, elasticity and incompressible fluid flows

    Numerical homogenization beyond scale separation

    Get PDF

    Solving forward and inverse Helmholtz equations via controllability methods

    Get PDF
    Waves are useful for probing an unknown medium by illuminating it with a source. To infer the characteristics of the medium from (boundary) measurements, for instance, one typically formulates inverse scattering problems in frequency domain as a PDE-constrained optimization problem. Finding the medium, where the simulated wave field matches the measured (real) wave field, the inverse problem requires the repeated solutions of forward (Helmholtz) problems. Typically, standard numerical methods, e.g. direct solvers or iterative methods, are used to solve the forward problem. However, large-scaled (or high-frequent) scattering problems are known being competitive in computation and storage for standard methods. Moreover, since the optimization problem is severely ill-posed and has a large number of local minima, the inverse problem requires additional regularization akin to minimizing the total variation. Finding a suitable regularization for the inverse problem is critical to tackle the ill-posedness and to reduce the computational cost and storage requirement. In my thesis, we first apply standard methods to forward problems. Then, we consider the controllability method (CM) for solving the forward problem: it instead reformulates the problem in the time domain and seeks the time-harmonic solution of the corresponding wave equation. By iteratively reducing the mismatch between the solution at initial time and after one period with the conjugate gradient (CG) method, the CMCG method greatly speeds up the convergence to the time-harmonic asymptotic limit. Moreover, each conjugate gradient iteration solely relies on standard numerical algorithms, which are inherently parallel and robust against higher frequencies. Based on the original CM, introduced in 1994 by Bristeau et al., for sound-soft scattering problems, we extend the CMCG method to general boundary-value problems governed by the Helmholtz equation. Numerical results not only show the usefulness, robustness, and efficiency of the CMCG method for solving the forward problem, but also demonstrate remarkably accurate solutions. Second, we formulate the PDE-constrained optimization problem governed by the inverse scattering problem to reconstruct the unknown medium. Instead of a grid-based discrete representation combined with standard Tikhonov-type regularization, the unknown medium is projected to a small finite-dimensional subspace, which is iteratively adapted using dynamic thresholding. The adaptive (spectral) space is governed by solving several Poisson-type eigenvalue problems. To tackle the ill-posedness that the Newton-type optimization method converges to a false local minimum, we combine the adaptive spectral inversion (ASI) method with the frequency stepping strategy. Numerical examples illustrate the usefulness of the ASI approach, which not only efficiently and remarkably reduces the dimension of the solution space, but also yields an accurate and robust method

    A C0 Finite Element Method For The Biharmonic Problem In A Polygonal Domain

    Get PDF
    This dissertation studies the biharmonic equation with Dirichlet boundary conditions in a polygonal domain. The biharmonic problem appears in various real-world applications, for example in plate problems, human face recognition, radar imaging, and hydrodynamics problems. There are three classical approaches to discretizing the biharmonic equation in the literature: conforming finite element methods, nonconforming finite element methods, and mixed finite element methods. We propose a mixed finite element method that effectively decouples the fourth-order problem into a system of one steady-state Stokes equation and one Poisson equation. As a generalization to the above-decoupled formulation, we propose another decoupled formulation using a system of two Poison equations and one steady-state Stokes equation. We solve Poisson equations using linear and quadratic Lagrange\u27s elements and the Stokes equation using Hood-Taylor elements and Mini finite elements. It is shown that the solution of each system is equivalent to that of the original fourth-order problem on both convex and non-convex polygonal domains. Two finite element algorithms are, in turn, proposed to solve the decoupled systems. Solving this problem in a non-convex domain is challenging due to the singularity occurring near re-entrant corners. We introduce a weighted Sobolev space and a graded mesh refine Algorithm to attack the singularity near re-entrant corners. We show the regularity results of each decoupled system in both Sobolev space and weighted Sobolev space. We derive the H1H^1 and L2L^2 error estimates for the numerical solutions on quasi-uniform and graded meshes. We present various numerical test results to justify the theoretical findings. Given the availability of fast Poisson solvers and Stokes solvers, our Algorithm is a relatively easy and cost-effective alternative to existing algorithms for solving the biharmonic equation
    corecore