Search NASA⌕ Search

SEARCH · Search NASA

Results for “applied computing”

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,513 records · Page 84

Lateral organization, bilayer asymmetry, and inter-leaflet coupling of biological membranes

Understanding of cell membrane organization has evolved significantly from the classic fluid mosaic model. It is now recognized that biological membranes are highly organized structures, with differences in lipid compositions between inner and outer leaflets and in lateral structures within the bilayer plane, known as lipid rafts. These organizing principles are important for protein localization and function as well as cellular signaling. However, the mechanisms and biophysical basis of lipid raft formation, structure, dynamics and function are not clearly understood. One key question, which we focus on in this review, is how lateral organization and leaflet compositional asymmetry are coupled. Detailed information elucidating this question has been sparse because of the small size and transient nature of rafts and the experimental challenges in constructing asymmetric bilayers. Resolving this mystery will require advances in both experimentation and modeling. We discuss here the preparation of model systems along with experimental and computational approaches that have been applied in efforts to address this key question in membrane biology. Furthermore, we seek to place recent and future advances in experimental and computational techniques in context, providing insight into in-plane and transverse organization of biological membranes.

59 BASIC BIOLOGICAL SCIENCES↗

PetaVision version 2.0

PetaVision is an open source, object oriented neural simulation toolbox optimized for high-performance multi-core, multi-node computer architectures. PetaVision is intended for computational neuroscientists who seek to apply neuromorphic models to hard signal processing problems; both to improve on the performance of existing algorithms and/or to gain insight into the computational mechanisms underlying biological neural processing. Please note that this assertion and ESTSC deposit are only for the portions of PetaVision which have been funded and written by LANL developers.

Lundquist, Sheng↗

Frequency-domain modeling of floating wind arrays with shared mooring lines

A frequency-domain model for floating wind turbine dynamics has been extended to model floating wind farms with couplings from shared mooring systems. The model, called RAFT, could previously calculate the mean offsets and wave-induced response spectra for single floating wind turbines. Now, the model supports multiple floating wind turbines, each with their own properties and responses, along with mooring lines that run directly between floating wind turbines in the array, meaning that shared mooring lines or fully suspended dynamic power cables can be included. This capability is achieved by setting up an array-level solution of the system mean offsets and assembling the full system matrices for solving the dynamic response. The quasi-static mooring model MoorPy is used to linearize the mooring system properties. To compute the floating wind turbine relative motions, phase offsets are applied to each turbine's response as a function of wave frequency based on the wavelength and relative positions in the array. These differential motions are then applied to mooring system tension Jacobians to compute the tension loads in the shared mooring lines. Overall, the capability provides a frequency-domain analog to the modeling capabilities of the floating support structure in FAST.Farm. Mean offsets and power spectral density plots of responses are compared between RAFT and FAST.Farm to verify the implementation. The results indicate good agreement within the expectations of a frequency-domain modeling approach and suggest correct implementation of the shared mooring aspects. Additionally, a unique comb-like frequency response in the shared mooring line tensions has been observed. This phenomenon has a clear physical basis and may be an important design consideration for future shared mooring systems.

17 WIND ENERGY↗

A model for rotorcraft flying qualities studies

This paper outlines the development of a mathematical model that is expected to be useful for rotorcraft flying qualities research. A computer model is presented that can be applied to a range of different rotorcraft configurations. The algorithm computes vehicle trim and a linear state-space model of the aircraft. The trim algorithm uses non linear optimization theory to solve the nonlinear algebraic trim equations. The linear aircraft equations consist of an airframe model and a flight control system dynamic model. The airframe model includes coupled rotor and fuselage rigid body dynamics and aerodynamics. The aerodynamic model for the rotors utilizes blade element theory and a three state dynamic inflow model. Aerodynamics of the fuselage and fuselage empennages are included. The linear state-space description for the flight control system is developed using standard block diagram data.

Mittal, Manoj↗

