Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Numerical Representation”

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 1,459 records · Page 81

Numerical simulations of depressurization-induced gas production from gas hydrates using 3-D heterogeneous models of L-Pad, Prudhoe Bay Unit, North Slope Alaska

Gas production potential is estimated using a three-dimensional reservoir model based on gas hydrate deposits located in the Prudhoe Bay region of the Alaska's North Slope. The model incorporates two hydrate-bearing sand units using detailed reservoir geological and structural information obtained from past and recent drilling programs. Geostatistical porosity models, conditioned to log data from 78 wells drilled in the vicinity of the Prudhoe Bay “L-Pad,” were developed, providing 3D heterogeneity in porosity, porosity-dependent hydrate saturation, and intrinsic permeability. The simulations utilize both vertical and inclined wellbores to induce depressurization of the reservoir at a constant bottom-hole pressure. The results show the superior performance of the inclined well design. Average gas production rates during the first five years were ~6.0 × 10 4 ST m 3 /day (~2.1 MMSCF/day) and ~2.7 × 10 4 ST m 3 /day (~1.0 MMSCF/day) for incline and vertical wells, respectively. After 30 years 5.3 × 10 8 - 5.7 × 10 8 ST m 3 (18.6–20.2 BSCF) and 6.2 × 10 8 - 6.4 × 10 8 ST m 3 (22.0–22.7 BSCF) gas were produced using the vertical and inclined well configurations, respectively. The analysis reveals that 2D reservoir models with homogeneous representations for porosity and hydrate saturation significantly underestimate production potential. The heterogeneity implemented in this work provides complex porous network and preferential pathways for mobile phase flow to a producing well. Consequently, no secondary hydrate formation around a wellbore is predicted in contrast to models that utilize uniform porosity and hydrate saturation distributions.

03 NATURAL GAS↗

Clouds and Convective Self-Aggregation in a Multi-Model Ensemble of Radiative-Convective Equilibrium Simulations

The Radiative-Convective Equilibrium Model Intercomparison Project (RCEMIP) is an intercomparison of multiple types of numerical models configured in radiative-convective56equilibrium (RCE). RCE is an idealization of the tropical atmosphere that has long been used to study basic questions in climate science. Here, we employ RCE to investigate the role that clouds and convective activity play in determining cloud feedbacks, climatecsensitivity, the state of convective aggregation, and the equilibrium climate. RCEMIP is unique amongst intercomparisons in its inclusion of a wide range of model types, including atmospheric general circulation models (GCMs), single column models (SCMs), cloud-resolving models (CRMs), large eddy simulations (LES), and global cloud-resolving models (GCRMs). The first results are presented from the RCEMIP ensemble of more than 30 models. While there are large differences across the RCEMIP ensemble in the representation of mean profiles of temperature, humidity, and cloudiness, in a majority of models anvil clouds rise, warm, and decrease in area coverage in response to an increase in sea surface temperature (SST). Nearly all models exhibit self-aggregation in large domains and agree that self-aggregation acts to dry and warm the troposphere, reduce high cloudiness, and increase cooling to space. The degree of self-aggregation exhibits no clear tendency with warming. There is a wide range of climate sensitivities, but models with parameterized convection tend to have lower climate sensitivities than models with explicit convection. In models with parameterized convection, aggregated simulations have lower climate sensitivities than un-aggregated simulations. Plain Language Summary This study investigates tropical clouds and climate using results from more than 30 different numerical models set up in a simplified framework. The dataset of model simulations is unique in that it includes a wide range of model types configured in a consistent manner. We address some of the biggest open questions in climate science, including how cloud properties change with warming and the role that the tendency of clouds to form clusters plays in determining the average climate and how climate changes. While there are large differences in how the different models simulate average temperature, humidity, and cloudiness, in a majority of models, the amount of high clouds decreases as climate warms. Nearly all models simulate a tendency for clouds to cluster together. There is agreement that when the clouds are clustered, the atmosphere is drier with fewer clouds overall. We don’t find a conclusive result for how cloud clustering changes as the climate warms.

Allison A. Wing↗

Evaluation of the Rapid Refresh Numerical Weather Prediction Model over Arctic Alaska

