SEARCH · Search NASA

Results for “algebraic specification”

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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 235 records · Page 13

All sources NASA NTRS DOE OSTI

DOE OSTI2022

Planar, longitudinal, compressive waves in solids: Thermodynamics and uniaxial strain restrictions

A new tri-axial pressure-based constitutive expression has been found using Cauchy's stress tensor. This stress state emphasizes pressure and shear stress. The description is a pressure plus an effective shear stress allowing for a constitutive law based on atomic solid-state phase changes in crystalline cells due to pressure plus shear-based dislocation motion commonly associated with plasticity. Pressure has a new role in the material's constitutive response as it is separated from plasticity. The thermo-mechanical system describes third-order Gibbs’ expressions without specific volume restrictions placed upon the material. Isothermally, the ratio of heat to shear work in elastic copper is shown to approach zero at a very low temperature and become larger than one as temperature approaches melting. Wave compression models investigated are elastic and plastic: in fully elastic materials, the planar wave is restricted by Poisson's effect although plastic shear changes this constraint. Plastic deformation, dominated by dissipative shear stresses in uniaxial strain, heats the material while excluding phase changes from hydrostatic pressures. The material properties per se across Hugoniot shocks are described with entropy concepts. Shock waves are exceedingly complex since the constitutive laws are linked at extreme temperatures, pressures, and shear stresses. Isothermal, isentropic, isochoric, and iso-shear conditions are used throughout with Jacobian algebra.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

DOE OSTI2021

Self-similar Reynolds-averaged mechanical–scalar turbulence models for Rayleigh–Taylor, Richtmyer–Meshkov, and Kelvin–Helmholtz instability-induced mixing in the small Atwood number limit

Analytical self-similar solutions to two-, three-, and four-equation Reynolds-averaged mechanical–scalar turbulence models describing incompressible turbulent Rayleigh–Taylor, Richtmyer–Meshkov, and Kelvin–Helmholtz instability-induced mixing in planar geometry are derived in the small Atwood number (Boussinesq) limit. The models are based on the turbulent kinetic energy K and its dissipation rate ε, together with the scalar (heavy-fluid mass fraction) variance S and its dissipation rate Χ modeled either differentially or algebraically. The models allow for a simultaneous description of mechanical and scalar mixing, i.e., mixing layer growth and molecular mixing, respectively. Mixing layer growth parameters and other physical observables relevant to each instability are obtained explicitly as functions of the model coefficients. The turbulent fields are also expressed in terms of the model coefficients, with their temporal power-law scalings obtained by requiring that the self-similar equations are explicitly time-independent. The model calibration methodology is described and discussed. Expressions for a subset of the various physical observables are used to calibrate each of the two-, three-, and four-equation models, such that the self-similar solutions are consistent with experimental and numerical simulation data corresponding to these values of the observables and to specific canonical Rayleigh–Taylor, Richtmyer–Meshkov, and Kelvin–Helmholtz turbulent flows. A calibrated four-equation model is then used to reconstruct the mean and turbulent fields, and late-time turbulent equation budgets for each instability-induced flow across the mixing layer. The reference solutions derived here can provide systematic calibrations and better understanding of mechanical–scalar turbulence models and their predictions for instability-induced turbulent mixing in the very large Reynolds number limit.

42 ENGINEERING↗

NASA NTRS1985

Predictions of transonic separated flow with an eddy-viscosity/Reynolds-shear-stress closure model

In previous work, a new turbulence-closure model was specifically developed for two-dimensional turbulent boundary layers subjected to strong, adverse-pressure gradients and the attendant separation. This closure model was shown to perform well, but the inverse, boundary-layer calculations used in evaluating the model were not truly predictive since the mass-flux parameter distribution obtained from the experimental data had to be specified. The objective of this study was to evaluate this closure model for a series of strong, transonic, inviscid-viscous interactions with varying degrees of separation using a fully predictive calculation method based on the Reynolds-averaged, Navier-Stokes equations. Calculated results are compared with experimental results and are shown to be in excellent agreement, even for the interactions with massive separation. This closure model has the very favorable property of requiring little more computational effort than equilibrium, algebraic models.

