Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Order”

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.

At least 487 records · Page 27

Aeroelastic Indicial Response Reduced-Order Modeling for Flexible Flight Vehicles

A reduced-order modeling method capable of providing computationally efficient predictions of the nonlinear, unsteady aerodynamics encountered by flexible flight vehicles under- going forced oscillations is presented. Models are developed using indicial response theory, which characterizes a vehicle’s dynamics through identification of time-accurate aerodynamic responses due to step changes in the vehicle-state parameters, e.g., angle-of-attack, pitch rate. A coupled computational fluid dynamics aeroelastic analysis is proposed for identifying step (indicial) responses of flexible vehicles. In this approach, aeroelastic indicial responses are simulated via prescribed rigid body motions, while fluid-structure interactions are captured at the subiterative level through coupling to a linear modal structural solver. A nonlinear extension of indicial response theory is applied through time-dependent linear interpolation of a database of locally linear aeroelastic step responses. Reduced-order models are then created using the mathematical principle of convolution applied to the interpolated aeroelastic indicial responses to predict the time-dependent aerodynamic response of a flexible vehicle to any arbitrary prescribed flight maneuver. The NASA FUN3D computational fluid dynamics solver is utilized for simulating full-order trajectories and indicial response functions. Aerodynamic predictions were generated for the X-56A aircraft undergoing a series of harmonic forced oscillations. The s are shown to provide a practical option for evaluating the unsteady aerodynamics of flexible vehicles using high-fidelity simulations.

Hiller, Brett↗

PatchworkWave: A Multipatch Infrastructure for Multiphysics/Multiscale/Multiframe/Multimethod Simulations at Arbitrary Order

We present an extension of the PatchworkMHD code [1], itself an MHD-capable extension of thePatch-workcode [2], for which several algorithms presented here were co-developed. Its purpose is to create a“multipatch” scheme compatible with numerical simulations of arbitrary equations of motion at any dis-cretization order in space and time. In thePatchworkframework, the global simulation is comprised of anarbitrary number of moving, local meshes, or “patches”, which are free to employ their own resolution, co-ordinate system/topology, physics equations, reference frame, and in our new approach, numerical method.Each local patch exchanges boundary data with a single global patch on which all other patches residethrough a client-router-server parallelization model. In generalizingPatchworkto be compatible witharbitrary order time integration,PatchworkMHDandPatchworkWavehave significantly improved theinterpatch interpolation accuracy by removing an interpolation of interpolated data feedback present in theoriginalPatchworkcode. Furthermore, we extendPatchworkto bemultimethodby allowing multiplestate vectors to be updated simultaneously, with each state vector providing its own interpatch interpolationand transformation procedures. As such, our scheme is compatible with nearly any set of hyperbolic partialdifferential equations. We demonstrate our changes through the implementation of a scalar wave toy-modelthat is evolved on arbitrary, time dependent patch configurations at 4th order accuracy.

Dennis B Bowen↗

Runtime Verification: From Propositional to First-Order Temporal Logic

Runtime Verification is a branch of formal methods concerned with analysis of execution traces for the purpose of determining the state or general quality of the executing system. The field covers numerous approaches, one of which is specification-based runtime verification, where execution traces are checked against formal specifications. The paper presents syntax, semantics, and monitoring algorithms for respectively propositional and first-order temporal logics. In propositional logics the observed events in the execution trace are represented using atomic propositions, while first-order logic allows universal and existential quantification over data occurring as arguments in events. Monitoring of the first-order case is drastically more challenging than the propositional case, and we present a solution for this problem based on BDDs. We furthermore discuss monitorability of temporal properties by dividing them into different classes representing different degrees of monitorability.

Peled, Doron↗

Low order wavefront sensing and control for WFIRST coronagraph