Abstract Despite a need for accurate weather forecasts for societal and economic interests in the U.S. Arctic, thorough evaluations of operational numerical weather prediction in the region have been limited. In particular, the Rapid Refresh Model (RAP), which plays a key role in short-term forecasting and decision-making, has seen very limited assessment in northern Alaska, with most evaluation efforts focused on lower latitudes. In the present study, we verify forecasts from version 4 of the RAP against radiosonde, surface meteorological, and radiative flux observations from two Arctic sites on the northern Alaskan coastline, with a focus on boundary layer thermodynamic and dynamic biases, model representation of surface inversions, and cloud characteristics. We find persistent seasonal thermodynamic biases near the surface that vary with wind direction, and may be related to the RAP’s handling of sea ice and ocean interactions. These biases seem to have diminished in the latest version of the RAP (version 5), which includes refined handling of sea ice, among other improvements. In addition, we find that despite capturing boundary layer temperature profiles well overall, the RAP struggles to consistently represent strong, shallow surface inversions. Further, while the RAP seems to forecast the presence of clouds accurately in most cases, there are errors in the simulated characteristics of these clouds, which we hypothesize may be related to the RAP’s treatment of mixed-phase clouds.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Complex Langevin simulation of a random matrix model at nonzero chemical potential

In this study we test the complex Langevin algorithm for numerical simulations of a random matrix model of QCD with a first order phase transition to a phase of finite baryon density. We observe that a naive implementation of the algorithm leads to phase quenched results, which were also derived analytically in this article. We test several fixes for the convergence issues of the algorithm, in particular the method of gauge cooling, the shifted representation, the deformation technique and reweighted complex Langevin, but only the latter method reproduces the correct analytical results in the region where the quark mass is inside the domain of the eigenvalues. In order to shed more light on the issues of the methods we also apply them to a similar random matrix model with a milder sign problem and no phase transition, and in that case gauge cooling solves the convergence problems as was shown before in the literature.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Multilevel Graph Partitioning for Three-Dimensional Discrete Fracture Network Flow Simulations

We present a topology-based method for mesh-partitioning in three-dimensional discrete fracture network (DFN) simulations that takes advantage of the intrinsic multi-level nature of a DFN. DFN models are used to simulate flow and transport through low-permeability fractured media in the subsurface by explicitly representing fractures as discrete entities. The governing equations for flow and transport are numerically integrated on computational meshes generated on the interconnected fracture networks. Modern high-fidelity DFN simulations require high-performance computing on multiple processors where performance and scalability depends partially on obtaining a high-quality partition of the mesh to balance work-loads and minimize communication across all processors. The discrete structure of a DFN naturally lends itself to various graph representations, which can be thought of as coarse-scale representations of the computational mesh. Using this concept, we develop two applications of the multilevel graph partitioning algorithm to partition the mesh of a DFN. In the first, we project a partition of the graph based on the DFN topology onto the mesh of the DFN and in the second, this DFN-based projection is used as the initial condition for further partitioning refinement of the mesh. We compare the performance of these methods with standard multi-level graph partitioning using graph-based metrics (cut, imbalance, partitioning time), computational-based metrics (FLOPS, iterations, solver time), and total run time. The DFN-based and the mesh-based partitioning methods are comparable in terms of the graph-based metrics, but the time required to obtain the partition is several orders of magnitude faster using the DFN-based partitions. The computation-based metrics show comparable performance between both methods so, in combination, the DFN-based partitions are several orders of magnitude faster than the mesh-based partition. Furthermore, the method which uses the DFN-partition solution as the initial condition of the mesh partition provided cut and imbalance values that were close to the mesh-based partition but in a fraction of the time. In turn, this hybrid method outperformed both of the other methods in terms of the total run time.

58 GEOSCIENCES↗

Coherent vorticity extraction in resistive drift-wave turbulence: Comparison of orthogonal wavelets versus proper orthogonal decomposition

We assess two techniques for extracting coherent vortices out of turbulent flows: the wavelet based Coherent Vorticity Extraction (CVE) and the Proper Orthogonal Decomposition (POD). The former decomposes the flow field into an orthogonal wavelet representation and subsequent thresholding of the coefficients allows one to split the flow into organized coherent vortices with non-Gaussian statistics and an incoherent random part which is structureless. POD is based on the singular value decomposition and decomposes the flow into basis functions which are optimal with respect to the retained energy for the ensemble average. Both techniques are applied to direct numerical simulation data of two-dimensional drift-wave turbulence governed by Hasegawa Wakatani equation, considering two limit cases: the quasi-hydrodynamic and the quasi-adiabatic regimes. The results are compared in terms of compression rate, retained energy, retained enstrophy and retained radial flux, together with the enstrophy spectrum and higher order statistics. (c) 2010 Published by Elsevier Masson SAS on behalf of Academie des sciences.

99 GENERAL AND MISCELLANEOUS↗

Gyrokinetic modeling: A multi-water-bag approach