Johnson, D. A.↗

NASA NTRS2011

Engineering and Scientific Applications: Using MatLab(Registered Trademark) for Data Processing and Visualization

MatLab(TradeMark)(MATrix LABoratory) is a numerical computation and simulation tool that is used by thousands Scientists and Engineers in many countries. MatLab does purely numerical calculations, which can be used as a glorified calculator or interpreter programming language; its real strength is in matrix manipulations. Computer algebra functionalities are achieved within the MatLab environment using "symbolic" toolbox. This feature is similar to computer algebra programs, provided by Maple or Mathematica to calculate with mathematical equations using symbolic operations. MatLab in its interpreter programming language form (command interface) is similar with well known programming languages such as C/C++, support data structures and cell arrays to define classes in object oriented programming. As such, MatLab is equipped with most of the essential constructs of a higher programming language. MatLab is packaged with an editor and debugging functionality useful to perform analysis of large MatLab programs and find errors. We believe there are many ways to approach real-world problems; prescribed methods to ensure foregoing solutions are incorporated in design and analysis of data processing and visualization can benefit engineers and scientist in gaining wider insight in actual implementation of their perspective experiments. This presentation will focus on data processing and visualizations aspects of engineering and scientific applications. Specifically, it will discuss methods and techniques to perform intermediate-level data processing covering engineering and scientific problems. MatLab programming techniques including reading various data files formats to produce customized publication-quality graphics, importing engineering and/or scientific data, organizing data in tabular format, exporting data to be used by other software programs such as Microsoft Excel, data presentation and visualization will be discussed.

Sen, Syamal K.↗

DOE OSTI2023

Quadratic pseudospectrum for identifying localized states

Here we examine the utility of the quadratic pseudospectrum for understanding and detecting states that are somewhat localized in position and energy, in particular, in the context of condensed matter physics. Specifically, the quadratic pseudospectrum represents a method for approaching systems with incompatible observables {A j |1 ≤ j ≤ d} as it minimizes collectively the errors $\parallel$A j v - λ j v$\parallel$ while defining a joint approximate spectrum of incompatible observables. Moreover, we derive an important estimate relating the Clifford and quadratic pseudospectra. Finally, we prove that the quadratic pseudospectrum is local and derive the bounds on the errors that are incurred by truncating the system in the vicinity of where the pseudospectrum is being calculated.

97 MATHEMATICS AND COMPUTING↗

NASA NTRS2011

Engineering and Scientific Applications: Using MatLab(Registered Trademark) for Data Processing and Visualization

MatLab(R) (MATrix LABoratory) is a numerical computation and simulation tool that is used by thousands Scientists and Engineers in many cou ntries. MatLab does purely numerical calculations, which can be used as a glorified calculator or interpreter programming language; its re al strength is in matrix manipulations. Computer algebra functionalities are achieved within the MatLab environment using "symbolic" toolbo x. This feature is similar to computer algebra programs, provided by Maple or Mathematica to calculate with mathematical equations using s ymbolic operations. MatLab in its interpreter programming language fo rm (command interface) is similar with well known programming languag es such as C/C++, support data structures and cell arrays to define c lasses in object oriented programming. As such, MatLab is equipped with most ofthe essential constructs of a higher programming language. M atLab is packaged with an editor and debugging functionality useful t o perform analysis of large MatLab programs and find errors. We belie ve there are many ways to approach real-world problems; prescribed methods to ensure foregoing solutions are incorporated in design and ana lysis of data processing and visualization can benefit engineers and scientist in gaining wider insight in actual implementation of their perspective experiments. This presentation will focus on data processing and visualizations aspects of engineering and scientific applicati ons. Specifically, it will discuss methods and techniques to perform intermediate-level data processing covering engineering and scientifi c problems. MatLab programming techniques including reading various data files formats to produce customized publication-quality graphics, importing engineering and/or scientific data, organizing data in tabu lar format, exporting data to be used by other software programs such as Microsoft Excel, data presentation and visualization will be discussed. The presentation will emphasize creating practIcal scripts (pro grams) that extend the basic features of MatLab TOPICS mclude (1) Ma trix and vector analysis and manipulations (2) Mathematical functions (3) Symbolic calculations & functions (4) Import/export data files (5) Program lOgic and flow control (6) Writing function and passing parameters (7) Test application programs