To maintain the required WFIRST Coronagraph starlight suppression performance in a realistic space environment, a low order wavefront sensing and control (LOWFS/C) subsystem is necessary. The LOWFS/C uses the rejected stellar light from coronagraph to sense and suppress the telescope pointing drift and jitter as well as the low order wavefront errors due to changes in thermal loading on the telescope and the rest of the observatory. In this paper we will present an overview of the low order wavefront sensing and control subsystem for the WFIRST Coronagraph and describe the WFIRST Coronagraph LOWFS function, its design, and modeled performance. We will present experimental results on a dedicated LOWFS/C testbed that show that the LOWFS/C subsystem not only can sense pointing errors better than 0.2 mas but has also experimentally demonstrated closed loop pointing error suppression with residuals better than 0.4 mas rms per axis for the vast majority of observatory reaction wheel speeds.

Wilson, Dan↗

Efficient Preconditioning of a High-Order Solver for Multiple Physics

This work addresses preconditioning approaches for an implicit high-order solver frame-work applied to multiple physics. The solver is based on a space-time spectral element method and matrix-free Newton-Krylov solver developed at NASA over the recent years. Within this context, most preconditioning methods are impractical, as the computational time and memory requirements scale poorly with increasing polynomial orders. To improve computational efficiency, we first describe a novel entity-based Block Jacobi preconditioner for the continuous-Galerkin solution of the linear-elasticity and linear-shell equations. Second, we introduce a multigrid algorithm to further reduce time-to-solution on stiff cases arising from continuous-and discontinuous-Galerkin discretizations. Results obtained on relevant single-physics reference solutions, demonstrate the feasibility of the methods, paving the way for high-order solutions of fully coupled multi-physics problems.

STMD↗

Evaluation of Higher-order Quadrature Schemes in Improving Computational Efficiency for Orientation-averaged Single-Scattering Properties of Nonspherical Ice Particles

We evaluate several high-order quadrature schemes for accuracy and efficacy in obtaining orientation-averaged single-scattering properties (SSPs). We use the highly efficient MIDAS to perform electromagnetic scattering calculations to evaluate the gain in efficiency from these schemes. MIDAS is shown to be superior to DDSCAT, a popular discrete dipole approximation (DDA) method. This study is motivated by the fact that quality physical precipitation retrievals rely on using accurate orientation-averaged SSPs derived from realistic hydrometeors as input to radiative transfer Models (RTMs). The DDA has been a popular choice for single-scattering calculations, due to its versatility with respect to target geometry. However, being iterative-solver-based (ISB), the most used DDA codes, e.g. DDSCAT and ADDA, must solve the scattering problem for each orientation of the target separately. As the size parameter and geometric anisotropy of the hydrometeor increase, the number of orientations needed to obtain accurate orientation-averages can increase drastically and so does the computation cost incurred by the ISB-DDA methods. MIDAS is a Direct-Solver-Based (DSB) code, its decomposition of the original large matrix with a high rank into multiple more manageable smaller matrices of lower ranks makes it much more computationally efficient while maintaining excellent accuracy. In addition, direct solvers consider all requested orientations at once, giving MIDAS further advantage over popular ISB-DDA methods. MIDAS, when combined with high-order quadrature for orientation averaging, can be greater than three orders of magnitude more efficient in obtaining RTM-ready SSPs of complex-shaped hydrometeors than existing ISB-DDA methods, with the native quadrature schemes they offer.

Ines Fenni↗

Higher-Order Statistical Moments of Predicted Sonic Boom Waveforms Through Turbulence

Sonic booms generated by supersonic aircraft are affected by turbulence in the atmospheric boundary layer through which they propagate. Turbulence effects lead to random variability of the sonic boom waveforms measured on the ground, complicating the prediction of such waveforms. As an initial effort to predict the waveform variability, the solution of the coherent or mean sonic boom waveform has previously been formulated by the author. The current paper extends the formulation to derive an expression of the second-order statistical moment necessary to calculate the variance of the spectral amplitudes. Since the derivation uses a full wave equation, results using the derived expression will be compared with those obtained using a parabolic approximation. In order to fully quantify the uncertainty of our predictions, the higher order statistical moments are also formulated and are shown to be approximately zero. Consequently, the probability density function (pdf) of the spectral amplitudes is predicted to be Gaussian. The formulation is further extended to determine the pdf of the loudness of sonic booms and quantify the uncertainties associated with the loudness prediction. Results from the formulation are compared with available flight test data.

