In this paper, we consider numerical methods for two-sided space variable-order fractional diffusion equations (VOFDEs) with a nonlinear source term. The implicit Euler (IE) method and a shifted Grünwald (SG) scheme are used to approximate the temporal derivative and the space variable-order (VO) fractional derivatives, respectively, which leads to an IE-SG scheme. Since the order of the VO derivatives depends on the space and the time variables, the corresponding coefficient matrices arising from the discretization of VOFDEs are dense and without the Toeplitz-like structure. In light of the off-diagonal decay property of the coefficient matrices, we consider applying the preconditioned generalized minimum residual methods with banded preconditioners to solve the discretization systems. The eigenvalue distribution and the condition number of the preconditioned matrices are studied. Numerical results show that the proposed banded preconditioners are efficient.

Recent advances have been made in a wide range of imaging and pattern recognition applications, including picture categorization and object identification systems. These systems necessitate a robust feature extraction method. This study proposes a new class of orthogonal functions known as orthogonal mountain functions (OMFs). Using these functions, a novel set of orthogonal moments and associated scaling, rotation, and translation (SRT) invariants are presented for building a color image’s feature vector components. These orthogonal moments are presented as quaternion orthogonal mountain Fourier moments (QOMFMs). To demonstrate the validity of our theoretically recommended technique, we conduct a number of image analysis and pattern recognition experiments, including a comparison of the performance of the feature vectors proposed above to preexisting orthogonal invariant moments. The result of this study experimentally proves the effectiveness and quality of our QOMFMs.

We consider the inverse problem of finding guiding pattern shapes that result in desired self-assembly morphologies of block copolymer melts. Specifically, we model polymer self-assembly using the self-consistent field theory and derive, in a non-parametric setting, the sensitivity of the dissimilarity between the desired and the actual morphologies to arbitrary perturbations in the guiding pattern shape. The sensitivity is then used for the optimization of the confining pattern shapes such that the dissimilarity between the desired and the actual morphologies is minimized. The efficiency and robustness of the proposed gradient-based algorithm are demonstrated in a number of examples related to templating vertical interconnect accesses (VIA).

In this paper, we develop new high-order numerical methods for hyperbolic systems of nonlinear partial differential equations (PDEs) with uncertainties. The new approach is realized in the semi-discrete finite-volume framework and is based on fifth-order weighted essentially non-oscillatory (WENO) interpolations in (multidimensional) random space combined with second-order piecewise linear reconstruction in physical space. Compared with spectral approximations in the random space, the presented methods are essentially non-oscillatory as they do not suffer from the Gibbs phenomenon while still achieving high-order accuracy. The new methods are tested on a number of numerical examples for both the Euler equations of gas dynamics and the Saint-Venant system of shallow-water equations. In the latter case, the methods are also proven to be well-balanced and positivity-preserving.

Machine learning has been widely used for solving partial differential equations (PDEs) in recent years, among which the random feature method (RFM) exhibits spectral accuracy and can compete with traditional solvers in terms of both accuracy and efficiency. Potentially, the optimization problem in the RFM is more difficult to solve than those that arise in traditional methods. Unlike the broader machine-learning research, which frequently targets tasks within the low-precision regime, our study focuses on the high-precision regime crucial for solving PDEs. In this work, we study this problem from the following aspects: (i) we analyze the coefficient matrix that arises in the RFM by studying the distribution of singular values; (ii) we investigate whether the continuous training causes the overfitting issue; (iii) we test direct and iterative methods as well as randomized methods for solving the optimization problem. Based on these results, we find that direct methods are superior to other methods if memory is not an issue, while iterative methods typically have low accuracy and can be improved by preconditioning to some extent.

Two of the main challenges in optimal control are solving problems with state-dependent running costs and developing efficient numerical solvers that are computationally tractable in high dimensions. In this paper, we provide analytical solutions to certain optimal control problems whose running cost depends on the state variable and with constraints on the control. We also provide Lax-Oleinik-type representation formulas for the corresponding Hamilton-Jacobi partial differential equations with state-dependent Hamiltonians. Additionally, we present an efficient, grid-free numerical solver based on our representation formulas, which is shown to scale linearly with the state dimension, and thus, to overcome the curse of dimensionality. Using existing optimization methods and the min-plus technique, we extend our numerical solvers to address more general classes of convex and nonconvex initial costs. We demonstrate the capabilities of our numerical solvers using implementations on a central processing unit (CPU) and a field-programmable gate array (FPGA). In several cases, our FPGA implementation obtains over a 10 times speedup compared to the CPU, which demonstrates the promising performance boosts FPGAs can achieve. Our numerical results show that our solvers have the potential to serve as a building block for solving broader classes of high-dimensional optimal control problems in real-time.

