Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “arbitrary choices”

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 109 records · Page 6
All sourcesNASA NTRSDOE OSTI
NASA NTRS1995

A Unified Air-Sea Visualization System: Survey on Gridding Structures

The goal is to develop a Unified Air-Sea Visualization System (UASVS) to enable the rapid fusion of observational, archival, and model data for verification and analysis. To design and develop UASVS, modelers were polled to determine the gridding structures and visualization systems used, and their needs with respect to visual analysis. A basic UASVS requirement is to allow a modeler to explore multiple data sets within a single environment, or to interpolate multiple datasets onto one unified grid. From this survey, the UASVS should be able to visualize 3D scalar/vector fields; render isosurfaces; visualize arbitrary slices of the 3D data; visualize data defined on spectral element grids with the minimum number of interpolation stages; render contours; produce 3D vector plots and streamlines; provide unified visualization of satellite images, observations and model output overlays; display the visualization on a projection of the users choice; implement functions so the user can derive diagnostic values; animate the data to see the time-evolution; animate ocean and atmosphere at different rates; store the record of cursor movement, smooth the path, and animate a window around the moving path; repeatedly start and stop the visual time-stepping; generate VHS tape animations; work on a variety of workstations; and allow visualization across clusters of workstations and scalable high performance computer systems.

Anand, Harsh↗
NASA NTRS2014

Gradient Calculation Methods on Arbitrary Polyhedral Unstructured Meshes for Cell-Centered CFD Solvers

A survey of gradient reconstruction methods for cell-centered data on unstructured meshes is conducted within the scope of accuracy assessment. Formal order of accuracy, as well as error magnitudes for each of the studied methods, are evaluated on a complex mesh of various cell types through consecutive local scaling of an analytical test function. The tests highlighted several gradient operator choices that can consistently achieve 1st order accuracy regardless of cell type and shape. The tests further offered error comparisons for given cell types, leading to the observation that the "ideal" gradient operator choice is not universal. Practical implications of the results are explored via CFD solutions of a 2D inviscid standing vortex, portraying the discretization error properties. A relatively naive, yet largely unexplored, approach of local curvilinear stencil transformation exhibited surprisingly favorable properties

Meshes↗
DOE OSTI2024

Accelerating Multivariate Functional Approximation Computation with Domain Decomposition Techniques⋆

Modeling large datasets through Multivariate Functional Approximations (MFA) provide an elegant way to handle many visualization and scientific analysis workflows. The process necessitates scalable data partitioning methods to compute MFA representations efficiently without compromising the accuracy or continuity of the reconstructed solution. We propose a domain -decomposed method for computing the MFA with B -spline bases, which reduces the total work per task and uses a restricted Additive Schwarz (RAS) method to converge the control point data degrees -of -freedom along subdomain boundaries. We provide an in-depth analysis of the parallel approach with domain decomposition solvers, aiming to minimize local subdomain error residuals and recover high -order continuity at subdomain interfaces with appropriate choices of knot overlaps. The communication cost, determined by the overlap regions in the RAS implementation, is optimized to recover the numerical error profile of the single subdomain case. Our proposed method stands in contrast to previous methods, which typically only recover either C 0 or at best C 1 continuity for arbitrary B -spline degree expansions, or those that require post -processing to blend discontinuities in the reconstructed data. We demonstrate the effectiveness of our approach using analytical and real -world datasets in 1D, 2D, and 3D through both strong and weak scaling studies. The performance results indicate that the overall cost of computing the approximation is directly proportional to the underlying nearest -neighbor communication implementation, and is only weakly dependent on the overlap region size that determines the size of the messages. This finding underscores the efficiency and scalability of our proposed method, making it a promising solution for handling large datasets in scientific workflows.

additive Schwarz solvers↗
DOE OSTI2024

Buffer-layer-controlled nickeline vs zinc-blende/wurtzite-type MnTe growths on c -plane Al 2 O 3 substrates

