The nonlocal cubic Gross-Pitaevskii equation, in comparison to the cubic Gross-Pitaevskii equation, incorporates a nonlocal diffusion operator and can capture a wider range of practical phenomena. However, this nonlocal formulation significantly increases the computational expenses in numerical simulations, necessitating the development of efficient and accurate time integration schemes. This paper

The paper is concerned with efficient time discretization methods based on exponential integrators for scalar hyperbolic conservation laws. The model problem is first discretized in space by the discontinuous Galerkin method, resulting in a system of nonlinear ordinary differential equations. To solve such a system, exponential time differencing of order 2 (ETDRK2) is employed with Jacobian linearization

This paper introduces an efficient high-order numerical method for solving the 1D stationary Schrödinger equation in the highly oscillatory regime. Building upon the ideas from the article (Arnold et al. SIAM J. Numer. Anal. 49, 1436–1460, 2011), we first analytically transform the given equation into a smoother (i.e., less oscillatory) equation. By developing sufficiently accurate quadratures for

The demagnetization field in micromagnetism is given as the gradient of a potential that solves a partial differential equation (PDE) posed in \(\mathbb {R}^d\). In its most general form, this PDE is supplied with continuity condition on the boundary of the magnetic domain, and the equation includes a discontinuity in the gradient of the potential over the boundary. Typical numerical algorithms to

In this paper, we investigate the optimal control problem governed by parabolic PDEs in random cylindrical domains, where the random domains are independent of time. We introduce a random mapping to transform the original problem in the random domain into the stochastic problem in the reference domain. The randomness of the transformed problem is reflected in the random coefficient matrix of the elliptic

We introduce a two-parameter Tikhonov regularization method to approximate an ill-posed problem with an unbounded matrix operator. The existence and uniqueness of regularized solutions to the problem are derived. With an a priori as well as an a posteriori parameter choice strategy, convergence analysis of the regularized solution is presented. As an application, we apply the regularization to a simultaneous

This paper develops fast and efficient algorithms for computing Tucker decomposition with a given multilinear rank. By combining random projection and the power scheme, we propose two efficient randomized versions for the truncated high-order singular value decomposition (T-HOSVD) and the sequentially T-HOSVD (ST-HOSVD), which are two common algorithms for approximating Tucker decomposition. To reduce

This paper deals with efficient numerical methods for computing the action of the matrix generating function of Bernoulli polynomials, say \(q(\tau ,A)\), on a vector when A is a large and sparse matrix. This problem occurs when solving some non-local boundary value problems. Methods based on the Fourier expansion of \(q(\tau ,w)\) have already been addressed in the scientific literature. The contribution

In this paper, we propose a discontinuous plane wave neural network (DPWNN) method with \(hp-\)refinement for approximately solving Helmholtz equation and time-harmonic Maxwell equations. In this method, we define a quadratic functional as in the plane wave least square (PWLS) method with \(h-\)refinement and introduce new discretization sets spanned by element-wise neural network functions with a

Exponential integrators are an efficient alternative to implicit schemes for the time integration of stiff system of differential equations. In this paper, low-rank exponential integrators of orders one and two for stiff differential Riccati equations are proposed and investigated. The error estimates of the proposed schemes are established. The proposed approach allows to overcome the main difficulties

In this paper, we adopt a quasi-boundary-value method to solve the nonlinear space-fractional backward problem with perturbed both final value and variable diffusion coefficient in general dimensional space, which is a severely ill-posed problem. The existence, uniqueness and stability of the solution for the quasi-boundary-value problem are proved. Convergence estimates are presented under an a-priori

We investigate numerical approximations for the stochastic Burgers equation driven by an additive cylindrical fractional Brownian motion with Hurst parameter \(H \in (\frac{1}{2}, 1)\). To discretize the continuous problem in space, a spectral Galerkin method is employed, followed by the presentation of a nonlinear-tamed accelerated exponential Euler method to yield a fully discrete scheme. By showing

This work concerns the construction and characterization of product kernels for multivariate approximation from a finite set of discrete samples. To this end, we consider composing different component kernels, each acting on a low-dimensional Euclidean space. Due to Aronszajn (Trans. Am. Math. Soc. 68, 337–404 1950), the product of positive semi-definite kernel functions is again positive semi-definite

The Kolmogorov N-width describes the best possible error one can achieve by elements of an N-dimensional linear space. Its decay has extensively been studied in approximation theory and for the solution of partial differential equations (PDEs). Particular interest has occurred within model order reduction (MOR) of parameterized PDEs, e.g., by the reduced basis method (RBM). While it is known that the

