We observe that Sturm’s error bounds readily imply that for semidefinite feasibility problems, the method of alternating projections converges at a rate of O(k^{-1/(2^{d+1}-2)}), where d is the singularity degree of the problem—the minimal number of facial reduction iterations needed to induce Slater’s condition. Consequently, for almost all such problems (in the sense of Lebesgue measure), alternating projections converge at a worst-case rate of O(1/k^{0.5}).

nthispaperwewillpresentthelocalstabilityanalysisandlocalerrorestimatefor the local discontinuous Galerkin (LDG) method, when solving the time-dependent singularly perturbed problems in one dimensional space with a stationary outflow boundary layer. Based on a general framework on the local stability, we obtain the optimal error estimate out of the local subdomain, which is nearby the outflow boundary point and has the width of O(h log(1/h)), for the semi-discrete LDG scheme and the fully-discrete LDG scheme with the second order explicit Runge–Kutta time-marching. Here h is the maximum mesh length. The numerical experiments are given also.

Numerical simulations of waves in highly heterogeneous media have important applications, but direct computations are prohibitively expensive. In this paper, we develop a new generalized multiscale finite element method with the aim of simulating waves at a much lower cost. Our method is based on a mixed Galerkin type method with carefully designed basis functions that can capture various scales in the solution. The basis functions are constructed based on some local snapshot spaces and local spectral problems defined on them. The spectral problems give a natural ordering of the basis functions in the snapshot space and allow systematically enrichment of basis functions. In addition, by using a staggered coarse mesh, our method is energy conserving and has block diagonal mass matrix, which are desirable properties for wave propagation. We will prove that our method has spectral convergence, and

In this paper, we develop and analyze a new multiscale discontinuous Galerkin (DG) method for one-dimensional stationary Schr\"{o}dinger equations with open boundary conditions \bo{which have highly oscillating solutions}. Our method uses a smaller finite element space than the WKB local DG (WKB-LDG) method while achieving the same order of accuracy with no resonance errors. We prove that the DG approximation converges optimally with respect to the mesh size $h$ in $L^2$ norm without the typical constraint \bo{that $h$ has to be smaller than the wave length}. Numerical experiments were carried out to verify the second order optimal convergence rate of the method and to demonstrate its ability to capture oscillating solutions on coarse meshes in the applications to Schr\"{o}dinger equations.

Fixed-point iterative sweeping methods were developed in the literature to efficiently solve static Hamilton-Jacobi equations. This class of methods utilizes the Gauss-Seidel iterations and alternating sweeping strategy to achieve fast convergence rate. They take advantage of the properties of hyperbolic partial differential equations (PDEs) and try to cover a family of characteristics of the corresponding Hamilton-Jacobi equation in a certain direction simultaneously in each sweeping order. Different from other fast sweeping methods, fixed-point iterative sweeping methods have the advantages such as that they have explicit forms and do {\it not} involve inverse operation of nonlinear local systems. In principle, it can be applied in solving very general equations using any monotone numerical fluxes and high order approximations easily. In this paper, based on the recently developed fifth order WENO schemes which improve the convergence of the classical WENO schemes by removing slight post-shock oscillations, we design fifth order fixed-point sweeping WENO methods for efficient computation of steady state solution of hyperbolic conservation laws. Especially, we show that although the methods do {\it not} have linear computational complexity, they converge to steady state solutions much faster than regular time-marching approach by stability improvement for high order schemes with a forward Euler time-marching.