Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Arbitrary functions”

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 739 records · Page 41

Modeling the Activity of Single Genes

The central dogma of molecular biology states that information is stored in DNA, transcribed to messenger RNA (mRNA) and then translated into proteins. This picture is significantly augmentated when we consider the action of certain proteins in regulating transcription. These transcription factors provide a feedback pathway by which genes can regulate one another's expression as mRNA and then as protein. To review: DNA, RNA and proteins have different functions. DNA is the molecular storehouse of genetic information. When cells divide, the DNA is replicated, so that each daughter cell maintains the same genetic information as the mother cell. RNA acts as a go-between from DNA to proteins. Only a single copy of DNA is present, but multiple copies of the same piece of RNA may be present, allowing cells to make huge amounts of protein. In eukaryotes (organisms with a nucleus), DNA is found in the nucleus only. RNA is copied in the nucleus then translocates(moves) outside the nucleus, where it is transcribed into proteins. Along the way, the RNA may be spliced, i.e., may have pieces cut out. RNA then attaches to ribosomes and is translated to proteins. Proteins are the machinery of the cell other than DNA and RNA, all the complex molecules of the cell are proteins. Proteins are specialized machines, each of which fulfills its own task, which may be transporting oxygen, catalyzing reactions, or responding to extracellular signals, just to name a few. One of the more interesting functions a protein may have is binding directly or indirectly to DNA to perform transcriptional regulation, thus forming a closed feedback loop of gene regulation. The structure of DNA and the central dogma were understood in the 50s; in the early 80s it became possible to make arbitrary modifications to DNA and use cellular machinery to transcribe and translate the resulting genes; more recently, genomes (i.e., the complete DNA sequence) of many organisms have been sequenced. This large-scale sequencing began with simple organisms, viruses and bacteria, progressed to eukaryotes such as yeast, and more recently (1998) progressed to a multi-cellular animal, the nematode Caenorhabditis elegans. Sequencers have now moved on to the fruit fly Drosophila melanogaster, whose sequence is slated for completion by the end of 1999. The human genome project is expected to determine the complete sequence of all 3 billion bases of human DNA within the next five years. In the wake of genome-scale sequencing, further instrumentation is being developed to assay gene expression and function on a comparably large scale. Much of the work in computational biology focuses on computational tools used in sequencing, finding genes that are related to a particular gene, finding which parts of the DNA code for proteins and which do not, understanding what proteins will be formed from a given length of DNA, predicting how the proteins will fold from a one-dimensional structure into a three dimensional structure, and so on. Much less computational work has been done regarding the function of proteins. One reason for this is that different proteins function very differently, and so work on protein function is very specific to certain classes of proteins. There are, for example, proteins such enzymes that catalyze various intracellular reactions, receptors that respond to extracellular signals and ion channels that regulate the flow of charged particles into and out of the cell. In this chapter, we will consider a particular class of proteins called transcription factors(TFs), which are responsible for regulating when a certain gene is expressed in a certain cell, which cells it is express in, and how much is expressed. Understanding these processes will involve developing a deeper understanding of transcription, translation, and the cellular processes that control those processes. All of these elements fall under the aegis of gene regulation or more narrowly transcriptional regulation. Some of the key questions in gene regulation are: What genes are expressed in a certain cell at a certain time? How does gene expression differ from cell to cell in a multicellular organism? Which proteins act as transcription factors, i.e., are important in regulating gene expression? From questions like these, we hope to understand which genes are important for various macroscopic processes. Nearly all of the cells of a multicellular organism contain the same DNA. Yet this same genetic information yields a large number of different cell types. The fundamental difference between a neuron and a liver cell, for example, is which genes are expressed. Thus understanding gene regulation is an important step in understanding development. Furthermore, understanding the usual genes that are expressed in cells may give important clues about various diseases. Some diseases, such as sickle cell anemia and cystic fibrosis, are caused by defects in single, non-regulatory genes; others, such as certain cancers, are caused when the cellular control circuitry malfunctions - an understanding of these diseases will involve pathways of multiple interacting gene products. There are numerous challenges in the area of understanding and modeling gene regulation. First and foremost, biologists would like to develop a deeper understanding of the processes involved, including which genes and families of genes are important, how they interact, etc. From a computation point of view, there has been embarrassingly little work done. In this chapter there are many areas in which we can phrase meaningful, non-trivial computational questions, but questions that have not been addressed. Some of these are purely computational (what is a good algorithm for dealing with a model of type X) and others are more mathematical (given a system with certain characteristics, what sort of model can one use? How does one find biochemical parameters from system-level behavior using as few experiments as possible?). In addition to biological and algorithmic problems, there is also the ever-present issue of theoretical biology - what general principles can be derived from these systems, what can one do with models other than just simulate time-courses, what can be deduced about a class of systems without knowing all the details? The fundamental challenge to computationalists and theorists is to add value to the biology - to use models, modeling techniques and algorithms to understand the biology in new ways.