Recently, deep neural networks (DNNs) have become powerful tools for solving inverse scattering problems. However, the approximation and generalization rates of DNNs for solving these problems remain largely under-explored. In this work, we introduce two types of combined DNNs (uncompressed and compressed) to reconstruct two function-valued coefficients in the Helmholtz equation for inverse scattering

A non-uniform implicit-explicit L1 mixed finite element method (IMEX-L1-MFEM) is investigated for a class of time-fractional partial integro-differential equations (PIDEs) with space-time-dependent coefficients and non-self-adjoint elliptic part. The proposed fully discrete method combines an IMEX-L1 method on a graded mesh in the temporal variable with a mixed finite element method in spatial variables

We study numerical integration over bounded regions in \(\mathbb {R}^s\), \(s \ge 1\), with respect to some probability measure. We replace random sampling with quasi-Monte Carlo methods, where the underlying point set is derived from deterministic constructions which aim to fill the space more evenly than random points. Ordinarily, such quasi-Monte Carlo point sets are designed for the uniform measure

Parametric model order reduction techniques often struggle to accurately represent transport-dominated phenomena due to a slowly decaying Kolmogorov n-width. To address this challenge, we propose a non-intrusive, data-driven methodology that combines the shifted proper orthogonal decomposition (POD) with deep learning. Specifically, the shifted POD technique is utilized to derive a high-fidelity, low-dimensional

In this paper, we propose a Scaling Fractional Asymptotical Regularization (S-FAR) method for solving linear ill-posed operator equations in Hilbert spaces, inspired by the work of (2019 Fract. Calc. Appl. Anal. 22(3) 699-721). Our method is incorporated into the general framework of linear regularization and demonstrates that, under both Hölder and logarithmic source conditions, the S-FAR with fractional

In this paper, a class of 3D elliptic equations is solved by using the combination of the finite difference method in one direction and nonconforming finite element methods in the other two directions. A finite-difference (FD) discretization based on \(P_1\)-element in the z-direction and a finite-element (FE) discretization based on \(P_1^{NC}\)-nonconforming element in the (x, y)-plane are used to

We introduce a new system of surface integral equations for Maxwell’s transmission problem in three dimensions (3-D). This system has two remarkable features, both of which we prove. First, it is well-posed at all frequencies. Second, the underlying linear operator has a uniformly bounded inverse as the frequency approaches zero, ensuring that there is no low-frequency breakdown. The system is derived

The generalized Lanczos trust-region (GLTR) method is one of the most popular approaches for solving large-scale trust-region subproblem (TRS). In Jia and Wang, SIAM J. Optim., 31, 887–914 2021. Z. Jia et al. considered the convergence of this method and established some a priori error bounds on the residual and the Lagrange multiplier. In this paper, we revisit the convergence of the GLTR method and

Problems with dominant advection, discontinuities, travelling features, or shape variations are widespread in computational mechanics. However, classical linear model reduction and interpolation methods typically fail to reproduce even relatively small parameter variations, making the reduced models inefficient and inaccurate. This work proposes a model order reduction approach based on the Radon Cumulative

In this paper, we introduce a novel unfitted finite element method to solve the quad-curl interface problem. We adapt Nitsche’s method for \({\operatorname {curl}}{\operatorname {curl}}\)-conforming elements and double the degrees of freedom on interface elements. To ensure stability, we incorporate ghost penalty terms and a discrete divergence-free term. We establish the well-posedness of our method

This paper studies the finite element method for solving the exterior Stokes problem in two dimensions. A nonlocal boundary condition is defined using a nonsingular-kernel Dirichlet-to-Dirichlet (DtD) mapping, which maps the Dirichlet data on an interior circle to the Dirichlet data on another circular artificial boundary based on the Poisson integral formula of the Stokes problem. The truncated problem

In this article, we present a numerical method for the Stokes flow of an Oldroyd-B fluid. The viscoelastic stress evolves according to a constitutive law formulated in terms of the upper convected time derivative. A finite difference method is used to discretise along fluid trajectories to approximate the advection and deformation terms of the upper convected derivative in a simple, cheap and cohesive

We provide a posteriori error estimates for a discontinuous Galerkin scheme for the parabolic-elliptic Keller-Segel system in 2 or 3 space dimensions. The estimates are conditional in the sense that an a posteriori computable quantity needs to be small enough—which can be ensured by mesh refinement—and optimal in the sense that the error estimator decays with the same order as the error under mesh

This paper studies a time filtered finite element method for the unsteady inductionless magnetohydrodynamic (MHD) equations. The method uses the semi-implicit backward Euler scheme with a time filter in time and adopts the standard inf-sup stable fluid pairs to discretize the velocity and pressure, and the inf-sup stable face-volume elements for solving the current density and electric potential in