Predicting turbulent transport in nearly collisionless fusion plasmas requires one to solve kinetic (or, more precisely, gyrokinetic) equations. In spite of considerable progress, several pending issues remain; although more accurate, the kinetic calculation of turbulent transport is much more demanding in computer resources than fluid simulations. An alternative approach is based on a water-bag representation of the distribution function that is not an approximation but rather a special class of initial conditions, allowing one to reduce the full kinetic Vlasov equation into a set of hydrodynamic equations while keeping its kinetic character. The main result for the water-bag model is a lower cost in the parallel velocity direction since no differential operator associated with some approximate numerical scheme has to be carried out on this variable v{sub parallel}. Indeed, a small bag number is sufficient to correctly describe the ion temperature gradient instability.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Periodic waves in fiber Bragg gratings

We construct two families of exact periodic solutions to the standard model of fiber Bragg grating (FBG) with Kerr nonlinearity. The solutions are named ''sn'' and ''cn'' waves, according to the elliptic functions used in their analytical representation. The sn wave exists only inside the FBG's spectral bandgap, while waves of the cn type may only exist at negative frequencies ({omega}<0), both inside and outside the bandgap. In the long-wave limit, the sn and cn families recover, respectively, the ordinary gap solitons, and (unstable) antidark and dark solitons. Stability of the periodic solutions is checked by direct numerical simulations and, in the case of the sn family, also through the calculation of instability growth rates for small perturbations. Although, rigorously speaking, all periodic solutions are unstable, a subfamily of practically stable sn waves, with a sufficiently large spatial period and {omega}>0, is identified. However, the sn waves with {omega}<0, as well as all cn solutions, are strongly unstable.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A Multi-Function AAA Algorithm Applied to Frequency Dependent Line Modeling

Modeling of power distribution system components that are valid for a wide range of frequencies are crucial for highly accurate modeling of electromagnetic transient (EMT) events. This has recently become of interest due to the improvements needed for the resilient operation of distribution systems. Vector fitting (VF) is a very popular and commonly used algorithm for wide band representations of power system components in EMT simulations. In this research, we present a new multi-input rational approximation algorithm (MIAAA) and illustrate its advantages with respect to VF using examples of approximations of admittance matrices discussed in the literature. We show that MIAAA not only outperforms VF in terms of achieving better accuracy using lesser number of poles, but also has no numerical issues achieving convergence. In contrast to VF, MIAAA is not sensitive to the location of input sample points and it does not require good estimates for the location of the desired approximation poles. The novelty of this research work is the use of recent mathematical results to solve existing challenges in distribution system modeling and to develop rational approximations for power system models that intend to be optimal in terms of accuracy and performance.

41 EE - Solar Energy Technologies Office (EE-4S)↗

Efficient Scalable Parallel Higher Order Direct MoM-SIE Method With Hierarchically Semiseparable Structures for 3-D Scattering

A novel fast scalable parallel algorithm is proposed for the solution of large 3-D scattering problems based on: 1) the double (geometrical and current-approximation) higher order (DHO) method of moments (MoM) in the surface integral equation (SIE) formulation and 2) a direct solver for dense linear systems utilizing hierarchically semiseparable (HSS) structures. Namely, an HSS matrix representation is used for compression, factorization, and solution of the system matrix. In addition, a rank-revealing QR decomposition for memory compression is used, with a stopping criterion in terms of the relative rank tolerance value. One method for geometrical preprocessing of the scatterers based on the cobblestone distance sorting technique is employed in order to enhance the HSS algorithm accuracy and parallelization. Numerical examples show how the accuracy of the DHO HSS-MoM-SIE method is easily controllable by using the relative tolerance for the matrix compression. Furthermore, the examples demonstrate low memory consumption, as well as much faster simulation time, when compared to the direct LU decomposition. The method enables dramatically faster monostatic scattering computations than iterative solvers and reduced number of unknowns when compared to low-order discretizations. Finally, great scalability of the algorithm is demonstrated on more than one thousand processes.

97 MATHEMATICS AND COMPUTING↗

Land-based wind turbines with flexible rail-transportable blades – Part 2: 3D finite element design optimization of the rotor blades