Mjolsness, Eric↗

A discontinuous piecewise polynomial generalized moving least squares scheme for robust finite element analysis on arbitrary grids

A variational approach is developed with a meshless discretization to enable accurate and robust numerical simulation of partial differential equations for meshes that are of poor quality. Traditional finite element methods use the mesh to both discretize the geometric domain and to define the finite element shape functions. The latter creates a dependence between the quality of the mesh and the properties of the finite element basis that may adversely affect the accuracy of the discretized problem. Here, we propose a new approach for defining finite element shape functions that breaks this dependence and separates mesh quality from the discretization quality, which we call discontinuous piecewise polynomial generalized moving least squares (DPP-GMLS). At the core of the approach is a meshless definition of the shape functions, which limits the purpose of the mesh to representing the geometric domain and integrating the basis functions without having any role in their approximation quality. The resulting non-conforming space can be utilized within a standard discontinuous Galerkin framework, providing a rigorous foundation for solving partial differential equations on low-quality meshes. We present a collection of numerical experiments demonstrating our approach in a wide range of settings: strongly coercive elliptic problems, linear elasticity in the compressible regime, and the stationary Stokes problem. We demonstrate convergence for all problems and stability for element pairs for problems which usually require inf-sup compatibility for conforming methods, also referring to a minor modification possible through the symmetric interior penalty Galerkin framework for stabilizing element pairs that would otherwise be traditionally unstable. Mesh robustness is particularly critical for elasticity, and we provide an example that our approach provides a greater than 5 x improvement in accuracy and allows for taking an 8 x larger stable timestep for a highly deformed mesh, compared to the continuous Galerkin finite element method.

97 MATHEMATICS AND COMPUTING↗

Statistical mechanics of light elements at high pressure. VII - A perturbative free energy for arbitrary mixtures of H and He

A model free energy is presented which accurately represents results from 45 high-precision Monte Carlo calculations of the thermodynamics of hydrogen-helium mixtures at pressures of astrophysical and planetophysical interest. The free energy is calculated using free-electron perturbation theory (dielectric function theory), and is an extension of the expression given in an earlier paper in this series. However, it fits the Monte Carlo results more accurately, and is valid for the full range of compositions from pure hydrogen to pure helium. Using the new free energy, the phase diagram of mixtures of liquid metallic hydrogen and helium is calculated and compared with earlier results. Sample results for mixing volumes are also presented, and the new free energy expression is used to compute a theoretical Jovian adiabat and compare the adiabat with results from three-dimensional Thomas-Fermi-Dirac theory. The present theory gives slightly higher densities at pressures of about 10 megabars.

Hubbard, W. B.↗

Finite and infinite matrix product states for Gutzwiller projected mean-field wave functions

Matrix product states (MPS) and “dressed” ground states of quadratic mean fields (e.g., Gutzwiller projected Slater determinants) are both important classes of variational wave functions. This latter class has played important roles in understanding superconductivity and quantum spin liquids. We present a method to obtain both the finite and infinite MPS (iMPS) representation of the ground state of an arbitrary fermionic quadratic mean-field Hamiltonian (which in the simplest case is a Slater determinant and in the most general case is a Pfaffian). We also show how to represent products of such states (e.g., determinants times Pfaffians). From this representation one can project to single occupancy and evaluate the entanglement spectra after Gutzwiller projection. We then obtain the MPS and iMPS representation of Gutzwiller projected mean-field states that arise from the variational slave-fermion approach to the S = 1 bilinear-biquadratic quantum spin chain. To accomplish this, we develop an approach to orthogonalize degenerate iMPS to find all the states in the degenerate ground-state manifold. We find the energies of the MPS and iMPS states match the variational energies closely, indicating the method is accurate and there is minimal loss due to truncation error. We then present an exploration of the entanglement spectra of projected slave-fermion states, exploring their qualitative features and finding good qualitative agreement with the respective exact ground-state spectra found from density matrix renormalization group.