Sen, Syamal K.↗

NASA NTRS1993

Convection equation modeling: A non-iterative direct matrix solution algorithm for use with SINDA

The determination of the boundary conditions for a component-level analysis, applying discrete finite element and finite difference modeling techniques often requires an analysis of complex coupled phenomenon that cannot be described algebraically. For example, an analysis of the temperature field of a coldplate surface with an integral fluid loop requires a solution to the parabolic heat equation and also requires the boundary conditions that describe the local fluid temperature. However, the local fluid temperature is described by a convection equation that can only be solved with the knowledge of the locally-coupled coldplate temperatures. Generally speaking, it is not computationally efficient, and sometimes, not even possible to perform a direct, coupled phenomenon analysis of the component-level and boundary condition models within a single analysis code. An alternative is to perform a disjoint analysis, but transmit the necessary information between models during the simulation to provide an indirect coupling. For this approach to be effective, the component-level model retains full detail while the boundary condition model is simplified to provide a fast, first-order prediction of the phenomenon in question. Specifically for the present study, the coldplate structure is analyzed with a discrete, numerical model (SINDA) while the fluid loop convection equation is analyzed with a discrete, analytical model (direct matrix solution). This indirect coupling allows a satisfactory prediction of the boundary condition, while not subjugating the overall computational efficiency of the component-level analysis. In the present study a discussion of the complete analysis of the derivation and direct matrix solution algorithm of the convection equation is presented. Discretization is analyzed and discussed to extend of solution accuracy, stability and computation speed. Case studies considering a pulsed and harmonic inlet disturbance to the fluid loop are analyzed to assist in the discussion of numerical dissipation and accuracy. In addition, the issues of code melding or integration with standard class solvers such as SINDA are discussed to advise the user of the potential problems to be encountered.

Schrage, Dean S.↗

DOE OSTI2021

Theory of Trotter Error with Commutator Scaling

The Lie-Trotter formula, together with its higher-order generalizations, provides a simple approach to decomposing the exponential of a sum of operators. Despite significant effort, the error scaling of such product formulas remains poorly understood. We develop a theory of Trotter error that overcomes the limitations of truncating the Baker-Campbell-Hausdorff expansion. Our analysis directly exploits the commutativity of operator summands, producing tighter error bounds for both real- and imaginary-time evolutions. Whereas previous work achieves similar goals for systems with geometric locality or Lie-algebraic structure, our approach holds in general. We give a host of improved algorithms for digital quantum simulation and quantum Monte Carlo methods, nearly matching or even outperforming the best previous results. Our applications include: (i) a simulation of second-quantized plane-wave electronic structure, nearly matching the interaction-picture algorithm of Low and Wiebe; (ii) a simulation of $k$-local Hamiltonians almost with induced one-norm scaling, faster than the qubitization algorithm of Low and Chuang; (iii) a simulation of rapidly decaying power-law interactions, outperforming the Lieb-Robinson-based approach of Tran et al.; (iv) a hybrid simulation of clustered Hamiltonians, dramatically improving the result of Peng, Harrow, Ozols, and Wu; and (v) quantum Monte Carlo simulations of the transverse field Ising model and quantum ferromagnets, tightening previous analyses of Bravyi and Gosset. We obtain further speedups using the fact that product formulas can preserve the locality of the simulated system. Specifically, we show that local observables can be simulated with complexity independent of the system size for power-law interacting systems, which implies a Lieb-Robinson bound nearly matching a recent result of Tran et al. Our analysis reproduces known tight bounds for first- and second-order formulas. We further investigate the tightness of our bounds for higher-order formulas. For quantum simulation of a one-dimensional Heisenberg model with an even-odd ordering of terms, our result overestimates the complexity by only a factor of $5$. Our bound is also close to tight for power-law interactions and other orderings of terms. This suggests that our theory can accurately characterize Trotter error in terms of both the asymptotic scaling and the constant prefactor.