sonic booms↗

Shock Capturing via Limiting for High-Order Methods including Discontinuous Galerkin

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.

numerical methods↗

Shock Capturing via Limiting for High-Order Methods Including Discontinuous Galerkin

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.

numerical methods↗

Shock Capturing via Limiting for High-Order Methods including Discontinuous Galerkin

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.

numerical methods↗

A Hunting Expedition For High-Order Hierarchies

Stellar hierarchical systems of high order containing more than three stars are rare and fascinating objects; their disco v ery and study highlight still unknown aspects of star formation and early evolution. We matched eclipsing binaries disco v ered by Transiting Exoplanet Surv e y Satellite with a Gaia catalogue of wide binaries and selected candidate quadruple (or higher order) systems based on e xcessiv e astrometric noise. A subset of 192 southern candidates located within 500 pc was observed by speckle interferometry, and we resolved for the first time 50 close pairs, confirming their high-order (from four to five components) multiplicity. These observations are reported, and some remarkable hierarchical systems are discussed.

Brian P Powell↗

Development and Evaluation of an Order-N Formulation for Multi-Flexible Body Space Systems

This paper presents development of a generic recursive Order-N algorithm for systems with rigid and flexible bodies, in tree or closed-loop topology, with N being the number of bodies of the system. Simulation results are presented for several test cases to verify and evaluate the performance of the code compared to an existing efficient dense mass matrix-based code. The comparison brought out situations where Order-N or mass matrix-based algorithms could be useful.

Multibody dynamics↗

A Survey of the Isentropic Euler Vortex Problem Using High-Order Methods

The flux reconstruction (FR) method offers a simple, efficient, and easy to implement method, and it has been shown to equate to a differential approach to discontinuous Galerkin (DG) methods. The FR method is also accurate to an arbitrary order and the isentropic Euler vortex problem is used here to empirically verify this claim. This problem is widely used in computational fluid dynamics (CFD) to verify the accuracy of a given numerical method due to its simplicity and known exact solution at any given time. While verifying our FR solver, multiple obstacles emerged that prevented us from achieving the expected order of accuracy over short and long amounts of simulation time. It was found that these complications stemmed from a few overlooked details in the original problem definition combined with the FR and DG methods achieving high-accuracy with minimal dissipation. This paper is intended to consolidate the many versions of the vortex problem found in literature and to highlight some of the consequences if these overlooked details remain neglected.

High-Order↗

Higher-Order Approximations for Stabilizing Zero-Energy Modes in Peridynamics Crystal Plasticity Models with Large Horizon Interactions

The non-ordinary state-based peridynamics theory combines non-local dynamic techniques with a desirable correspondence material principle, allowing for the use of continuum mechanics constitutive models. Such an approach presents a unique capability for solving problems involving discontinuities (e.g., strain localization, fracture, and fragmentation). However, the correspondence-based peridynamics models often suffer from zero-energy mode instabilities in numerical implementation, primarily due to the approximations of the non-local deformation gradient tensor. This paper focuses on a computational scheme for eliminating the zero-energy mode oscillations using a choice of influence functions that improve the truncation error in a higher-order Taylor series expansion of the deformation gradient. The novelty here is a tensor-based derivation of the linear constraint equations, which can be used to systematically identify the particle interaction weight functions for various user-specified horizon radii. In this paper, the proposed higher-order stabilization scheme is demonstrated for multi-dimensional examples involving polycrystalline and composite microstructures, along with comparisons against conventional finite element methods. The proposed stabilization scheme is shown to be highly effective in suppressing the spurious zero-energy mode oscillations in all numerical examples while enabling efficient simulations of strain localizations across material interfaces.