1-dimensional spin chains↗

The equations of motion of an artificial satellite in nonsingular variables

The equations of motion of an artificial satellite are given in nonsingular variables. Any term in the geopotential is considered as well as luni-solar perturbations up to an arbitrary power of r/r prime; r prime being the geocentric distance of the disturbing body. Resonances with tesseral harmonics and with the moon or sun are also considered. By neglecting the shadow effect, the disturbing function for solar radiation is also developed in nonsingular variables for the long periodic perturbations. Formulas are developed for implementation of the theory in actual computations.

Giacaglia, G. E. O.↗

A general and computationally fast formulation for radiative transfer with scattering

A general formulation of monocromatic radiative transfer with scattering has been developed for plane-parallel geometry. The inhomogeneous and nonisothermal medium absorbs, emits, and anisotropically scatters radiation. Surfaces can emit and scatter radiation in any specified manner. The solution procedure uses the fact that phase incoherent scattering is linear in radiative sources. Certain basic scattering functions are then defined and calculated by an adding computer code using matrix algebra. These scattering functions are weighted by the temperature field and summed (superimposed) to obtain the solution for any specific problem. Numerical results for exiting intensities and one-sided heat fluxes from general media bound by one arbitrary surface are presented. These parametric studies demonstrate the effects of scattering particles and surfaces on radiative transfer from inhomogeneous and nonisothermal media. Application of the formulation to radiative equilibrium is also discussed. The conclusion is that all problems in plane-parallel radiative transfer with scattering can be solved by a common and computationally fast algorithm based on this formulation.

Cogley, A. C.↗

Generation of three-dimensional boundary-fitted curvilinear coordinate systems for wing/wing-tip geometries using the elliptic solver method

A three-dimensional elliptic solver technique is utilized to generate surface-fitted coordinates about wing/wing-tip configurations. The method is applicable to wings of arbitrary section profile and camber, leading-edge sweep, taper ratio, and spanwise thickness variation. The basic theory of three-dimensional elliptic mappings is developed along with a method to compute interior coordinate control functions. Examples of grids generated about several wing/wing-tip geometries are given. A 49 x 33 x 17 grid requires about 3 minutes of CPU time on a CYBER 203 computer.

Thames, F. C.↗

Investigation of fast initialization of spacecraft bubble memory systems

Bubble domain technology offers significant improvement in reliability and functionality for spacecraft onboard memory applications. In considering potential memory systems organizations, minimization of power in high capacity bubble memory systems necessitates the activation of only the desired portions of the memory. In power strobing arbitrary memory segments, a capability of fast turn on is required. Bubble device architectures, which provide redundant loop coding in the bubble devices, limit the initialization speed. Alternate initialization techniques are investigated to overcome this design limitation. An initialization technique using a small amount of external storage is demonstrated.

Looney, K. T.↗

Grid generation in three dimensions by Poisson equations with control of cell size and skewness at boundary surfaces

An algorithm for generating computational grids about arbitrary three-dimensional bodies is developed. The elliptic partial differential equation (PDE) approach developed by Steger and Sorenson and used in the NASA computer program GRAPE is extended from two to three dimensions. Forcing functions which are found automatically by the algorithm give the user the ability to control mesh cell size and skewness at boundary surfaces. This algorithm, as is typical of PDE grid generators, gives smooth grid lines and spacing in the interior of the grid. The method is applied to a rectilinear wind-tunnel case and to two body shapes in spherical coordinates.

Sorenson, R. L.↗

Solution of multi-center molecular integrals of Slater-type orbitals