quantum computing, numerical analysis↗

DOE OSTI2022

An aggregation-based nonlinear multigrid solver for two-phase flow and transport in porous media

A nonlinear multigrid solver for two-phase flow and transport in a mixed fractional-flow velocity-pressure-saturation formulation is proposed. The solver, which is under the framework of the full approximation scheme (FAS), extends our previous work on nonlinear multigrid for heterogeneous diffusion problems. The coarse spaces in the multigrid hierarchy are constructed by first aggregating degrees of freedom, and then solving some local flow problems. The mixed formulation and the choice of coarse spaces allow us to assemble the coarse problems without visiting finer levels during the solving phase, which is crucial for the scalability of multigrid methods. Specifically, a natural generalization of the upwind flux can be evaluated directly on coarse levels using the precomputed coarse flux basis vectors. We find that the resulting solver is applicable to problems discretized on general unstructured grids. The performance of the proposed nonlinear multigrid solver in comparison with the standard single level Newton's method is demonstrated through challenging numerical examples. It is observed that the proposed solver is robust for highly nonlinear problems and clearly outperforms Newton's method in the case of high Courant-Friedrichs-Lewy (CFL) numbers.

58 GEOSCIENCES↗

DOE OSTI2021

Topological data analysis of task-based fMRI data from experiments on schizophrenia

We use methods from computational algebraic topology to study functional brain networks, in which nodes represent brain regions and weighted edges represent similarity of fMRI time series from each region. With these tools, which allow one to characterize topological invariants such as loops in high-dimensional data, we are able to gain understanding into low-dimensional structures in networks in a way that complements traditional approaches based on pairwise interactions. In the present paper, we analyze networks constructed from task-based fMRI data from schizophrenia patients, healthy controls, and healthy siblings of schizophrenia patients using persistent homology, which allows us to explore the persistence of topological structures such as loops at different scales in the networks. We use persistence landscapes, persistence images, and Betti curves to create output summaries from our persistent-homology calculations, and we study the persistence landscapes and images using k-means clustering and community detection. Based on our analysis of persistence landscapes, we find that the members of the sibling cohort have topological features (specifically, their 1-dimensional loops) that are distinct from the other two cohorts. From the persistence images, we are able to distinguish all three subject groups and to determine the brain regions in the loops (with four or more edges) that allow us to make these distinctions.

60 APPLIED LIFE SCIENCES↗

DOE OSTI2025

String membrane nets from higher-form gauging: An alternate route to 𝑝-string condensation

We present a new perspective on the $p$-string condensation procedure for constructing 3+1D fracton phases by implementing this process via the gauging of higher-form symmetries. Specifically, we show that gauging a 1-form symmetry in 3+1D that is generated by Abelian anyons in isotropic stacks of 2+1D topological orders naturally results in a 3+1D $p$-string condensed phase, providing a controlled non-perturbative construction that realizes fracton orders. This approach clarifies the symmetry principles underlying $p$-string condensation and generalizes the familiar connection between anyon condensation and one-form gauging in two spatial dimensions. We demonstrate this correspondence explicitly in both field theories and lattice models: in field theory, we derive the foliated field theory description of the $\mathbb{Z}_N$ X-Cube model by gauging a higher-form symmetry in stacks of 2+1D $\mathbb{Z}_N$ gauge theories; on the lattice, we show how gauging a diagonal 1-form symmetry in isotropic stacks of $G$-graded string-net models leads to string-membrane-nets hosting restricted mobility excitations. This perspective naturally generalizes to spatial dimensions $d \geq 2$ and provides a step towards building an algebraic theory of $p$-string condensation.