Adaptive enriched Galerkin methods for miscible displacement problems with entropy residual stabilization

Here we present a novel approach to the simulation of miscible displacement by employing adaptive enriched Galerkin finite element methods (EG) coupled with entropy residual stabilization for transport. In particular, numerical simulations of viscous fingering instabilities in heterogeneous porous media and Hele–Shaw cells are illustrated. EG is formulated by enriching the conforming continuous Galerkin finite element method (CG) with piecewise constant functions. The method provides locally and globally conservative fluxes, which are crucial for coupled flow and transport problems. Moreover, EG has fewer degrees of freedom in comparison with discontinuous Galerkin (DG) and an efficient flow solver has been derived which allows for higher order schemes. Dynamic adaptive mesh refinement is applied in order to reduce computational costs for large-scale three dimensional applications. In addition, entropy residual based stabilization for high order EG transport systems prevents spurious oscillations. Numerical tests are presented to show the capabilities of EG applied to flow and transport.

97 MATHEMATICS AND COMPUTING↗

What can we learn from in-soil imaging of a live plant: X-ray Computed Tomography and 3D numerical simulation of root-soil system

Plant roots play a critical role in plant-soil-microbe interactions that occur in the rhizosphere, as well as processes with important implications to farming, forest management and climate change. X-ray computed tomography (XCT) has been proven to be an effective tool for non-invasive root imaging and analysis. A combination of XCT, open-source software, and our own code was used to noninvasively image a prairie dropseed (Sporobolus heterolepis) specimen, segment the root data to obtain a 3D image of the root structure at 31µm resolution, and extract quantitative information (root volume and surface area) from the 3D data, respectively. Based on the mesh generated from the root structure, computational fluid dynamics (CFD) simulations were applied to numerically investigate the root-soil-groundwater system. The plant root conductivity, soil hydraulic conductivity and transpiration rate were shown to control the groundwater distribution. The flow variability and soil water distributions under different scenarios were investigated. Parameterizations were evaluated to show their impacts on the average conductivity. The pore-scale modeling approach provides realistic simulations of rhizosphere flow processes and provides useful information that can be linked to upscaled models.

54 ENVIRONMENTAL SCIENCES↗

Dynamic Multiscale Averaging (DMA) of Turbulent Flow

A new approach called dynamic multiscale averaging (DMA) for computing the effects of turbulent flow is described. The new method encompasses multiple applications of temporal and spatial averaging, that is, multiscale operations. Initially, a direct numerical simulation (DNS) is performed for a relatively short time; it is envisioned that this short time should be long enough to capture several fluctuating time periods of the smallest scales. The flow field variables are subject to running time averaging during the DNS. After the relatively short time, the time-averaged variables are volume averaged onto a coarser grid. Both time and volume averaging of the describing equations generate correlations in the averaged equations. These correlations are computed from the flow field and added as source terms to the computation on the next coarser mesh. They represent coupling between the two adjacent scales. Since they are computed directly from first principles, there is no modeling involved. However, there is approximation involved in the coupling correlations as the flow field has been computed for only a relatively short time. After the time and spatial averaging operations are applied at a given stage, new computations are performed on the next coarser mesh using a larger time step. The process continues until the coarsest scale needed is reached. New correlations are created for each averaging procedure. The number of averaging operations needed is expected to be problem dependent. The new DMA approach is applied to a relatively low Reynolds number flow in a square duct segment. Time-averaged stream-wise velocity and vorticity contours from the DMA approach appear to be very similar to a full DNS for a similar flow reported in the literature. Expected symmetry for the final results is produced for the DMA method. The results obtained indicate that DMA holds significant potential in being able to accurately compute turbulent flow without modeling for practical engineering applications.

97 MATHEMATICS AND COMPUTING↗

Discrete ordinates analysis of the forced-flight variance reduction technique in Monte Carlo neutral particle transport simulations