The troublesome multi-center molecular integrals of Slater-type orbitals (STO) in molecular physics calculations can be evaluated by using the Fourier transform and proper coupling of the two center exchange integrals. A numerical integration procedure is then readily rendered to the final expression in which the integrand consists of well known special functions of arguments containing the geometrical arrangement of the nuclear centers and the exponents of the atomic orbitals. A practical procedure was devised for the calculation of a general multi-center molecular integrals coupling arbitrary Slater-type orbitals. Symmetry relations and asymptotic conditions are discussed. Explicit expressions of three-center one-electron nuclear-attraction integrals and four-center two-electron repulsion integrals for STO of principal quantum number n=2 are listed. A few numerical results are given for the purpose of comparison.

Tai, H.↗

Free vibrations of delaminated beams

Free vibration of laminated composite beams is studied. The effect of interply delaminations on natural frequencies and mode shapes is evaluated both analytically and experimentally. The equation of motion and associated boundary conditions are derived for the free vibration of a composite beam with a delamination of arbitrary size and location. A generalized variational principle is used to formulate the equation of motion, taking into account the interlaminar stress concentration at the crack-tips. This is accomplished by introducing a 'crack function' into the beam's compatibility relations. This function has its maximum value at the crack tip and decays exponentially in the longitudinal direction. The rate of exponential decay is determined by a least-square fit with the experimental results. The effect of coupling between longitudinal vibration and bending vibration is considered in the present study. This coupling effect is found to significantly affect the natural frequencies and mode shapes of the delaminated beam.

Shen, M.-H. H.↗

User's manual for CBS3DS, version 1.0

CBS3DS is a computer code written in FORTRAN 77 to compute the backscattering radar cross section of cavity backed apertures in infinite ground plane and slots in thick infinite ground plane. CBS3DS implements the hybrid Finite Element Method (FEM) and Method of Moments (MoM) techniques. This code uses the tetrahedral elements, with vector edge basis functions for FEM in the volume of the cavity/slot and the triangular elements with the basis functions for MoM at the apertures. By virtue of FEM, this code can handle any arbitrarily shaped three-dimensional cavities filled with inhomogeneous lossy materials; due to MoM, the apertures can be of any arbitrary shape. The User's Manual is written to make the user acquainted with the operation of the code. The user is assumed to be familiar with the FORTRAN 77 language and the operating environment of the computer the code is intended to run.

Reddy, C. J.↗

A Trilateration Scheme for Relative Positioning

We introduce a trilateration scheme that evaluates the 3-dimensional (3-D) relative position between a reference spacecraft and a target spacecraft using raw-range measurements from a distance baseline of known locations, which we call “anchors”. The anchors can be antennas of a ground-based network (e.g., Deep Space Network (DSN) or Near Earth Network (NEN) stations), or satellites of a spacebased network (e.g., global positioning system (GPS) or tracking and data relay satellite (TDRS)). We define raw-range as the range that includes all the systematic errors that occur during range measurements. A unique feature of this approach is that accurate relative position is derived from a “differencing function” of raw-range measurements of the reference spacecraft and target spacecraft, thereby eliminating most of the systematic errors, such as media effects, ephemeris errors, instrument delays, clock bias, etc. There can be an arbitrary number of target spacecraft, and relative positioning of target spacecraft with respect to the reference spacecraft can be done simultaneously. In this paper, we first assume an idealized system in which clocks on the reference and target spacecraft are synchronized, with clocks of the anchors synchronized as well. We develop a novel iterative algorithm that computes the relative position of the target spacecraft with respect to the reference spacecraft. We illustrate the relative positioning method using the scenario of a network of three ground stations (i.e., the anchors) at Goldstone, California, USA, Madrid, Spain, and Marlargue, Argentina tracking two spacecraft at geosynchronous orbit distance. We demonstrate that the algorithm converges to submeter accuracy in estimating the relative position, in the presence of random errors and systematic errors in raw-range measurements, and in the presence of angular errors in estimating the pointing vectors between the anchors and the reference spacecraft. Next, we relax the requirement of perfect time synchronization between spacecraft, and show that by using an additional anchor, one can estimate and remove the clock biases between the reference and target spacecraft. We add a ground station at Kourou to the above example of three ground stations of Goldstone, Madrid, and Marlargue, and demonstrate that the updated algorithm also converges to meter-level accuracy (submeter in some cases) in the presence of clock biases in addition to the random errors, systematic errors, and angular errors as shown in the above case. We compare this scheme with a similar trilateration scheme for relative positioning scheme first proposed by Montenbruck in 2002.