Anyons↗

NASA NTRS1993

A critical analysis of the accuracy of several numerical techniques for combustion kinetic rate equations

A detailed analysis of the accuracy of several techniques recently developed for integrating stiff ordinary differential equations is presented. The techniques include two general-purpose codes EPISODE and LSODE developed for an arbitrary system of ordinary differential equations, and three specialized codes CHEMEQ, CREK1D, and GCKP4 developed specifically to solve chemical kinetic rate equations. The accuracy study is made by application of these codes to two practical combustion kinetics problems. Both problems describe adiabatic, homogeneous, gas-phase chemical reactions at constant pressure, and include all three combustion regimes: induction, heat release, and equilibration. To illustrate the error variation in the different combustion regimes the species are divided into three types (reactants, intermediates, and products), and error versus time plots are presented for each species type and the temperature. These plots show that CHEMEQ is the most accurate code during induction and early heat release. During late heat release and equilibration, however, the other codes are more accurate. A single global quantity, a mean integrated root-mean-square error, that measures the average error incurred in solving the complete problem is used to compare the accuracy of the codes. Among the codes examined, LSODE is the most accurate for solving chemical kinetics problems. It is also the most efficient code, in the sense that it requires the least computational work to attain a specified accuracy level. An important finding is that use of the algebraic enthalpy conservation equation to compute the temperature can be more accurate and efficient than integrating the temperature differential equation.

Radhadrishnan, Krishnan↗

DOE OSTI2022

Krylov subspace recycling for evolving structures

Krylov subspace recycling is a powerful tool when solving a long series of large, sparse linear systems that change only slowly over time. In PDE constrained shape optimization, these series appear naturally, as typically hundreds or thousands of optimization steps are needed with only small changes in the geometry. In this setting, however, applying Krylov subspace recycling can be a difficult task. As the geometry evolves, in general, so does the finite element mesh defined on or representing this geometry, including the numbers of nodes and elements and element connectivity. This is especially the case if re-meshing techniques are used. As a result, the number of algebraic degrees of freedom in the system changes, and in general the linear system matrices resulting from the finite element discretization change size from one optimization step to the next. Changes in the mesh connectivity also lead to structural changes in the matrices. In the case of re-meshing, even if the geometry changes only a little, the corresponding mesh might differ substantially from the previous one. Obviously, this prevents any straightforward mapping of the approximate invariant subspace of the linear system matrix (the focus of recycling in this work) from one optimization step to the next; similar problems arise for other selected subspaces. In this paper, we present an algorithm to map an approximate invariant subspace of the linear system matrix for the previous optimization step to an approximate invariant subspace of the linear system matrix for the current optimization step, for general meshes. This is achieved by exploiting the map from coefficient vectors to finite element functions on the mesh, combined with interpolation or approximation of functions on the finite element mesh. We demonstrate the effectiveness of our approach numerically with several proof of concept studies for a specific meshing technique.

42 ENGINEERING↗

DOE OSTI2023

Quantum simulations of SO(5) many-fermion systems using qudits

