A popular and classical method for finding the best rank one approximation of a real tensor is the higher order power method (HOPM). It is known in the literature that the iterative sequence generated by HOPM converges globally, while the convergence rate can be superlinear, linear or sublinear. In this paper, we examine the convergence rate of HOPM in solving the best rank one approximation problem of real tensors. We first show that the iterative sequence of HOPM always converges globally and provide an explicit eventual sublinear convergence rate. The sublinear convergence rate estimate is in terms of the dimension and the order of the underlying tensor space. Then, we examine the concept of nondegenerate singular vector tuples and show that, if the sequence of HOPM converges to a nondegenerate singular vector tuple, then the global convergence rate is R-linear. We show that, for almost all tensors (in the sense of Lebesgue measure), all the singular vector tuples are nondegenerate, and so, the HOPM “typically” exhibits global R-linear convergence rate. Moreover, without any regularity assumption, we establish that the sequence generated by HOPM always converges globally and R-linearly for orthogonally decomposable tensors with order at least 3. We achieved this by showing that each nonzero singular vector tuple of an orthogonally decomposable tensor with order at least 3 is nondegenerate.

In this article, we propose two numerical methods, the Gaussian Process (GP) method and the Fourier Features (FF) algorithm, to solve mean field games (MFGs). The GP algorithm approximates the solution of a MFG with maximum a posteriori probability estimators of GPs conditioned on the partial differential equation (PDE) system of the MFG at a finite number of sample points. The main bottleneck of the GP method is to compute the inverse of a square gram matrix, whose size is proportional to the number of sample points. To improve the performance, we introduce the FF method, whose insight comes from the recent trend of approximating positive definite kernels with random Fourier features. The FF algorithm seeks approximated solutions in the space generated by sampled Fourier features. In the FF method, the size of the matrix to be inverted depends only on the number of Fourier features selected, which is much less than the size of sample points. Hence, the FF method reduces the precomputation time, saves the memory, and achieves comparable accuracy to the GP method. We give the existence and the convergence proofs for both algorithms. The convergence argument of the GP method does not depend on any monotonicity condition, which suggests the potential applications of the GP method to solve MFGs with non-monotone couplings in future work. We show the efficacy of our algorithms through experiments on a stationary MFG with a non-local coupling and on a time-dependent planning problem. We believe that the FF method can also serve as an alternative algorithm to solve general PDEs.

In this paper we analyze the explicit Runge-Kutta discontinuous Galerkin (RKDG) methods for the semilinear hyperbolic system of a correlated random walk model describing movement of animals and cells in biology. The RKDG methods use a third order explicit total-variation-diminishing Runge-Kutta (TVDRK3) time discretization and upwinding numerical fluxes. By using the energy method, under a standard CFL condition, we obtain $L^2$ stability for general solutions and a priori error estimates when the solutions are smooth enough. The theoretical results are proved for piecewise polynomials with any degree $k \geq 1$. Finally, since the solutions to this system are non-negative, we discuss a positivity-preserving limiter to preserve positivity without compromising accuracy. Numerical results are provided to demonstrate these RKDG methods.

In this paper, we develop and analyze discontinuous Galerkin (DG) methods to solve hyperbolic equations involving $\delta$-singularities. Negative-order norm error estimates for the accuracy of DG approximations to $\delta$-singularities are investigated. We first consider linear hyperbolic conservation laws in one space dimension with singular initial data. We prove that, by using piecewise $k$-th degree polynomials, at time $t$, the error in the $H^{-(k+2)}$ norm over the whole domain is $(k+1/2)$-th order, and the error in the $H^{-(k+1)}(\mathbb{R}\backslash\mathcal{R}_t)$ norm is $(2k+1)$-th order, where $\mathcal{R}_t$ is the pollution region due to the initial singularity with the width of order $\mathcal{O}(h^{1/2} \log (1/h))$ and $h$ is the maximum cell length. As an application of the negative-order norm error estimates, we convolve the numerical solution with a suitable kernel which is a linear combination of B-splines, to obtain $L^2$ error estimate of $(2k+1)$-th order for the post-processed solution. Moreover, we also obtain high order superconvergence error estimates for linear hyperbolic conservation laws with singular source terms by applying Duhamel's principle. Numerical examples including an acoustic equation and the nonlinear rendez-vous algorithms are given to demonstrate the good performance of DG methods for solving hyperbolic equations involving $\delta$-singularities.

We introduce a new troubled-cell indicator for the discontinuous Galerkin (DG) methods for solving hyperbolic conservation laws. This indicator can be defined on unstructured meshes for high order DG methods and depends only on data from the target cell and its immediate neighbors. It is able to identify shocks without PDE sensitive parameters to tune. Extensive one- and two-dimensional simulations on the hyperbolic systems of Euler equations indicate the good performance of this new troubled-cell indicator coupled with a simple minmod-type TVD limiter for the Runge-Kutta DG (RKDG) methods.