In this paper, we present an entropy-stable Gauss collocation discontinuous Galerkin (DG) method on 3D curvilinear meshes for the GLM-MHD equations: single-fluid magneto-hydrodynamics (MHD) equations with a generalized Lagrange multiplier (GLM) divergence cleaning mechanism. For continuous entropy analysis to hold and ensure Galilean invariance in technique, system requires use of non-conservat...

In this paper, a new class of Runge–Kutta-type collocation methods for the numerical integration ordinary differential equations (ODEs) is presented. Its derivation based on integral form equation. The approach enables enhancing accuracy established Runge–Kutta while retaining same number stages. We demonstrate that, with proposed approach, Gauss–Legendre and Lobatto IIIA can be derived that th...

Different discretization and trust-region methods are compared for the low-thrust fuel-optimal trajectory optimization problem using successive convex programming. In particular, differential integral formulations of adaptive pseudospectral Legendre–Gauss–Radau method, an arbitrary-order Legendre–Gauss–Lobatto technique based on Hermite interpolation, a first-order-hold considered. The number p...

We study Gauss-Kronrod quadrature formulae for the Jacobi weight function «/"'"'(t) = (l-i)Q(l + t)'3 and its special case a = ß = X^ of the Gegenbauer weight function. We are interested in delineating regions in the (a, /3)-plane, resp. intervals in A, for which the quadrature rule has (a) the interlacing property, i.e., the Gauss nodes and the Kronrod nodes interlace; (b) all nodes contained ...

orthogonal zero interpolants (ozi) are polynomials which interpolate the “zero-function” at a finite number of pre-assigned nodes and satisfy orthogonality condition. ozi’s can be constructed by the 3-term recurrence relation. these interpolants are found useful in the solution of constrained approximation problems and in the structure of gauss-type quadrature rules. we present some theoretical...

the star-mesh transformation allows the reduction of nodes in an electrical circuit. the gauss elimination method allows the reduction of unknowns in a system of linear equations . triangular decomposition can be used to find the inverse of a matrix. in this paper the coherence between these methods are discussed. it is shown that the gauss elimination method gives the same formula for star-mes...

Aunified framework is presented for the numerical solution of optimal control problems using collocation at Legendre–Gauss (LG), Legendre–Gauss–Radau (LGR), and Legendre–Gauss–Lobatto (LGL) points. It is shown that the LG and LGR differentiation matrices are rectangular and full rank whereas the LGL differentiation matrix is square and singular. Consequently, the LG and LGR schemes can be expre...