The structure and dynamics of many-body systems are the result of a delicate interplay between underlying interactions. Fermionic pairing, for example, plays a central role in various physical systems, ranging from condensed matter to nuclear systems, where it can lead to collective phenomena such as superconductivity and superfluidity. In atomic nuclei, the interplay between pairing and particle-hole interactions leads to a high degree of complexity and intricate entanglement structures. Despite this apparent complexity, symmetries emerge and manifest themselves in observable regular patterns. These symmetries and their breakings have long been used to determine relevant degrees of freedom and simplify classical descriptions of many-body systems. Here, this work explores the potential utility of quantum computers with arrays of qudits in simulating interacting fermionic systems, when the qudits can naturally map the relevant degrees of freedom determined by an underlying symmetry group. The Agassi model of fermions interacting via particle-hole and pairing interactions is based on an underlying so(5) algebra. Such systems can intuitively be partitioned into pairs of modes with five basis states, which thus naturally map to arrays of d = 5 qudits (qu5its). Classical noiseless simulations of the time evolution of systems with up to twelve qu5its are performed, by implementing quantum circuits that are developed herein, using PYTHON codes invoking Google's CIRQ software. The resource requirements of the qu5it circuits are analyzed and compared with two different mappings to qubit systems: a physics-aware Jordan-Wigner mapping requiring four qubits per mode pair and a state-to-state mapping requiring three qubits per mode pair. While the dimensionality of Hilbert spaces in mappings to qu5it systems are less than those for the corresponding qubit systems, the number of entangling operations, depending on the available hardware, can either be greater or smaller than for the physics-aware Jordan-Wigner mapping. The state-to-state mapping, while having a smaller Hilbert space than Jordan-Wigner mappings, appears to be the least efficient in gate counts. Further, a previously unknown sign problem has been identified from Trotterization errors in time evolving high-energy excitations. There appear to be advantages in employing quantum computers with arrays of qudits to perform simulations of many-body dynamics that exploit the role of underlying symmetries, specifically in lowering the required quantum resources and in reducing anticipated errors that take the simulation out of the physical space. If the necessary entangling gates are not directly supported by the hardware, physics-aware mappings to qubits may, however, be advantageous for other aspects.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

DOE OSTI2024

Coupling and recoupling coefficients for Wigner’s U(4) supermultiplet symmetry

A novel procedure for evaluating Wigner coupling coefficients and Racah recoupling coefficients for U(4) in two group–subgroup chains is presented. The canonical U(4) > U(3) > U(2) > U(1) coupling and recoupling coefficients are applicable to any system that possesses U(4) symmetry, while the physical U(4) coupling coefficients are more specific to nuclear structure studies that utilize Wigner’s supermultiplet symmetry concept. The procedure that is proposed sidesteps the use of binomial coefficients and alternating sum series and consequently enables fast and accurate computation of any and all U(4)-underpinned features. The inner multiplicity of a (S, T) pair within a single U(4) > SU S (2) Ⓧ SU T (2) irreducible representation is obtained from the dimension of the null space of the SU(2) raising generators, while the resolution for the outer multiplicity follows from the work of Alex et al. on U(N) . It is anticipated that a C++ library will ultimately be available for determining generic coupling and recoupling coefficients associated with both the canonical and the physical group–subgroup chains of U(4).

Cross-Coupling Reaction↗

DOE OSTI2024

A Performance and Energy Study of GPU-Resident Preconditioners for Conjugate Gradient Solvers: In the Context of Existing and Novel Approaches

Optimizing a particular subprogram out of the set of Basic (sparse) Linear Algebra Subprograms (BLAS) for a given architecture is a common topic of research. In applications, however, these BLAS functions rarely appear in isolation; usually, many of them are used together, in various combinations and with varying inputs. As the need to solve a large, sparse linear system is ubiquitous throughout HPC applications, linear solvers constitute a realistic, sufficiently complex and well-defined representative use case for composite BLAS routines. To this end, based on a representative set of matrices drawn from a diverse set of fields, we present a framework to study, from the performance and energy perspective, the efficacy of GPU- resident parallel Conjugate Gradient (CG) linear solver with different preconditioner options, including Gauss-Seidel, Jacobi, and incomplete Cholesky. We also propose a novel GPU-based preconditioner, in which the triangular solves are approximated by an iterative process. The development of this preconditioner was motivated by solving large graph Laplacian linear systems, for which the existing preconditioners either perform slow on GPU-based platforms or are not applicable. We compare the performance of these preconditioners on different hardware accelerator architectures, i.e., AMD MI250X, MI100, Nvidia A100, V100, and Jetson. Our experiments reveal performance trade-offs and provide information on how to select the best strategy for the given linear system, dictated by its properties, and the platform of interest. We demonstrate the application of our novel preconditioner for solving CG and graph Laplacian systems. Overall, the framework can be utilized as a benchmark to guide informed decisions in choosing a specific preconditioner, i.e., whether it is better to rely on the performance of a triangular solver or on the performance of sparse matrix-vector product. Finally, by considering power consumption to solve the linear systems, we report the energy footprint for the solvers.

