An important property for finite difference schemes designed on curvilinear meshes is the exact preservation of free-stream solutions. This property is difficult to fulfill for high order conservative essentially non-oscillatory (WENO) finite difference schemes. In this paper we explore an alternative flux formulation for such finite difference schemes which can preserve free-stream solutions, based on the numerical technique for the metric terms, which can be applied to this alternative flux formulation but is difficult to be applied to the standard finite difference formulation. Free-stream and vortex preservation properties are investigated, and comparison with standard finite difference WENO schemes is made. Theoretical derivation and numerical results show that the finite difference WENO schemes based on the alternative flux formulation can preserve free-stream and vortex solutions on both stationary and dynamically generalized coordinate systems, hence giving much better performance than the standard finite difference WENO schemes for such problems.

We consider the solution of the large-scale nonsymmetric algebraic Riccati equation XCX − XD − AX + B = 0, with M ≡ [D,−C;−B,A] ∈ R(n1+n2)×(n1+n2) being a nonsingular M-matrix. In addition, A and D are sparselike, with the products A−1u, A−⊤u, D−1v, and D−⊤v computable in O(n) complexity (with n = max{n1, n2}), for some vectors u and v, and B, C are low ranked. The structure-preserving doubling algorithms (SDA) by Guo, Lin, and Xu [Numer. Math., 103 (2006), pp. 392–412] is adapted, with the appropriate applications of the Sherman–Morrison– Woodbury formula and the sparse-plus-low-rank representations of various iterates. The resulting large-scale doubling algorithm has an O(n) computational complexity and memory requirement per iteration and converges essentially quadratically. A detailed error analysis, on the effects of truncation of iterates with an explicit forward error bound for the approximate solution from the SDA, and some numerical results will be presented.

No abstract uploaded!

No abstract uploaded!

In this paper, we study the superconvergence of the error for the discontinuous Galerkin (DG) finite element method for linear conservation laws when upwind fluxes are used. We prove that if we apply piecewise $k$-th degree polynomials, the error between the DG solution and the exact solution is ($k+2$)-th order superconvergent at the downwind-biased Radau points with suitable initial discretization. Moreover, we also prove the DG solution is ($k+2$)-th order superconvergent both for the cell averages and for the error to a particular projection of the exact solution. The superconvergence result in this paper leads to a new {\em a posteriori} error estimate. Our analysis is valid for arbitrary regular meshes and for $\mathcal{P}^k$ polynomials with arbitrary $k\geq1$, and for both periodic boundary conditions and for initial-boundary value problems. We perform numerical experiments to demonstrate that the superconvergence rate proved in this paper is optimal.