In the recent past, MnTe has proven to be a crucial component of the intrinsic magnetic topological insulator (IMTI) family [MnTe] m [Bi2Te 3 ] n , which hosts a wide range of magneto-topological properties depending on the choice of m and n. However, bulk crystal growth allows only a few combinations of m and n for these IMTIs due to the strict limitations of the thermodynamic growth conditions. One way to overcome this challenge is to utilize atomic layer-by-layer molecular beam epitaxy (MBE) technique, which allows arbitrary sequences of [MnTe]m and [Bi 2 Te 3 ] n to be formed beyond the thermodynamic limit. For such MBE growth, finding optimal growth templates and conditions for the parent building block, MnTe, is a key requirement. Here, we report that two different hexagonal phases of MnTe - nickeline (NC) and zinc-blende/wurtzite (ZB-WZ) structures, with distinct in-plane lattice constants of 4.20 ± 0.04 Å and 4.39 ± 0.04 Å, respectively - can be selectively grown on c-plane Al 2 O 3 substrates using different buffer layers and growth temperatures. Moreover, we provide the first comparative studies of different MnTe phases using atomic-resolution scanning transmission electron microscopy and show that ZB and WZ-like stacking sequences can easily alternate between the two. Surprisingly, In 2 Se 3 buffer layer, despite its lattice constant (4.02 Å) being closer to that of the NC phase, fosters the ZB-WZ instead, whereas Bi 2 Te 3 , sharing the same lattice constant (4.39 Å) with the ZB-WZ phase, fosters the NC phase. Furthermore, these discoveries suggest that lattice matching is not always the most critical factor determining the preferred phase during epitaxial growth. Overall, this will deepen our understanding of epitaxial growth modes for chalcogenide materials and accelerate progress toward new IMTI phases as well as other magneto-topological applications.

36 MATERIALS SCIENCE↗
DOE OSTI2024

Progress on 3D SRF-based architecture for quantum computing

Superconducting radio frequency (SRF) cavities are excellent choices for storing and manipulating quantum information as quantum d-level systems (qudits) due to their exceptionally long lifetimes and large accessible Hilbert spaces. A common strategy to manipulate the states is to use a nonlinear element like a transmon. We present preliminary experimental results obtained with cavity displacements and selective number dependent arbitrary phase gates for universal qudit control, and its application towards High-energy physics (HEP) simulations and beyond. We discuss the advantages and challenges associated with building a 3D SRF architecture while maintaining long cavity lifetimes in the presence of lossy components. We show how the system coherence properties can be preserved by carefully engineering to minimize the participation of the long coherence modes in different loss channels, while ensuring sufficient quantum controllability. We further discuss the path towards building multi-qudit systems.

Romanenko, Alexander↗
DOE OSTI2021

Time evolution of ML-MCTDH wavefunctions. I. Gauge conditions, basis functions, and singularities

We derive a family of equations-of-motion (EOMs) for evolving multi-layer multiconfiguration time-dependent Hartree (ML-MCTDH) wavefunctions that, unlike the standard ML-MCTDH EOMs, never require the evaluation of the inverse of singular matrices. All members of this family of EOMs make use of alternative static gauge conditions than those used for standard ML-MCTDH. These alternative conditions result in an expansion of the wavefunction in terms of a set of potentially arbitrary orthonormal functions, rather than in terms of a set of non-orthonormal and potentially linearly dependent functions, as is the case for standard ML-MCTDH. We show that the EOMs used in the projector splitting integrator (PSI) and the invariant EOM approaches are two special cases of this family obtained from different choices for the dynamic gauge condition, with the invariant EOMs making use of a choice that introduces potentially unbounded operators into the EOMs. As a consequence, all arguments for the existence of parallelizable integration schemes for the invariant EOMs can also be applied to the PSI EOMs.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
NASA NTRS1981

Two-channel Costas loop tracking performance for UQPSK signals with arbitrary data formats

