In this paper, we introduce a nonlocal model for linear steady Stokes system with physical no-slip boundary condition. We use the idea of volume constraint to enforce the no-slip boundary condition. We prove that the nonlocal model is well-posed and the solution of the nonlocal system converges to the solution of the original Stokes system when the nonlocality vanishes.

Solving wave propagation problems within heterogeneous media has been of great interest and has a wide range of applications in physics and engineering. The design of numerical methods for such general wave propagation problems is challenging because the energy conserving property has to be incorporated in the numerical algorithms in order to minimize the phase or shape errors after long time integration. In this paper, we focus on multi-dimensional wave problems and consider linear second-order wave equation in heterogeneous media. We develop and analyze an LDG method, in which numerical fluxes are carefully designed to maintain the energy preserving property and accuracy. Compatible high order energy conserving time integrators are also proposed. The optimal error estimates and the energy conserving property are proved for the semi-discrete methods. Our numerical experiments demonstrate optimal rates of convergence, and show that the errors of the numerical solutions do not grow significantly in time due to the energy conserving property.

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.

No abstract uploaded!

In a previous work [P. Crispel, P. Degond, and M.-H. Vignal, J. Comput. Phys., 223 (2007), pp. 208–234], a new numerical discretization of the Euler–Poisson system was proposed. This scheme is “asymptotic preserving” in the quasineutral limit (i.e., when the Debye length $\varepsilon$ tends to zero), which means that it becomes consistent with the limit model when $\varepsilon \to 0$. In the present work, we show that the stability domain of the present scheme is independent of $\varepsilon$. This stability analysis is performed on the Fourier transformed (with respect to the space variable) linearized system. We show that the stability property is more robust when a space-decentered scheme is used (which brings in some numerical dissipation) rather than a space-centered scheme. The linearization is first performed about a zero mean velocity and then about a nonzero mean velocity. At the various stages of the analysis, our scheme is compared with more classical schemes and its improved stability property is outlined. The analysis of a fully discrete (in space and time) version of the scheme is also given. Finally, some considerations about a model nonlinear problem, the Burgers–Poisson problem, are also discussed.