Non-Ordinary State-Based Peridynamics↗

Low-cost Quantification of Fluid Flow Parameter Sensitivity using Reduced-order Modeling

Uncertainty quantification of computational fluid dynamics (CFD) simulations is a complicated procedure which still relies in many cases on engineering judgment and factors of safety. This is in part because the computational cost of measuring the simulation's sensitivity to all meaningful parameters (e.g., body surface roughness) and hyperparameters (e.g., subiteration convergence criterion) is intractable for even a single simulation. Reduced-order modeling dramatically lowers this computational cost of simulating fluid flows, but usually only where similar data is already available. In this work, fluid reduced-order models are utilized to quantify a flow's sensitivity to certain physical parameters for the purposes of improved uncertainty quantification. Characteristic observability and sensitivity are both explored. The resulting sensitivity quantifications enable more informed CFD frameworks and more rigorous uncertainty bounds on the resulting data.

uncertainty quantification↗

Low-cost Quantification of Fluid Flow Parameter Sensitivity using Reduced-order Modeling

Uncertainty quantification of computational fluid dynamics (CFD) simulations is a complicated procedure which still relies in many cases on engineering judgment and factors of safety. This is in part because the computational cost of measuring the simulation's sensitivity to all meaningful parameters (e.g., body surface roughness) and hyperparameters (e.g., subiteration convergence criterion) is intractable for even a single simulation. Reduced-order modeling dramatically lowers this computational cost of simulating fluid flows, but usually only where similar data is already available. In this work, fluid reduced-order models are utilized to quantify a flow's sensitivity to certain physical parameters for the purposes of improved uncertainty quantification. Characteristic observability and sensitivity are both explored. The resulting sensitivity quantifications enable more informed CFD frameworks and more rigorous uncertainty bounds on the resulting data.

uncertainty quantification↗

Impact of Traffic-Following on Order of Autonomous Airspace Operations

In this paper, we investigate the dynamic emergence of traffic order in a distributed multi-agent system, aiming to minimize inefficiencies that stem from unnecessary structural impositions. We introduce a methodology for developing a dynamically updating traffic pattern map of the airspace by leveraging information about the consistency and frequency of flow directions used by current as well as preceding traffic. Informed by this map, an agent can discern the degree to which it is advantageous to follow traffic by trading off utilities such as time and order. We show that for the traffic levels studied, for low degrees of traffic-following behavior, there is minimal penalty in terms of aircraft travel times while improving the overall orderliness of the airspace. On the other hand, heightened traffic-following behavior may result in increased aircraft travel times, while marginally reducing the overall entropy of the airspace. Ultimately, the methods and metrics presented in this paper can be used to optimally and dynamically adjust an agent’s traffic-following behavior based on these trade-offs.

Airspace Operations↗

Impact of Traffic-Following on Order of Autonomous Airspace Operations

We investigate the dynamic emergence of traffic order in a distributed multi-agent system, aiming to minimize inefficiencies that stem from unnecessary structural impositions. We introduce a methodology for developing a dynamically updating traffic pattern map of the airspace by leveraging information about the consistency and frequency of flow directions used by current as well as preceding traffic. Informed by this map, an agent can discern the degree to which it is advantageous to follow traffic by trading off utilities such as time and order. We show that for the traffic levels studied, for low degrees of traffic-following behavior, there is minimal penalty in terms of aircraft travel times while improving the overall orderliness of the airspace. On the other hand, heightened traffic-following behavior may result in increased aircraft travel times, while marginally reducing the overall entropy of the airspace. Ultimately, the methods and metrics presented in this paper can be used to optimally and dynamically adjust an agent’s traffic-following behavior based on these trade-offs.

Airspace Operations↗