H(div) conforming and discontinuous Galerkin (DG) methods are designed for incompressible Euler's equation in two and three dimension. Error estimates are proved for both the semi-discrete method and fully-discrete method using backward Euler time stepping. Numerical examples exhibiting the performance of the methods are given.

Finding the maximum eigenvalue of a symmetric tensor is an important topic in tensor computation and numerical multilinear algebra. In this paper, we introduce a new class of structured tensors called W-tensors, which not only extends thewell-studied nonnegative tensors by allowing negative entries but also covers several important tensors arising naturally from spectral hypergraph theory.We then show that finding the maximum H-eigenvalue of an even-order symmetric W-tensor is equivalent to solving a structured semidefinite program and hence can be validated in polynomial time. This yields a highly efficient semidefinite program algorithm for computing themaximumH-eigenvalue of W-tensors and is based on a new structured sums-of-squares decomposition result for a nonnegative polynomial induced by W-tensors. Numerical experiments illustrate that the proposed algorithm can successfully find the maximum H-eigenvalue of W-tensors with dimension up to 10,000, subject to machine precision. As applications, we provide a polynomial time algorithm for computing the maximum H-eigenvalues of large-size Laplacian tensors of hyperstars and hypertrees, where the algorithm can be up to 13 times faster than the state-of-the-art numerical method introduced by Ng, Qi, and Zhou in 2009. Finally, we also show that the proposed algorithm can be used to test the copositivity of a multivariate form associated with symmetric extended Z-tensors,whose order may be even or odd.

Positivity-preserving discontinuous Galerkin (DG) methods for solving hyperbolic conservation laws have been extensively studied in the last several years. But nearly all the developed schemes are coupled with explicit time discretizations. Explicit discretizations suffer from the constraint for the Courant-Friedrichs-Levis (CFL) number. This makes explicit methods impractical for problems involving unstructured and extremely varying meshes or long-time simulations. Instead, implicit DG schemes are often popular in practice, especially in the computational fluid dynamics (CFD) community. In this paper we develop a high-order positivity-preserving DG method with the backward Euler time discretization for conservation laws. We focus on one spatial dimension, however the result easily generalizes to multidimensional tensor product meshes and polynomial spaces. This work is based on a generalization of the positivity-preserving limiters in (X. Zhang and C.-W. Shu, Journal of Computational Physics, 229 (2010), pp.~3091--3120) and (X. Zhang and C.-W. Shu, Journal of Computational Physics, 229 (2010), pp.~8918--8934) to implicit time discretizations. Both the analysis and numerical experiments indicate that a lower bound for the CFL number is required to obtain the positivity-preserving property. The proposed scheme not only preserves the positivity of the numerical approximation without compromising the designed high-order accuracy, but also helps accelerate the convergence towards the steady-state solution and add robustness to the nonlinear solver. Numerical experiments are provided to support these conclusions.

No abstract uploaded!

No abstract uploaded!