SEARCH · Engineering Papers
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.
Transonic flows over several bodies of varying complexity including a simple wing-body combination and the Shuttle Orbiter have been modeled with the use of slender body theory. Flows with various angles of attack have been considered. Also some off-body flow calculations were conducted. For attached flows, the calculations predicted the pressure results with good accuracy.
The local momentum theory is based on the instantaneous balance between the fluid momentum and the blade elemental lift at a local station in the rotor rotational plane. Therefore, the theory has the capability of evaluating time wise variations of air loading and induced velocity distributions along a helicopter blade span. Unlike a complex vortex theory, this theory was developed to analyze the instantaneous induced velocity distribution effectively. The boundaries of this theory and a computer program using this theory are discussed. A concept introduced into the theory is the effect of the rotor wake contraction in hovering flight. A comparison of this extended local momentum theory with a prescribed wake vortex theory is also presented. The results indicate that the extended local momentum theory has the capability of achieving a level of accuracy similar to that of the prescribed wake vortex theory over wide range variations of rotor geometrical parameters. It is also shown that the analytical results obtained using either theory are in reasonable agreement with experimental data.
In this followup article to Ducru et al., we establish new results on scattering matrix pole expansions for complex wave numbers in R-matrix theory. In the past, two branches of theoretical formalisms emerged to describe the scattering matrix in nuclear physics: R-matrix theory and pole expansions. The two have been quite isolated from one another. Recently, our study of Brune's alternative parametrization of R-matrix theory has shown the need to extend the scattering matrix (and the underlying R-matrix operators) to complex wave numbers. Two competing ways of doing so have emerged from a historical ambiguity in the definitions of the shift S and penetration P functions: the legacy Lane and Thomas's “force closure” approach versus analytic continuation (which is the standard in mathematical physics). The R-matrix community has not yet come to a consensus as to which to adopt for evaluations in standard nuclear data libraries, such as ENDF. Here, in this article, we argue in favor of analytic continuation of R-matrix operators. We bridge R-matrix theory with the Humblet-Rosenfeld pole expansions, and discover new properties of the Siegert-Humblet radioactive poles and widths, including their invariance properties to changes in channel radii a c . We then show that analytic continuation of R-matrix operators preserves important physical and mathematical properties of the scattering matrix—canceling spurious poles and guaranteeing generalized unitarity—while still being able to close channels below thresholds.
A new understanding (with potential applications to air transportation systems) has emerged in the past five years in the scientific field of networks. This development emerges in large part because we now have a new laboratory for developing theories about complex networks: The Internet. The premise of this new understanding is that most complex networks of interest, both of nature and of human contrivance, exhibit a fundamentally different behavior than thought for over two hundred years under classical graph theory. Classical theory held that networks exhibited random behavior, characterized by normal, (e.g., Gaussian or Poisson) degree distributions of the connectivity between nodes by links. The new understanding turns this idea on its head: networks of interest exhibit scale-free (or small world) degree distributions of connectivity, characterized by power law distributions. The implications of scale-free behavior for air transportation systems include the potential that some behaviors of complex system architectures might be analyzed through relatively simple approximations of local elements of the system. For air transportation applications, this presentation proposes a framework for constructing topologies (architectures) that represent the relationships between mobility, flight operations, aircraft requirements, and airspace capacity, and the related externalities in airspace procedures and architectures. The proposed architectures or topologies may serve as a framework for posing comparative and combinative analyses of performance, cost, security, environmental, and related metrics.
Some results of a new theory of multidimensional complex variables are reported, including analytic functions of a three-dimensional (3-D) complex variable. Three-dimensional complex numbers are defined, including vector properties and rules of multiplication. The necessary conditions for a function of a 3-D variable to be analytic are given and shown to be analogous to the 2-D Cauchy-Riemann equations. A simple example also demonstrates the analogy between the newly defined 3-D complex velocity and 3-D complex potential and the corresponding ordinary complex velocity and complex potential in two dimensions.
BACKGROUND: New methods of R-R interval variability based on fractal scaling and nonlinear dynamics ("chaos theory") may give new insights into heart rate dynamics. The aims of this study were to (1) systematically characterize and quantify the effects of aging from early childhood to advanced age on 24-hour heart rate dynamics in healthy subjects; (2) compare age-related changes in conventional time- and frequency-domain measures with changes in newly derived measures based on fractal scaling and complexity (chaos) theory; and (3) further test the hypothesis that there is loss of complexity and altered fractal scaling of heart rate dynamics with advanced age. METHODS AND RESULTS: The relationship between age and cardiac interbeat (R-R) interval dynamics from childhood to senescence was studied in 114 healthy subjects (age range, 1 to 82 years) by measurement of the slope, beta, of the power-law regression line (log power-log frequency) of R-R interval variability (10(-4) to 10(-2) Hz), approximate entropy (ApEn), short-term (alpha(1)) and intermediate-term (alpha(2)) fractal scaling exponents obtained by detrended fluctuation analysis, and traditional time- and frequency-domain measures from 24-hour ECG recordings. Compared with young adults (<40 years old, n=29), children (<15 years old, n=27) showed similar complexity (ApEn) and fractal correlation properties (alpha(1), alpha(2), beta) of R-R interval dynamics despite lower spectral and time-domain measures. Progressive loss of complexity (decreased ApEn, r=-0.69, P<0.001) and alterations of long-term fractal-like heart rate behavior (increased alpha(2), r=0.63, decreased beta, r=-0.60, P<0.001 for both) were observed thereafter from middle age (40 to 60 years, n=29) to old age (>60 years, n=29). CONCLUSIONS: Cardiac interbeat interval dynamics change markedly from childhood to old age in healthy subjects. Children show complexity and fractal correlation properties of R-R interval time series comparable to those of young adults, despite lower overall heart rate variability. Healthy aging is associated with R-R interval dynamics showing higher regularity and altered fractal scaling consistent with a loss of complex variability.
An implicit difference procedure for the solution of equations for a chemically reacting hypersonic boundary layer is described. Difference forms of arbitrary error order in the x and y coordinate plane were used to derive estimates for discretization error. Computational complexity and time were minimized by the use of this difference method and the iteration of the nonlinear boundary layer equations was regulated by discretization error. Velocity and temperature profiles are presented for Mach 20.14 and Mach 18.5; variables are velocity profiles, temperature profiles, mass flow factor, Stanton number, and friction drag coefficient; three figures include numeric data.
Motivated by NASA's need for high-assurance software, NASA Ames' Amphion project has developed a generic program generation system based on deductive synthesis. Amphion has a number of advantages, such as the ability to develop a new synthesis system simply by writing a declarative domain theory. However, as a practical matter, the validation of the domain theory for such a system is problematic because the link between generated programs and the domain theory is complex. As a result, when generated programs do not behave as expected, it is difficult to isolate the cause, whether it be an incorrect problem specification or an error in the domain theory. This paper describes a tool we are developing that provides formal traceability between specifications and generated code for deductive synthesis systems. It is based on extensive instrumentation of the refutation-based theorem prover used to synthesize programs. It takes augmented proof structures and abstracts them to provide explanations of the relation between a specification, a domain theory, and synthesized code. In generating these explanations, the tool exploits the structure of Amphion domain theories, so the end user is not confronted with the intricacies of raw proof traces. This tool is crucial for the validation of domain theories as well as being important in everyday use of the code synthesis system. It plays an important role in validation because when generated programs exhibit incorrect behavior, it provides the links that can be traced to identify errors in specifications or domain theory. It plays an important role in the everyday use of the synthesis system by explaining to users what parts of a specification or of the domain theory contribute to what pieces of a generated program. Comments are inserted into the synthesized code that document these explanations.
A hierarchy of human activities is derived by analyzing automobile driving in general terms. A structural description leads to a block diagram and a time-sharing computer analogy. The range of applicability of existing mathematical models is considered with respect to the hierarchy of human activities in actual complex tasks. Other mathematical tools so far not often applied to man machine systems are also discussed. The mathematical descriptions at least briefly considered here include utility, estimation, control, queueing, and fuzzy set theory as well as artificial intelligence techniques. Some thoughts are given as to how these methods might be integrated and how further work might be pursued.
We define predictive states and predictive complexity for quantum systems composed of distinct subsystems. This complexity is a generalization of entanglement entropy. It is inspired by the statistical or forecasting complexity of predictive state analysis of stochastic and complex systems theory but is intrinsically quantum. Predictive states of a subsystem are formed by equivalence classes of state vectors in the exterior Hilbert space that effectively predict the same future behavior of that subsystem for some time. As an illustrative example, we present calculations in the dynamics of an isotropic Heisenberg model spin chain and show that, in comparison to the entanglement entropy, the predictive complexity better signifies dynamically important events, such as magnon collisions. It can also serve as a local order parameter that can distinguish long and short range entanglement.
Kostka, Littlewood-Richardson, Plethysm, and Kronecker coefficients are the multiplicities of irreducible representations in the decomposition of representations of the symmetric group that play an important role in representation theory, geometric complexity, and algebraic combinatorics. We give quantum algorithms for computing these coefficients whenever the ratio of dimensions of the representations is polynomial. We show that there is an efficient classical algorithm for computing the Kostka numbers under this restriction and conjecture the existence of an analogous algorithm for the Littlewood-Richardson coefficients. We argue why such classical algorithm does not straightforwardly work for the Plethysm and Kronecker coefficients and conjecture that our quantum algorithms lead to superpolynomial speedups. The conjecture about Kronecker coefficients was disproved by Panova [Polynomial time classical versus quantum algorithms for representation theoretic multiplicities, arXiv:2502.20253] with a classical algorithm which, if optimal, points to a 𝒪(𝑛 4+2𝑘 ) vs $\tilde{Ω}$(𝑛 4𝑘 2 +1 ) polynomial gap in quantum vs classical computational complexity for an integer parameter 𝑘.
Here, we present a unified framework for constructing spectrally equivalent low-order-refined discretizations for the high-order finite element de Rham complex. This theory covers diffusion problems in H 1 , H(curl), and H(div) and is based on combining a low-order discretization posed on a refined mesh with a high-order basis for Nédélec and Raviart–Thomas elements that makes use of the concept of polynomial histopolation (polynomial fitting using prescribed mean values over certain regions). This spectral equivalence, coupled with algebraic multigrid methods constructed using the low-order discretization, results in highly scalable matrix-free preconditioners for high-order finite element problems in the full de Rham complex. Additionally, a new lowest-order (piecewise constant) preconditioner is developed for high-order interior penalty discontinuous Galerkin (DG) discretizations, for which spectral equivalence results and convergence proofs for algebraic multigrid methods are provided. In all cases, the spectral equivalence results are independent of polynomial degree and mesh size; for DG methods, they are also independent of the penalty parameter. These new solvers are flexible and easy to use; any “black-box” preconditioner for low-order problems can be used to create an effective and efficient preconditioner for the corresponding high-order problem. A number of numerical experiments are presented, based on an implementation in the finite element library MFEM. A range of challenging three-dimensional problems are used to corroborate the theoretical properties and demonstrate the flexibility and scalability of the method.
Density functional theory (DFT) and electron propagator theory (EPT) calculations were performed to study ground and excited electronic structures of alkali-metal (M) coordinated 9-crown-3, 24-crown-8, [2.1.1]cryptand, o-Me 2 -1.1.1, and 3 6 Adamanzane complexes. Each complex bears an expanded electron in the periphery and occupies diffuse 1p-, 1d-, 1f-type molecular orbitals (or superatomic 1P, 1D, 1F orbitals) in excited electronic states. The calculated superatomic shell model of the M(9-crown-3) 2 is 1S, 1P, 1D, 1F, 2S, 2P, 2D, 1G and it is held by all other complexes up to the studied 1F level. Due to the highly diffuse nature of the electron, the ionization energies of these complexes are significantly lower (1.6–2.0 eV) and hence these complexes belong to the superalkali category. Further, the ab initio EPT ionization energy and the excitation energies of the Li(9-crown-3) 2 were used to evaluate DFT errors associated with a series of exchange correlation functionals that span multiple rungs of Jacob's ladder (i.e., GGA, meta-GGA, global GGA hybrid, meta-GGA hybrid, range-separated hybrid, double-hybrid). Among these, the best performing functional is the range-separated hybrid CAM-B3LYP and the errors are within 6% of high-level ab initio EPT results. The accuracy of CAM-B3LYP is indeed transferable to similar complexes and hence the findings are expected to accelerate the progression of studies of Rydberg-type systems.
Lattice ℤ 3 theories with complex actions share many key features with finite- density QCD including a sign problem and $\mathcal{CK}$ symmetry. Complex ℤ 3 spin and gauge models exhibit a generalized Kramers-Wannier duality mapping them onto chiral ℤ 3 spin and gauge models, which are simulatable with standard lattice methods in large regions of parameter space. The Migdal-Kadanoff real-space renormalization group (RG) preserves this duality, and we use it to compute the approximate phase diagram of both spin and gauge ℤ 3 models in dimensions one through four. Chiral ℤ 3 spin models are known to exhibit a Devil’s Flower phase structure, with inhomogeneous phases that can be thought of as ℤ 3 analogues of chiral spirals. Out of the large class of models we study, we find that only chiral spin models and their duals have a Devil’s Flower structure with an infinite set of inhomogeneous phases, a result we attribute to Elitzur’s theorem. We also find that different forms of the Migdal-Kadanoff RG produce different numbers of phases, a violation of the expectation for universal behavior from a real-space RG. We discuss extensions of our work to ℤ N models, SU(N) models and nonzero temperature.
This is a review article concerning the accuracy of DFT methods for noncovalent interactions.
Nano-additive aggregation, limited performance, and unclear modification mechanisms are the main obstacles in developing nanocomposite anion exchange membranes (AEMs). In this work, for the first time, an effective and highly stable Poly(vinyl alcohol) (PVA)-based AEMs with dispersive Cu(OH)$_2$ nanoclusters (Cu-AEMs) are prepared by a simple and eco-friendly three-step method: ‘CuCl$_2$ doping-casting-KOH immersing’. The doped Cu$^{2+}$ ions chemically combine with OH- ions to form anionic conductive Cu(OH)2 nanoclusters intermediated by attaching resins. The PVA skeletons wrap around Cu(OH)$_2$ while the hydroxyl groups expose to bulk water, forming Cu(OH)$_2$-PVA complex, which avoids nano-additive aggregation, increases anionic channels, and strengthens additive-matrix connection. A direct borohydride fuel cell using Cu-AEM with 0.56 wt % CuCl$_2$ possess the highest power density of 403.3 mW cm$^{-2}$ at 60 °C and a life span of over 200 h. The high-performance and durability come from the unique structure of Cu(OH)$_2$ nanoclusters-PVA complex. ‘Vehicle’ theory is considered to be the dominant mechanism for enhancing such nanocomposite Cu-AEMs. This work demonstrates a new concept for preparing the stable AEMs toward high-performance fuel cells. The synthetic chemistry involved can be broadly extended for fabricating versatile AEMs.
Herein we address the increasing complexity of scientific workflows in the context of high-performance computing (HPC) and their associated need for robust, adaptable, and flexible computational support systems. We explore five key trends as well as future challenges and opportunities for scientific workflows and HPC technologies.
Adaptive mesh refinement (AMR) is an important method that enables many mesh-based applications to run at effectively higher resolution within limited computing resources by allowing high resolution only where really needed. This advantage comes at a cost, however: greater complexity in the mesh management machinery and challenges with load distribution. With the current trend of increasing heterogeneity in hardware architecture, AMR presents an orthogonal axis of complexity. Additionally, the usual techniques, such as asynchronous communication and hierarchy management for parallelism and memory that are necessary to obtain reasonable performance are very challenging to reason about with AMR. Different groups working with AMR are bringing different approaches to this challenge. Here, we examine the design choices of several AMR codes and also the degree to which demands placed on them by their users influence these choices.