We study Bayesian methods for large-scale linear inverse problems, focusing on the challenging task of hyperparameter estimation. Typical hierarchical Bayesian formulations that follow a Markov Chain Monte Carlo approach are possible for small problems but are not computationally feasible for problems with a very large number of unknown inverse parameters. In this work, we describe an empirical Bayes

We recover the initial status of an evolution system governed by linearized shallow-water wave equations in a 2-dimensional bounded domain by data assimilation technique, with the aim of determining the initial wave height from the measurement of wave distribution in an interior domain. Since we specify only one component of the solution to the governed system and the observation is only measured in

In this paper, we develop new methods to join machine learning techniques and macroscopic differential models, aimed at estimate and forecast vehicular traffic. This is done to complement respective advantages of data-driven and model-driven approaches. We consider here a dataset with flux and velocity data of vehicles moving on a highway, collected by fixed sensors and classified by lane and by class

In this paper, we consider the quadratic eigenvalue problem (QEP) expressed in various commonly used bases, including Taylor, Newton, and Lagrange bases. We propose to investigate the backward errors of the computed eigenpairs and condition numbers of eigenvalues for QEP solved by a class of block Kronecker linearizations. To improve the backward error and condition number of the QEP expressed in a

In two dimensions, we propose and analyse an iterative a posteriori error indicator for the discontinuous Galerkin finite element approximations of the Stokes equations under boundary conditions of friction type. Two sources of error are identified here, namely; the discretisation error and the linearization error. Under a smallness assumption on data, we prove that the devised error estimator is reliable

For h-FEM discretisations of the Helmholtz equation with wavenumber k, we obtain k-explicit analogues of the classic local FEM error bounds of Nitsche and Schatz (Math. Comput. 28(128), 937–958 1974), Wahlbin (1991, §9), Demlow et al.(Math. Comput. 80(273), 1–9 2011), showing that these bounds hold with constants independent of k, provided one works in Sobolev norms weighted with k in the natural way

For the iterative decoupling of elliptic–parabolic problems such as poroelasticity, we introduce time discretization schemes up to order five based on the backward differentiation formulae. Its analysis combines techniques known from fixed-point iterations with the convergence analysis of the temporal discretization. As the main result, we show that the convergence depends on the interplay between

This paper is concerned with near-optimal approximation of a given univariate function with elements of a polynomially enriched wavelet frame, a so-called quarklet frame. Inspired by hp-approximation techniques of Binev, we use the underlying tree structure of the frame elements to derive an adaptive algorithm that, under standard assumptions concerning the local errors, can be used to create approximations

We investigate Sobolev regularity of bivariate functions obtained in Isogeometric Analysis when using geometry maps that are degenerate in the sense that the first partial derivatives vanish at isolated points. In particular, we show how the known \(C^1\)-conditions for D-patches have to be tightened to guarantee square integrability of second partial derivatives, as required when computing finite

We revisit the moving least squares (MLS) approximation scheme on the sphere \(\mathbb S^{d-1} \subset {\mathbb R}^d\), where \(d>1\). It is well known that using the spherical harmonics up to degree \(L \in {\mathbb N}\) as ansatz space yields for functions in \(\mathcal {C}^{L+1}(\mathbb S^{d-1})\) the approximation order \(\mathcal {O}\left( h^{L+1} \right) \), where h denotes the fill distance

In this work, we propose and analyze a new stabilized virtual element method for the coupled Stokes-Darcy problem with Beavers-Joseph-Saffman interface condition on polygonal meshes. We derive two variants of local projection stabilization methods for the coupled Stokes-Darcy problem. The significance of local projection-based stabilization terms is that they provide reasonable control of the pressure

With local pressure-residual stabilizations as an augmentation to the classical Galerkin/least-squares (GLS) stabilized method, a new locally evaluated residual-based stabilized finite element method is proposed for a type of Stokes equations from the incompressible flows. We focus on the study of a type of nonstandard boundary conditions involving the mixed tangential velocity and pressure Dirichlet

The perturbation of the QR decompostion is analyzed from the probalistic point of view. The perturbation error is approximated by a first-order perturbation expansion with high probability where the perturbation is assumed to be random. Different from the previous normwise perturbation bounds using the Frobenius norm, our techniques are used to develop the spectral norm, as well as the entry-wise perturbation

We look at computational physics from an electrical engineering perspective and suggest that several concepts of mathematics, not so well-established in computational physics literature, present themselves as opportunities in the field. We discuss elliptic complexes and highlight the category theoretical background and its role as a unifying language between algebraic topology, differential geometry

We study the classic matrix cross approximation based on the maximal volume submatrices. Our main results consist of an improvement of the classic estimate for matrix cross approximation and a greedy approach for finding the maximal volume submatrices. More precisely, we present a new proof of the classic estimate of the inequality with an improved constant. Also, we present a family of greedy maximal