Previous results on the tracking performance of two-channel Costas-type carrier synchronization loops are generalized and corrected, in order that they may be applied to several mixed-format cases. In particular, the mean-square phase jitter performance of these loops with active arm filters, synchronous or asynchronous symbol clocks, and arbitrary data formats on the two channels is examined. It is demonstrated that for each case, selection of the channel gain ratio, as motivated by the MAP estimation theory, does not guarantee optimum loop tracking performance: in some instances, a conventional single-channel Costas loop would outperform the two-channel version with the MAP choice of gain ratio. It is suggested that the gain ratio be chosen to directly minimize the mean-square phase tracking jitter which is equivalent to minimizing the loop's 'squaring loss'. This can, in some cases, improve the performance measure, although in all cases, the two-channel loop will still outperform the single-channel version.

Simon, M. K.↗
NASA NTRS1991

Design of an essentially non-oscillatory reconstruction procedure on finite-element type meshes

An essentially non-oscillatory reconstruction for functions defined on finite-element type meshes was designed. Two related problems are studied: the interpolation of possibly unsmooth multivariate functions on arbitrary meshes and the reconstruction of a function from its average in the control volumes surrounding the nodes of the mesh. Concerning the first problem, we have studied the behavior of the highest coefficients of the Lagrange interpolation function which may admit discontinuities of locally regular curves. This enables us to choose the best stencil for the interpolation. The choice of the smallest possible number of stencils is addressed. Concerning the reconstruction problem, because of the very nature of the mesh, the only method that may work is the so called reconstruction via deconvolution method. Unfortunately, it is well suited only for regular meshes as we show, but we also show how to overcome this difficulty. The global method has the expected order of accuracy but is conservative up to a high order quadrature formula only. Some numerical examples are given which demonstrate the efficiency of the method.

Abgrall, R.↗
NASA NTRS1990

Optimal expression evaluation for data parallel architectures

A data parallel machine represents an array or other composite data structure by allocating one processor (at least conceptually) per data item. A pointwise operation can be performed between two such arrays in unit time, provided their corresponding elements are allocated in the same processors. If the arrays are not aligned in this fashion, the cost of moving one or both of them is part of the cost of the operation. The choice of where to perform the operation then affects this cost. If an expression with several operands is to be evaluated, there may be many choices of where to perform the intermediate operations. An efficient algorithm is given to find the minimum-cost way to evaluate an expression, for several different data parallel architectures. This algorithm applies to any architecture in which the metric describing the cost of moving an array is robust. This encompasses most of the common data parallel communication architectures, including meshes of arbitrary dimension and hypercubes. Remarks are made on several variations of the problem, some of which are solved and some of which remain open.

Gilbert, John R.↗
DOE OSTI2023

Social network structure and the spread of complex contagions from a population genetics perspective

Ideas, behaviors, and opinions spread through social networks. If the probability of spreading to a new individual is a non-linear function of the fraction of the individuals’ affected neighbors, such a spreading process becomes a “complex contagion”. This non-linearity does not typically appear with physically spreading infections, but instead can emerge when the concept that is spreading is subject to game theoretical considerations (e.g. for choices of strategy or behavior) or psychological effects such as social reinforcement and other forms of peer influence (e.g. for ideas, preferences, or opinions). Here we study how the stochastic dynamics of such complex contagions are affected by the underlying network structure. Motivated by simulations of complex contagions on real social networks, we present a framework for analyzing the statistics of contagions with arbitrary non-linear adoption probabilities based on the mathematical tools of population genetics. The central idea is to use an effective lower-dimensional diffusion process to approximate the statistics of the contagion. This leads to a tradeoff between the effects of ”selection” (microscopic tendencies for an idea to spread or die out), random drift, and network structure. Our framework illustrates intuitively several key properties of complex contagions: stronger community structure and network sparsity can significantly enhance the spread, while broad degree distributions dampen the effect of selection compared to random drift. Finally, we show that some structural features can exhibit critical values that demarcate regimes where global contagions become possible for networks of arbitrary size. Our results draw parallels between the competition of genes in a population and memes in a world of minds and ideas. Our tools provide insight into the spread of information, behaviors, and ideas via social influence, and highlight the role of macroscopic network structure in determining their fate.