Cheung, Kar-Ming↗

Working with Bezier Curves as bases for Functional Expansion Tallies

Functional expansion tallies (FETs) are a powerful tool for getting more information per history from Monte Carlo simulations, but in the past they have been constrained to orthogonal bases. Bezier curves, from computer aided design (CAD), could be well suited for FET due to their ability to assume many arbitrary shapes, but are non-orthogonal. Recent development has made non-orthongal FET possible. The convergence of B ´ezier curve FETs in both polynomial order and number of samples is explored. These bases are well suited for representing normal distributions, and opens the door to possible other CAD derived FET bases.

97 MATHEMATICS AND COMPUTING↗

A defect stream function, law of the wall/wake method for compressible turbulent boundary layers

The application of the defect stream function to the solution of the two-dimensional, compressible boundary layer is examined. A law of the wall/law of the wake formulation for the inner part of the boundary layer is presented which greatly simplifies the computational task near the wall and eliminates the need for an eddy viscosity model in this region. The eddy viscosity model in the outer region is arbitrary. The modified Crocco temperature-velocity relationship is used as a simplification of the differential energy equation. Formulations for both equilibrium and nonequilibrium boundary layers are presented including a constrained zero-order form which significantly reduces the computational workload while retaining the significant physics of the flow. A formulation for primitive variables is also presented. Results are given for the constrained zero-order and second-order equilibrium formulations and are compared with experimental data. A compressible wake function valid near the wall has been developed from the present results.

Barnwell, Richard W.↗

Noise and error analysis and optimization in particle-based kinetic plasma simulations

In this paper we analyze the noise in macro-particle methods used in plasma physics and fluid dynamics, leading to approaches for minimizing the total error, focusing on electrostatic models in one dimension. We begin by describing kernel density estimation for continuous values of the spatial variable x, expressing the kernel in a form in which its shape and width are represented separately. The covariance matrix of the noise in the density is computed, first for uniform true density. The bandwidth of the covariance matrix C(x,y) is related to the width of the kernel. A feature that stands out is the presence of constant negative terms in the elements of the covariance matrix both on and off-diagonal. These negative correlations are related to the fact that the total number of particles is fixed at each time step; they also lead to the property ∫C(x,y)dy = 0. We investigate the effect of these negative correlations on the electric field computed by Gauss's law, finding that the noise in the electric field is related to a process called the Ornstein-Uhlenbeck bridge, leading to a covariance matrix of the electric field with variance significantly reduced relative to that of a Brownian process. For non-constant density, p(x), still with continuous x, we analyze the total error in the density estimation and discuss it in terms of bias-variance optimization (BVO). For some characteristic length l, determined by the density and its second derivative, and kernel width h, having too few particles within h leads to too much variance; for h that is large relative to l, there is too much smoothing of the density. The optimum between these two limits is found by BVO. For kernels of the same width, it is shown that this optimum (minimum) is weakly sensitive to the kernel shape. Next, we repeat the analysis for x discretized on a grid. In this case the charge deposition rule is determined by a particle shape. An important property to be respected in the discrete system is the exact preservation of total charge on the grid; this property is necessary to ensure that the electric field is equal at both ends, consistent with periodic boundary conditions. We find that if the particle shapes satisfy a partition of unity property, the particle charge deposited on the grid is conserved exactly. Further, if the particle shape is expressed as the convolution of a kernel with another kernel that satisfies the partition of unity, then the particle shape obeys the partition of unity. This property holds for kernels of arbitrary width, including widths that are not integer multiples of the grid spacing. Furthermore, we show results relaxing the approximations used to do BVO optimization analytically, by doing numerical computations of the total error as a function of the kernel width, on a grid in x. The comparison between numerical and analytical results shows good agreement over a range of particle shapes. We discuss the practical implications of our results, including the criteria for design and implementation of computationally efficient particle shapes that take advantage of the developed theory.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