This paper presents mathematical formulations and methods to predict the effect of forced-flight variance reduction on Monte Carlo tally variance and calculation time. This includes deducing biasing operators that are then used to construct a history-score probability density function (HSPDF), which represents all possible Monte Carlo random walks and gives the probability of a Monte Carlo history scoring in a tally from a particular phase-space position. The history-score moment equations (HSMEs), the statistical moments of the HSPDF, are then derived to calculate the statistical behavior of the Monte Carlo tally when forced-flight variance reduction is applied. In addition, the future-time equation (FTE) is derived to predict the Monte Carlo computational time as a result of applying forced-flight variance reduction. The solutions of the HSMEs and FTE can be used to predict Monte Carlo computational cost. Furthermore, this work also describes a discrete ordinates method to solve the forced-flight HSMEs and FTE. Several 1-D and 2-D test problems verify that the derivations are performed and implemented correctly.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

On the shape of things: From holography to elastica

We explore the question of which shape a manifold is compelled to take when immersed in another one, provided it must be the extremum of some functional. We consider a family of functionals which depend quadratically on the extrinsic curvatures and on projections of the ambient curvatures. These functionals capture a number of physical setups ranging from holography to the study of membranes and elastica. We present a detailed derivation of the equations of motion, known as the shape equations, placing particular emphasis on the issue of gauge freedom in the choice of normal frame. We apply these equations to the particular case of holographic entanglement entropy for higher curvature three dimensional gravity and find new classes of entangling curves. In particular, we discuss the case of New Massive Gravity where we show that non-geodesic entangling curves have always a smaller on-shell value of the entropy functional. Then we apply this formalism to the computation of the entanglement entropy for dual logarithmic CFTs. Nevertheless, the correct value for the entanglement entropy is provided by geodesics. Then, we discuss the importance of these equations in the context of classical elastica and comment on terms that break gauge invariance. - Highlights: • We apply the formalism of shape equations to the study of holographic entanglement entropy. • We compute holographically the entanglement entropy for logarithmic conformal field theories. • We discuss the importance of geometrical gauge invariance in the study of elastica.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Session on High Speed Civil Transport Design Capability Using MDO and High Performance Computing

Since the inception of CAS in 1992, NASA Langley has been conducting research into applying multidisciplinary optimization (MDO) and high performance computing toward reducing aircraft design cycle time. The focus of this research has been the development of a series of computational frameworks and associated applications that increased in capability, complexity, and performance over time. The culmination of this effort is an automated high-fidelity analysis capability for a high speed civil transport (HSCT) vehicle installed on a network of heterogeneous computers with a computational framework built using Common Object Request Broker Architecture (CORBA) and Java. The main focus of the research in the early years was the development of the Framework for Interdisciplinary Design Optimization (FIDO) and associated HSCT applications. While the FIDO effort was eventually halted, work continued on HSCT applications of ever increasing complexity. The current application, HSCT4.0, employs high fidelity CFD and FEM analysis codes. For each analysis cycle, the vehicle geometry and computational grids are updated using new values for design variables. Processes for aeroelastic trim, loads convergence, displacement transfer, stress and buckling, and performance have been developed. In all, a total of 70 processes are integrated in the analysis framework. Many of the key processes include automatic differentiation capabilities to provide sensitivity information that can be used in optimization. A software engineering process was developed to manage this large project. Defining the interactions among 70 processes turned out to be an enormous, but essential, task. A formal requirements document was prepared that defined data flow among processes and subprocesses. A design document was then developed that translated the requirements into actual software design. A validation program was defined and implemented to ensure that codes integrated into the framework produced the same results as their standalone counterparts. Finally, a Commercial Off the Shelf (COTS) configuration management system was used to organize the software development. A computational environment, CJOPT, based on the Common Object Request Broker Architecture, CORBA, and the Java programming language has been developed as a framework for multidisciplinary analysis and Optimization. The environment exploits the parallelisms inherent in the application and distributes the constituent disciplines on machines best suited to their needs. In CJOpt, a discipline code is "wrapped" as an object. An interface to the object identifies the functionality (services) provided by the discipline, defined in Interface Definition Language (IDL) and implemented using Java. The results of using the HSCT4.0 capability are described. A summary of lessons learned is also presented. The use of some of the processes, codes, and techniques by industry are highlighted. The application of the methodology developed in this research to other aircraft are described. Finally, we show how the experience gained is being applied to entirely new vehicles, such as the Reusable Space Transportation System. Additional information is contained in the original.