Preconditioned Conjugate Gradient, GPUs, iterative↗

NASA NTRS1999

Multi-Body Analysis of the 1/5 Scale Wind Tunnel Model of the V-22 Tiltrotor

The paper presents a multi-body analysis of the 1/5 scale wind tunnel model of the V-22 tiltrotor, the Wing and Rotor Aeroelastic Testing System (WRATS), currently tested at NASA Langley Research Center. An original multi-body formulation has been developed at the Dipartimento di Ingegneria Aerospaziale of the Politecnico di Milano, Italy. It is based on the direct writing of the equilibrium equations of independent rigid bodies, connected by kinematic constraints that result in the addition of algebraic constraint equations, and by dynamic constraints, that directly contribute to the equilibrium equations. The formulation has been extended to the simultaneous solution of interdisciplinary problems by modeling electric and hydraulic networks, for aeroservoelastic problems. The code has been tailored to the modeling of rotorcrafts while preserving a complete generality. A family of aerodynamic elements has been introduced to model high aspect aerodynamic surfaces, based on the strip theory, with quasi-steady aerodynamic coefficients, compressibility, post-stall interpolation of experimental data, dynamic stall modeling, and radial flow drag. Different models for the induced velocity of the rotor can be used, from uniform velocity to dynamic in flow. A complete dynamic and aeroelastic analysis of the model of the V-22 tiltrotor has been performed, to assess the validity of the formulation and to exploit the unique features of multi-body analysis with respect to conventional comprehensive rotorcraft codes; These are the ability to model the exact kinematics of mechanical systems, and the possibility to simulate unusual maneuvers and unusual flight conditions, that are particular to the tiltrotor, e.g. the conversion maneuver. A complete modal validation of the analytical model has been performed, to assess the ability to reproduce the correct dynamics of the system with a relatively coarse beam model of the semispan wing, pylon and rotor. Particular care has been used to model the kinematics of the gimbal joint, that characterizes the rotor hub, and of the control system, consisting in the entire swashplate mechanism. The kinematics of the fixed and the rotating plates have been modeled, with variable length control links used to input the controls, the rotating flexible links, the pitch horns and the pitch bearings. The investigations took advantage of concurring wind tunnel test runs, that were performed in August 1998, and allowed the acquisition of data specific to the multi-body analysis.

Ghiringhelli, G. L.↗

DOE OSTI2020

Machine learning Frenkel Hamiltonian parameters to accelerate simulations of exciton dynamics

In this manuscript, we develop multiple machine learning (ML) models to accelerate a scheme for parameterizing site-based models of exciton dynamics from all-atom configurations of condensed phase sexithiophene systems. This scheme encodes the details of a system’s specific molecular morphology in the correlated distributions of model parameters through the analysis of many single-molecule excited-state electronic-structure calculations. These calculations yield excitation energies for each molecule in the system and the network of pair-wise intermolecular electronic couplings. In this work, we demonstrate that the excitation energies can be accurately predicted using a kernel ridge regression (KRR) model with Coulomb matrix featurization. We present two ML models for predicting intermolecular couplings. The first one utilizes a deep neural network and bi-molecular featurization to predict the coupling directly, which we find to perform poorly. The second one utilizes a KRR model to predict unimolecular transition densities, which can subsequently be analyzed to compute the coupling. We find that the latter approach performs excellently, indicating that an effective, generalizable strategy for predicting simple bimolecular properties is through the indirect application of ML to predict higher-order unimolecular properties. Such an approach necessitates a much smaller feature space and can incorporate the insight of well-established molecular physics.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