Abstract. Increasing growth in land-based wind turbine blades to enable higher machine capacities and capacity factors is creating challenges in design, manufacturing, logistics, and operation. Enabling further blade growth will require technology innovation. An emerging solution to overcome logistics constraints is to segment the blades spanwise and chordwise, which is effective, but the additional field-assembled joints result in added mass and loads, as well as increased reliability concerns in operation. An alternative to this methodology is to design slender flexible blades that can be shipped on rail lines by flexing during transport. However, the increased flexibility is challenging to accommodate with a typical glass-fiber, upwind design. In a two-part paper series, several design options are evaluated to enable slender flexible blades: downwind machines, optimized carbon fiber, and active aerodynamic controls. Part 1 presents the system-level optimization of the rotor variants as compared to conventional and segmented baselines, with a low-fidelity representation of the blades. The present work, Part 2, supplements the system-level optimization in Part 1 with high-fidelity blade structural optimization to ensure that the designs are at feasible optima with respect to material strength and fatigue limits, as well as global stability and structural dynamics constraints. To accommodate the requirements of the design process, a new version of the Numerical Manufacturing And Design (NuMAD) code has been developed and released. The code now supports laminate-level blade optimization and an interface to the International Energy Agency Wind Task 37 blade ontology. Transporting long, flexible blades via controlled flapwise bending is found to be a viable approach for blades of up to 100 m. The results confirm that blade mass can be substantially reduced by going either to a downwind design or to a highly coned and tilted upwind design. A discussion of active and inactive constraints consisting of material rupture, fatigue damage, buckling, deflection, and resonant frequencies is presented. An analysis of driving load cases revealed that the downwind designs are dominated by loads from sudden, abrupt events like gusts rather than fatigue. Finally, an analysis of carbon fiber spar caps for downwind machines finds that, compared to typical carbon fibers, the use of a new heavy-tow carbon fiber in the spar caps is found to yield between 9 % and 13 % cost savings.

17 WIND ENERGY↗

PRIME: A bottom-up approach to probabilistic rule development

PRIME is a system to be used by an intelligent machine to allow it to operate in an abstract but uncertain (or stochastic) environment. It maintains a model of the effects of the machine's actions in the form of a rule base, which is induced from experience. This bottom-up approach to rule development allows the model to adapt to changes in the environment. Each rule consists of a condition under which the rule is active, an action, the effect of the action on the environment, and an estimate of the probability of this effect occurring. The effect probabilities are used to model the uncertainty in the environment, permitting multiple possible effects for a single action under a particular set of conditions. The objective of the intelligent machine is to satisfy user-specified goals with maximum probability of success. PRIME fulfills this requirement in two ways: it continuously updates the rule base with the most recent information, to ensure the validity of the model; and it generates plans which have the maximum probability of achieving the goals, based on the probability estimates in the rule base. PRIME is composed of three main processes: exploration, generalization, and planning. In exploration, the machine executes various randomly chosen actions, observes the effects on the environment, and updates the rule base accordingly. This process is used to develop the rule base in simulation, as well as to supplement the current knowledge during normal operation. Generalization is the procedure used to induce general rules from experience, which is encoded in the form of specific rules. These general rules extend the machine's knowledge to situations which have not been encountered yet, thereby increasing the capability of the machine to plan effectively. Planning is the process of constructing an optimal sequence of actions to satisfy a goal, using the rule base to predict the effects of these actions and to determine the probability of success of the plan. The rule representation and many other data structures were specifically chosen to maximize the efficiency of these processes. A simulated environment was designed to test the performance of PRIME. The results of experimentation were largely negative. The main problem was that the domain coverage of the rules was inadequate for the number of rules stored in the rule base, due to redundancies in general rules and numerous rules covering ineffective actions. It was determined that a more efficient generalization, and some form of goal-directed exploration, are necessary in order to solve most of the current deficiencies in PRIME.

Miller, Scott A.↗

EVA Suit R and D for Performance Optimization

Designing a planetary suit is very complex and often requires difficult trade‐offs between performance, cost, mass, and system complexity. To verify that new suit designs meet requirements, full prototypes must be built and tested with human subjects. However, numerous design iterations will occur before the hardware meets those requirements. Traditional draw‐prototype‐test paradigms for R&D are prohibitively expensive with today's shrinking Government budgets. Personnel at NASA are developing modern simulation techniques which focus on human‐centric designs by creating virtual prototype simulations and fully adjustable physical prototypes of suit hardware. During the R&D design phase, these easily modifiable representations of an EVA suit's hard components will allow designers to think creatively and exhaust design possibilities before they build and test working prototypes with human subjects. It allows scientists to comprehensively benchmark current suit capabilities and limitations for existing suit sizes and sizes that do not exist. This is extremely advantageous and enables comprehensive design down‐selections to be made early in the design process, enables the use of human performance as design criteria, and enables designs to target specific populations

Cowley, Matthew S.↗

A MIMO AAA Agorithm for Frequency Dependent Line Modeling