Rehder, Joe↗

Is ""predictability"" in computational sciences a myth?

Within the last two decades, Modeling and Simulation (M&S) has become the tool of choice to investigate the behavior of complex phenomena. Successes encountered in 'hard' sciences are prompting interest to apply a similar approach to Computational Social Sciences in support, for example, of national security applications faced by the Intelligence Community (IC). This manuscript attempts to contribute to the debate on the relevance of M&S to IC problems by offering an overview of what it takes to reach 'predictability' in computational sciences. Even though models developed in 'soft' and 'hard' sciences are different, useful analogies can be drawn. The starting point is to view numerical simulations as 'filters' capable to represent information only within specific length, time or energy bandwidths. This simplified view leads to the discussion of resolving versus modeling which motivates the need for sub-scale modeling. The role that modeling assumptions play in 'hiding' our lack-of-knowledge about sub-scale phenomena is explained which leads to discussing uncertainty in simulations. It is argued that the uncertainty caused by resolution and modeling assumptions should be dealt with differently than uncertainty due to randomness or variability. The corollary is that a predictive capability cannot be defined solely as accuracy, or ability of predictions to match the available physical observations. We propose that 'predictability' is the demonstration that predictions from a class of 'equivalent' models are as consistent as possible. Equivalency stems from defining models that share a minimum requirement of accuracy, while being equally robust to the sources of lack-of-knowledge in the problem. Examples in computational physics and engineering are given to illustrate the discussion.

45 MILITARY TECHNOLOGY, WEAPONRY, AND NATIONAL DEF↗

Intelligent Machines in the 21st Century: Automating the Processes of Inference and Inquiry

The last century saw the application of Boolean algebra toward the construction of computing machines, which work by applying logical transformations to information contained in their memory. The development of information theory and the generalization of Boolean algebra to Bayesian inference have enabled these computing machines. in the last quarter of the twentieth century, to be endowed with the ability to learn by making inferences from data. This revolution is just beginning as new computational techniques continue to make difficult problems more accessible. However, modern intelligent machines work by inferring knowledge using only their pre-programmed prior knowledge and the data provided. They lack the ability to ask questions, or request data that would aid their inferences. Recent advances in understanding the foundations of probability theory have revealed implications for areas other than logic. Of relevance to intelligent machines, we identified the algebra of questions as the free distributive algebra, which now allows us to work with questions in a way analogous to that which Boolean algebra enables us to work with logical statements. In this paper we describe this logic of inference and inquiry using the mathematics of partially ordered sets and the scaffolding of lattice theory, discuss the far-reaching implications of the methodology, and demonstrate its application with current examples in machine learning. Automation of both inference and inquiry promises to allow robots to perform science in the far reaches of our solar system and in other star systems by enabling them to not only make inferences from data, but also decide which question to ask, experiment to perform, or measurement to take given what they have learned and what they are designed to understand.

Knuth, Kevin H.↗

Intelligent machines in the twenty-first century: foundations of inference and inquiry

