Scale-Resolving Simulations of Bypass Transition in a High-Pressure Turbine Cascade Using a Spectral-Element Discontinuous-Galerkin Method
No abstract available
SEARCH · Search NASA
Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.
Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.
No abstract available
Here we present a hybrid method for time-dependent particle transport problems that combines Monte Carlo (MC) estimation with deterministic solutions based on discrete ordinates. For spatial discretizations, the MC algorithm computes a piecewise constant solution and the discrete ordinates use bilinear discontinuous finite elements. From the hybridization of the problem, the resulting problem solved by Monte Carlo is scattering free, resulting in a simple, efficient solution procedure. Between time steps, we use a projection approach to “relabel” collided particles as uncollided particles. In conclusion, from a series of standard 2-D Cartesian test problems we observe that our hybrid method has improved accuracy and reduction in computational complexity of approximately an order of magnitude relative to standard discrete ordinates solutions.
Not provided.
Not Available
Explore the source record for details and available documents.
A recent paper is generalized to a case where the spatial region is taken in R(sup 3). The region is assumed to be a thin body, such as a panel on the wing or fuselage of an aerospace vehicle. The traditional h- as well as hp-finite element methods are applied to the surface defined in the x - y variables, while, through the thickness, the technique of the p-element is employed. Time and spatial discretization scheme based upon an assumption of certain weak singularity of double vertical line u(sub t) double vertical line 2, is used to derive an optimal a priori error estimate for the current method.
The efficiency of the quadrature-free form of the dis- continuous Galerkin method in two dimensions, and briefly in three dimensions, is examined. Most of the work for constant-coefficient, linear problems involves the volume and edge integrations, and the transformation of information from the volume to the edges. These operations can be viewed as matrix-vector multiplications. Many of the matrices are sparse as a result of symmetry, and blocking and specialized multiplication routines are used to account for the sparsity. By optimizing these operations, a 35% reduction in total CPU time is achieved. For nonlinear problems, the calculation of the flux becomes dominant because of the cost associated with polynomial products and inversion. This component of the work can be reduced by up to 75% when the products are approximated by truncating terms. Because the cost is high for nonlinear problems on general elements, it is suggested that simplified physics and the most efficient element types be used over most of the domain.
Explore the source record for details and available documents.
Explore the source record for details and available documents.
Explore the source record for details and available documents.
High-order methods, such as discontinuous Galerkin (DG), spectral, and flux reconstruction (FR), are prone to generating unwanted oscillations near shocks and discontinuities. Conventional limiting techniques, while effective in suppressing oscillations near shocks, often compromise accuracy near extrema, where the solution is only first-order accurate. This paper introduces a novel limiting technique for these high-order schemes, aimed at effectively managing shocks while preserving accuracy. The key idea is to expand the standard monotonicity limits to provide “room” near smooth extrema, ensuring that limiting has no effect and thus preserving accuracy. Near a discontinuity, these expanded limits effectively reduce to the original monotonicity limits, suppressing oscillations. Additional motivation is drawn from a formula for the derivative of Radau polynomials, which depicts the behavior of oscillations resulting from discontinuities. This behavior leads to a simplification by applying the limits to the sum of magnitudes of all modes, linear and higher degree. Unlike typical approaches, which rely on successful detection to activate limiting, our limiter depends continuously on the data, there by avoiding potential issues if detection fails. To reduce computing time, efficient criteria for detecting smooth regions where limiting is unnecessary are presented. Combined with detection, the continuous dependence on the data is lost, but the method is more economical. A notable characteristic of the entire process is its simplicity in both concept and implementation. Numerical tests for advection and Euler equations are conducted to demonstrate the effectiveness of the proposed method.
High-order methods, such as discontinuous Galerkin (DG), spectral, and flux reconstruction (FR), are prone to generating unwanted oscillations near shocks and discontinuities. Conventional limiting techniques, while effective in suppressing oscillations near shocks, often compromise accuracy near extrema, where the solution is only first-order accurate. This paper introduces a novel limiting technique for these high-order schemes, aimed at effectively managing shocks while preserving accuracy. The key idea is to expand the standard monotonicity limits to provide “room” near smooth extrema, ensuring that limiting has no effect and thus preserving accuracy. Near a discontinuity, these expanded limits effectively reduce to the original monotonicity limits, suppressing oscillations. Additional motivation is drawn from a formula for the derivative of Radau polynomials, which depicts the behavior of oscillations resulting from discontinuities. This behavior leads to a simplification by applying the limits to the sum of magnitudes of all modes, linear and higher degree. Unlike typical approaches, which rely on successful detection to activate limiting, our limiter depends continuously on the data, there by avoiding potential issues if detection fails. To reduce computing time, efficient criteria for detecting smooth regions where limiting is unnecessary are presented. Combined with detection, the continuous dependence on the data is lost, but the method is more economical. A notable characteristic of the entire process is its simplicity in both concept and implementation. Numerical tests for advection and Euler equations are conducted to demonstrate the effectiveness of the proposed method.
A computational aeroacoustics code based on the discontinuous Galerkin method is ported to several parallel platforms using MPI. The discontinuous Galerkin method is a compact high-order method that retains its accuracy and robustness on non-smooth unstructured meshes. In its semi-discrete form, the discontinuous Galerkin method can be combined with explicit time marching methods making it well suited to time accurate computations. The compact nature of the discontinuous Galerkin method also makes it well suited for distributed memory parallel platforms. The original serial code was written using an object-oriented approach and was previously optimized for cache-based machines. The port to parallel platforms was achieved simply by treating partition boundaries as a type of boundary condition. Code modifications were minimal because boundary conditions were abstractions in the original program. Scalability results are presented for the SCI Origin, IBM SP2, and clusters of SGI and Sun workstations. Slightly superlinear speedup is achieved on a fixed-size problem on the Origin, due to cache effects.
As is well-known, popular high-order methods such as discontinuous Galerkin (DG) and flux reconstruction (FR) tend to generate oscillations near shocks and discontinuities, which can lead to negative pressure or density, ultimately causing code breakdown. For standard second-order methods, one approach to mitigating oscillations is to impose constraints on the calculated slopes, ensuring they do not become excessively steep. This limiting process is rooted in the idea of preserving monotonicity introduced by Van Leer (1974): when the data are monotone, limiting the slopes result in a monotone piecewise linear solution. However, a drawback of this approach is the loss of accuracy near extrema, where the non-monotone solution is somewhat flattened and achieves only first-order accuracy.
A defining feature of the discontinuous Galerkin (DG) method for ODE is that the piecewise polynomial solution can have a jump discontinuity at the beginning of each step. Starting from the standard integral formulation, the DG method is derived here in differential form. The key ingredient is a polynomial called the correction function, which helps ‘correct’ the discontinuous solution by approximating the jump and yields a continuous one. Under the right Radau quadrature, this continuous solution is identical to the solutions by the right Radau collocation and the continuous Galerkin (CG) methods. Next, the correction function facilitates the construction of the associated implicit Runge-Kutta schemes (IRK-DG). Different quadratures for DG result in different IRK-DG methods: left Radau quadrature in Radau IA, right Radau quadrature in Radau IIA or right Radau collocation, and Gauss quadrature in a method called DG-Gauss. The construction of IRK-DG clarifies the meaning and facilitates the proofs of various 𝐵(𝑝), 𝐶(𝜂), and 𝐷(𝜁) conditions for accuracy. The two consequences of these conditions are that all 𝑠-stage IRK-DG methods are accurate to order 2𝑠 − 1, and the IRK-DG methods of Radau type are unique. Numerical examples showing the behavior of the DG solutions are provided. In all, the correction function plays a key role and helps establish the relations among the DG, IRK-DG, collocation, and CG schemes.
This viewgraph presentation provides information on optimizing the travel distance between two points on a curved surface. The presentation addresses the single source shortest path problem, fast algorithms for estimating the eikonal equation, fast schemes and barrier theorems, and the discontinuous Galerkin method, including hyperbolic causality, finite element method, scalars, and marching the discontinuous Galerkin Eikonal approximation.
The focus of this research is on the development of analysis and sensitivity analysis equations for nonlinear, transient heat transfer problems modeled by p-version, time discontinuous finite element approximation. The resulting matrix equation of the state equation is simply in the form ofA(x)x = c, representing a single step, time marching scheme. The Newton-Raphson's method is used to solve the nonlinear equation. Examples are first provided to demonstrate the accuracy characteristics of the resultant finite element approximation. A direct differentiation approach is then used to compute the thermal sensitivities of a nonlinear heat transfer problem. The report shows that only minimal coding effort is required to enhance the analysis code with the sensitivity analysis capability.