The distribution of centered Gaussian random fields (GRFs) indexed by compacta such as smooth, bounded Euclidean domains or smooth, compact and orientable manifolds is determined by their covariance operators. We consider centered GRFs given as variational solutions to coloring operator equations driven by spatial white noise, with an elliptic self-adjoint pseudodifferential coloring operator from

Projection-based model order reduction of dynamical systems usually introduces an error between the high-fidelity model and its counterpart of lower dimension. This unknown error can be bounded by residual-based methods, which are typically known to be highly pessimistic in the sense of largely overestimating the true error. This work applies two improved error bounding techniques, namely (a) a hierarchical

Standard interpolatory subdivision schemes and their underlying interpolating refinable functions are of interest in CAGD, numerical PDEs, and approximation theory. Generalizing these notions, we introduce and study \(n_s\)-step interpolatory \(\textsf{M}\)-subdivision schemes and their interpolating \(\textsf{M}\)-refinable functions with \(n_s\in \mathbb {N}\cup \{\infty \}\) and a dilation factor

Tensor wheel (TW) decomposition combines the popular tensor ring and fully connected tensor network decompositions and has achieved excellent performance in tensor completion problem. A standard method to compute this decomposition is the alternating least squares (ALS). However, it usually suffers from slow convergence and numerical instability. In this work, the fast and robust SVD-based algorithms

In this paper, we show that the eigenvalues and eigenvectors of the spectral discretisation matrices resulting from the Legendre dual-Petrov-Galerkin (LDPG) method for the mth-order initial value problem (IVP): \(u^{(m)}(t)=\sigma u(t),\, t\in (-1,1)\) with constant \(\sigma \not =0\) and usual initial conditions at t\(=-1,\) are associated with the generalised Bessel polynomials (GBPs). In particular

In this short note we show that Hilbert complexes are strongly related to what we shall call annihilating sets of skew-selfadjoint operators. This provides for a new perspective on the classical topic of Hilbert complexes viewed as families of commuting normal operators.

This paper focuses on computing the eigenvalues of the generalized collocation matrix of the rational Said–Ball basis, also called as the quasi-rational Said–Ball–Vandermonde (q-RSBV) matrix, with high relative accuracy. To achieve this, we propose explicit expressions for the minors of the q-RSBV matrix and develop a high-precision algorithm to compute these parameters. Additionally, we present perturbation

This paper analyses the nonconforming Morley type virtual element method to approximate a regular solution to the von Kármán equations that describes bending of very thin elastic plates. Local existence and uniqueness of a discrete solution to the non-linear problem is discussed. A priori error estimate in the energy norm is established under minimal regularity assumptions on the exact solution. Error

Common formulations of the eddy current problem involve either vector or scalar potentials, each with its own advantages and disadvantages. An impasse arises when using scalar potential-based formulations in the presence of conductors with non-trivial topology. A remedy is to augment the approximation spaces with generators of the first cohomology group. Most existing algorithms for this require a

This article presents a comprehensive study on the convergence behavior of the Dirichlet-Neumann Waveform Relaxation algorithm applied to solve the time fractional sub-diffusion and diffusion-wave equations in multiple subdomains, considering the presence of some heterogeneous media. Our analysis focuses on estimating the convergence rate of the algorithm and investigates how this estimate varies with

Let H be a separable Hilbert space and let \(\{x_{n}\}\) be a sequence in H that does not contain any zero elements. We say that \(\{x_{n}\}\) is a Bessel-normalizable or frame-normalizable sequence if the normalized sequence \({\bigl \{\frac{x_n}{\Vert x_n\Vert }\bigr \}}\) is a Bessel sequence or a frame for H, respectively. In this paper, several necessary and sufficient conditions for sequences

In this paper, we propose and analyze a second-order time-stepping numerical scheme for the inhomogeneous backward fractional Feynman-Kac equation with nonsmooth initial data. The complex parameters and time-space coupled Riemann-Liouville fractional substantial integral and derivative in the equation bring challenges on numerical analysis and computations. The nonlocal operators are approximated by

We discuss model order reduction (MOR) for large-scale quadratic-bilinear (QB) systems based on balanced truncation. The method for linear systems mainly involves the computation of the Gramians of the system, namely reachability and observability Gramians. These Gramians are extended to a general nonlinear setting in Scherpen (Systems Control Lett. 21, 143-153 1993). These formulations of Gramians

This paper deals with high order Whitney forms. We define a canonical isomorphism between two sets of degrees of freedom. This allows to geometrically localize the classical degrees of freedom, the moments, over the elements of a simplicial mesh. With such a localization, it is thus possible to associate, even with moments, a graph structure relating a field with its potential.