Advances in Computational Mathematics最新文献

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 inversion of the source term and the initial value problem for a heat conduction equation, and numerical experiments are given to demonstrate the effectiveness of the proposed method.

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 the complexities of these two algorithms, fast and efficient algorithms are designed by combining two algorithms and approximate matrix multiplication. The theoretical results are also achieved based on the bounds of singular values of standard Gaussian matrices and the theoretical results for approximate matrix multiplication. Finally, the efficiency of these algorithms is illustrated via some test tensors from synthetic and real datasets.

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 of this paper is twofold. First, we place these methods in the classical framework of Krylov-Lanczos (polynomial-rational) techniques for accelerating Fourier series. This allows us to apply the convergence results developed in this context to our function. Second, we design a new acceleration scheme. Some numerical results are presented to show the effectiveness of the proposed algorithms.

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 single hidden layer, where the activation function on each element is chosen as a complex-valued exponential function like the plane wave function. The desired approximate solution is recursively generated by iteratively solving a quasi-minimization problem associated with the functional and the sets described above, which is defined by a sequence of approximate minimizers of the underlying residual functionals, where plane wave direction angles and activation coefficients are alternatively computed by iterative algorithms. For the proposed DPWNN method, the plane wave directions are adaptively determined in the iterative process, which is different from that in the standard PWLS method (where the plane wave directions are preliminarily given). Numerical experiments will confirm that this DPWNN method can generate approximate solutions with higher accuracy than the PWLS method.

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 that lay in the interplay of time integration and low-rank approximation in the numerical schemes, which is uncommon in standard discretization of differential equations. Results of numerical experiments demonstrate the validity of the convergence analysis and show the performance of the proposed low-rank approximations with different settings.

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 bound assumption of the exact solution. Finally, several numerical examples are given by the finite difference scheme and the fixed-point iteration method to show the effectiveness of the theoretical results.

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 the exponential integrability of the stochastic convolution of the fractional Brownian motion, we present the boundedness of moments of semidiscrete and full-discrete approximations. Building upon these results and the convergence of the fully discrete scheme in probability proved by a stopping time technique, we derive the strong convergence of the proposed scheme.

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, where, moreover, the corresponding native space is a particular instance of a tensor product, referred to as Hilbert tensor product. We first analyze the general problem of multivariate interpolation by product kernels. Then, we further investigate the tensor product structure, in particular for grid-like samples. We use this case to show that the product of positive definite kernel functions is again positive definite. Moreover, we develop an efficient computation scheme for the well-known Newton basis. Supporting numerical examples show the good performance of product kernels, especially for their flexibility.

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 N-width decays exponentially fast (and thus admits efficient MOR) for certain problems, there are examples of the linear transport and the wave equation, where the decay rate deteriorates to (N^{-1/2}). On the other hand, it is widely accepted that a smooth parameter dependence admits a fast decay of the N-width. However, a detailed analysis of the influence of properties of the data (such as regularity or slope) on the rate of the N-width seems to be lacking. In this paper, we state that the optimal linear space is a direct sum of shift-isometric eigenspaces corresponding to the largest eigenvalues, yielding an exact representation of the N-width as their sum. For the linear transport problem, which is modeled by half-wave symmetric initial and boundary conditions g, we obtain such an optimal decomposition by sorted trigonometric functions with eigenvalues that match the Fourier coefficients of g. Further, for normalized g in the Sobolev space (H^r) of broken order (r>0), the sorted eigenfunctions give the sharp upper bound of the N-width, which is a reciprocal of a certain power sum. Yet, for ease, we also provide the decay ((pi N)^{-r}), obtained by the non-optimal space of ordering the trigonometric functions by frequency rather than by eigenvalue. Our theoretical investigations are complemented by numerical experiments which confirm the sharpness of our bounds and give additional quantitative insight.

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 problems from the scattering data at two different frequencies. An analysis of the approximation and generalization capabilities of the proposed neural networks for simulating the regularized pseudo-inverses of the linearized forward operators in direct scattering problems is provided. The results show that, with sufficient training data and parameters, the proposed neural networks can effectively approximate the inverse process with desirable generalization. Preliminary numerical results show the feasibility of the proposed neural networks for recovering two types of isotropic inhomogeneous media. Furthermore, the trained neural network is capable of reconstructing the isotropic representation of certain types of anisotropic media.