The last century saw the application of Boolean algebra to the construction of computing machines, which work by applying logical transformations to information contained in their memory. The development of information theory and the generalization of Boolean algebra to Bayesian inference have enabled these computing machines, in the last quarter of the twentieth century, to be endowed with the ability to learn by making inferences from data. This revolution is just beginning as new computational techniques continue to make difficult problems more accessible. Recent advances in our understanding of the foundations of probability theory have revealed implications for areas other than logic. Of relevance to intelligent machines, we recently identified the algebra of questions as the free distributive algebra, which will now allow us to work with questions in a way analogous to that which Boolean algebra enables us to work with logical statements. In this paper, we examine the foundations of inference and inquiry. We begin with a history of inferential reasoning, highlighting key concepts that have led to the automation of inference in modern machine-learning systems. We then discuss the foundations of inference in more detail using a modern viewpoint that relies on the mathematics of partially ordered sets and the scaffolding of lattice theory. This new viewpoint allows us to develop the logic of inquiry and introduce a measure describing the relevance of a proposed question to an unresolved issue. Last, we will demonstrate the automation of inference, and discuss how this new logic of inquiry will enable intelligent machines to ask questions. Automation of both inference and inquiry promises to allow robots to perform science in the far reaches of our solar system and in other star systems by enabling them not only to make inferences from data, but also to decide which question to ask, which experiment to perform, or which measurement to take given what they have learned and what they are designed to understand.

Review↗

Newton like: Minimal residual methods applied to transonic flow calculations

A computational technique for the solution of the full potential equation is presented. The method consists of outer and inner iterations. The outer iterate is based on a Newton like algorithm, and a preconditioned Minimal Residual method is used to seek an approximate solution of the system of linear equations arising at each inner iterate. The present iterative scheme is formulated so that the uncertainties and difficulties associated with many iterative techniques, namely the requirements of acceleration parameters and the treatment of additional boundary conditions for the intermediate variables, are eliminated. Numerical experiments based on the new method for transonic potential flows around the NACA 0012 airfoil at different Mach numbers and different angles of attack are presented, and these results are compared with those obtained by the Approximate Factorization technique. Extention to three dimensional flow calculations and application in finite element methods for fluid dynamics problems by the present method are also discussed. The Inexact Newton like method produces a smoother reduction in the residual norm, and the number of supersonic points and circulations are rapidly established as the number of iterations is increased.

Wong, Y. S.↗

Newton-like minimal residual methods applied to transonic flow calculations

A computational technique for the solution of the full potential equation is presented. The method consists of outer and inner iterations. The outer iterate is based on a Newton like algorithm, and a preconditioned Minimal Residual method is used to seek an approximate solution of the system of linear equations arising at each inner iterate. The present iterative scheme is formulated so that the uncertainties and difficulties associated with many iterative techniques, namely the requirements of acceleration parameters and the treatment of additional boundary conditions for the intermediate variables, are eliminated. Numerical experiments based on the new method for transonic potential flows around the NACA 0012 airfoil at different Mach numbers and different angles of attack are presented, and these results are compared with those obtained by the Approximate Factorization technique. Extention to three dimensional flow calculations and application in finite element methods for fluid dynamics problems by the present method are also discussed. The Inexact Newton like method produces a smoother reduction in the residual norm, and the number of supersonic points and circulations are rapidly established as the number of iterations is increased.

Wong, Y. S.↗

Dynamo magnetic field modes in thin astrophysical disks - An adiabatic computational approximation

An adiabatic approximation is applied to the calculation of turbulent MHD dynamo magnetic fields in thin disks. The adiabatic method is employed to investigate conditions under which magnetic fields generated by disk dynamos permeate the entire disk or are localized to restricted regions of a disk. Two specific cases of Keplerian disks are considered. In the first, magnetic field diffusion is assumed to be dominated by turbulent mixing leading to a dynamo number independent of distance from the center of the disk. In the second, the dynamo number is allowed to vary with distance from the disk's center. Localization of dynamo magnetic field structures is found to be a general feature of disk dynamos, except in the special case of stationary modes in dynamos with constant dynamo number. The implications for the dynamical behavior of dynamo magnetized accretion disks are discussed and the results of these exploratory calculations are examined in the context of the protosolar nebula and accretion disks around compact objects.

Stepinski, T. F.↗