59 BASIC BIOLOGICAL SCIENCES↗
NASA NTRS1986

Methods for the solution of radiative transfer equation

To obtain an exact solution of the radiative-transfer equation in media where both absorption and scattering are significant, the usual approach is to use a numerical method. Three methods are known in the literature: invariant imbedding, eigenvalue-eigenfunction, and matrix doubling. This paper examines the practical application of these methods to the problem of emission from an inhomogeneous (Rayleigh) layer, the effects of layer parameters on the stability. It is found that invariant imbedding is most suitable for computing emission from an inhomogeneous layer with a temperature profile but tends to be unstable as the optical thickness of the layer increases beyond 0.5. On the other hand, the matrix-doubling method is stable for arbitrary optical thickness but is not suitable for handling multilayers. The eigenvalue-eigenfunction method is more stable than the invariant imbedding as optical thickness increases up to 2.0. It also permits temperature profile in the layer, but the computation is much more complicated. It is less stable than the matrix-doubling method when optical thickness is larger than 2.0. In general, the choice of a method is dependent on the nature of the problem.

Chen, M. F.↗
NASA NTRS1990

Optimal expression evaluation for data parallel architectures

A data parallel machine represents an array or other composite data structure by allocating one processor per data item. A pointwise operation can be performed between two such arrays in unit time, provided their corresponding elements are allocated in the same processors. If the arrays are not aligned in this fashion, the cost of moving one or both of them is part of the cost of operation. The choice of where to perform the operation then affects this cost. If an expression with several operands is to be evaluated, there may be many choices of where to perform the intermediate operations. An efficient algorithm is given to find the minimum cost way to evaluate an expression, for several different data parallel architectures. The algorithm applies to any architecture in which the metric describing the cost of moving an array has a property called robustness. This encompasses most of the common data parallel communication architectures, including meshes of arbitrary dimension and hypercubes.

Gilbert, J. R.↗
NASA NTRS1991

Optimal expression evaluation for data parallel architectures

A data parallel machine represents an array or other composits data structure by allocating one processor per data item. A pointwise operation can be performed between two such arrays in unit time, provided their corresponding elements are allocated in the same processors. If the arrays are not aligned in this fashion, the cost of moving one or both of them is part of the cost of operation. The choice of where to perform the operation then affects this cost. If an expression with several operands is to be evaluated, there may be many choices of where to perform the intermediate operations. An efficient algorithm is given to find the minimum cost way to evaluate an expression, for several different data parallel architectures. The algorithm applies to any architecture in which the metric describing the cost of moving an array has a property called robustness. This encompasses most of the common data parallel communication architectures, including meshes of arbitrary dimension and hypercubes.

Gilbert, John R.↗
NASA NTRS1992

Prediction of airfoil stall using Navier-Stokes equations in streamline coordinates

A Navier-Stokes procedure to calculate the flow about an airfoil at incidence was developed. The parabolized equations are solved in the streamline coordinates generated for an arbitrary airfoil shape using conformal mapping. A modified k-epsilon turbulence model is applied in the entire domain, but the eddy viscosity in the laminar region is suppressed artificially to simulate the region correctly. The procedure was applied to airfoils at various angles of attack, and the results are quite satisfactory for both laminar and turbulent flows. It is shown that the present choice of the coordinate system reduces the error due to numerical diffusion, and that the lift is accurately predicted for a wide range of incidence.

Choi, D. H.↗
DOE OSTI2020

Fast Automatic Knot Placement Method for Accurate B-spline Curve Fitting

The choice of knot vector has immense influence on the resulting accuracy of a B-spline approximation of a curve. However, despite the significance of this problem and the various solutions that were proposed in the literature, optimizing the number and placement of knots remains a difficult task. This paper presents a novel method for the approximation of a curve by a B-spline of arbitrary order, which automatically determines a knot vector that achieves high approximation quality. Additionally, at the core of our approach is a feature function that characterizes the amount and spatial distribution of geometric details in the input curve by estimating its derivatives. Knots are then selected in such a way as to evenly distribute the feature contents across their intervals. A comparison to the state of the art for a wide variety of curves shows that our method is faster and achieves more accurate reconstruction results, while typically reducing the number of necessary knots.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1981