In this paper, we develop an entropy-conservative discontinuous Galerkin (DG) method for the shallow water (SW) equation with random inputs. One of the most popular methods for uncertainty quantification is the generalized Polynomial Chaos (gPC) approach which we consider in the following manuscript. We apply the stochastic Galerkin (SG) method to the stochastic SW equations. Using the SG approach in the stochastic hyperbolic SW system yields a purely deterministic system that is not necessarily hyperbolic anymore. The lack of the hyperbolicity leads to ill-posedness and stability issues in numerical simulations. By transforming the system using Roe variables, the hyperbolicity can be ensured and an entropy-entropy flux pair is known from a recent investigation by Gerster and Herty (Commun. Comput. Phys. 27(3): 639–671, 2020). We use this pair and determine a corresponding entropy flux potential. Then, we construct entropy conservative numerical two-point fluxes for this augmented system. By applying these new numerical fluxes in a nodal DG spectral element method (DGSEM) with flux differencing ansatz, we obtain a provable entropy conservative (dissipative) scheme. In numerical experiments, we validate our theoretical findings.

This paper presents a mass and momentum conservative semi-implicit finite volume (FV) scheme for complex non-hydrostatic free surface flows, interacting with moving solid obstacles. A simplified incompressible Baer-Nunziato type model is considered for two-phase flows containing a liquid phase, a solid phase, and the surrounding void. According to the so-called diffuse interface approach, the different phases and consequently the void are described by means of a scalar volume fraction function for each phase. In our numerical scheme, the dynamics of the liquid phase and the motion of the solid are decoupled. The solid is assumed to be a moving rigid body, whose motion is prescribed. Only after the advection of the solid volume fraction, the dynamics of the liquid phase is considered. As usual in semi-implicit schemes, we employ staggered Cartesian control volumes and treat the nonlinear convective terms explicitly, while the pressure terms are treated implicitly. The non-conservative products arising in the transport equation for the solid volume fraction are treated by a path-conservative approach. The resulting semi-implicit FV discretization of the mass and momentum equations leads to a mildly nonlinear system for the pressure which can be efficiently solved with a nested Newton-type technique. The time step size is only limited by the velocities of the two phases contained in the domain, and not by the gravity wave speed nor by the stiff algebraic relaxation source term, which requires an implicit discretization. The resulting semi-implicit algorithm is first validated on a set of classical incompressible Navier-Stokes test problems and later also adds a fixed and moving solid phase.

We present a high-order Galerkin method in both space and time for the 1D unsteady linear advection-diffusion equation. Three Interior Penalty Discontinuous Galerkin (IPDG) schemes are detailed for the space discretization, while the time integration is performed at the same order of accuracy thanks to an Arbitrary high order DERivatives (ADER) method. The orders of convergence of the three ADER-IPDG methods are carefully examined through numerical illustrations, showing that the approach is consistent, accurate, and efficient. The numerical results indicate that the symmetric version of IPDG is typically more accurate and more efficient compared to the other approaches.

Understanding the dynamics of phase boundaries in fluids requires quantitative knowledge about the microscale processes at the interface. We consider the sharp-interface motion of the compressible two-component flow and propose a heterogeneous multiscale method (HMM) to describe the flow fields accurately. The multiscale approach combines a hyperbolic system of balance laws on the continuum scale with molecular-dynamics (MD) simulations on the microscale level. Notably, the multiscale approach is necessary to compute the interface dynamics because there is—at present—no closed continuum-scale model. The basic HMM relies on a moving-mesh finite-volume method and has been introduced recently for the compressible one-component flow with phase transitions by Magiera and Rohde in (J Comput Phys 469: 111551, 2022). To overcome the numerical complexity of the MD microscale model, a deep neural network is employed as an efficient surrogate model. The entire approach is finally applied to simulate droplet dynamics for argon-methane mixtures in several space dimensions. To our knowledge, such compressible two-phase dynamics accounting for microscale phase-change transfer rates have not yet been computed.

Slope limiters play an essential role in maintaining the non-oscillatory behavior of high-resolution methods for nonlinear conservation laws. The family of minmod limiters serves as the prototype example. Here, we revisit the question of non-oscillatory behavior of high-resolution central schemes in terms of the slope limiter proposed by van Albada et al. (Astron Astrophys 108: 76–84, 1982). The van Albada (vA) limiter is smoother near extrema, and consequently, in many cases, it outperforms the results obtained using the standard minmod limiter. In particular, we prove that the vA limiter ensures the one-dimensional Total-Variation Diminishing (TVD) stability and demonstrate that it yields noticeable improvement in computation of one- and two-dimensional systems.