Modeling of power distribution system components that are valid for a wide range of frequencies are crucial for highly accurate modeling of electromagnetic transient (EMT) events. This has recently become of interest due to the improvements needed for the resilient operation of distribution systems. Vector fitting (VF) is a very popular and commonly used algorithm for wide band representations of power system components in EMT simulations. In this research, we present a new multi-input rational approximation algorithm (MIAAA) and illustrate its advantages with respect to VF using examples of approximations of admittance matrices discussed in the literature. We show that MIAAA not only outperforms VF in terms of achieving better accuracy using lesser number of poles, but also has no numerical issues achieving convergence. In contrast to VF, MIAAA is not sensitive to the location of input sample points and it does not require good estimates for the location of the desired approximation poles. The novelty of this research work is the use of recent mathematical results to solve existing challenges in distribution system modeling and to develop rational approximations for power system models that intend to be optimal in terms of accuracy and performance.

AAA algorithm↗

Exactly unitary discrete representations of the metaplectic transform for linear-time algorithms

The metaplectic transform (MT), a generalization of the Fourier transform sometimes called the linear canonical transform, is a tool used ubiquitously in modern optics, for example, when calculating the transformations of light beams in paraxial optical systems. The MT is also an essential ingredient of the geometrical-optics modeling of caustics that we recently proposed. In particular, this application relies on the near-identity MT (NIMT); however, the NIMT approximation used so far is not exactly unitary and leads to numerical instability. Here, we develop a discrete MT that is exactly unitary, and approximate it to obtain a discrete NIMT that is also unitary and can be computed in linear time. We prove that the discrete NIMT converges to the discrete MT when iterated, thereby allowing the NIMT to compute MTs that are not necessarily near-identity. Finally, we then demonstrate the new algorithms with a series of examples.

47 OTHER INSTRUMENTATION↗

On the v-representabilty problem in density functional theory: Application to non-interacting systems

Based on a computational procedure for determining the functional derivative with respect to the density of any antisymmetric N-particle wave function for a non-interacting system that leads to the density, we devise a test as to whether or not a wave function known to lead to a given density corresponds to a solution of a Schrödinger equation for some potential. We examine explicitly the case of non-interacting systems described by Slater determinants. Here, numerical examples for the cases of a one-dimensional square-well potential with infinite walls and the harmonic oscillator potential illustrate the formalism.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Constrained or unconstrained? Neural-network-based equation discovery from data

Throughout many fields, practitioners often rely on differential equations to model systems. Yet, for many applications, the theoretical derivation of such equations and/or the accurate resolution of their solutions may be intractable. Instead, recently developed methods, including those based on parameter estimation, operator subset selection, and neural networks, allow for the data-driven discovery of both ordinary and partial differential equations (PDEs), on a spectrum of interpretability. The success of these strategies is often contingent upon the correct identification of representative equations from noisy observations of state variables and, as importantly and intertwined with that, the mathematical strategies utilized to enforce those equations. Specifically, the latter has been commonly addressed via unconstrained optimization strategies. Representing the PDE as a neural network, we propose to discover the PDE (or the associated operator) by solving a constrained optimization problem and using an intermediate state representation similar to a physics-informed neural network (PINN). The objective function of this constrained optimization problem promotes matching the data, while the constraints require that the discovered PDE is satisfied at a number of spatial collocation points. We present a penalty method and a widely used trust-region barrier method to solve this constrained optimization problem, and we compare these methods on numerical examples. Our results on several example problems demonstrate that the latter constrained method outperforms the penalty method, particularly for higher noise levels or fewer collocation points. This work motivates further exploration into using sophisticated constrained optimization methods in scientific machine learning, as opposed to their commonly used, penalty-method or unconstrained counterparts. For both of these methods, we solve these discovered neural network PDEs with classical methods, such as finite difference methods, as opposed to PINNs-type methods relying on automatic differentiation. Here, we briefly highlight how simultaneously fitting the data while discovering the PDE improves the robustness to noise and other small, yet crucial, implementation details.

Data-driven discovery↗

An energy-based coupling approach to nonlocal interface problems

Nonlocal models provide accurate representations of physical phenomena ranging from fracture mechanics to complex subsurface flows, where traditional partial differential equations fail to capture effects caused by long-range forces at the microscale and mesoscale. However, the application of nonlocal models to problems involving interfaces such as multimaterial simulations and fluid-structure interaction, is hampered by the lack of a rigorous nonlocal interface theory needed to support numerical developments. In this paper, we use an energy-based approach to develop a mathematically rigorous nonlocal interface theory which provides a physically consistent extension of the classical perfect interface PDE formulation. Numerical examples validate the proposed framework and demonstrate the scope of our theory.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