N-stream approximations to radiative transfer

Schuster's two-stream approximation (1905) is first derived from Chandrasekhar's radiative transfer equation (1950), and then extended to an arbitrary number of streams. The resulting technique for solving the transfer function similar to the discrete ordinate and spherical harmonic methods, is useful for modeling atmospheres with complicated phase functions and moderate optical depths. The resulting n coupled linear differential equations are simple and consume less computer time than other approximations, yet have the same required accuracy. The approximation is also flexible with respect to the choice of patch functions, and no approximations are made on the form of the phase function, other than its expansion into Legendre polynomials. A four-stream approximation is evaluated for a Henyey-Greenstein phase function with an asymmetry factor equal to 0.5.

Acquista, C.↗
NASA NTRS1977

Performance analysis of grazing incidence imaging systems

An exact expression relating the coordinates of a point on the incident ray, a point of reflection from an arbitrary surface, and a point on the reflected ray is derived. The exact relation is then specialized for the case of grazing incidence, and first order and third order systematic analyses are carried out for a single reflective surface and then for a combination of two surfaces. The third order treatment yields a complete set of primary aberrations for single element and two element systems. The importance of a judicious choice for a coordinate system in showing field curvature to clearly be the predominant aberration for a two element system is discussed. The validity of the theory is verified through comparisons with the exact ray trace results for the case of the telescope.

Winkler, C. E.↗
DOE OSTI2021

Twisted bilayer graphene. II. Stable symmetry anomaly

We show that the entire continuous model of twisted bilayer graphene (TBG) (and not just the two active bands) with particle-hole symmetry is anomalous and hence incompatible with lattice models. Previous works [e.g., Z. Song, Z. Wang, W. Shi, G. Li, C. Fang, and B. A. Bernevig, Phys. Rev. Lett. 123, 036401 (2019); J. Ahn, S. Park, and B.-J. Yang, Phys. Rev. X 9, 021013 (2019); H. C. Po, L. Zou, T. Senthil, and A. Vishwanath, Phys. Rev. B 99, 195455 (2019); J. Kang and O. Vafek, Phys. Rev. X 8, 031088 (2018); M. Koshino, N. F. Q. Yuan, T. Koretsune, M. Ochi, K. Kuroki, and L. Fu, Phys. Rev. X 8, 031087 (2018); J. Liu, J. Liu, and X. Dai, Phys. Rev. B 99, 155415 (2019); L. Zou, H. C. Po, A. Vishwanath, and T. Senthil, Phys. Rev. B 98, 085435 (2018)] found that the two flatbands in TBG possess a fragile topology protected by the C 2z T symmetry. Song et al. [Z. Song, Z. Wang, W. Shi, G. Li, C. Fang, and B. A. Bernevig, Phys. Rev. Lett. 123, 036401 (2019)] also pointed out an approximate particle-hole symmetry (P) in the continuous model of TBG. In this paper, we numerically confirm that P is indeed a good approximation for TBG and show that the fragile topology of the two flatbands is enhanced to a P-protected stable topology. This stable topology implies 4l + 2 (l ϵ N) Dirac points between the middle two bands. The P-protected stable topology is robust against arbitrary gap closings between the middle two bands and the other bands. We also show that, remarkably, this P-protected stable topology, as well as the corresponding 4l + 2 Dirac points, cannot be realized in lattice models that preserve both C 2z T and P symmetries. In other words, the continuous model of TBG is anomalous and cannot be realized on lattices. Two other topology related topics, with consequences for the interacting TBG problem, i.e., the choice of Chern band basis in the two flatbands and the perfect metal phase of TBG in the so-called second chiral limit, are also discussed.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