Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Algebraic models”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

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

At least 1,765 records · Page 98

A general ansatz for constructing quasi-diabatic states in electronically excited aggregated systems

We present a general method for analyzing the character of singly excited states in terms of charge transfer (CT) and locally excited (LE) configurations. The analysis is formulated for configuration interaction singles (CIS) singly excited wave functions of aggregate systems. It also approximately works for the second-order approximate coupled cluster singles and doubles and the second-order algebraic-diagrammatic construction methods [CC2 and ADC(2)]. The analysis method not only generates a weight of each character for an excited state, but also allows to define the related quasi-diabatic states and corresponding coupling matrix elements. In the character analysis approach, we divide the target system into domains and use a modified Pipek-Mezey algorithm to localize the canonical MOs on each domain, respectively. The CIS wavefunction is then transformed into the localized basis, which allows us to partition the wavefunction into LE configurations within domains and CT configuration between pairs of different domains. Quasi-diabatic states are then obtained by mixing excited states subject to the condition of maximizing the weight of one single LE or CT configuration (localization in configuration space). Different aims of such a procedure are discussed, either the construction of pure LE and CT states for analysis purposes (by including a large number of excited states) or the construction of effective models for dynamics calculations (by including a restricted number of excited states). Applications are given to LE/CT mixing in π-stacked systems, charge-recombination matrix elements in a hetero-dimer, and excitonic couplings in multi-chromophoric systems.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Nonrenormalization theorem for $\mathcal{N}$ = (4, 4) interface entropy

We derive a formula for the half-BPS interface entropy between any pair of $\mathcal{N}$ = (4, 4) theories on the same conformal manifold. This generalizes the diastasis formula derived in [1] for $\mathcal{N}$ = (2, 2) theories, which is restricted to the conformal submanifolds generated by either chiral or twisted chiral multiples of $\mathcal{N}$ = (2, 2) supersymmetry. To derive the $\mathcal{N}$ = (4, 4) formula, we use the fact that the conformal manifold of $\mathcal{N}$ = (4, 4) theories is symmetric and quaternionic-Kähler and that its isotropy group contains the SU(2) ⊗ SU(2) external automorphism of the $\mathcal{N}$ = (4, 4) superconformal algebra. As an application of the formula, we prove a supersymmetric non-renormalization theorem, which explains the observation in [2] that the interface entropy for half-BPS Janus solutions in type IIB supergravity on AdS 3 × S 3 × T 4 coincides with the corresponding quantity in their free conformal field limits.

AdS-CFT correspondence↗

Gauge-invariant perturbation expansion in powers of electric charge for the density-of-states of a network model for charged-particle motion in a uniform background magnetic flux density

An explicitly gauge-invariant expansion in powers of e/$\hbar$ times the magnetic flux density is formally obtained for the density of states [as characterized by the trace of the resolvent $\hat{G}$ = (ω-$\hat{ℎ}$)-1] of a charged particle moving on a Hermitian quantum network that is embedded in a Euclidean background that supports a uniform magnetic flux density. The explicit expressions, given here up to third order in the flux density, are also valid for the “local trace” (the trace of $\hat{P}_i\hat{G}$ , where $\hat{P}_i$ is the projector on a network node) and do not appear to have been previously given.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Algebraic Time Crystallization in a Two-Dimensional Superfluid

Time crystallization is a hallmark of superfluidity, indicative of the fundamental fact that along with breaking the global U(1) symmetry, superfluids also break time-translation symmetry. While the standard discussion of the time crystallization phenomenon is based on the notion of the global phase and genuine condensate, for the superfluidity to take place in two dimensions an algebraic (topological) order is sufficient. We find that the absence of long-range order in a finite-temperature two-dimensional superfluid translates into algebraic time crystallization caused by the temporal phase correlations. The exponent controlling the algebraic decay is a universal function of the superfluid-stiffness-to-temperature ratio; this exponent can be also seen in the power-law singularity of the Fourier spectrum of the AC Josephson current. We elaborate on subtleties involved in defining the phenomenon of time crystallization in both classical-field and all-quantum cases and propose an experimental protocol in which the broken time translation symmetry—more precisely, temporal correlations of the relative phase, with all possible finite-size, dimensional, and quantum effects included—can be observed without permanently keeping two superfluids in a contact.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Total photoionization cross-sections of excited electronic states by the algebraic diagrammatic construction-Stieltjes-Lanczos method

Here, we extend the L{sup 2} ab initio method for molecular photoionization cross-sections introduced in Gokhberg et al. [J. Chem. Phys. 130, 064104 (2009)] and benchmarked in Ruberti et al. [J. Chem. Phys. 139, 144107 (2013)] to the calculation of total photoionization cross-sections of molecules in electronically excited states. The method is based on the ab initio description of molecular electronic states within the many-electron Green's function approach, known as algebraic diagrammatic construction (ADC), and on the application of Stieltjes-Chebyshev moment theory to Lanczos pseudospectra of the ADC electronic Hamiltonian. The intermediate state representation of the dipole operator in the ADC basis is used to compute the transition moments between the excited states of the molecule. We compare the results obtained using different levels of the many-body theory, i.e., ADC(1), ADC(2), and ADC(2)x for the first two excited states of CO, N{sub 2}, and H{sub 2}O both at the ground state and the excited state equilibrium or saddle point geometries. We find that the single excitation ADC(1) method is not adequate even at the qualitative level and that the inclusion of double electronic excitations for description of excited state photoionization is essential. Moreover, we show that the use of the extended ADC(2)x method leads to a substantial systematic difference from the strictly second-order ADC(2). Our calculations demonstrate that a theoretical modelling of photoionization of excited states requires an intrinsically double excitation theory with respect to the ground state and cannot be achieved by the standard single excitation methods with the ground state as a reference.

74 ATOMIC AND MOLECULAR PHYSICS↗

Accelerated basis adaptation in homogeneous chaos spaces

Polynomial chaos expansions (PCE) provide an efficient approach to uncertainty quantification (UQ) and have been adapted to diverse applications across the spectrum of science and engineering. For situations involving large stochastic parameterizations, the curse of dimensionality renders PCE-based methods computationally prohibitive. A basis adaptation approach for PCE was proposed by Tipireddy and Ghanem (2014) which transforms the input random variables through an isometry such that sufficient probabilistic characterization of specific quantities of interest (QoI) is concentrated in an algebraic manifold embedded in the linear span of the dominant transformed variables. While quite versatile, that original version of the PCE basis adaptation exhibited slow convergence for a number of problems of practical significance. In the present paper, we propose two novel methods to accelerate the convergence of the original basis adaptation approach, thus expanding its reach while also providing insight into its performance. In the first method, information gained from a pilot PCE representation is used to correct the mean and Gaussian coefficients in the adapted space. By taking advantages of probabilistic information in higher dimensional adaptation gleaned from an initial adaptation, the second method updates the rotation matrix used to identify the dominant transformed variables. In this manner, the new rotation matrix concentrates even more probabilistic information in its first few dimensions. These two method can be combined to achieve even better performance, the combined method is referred to as sequentially optimized adaptation method. Here, the methods are demonstrated on an analytical test function and a model of a space structure with several sub-components and a non-smooth quantity of interest representing the maximum acceleration over time. Both methods achieve accelerated convergence of the basis adaptation approach with negligible additional costs.

Accelerated convergence↗

Dynamic control of metastable remanent states in mesoscale magnetic elements

The formation of the vortex-antivortex-vortex (v-av-v) metastable remanent states in elongated magnetic elements have been systematically investigated using micromagnetic modeling. It is demonstrated that the v-av-v magnetization pattern can be effectively stabilized by exciting the single vortex state with an external RF field. Furthermore, we show that a set of different polarity combinations of the vortex cores can be achieved by adjusting the frequency and amplitude of the excitation field. The corresponding dynamic response in time- and frequency-domain has also been presented. Owing to the diversity of the collective modes with different vortex-antivortex combinations, this system may open promising perspectives in the area of spin transfer torque oscillators.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Computing Aerodynamic Performance of a 2D Iced Airfoil: Blocking Topology and Grid Generation

The ice accrued on airfoils can have enormously complicated shapes with multiple protruded horns and feathers. In this paper, several blocking topologies are proposed and evaluated on their ability to produce high-quality structured multi-block grid systems. A transition layer grid is introduced to ensure that jaggedness on the ice-surface geometry do not to propagate into the domain. This is important for grid-generation methods based on hyperbolic PDEs (Partial Differential Equations) and algebraic transfinite interpolation. A 'thick' wrap-around grid is introduced to ensure that grid lines clustered next to solid walls do not propagate as streaks of tightly packed grid lines into the interior of the domain along block boundaries. For ice shapes that are not too complicated, a method is presented for generating high-quality single-block grids. To demonstrate the usefulness of the methods developed, grids and CFD solutions were generated for two iced airfoils: the NLF0414 airfoil with and without the 623-ice shape and the B575/767 airfoil with and without the 145m-ice shape. To validate the computations, the computed lift coefficients as a function of angle of attack were compared with available experimental data. The ice shapes and the blocking topologies were prepared by NASA Glenn's SmaggIce software. The grid systems were generated by using a four-boundary method based on Hermite interpolation with controls on clustering, orthogonality next to walls, and C continuity across block boundaries. The flow was modeled by the ensemble-averaged compressible Navier-Stokes equations, closed by the shear-stress transport turbulence model in which the integration is to the wall. All solutions were generated by using the NPARC WIND code.

Chi, X.↗

Matrix-free preconditioning for high-order H (curl) discretizations

The greater arithmetic intensity of high-order finite element discretizations makes them attractive for implementation on next-generation hardware, but assembly of high-order finite element operators as matrices is prohibitively expensive. As a result, the development of general algebraic solvers for such operators has been an open research challenge. Fast matrix-free application of high-order operators has received significant attention in the literature in the context of Poisson-type problems, but preconditioners and solvers for inverting more general operators are not very well-developed. In this paper, we consider the problem of preconditioning a definite Maxwell operator at high polynomial order without assembling a matrix. We show that given efficient preconditioners for high-order H 1 finite element problems on the same mesh, efficient H(curl) preconditioners can be constructed in an auxiliary space framework. We demonstrate the resulting preconditioners in a practical setting with tensor-product basis functions on an unstructured mesh of quadrilaterals. Overall, our approach uses a sparsified H 1 solver constructed on a low-order mesh of the nodal points of the underlying high-order space, and we show that the resulting H(curl) preconditioner is effective at very high polynomial orders for two-dimensional model problems with complicated geometry, varying piecewise constant coefficients, and curved elements. The resulting preconditioner scales with nearly optimal O(p d+1 ) floating point operation count and optimal O(p d ) memory transfer requirements, outperforming existing Maxwell preconditioners in the high-order regime.

97 MATHEMATICS AND COMPUTING↗

Conformal wavefunctions for graviton amplitudes

The extended-BMS algebra of asymptotically flat spacetime contains an SO(3, 1) subgroup that acts by conformal transformations on the celestial sphere. It is of interest to study the representations of this subgroup associated with gravitons. To reduce the equation of motion to a Schrodinger-like equation it is necessary to impose a non-covariant gauge condition. Using these solutions, leading-order gauge invariant Weyl scalars are then computed and decomposed into families of unitary principal series representations. An invertible holographic mapping is constructed between these unitary principal series operators and massless spin-2 perturbations of flat spacetime.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

A Block-Structured Adaptive Mesh Framework to Solve Radiation Transfer Equation in Irregular Embedded Geometries

Radiation transport arises in various scientific, industrial, and medical fields, and understanding its effect in applications is needed to make accurate predictions, safety assessments and performance optimizations. Solving the Radiation Transport Equation (RTE) is challenging due to its integro-differential nature, which involves both differential and integral terms. The differential term describes the change in radiation intensity due to absorption and emission, while the integral term accounts for scattering. The accurate modeling of radiation is further complicated in many applications due to the complex, irregular geometries. Various methods exist for solving the RTE, including the zonal, Monte Carlo, spherical harmonics, discrete ordinates, and finite volume methods. Traditional mesh-based approaches, which rely on structured or unstructured meshes, struggle with irregular geometries due to: a) the difficulty of conforming structured grids to irregular domains, b) challenges in enforcing boundary conditions correctly, and c) the additional computational cost of unstructured mesh methods. This work presents a second-order accurate method for solving the RTE in irregular geometries. The radiation intensity is discretized using the finite-volume method in both spatial and angular directions on regular Cartesian grid blocks. Leveraging the block-structured adaptive mesh refinement (AMR) framework provided by AMReX, our method refines the grid locally to reduce spatial discretization error, ensuring a converged numerical solution while minimizing computational costs elsewhere. A two-stage deferred correction approach is employed: First, a first-order discretization on grid blocks is solved using an algebraic multigrid method in HYPRE. Second, a correction term is applied explicitly to achieve second-order accuracy. The correction term is calculated by approximating the radiation flux on cell faces using a Total Variation Diminishing (TVD) scheme. This approach ensures quick convergence of the multigrid method while preserving higher-order accuracy of the numerical solution. Irregular geometries are resolved as embedded boundaries (EB), resulting in both cut cells and regular cells. In cut cells, we modify the fluxes using face fractions and incorporate additional contributions from EB boundary conditions. To ensure higher-order convergence near the EB interface, the correction term is modified by interpolating the radiation intensity to fictitious ghost points. The implementation takes advantage of modern supercomputers by leveraging AMReX’sMPI/X parallelization strategy where X can be MPI or a GPU accelerator including CUDA, HIP and DPC++. We validate our solver using classical test cases, both with and without EB, demonstrating accuracy and efficiency. Additionally, we analyze the impact of adaptive mesh refinement on solution accuracy and computational cost, highlighting the advantages of our approach for high-resolution radiation transport simulations.

computational fluid dynamics (CFD)↗

Aspects of efficient and reliable multibody system simulation

Multibody system equations can be generated in various forms. All of these may be interpreted as results of two basic approaches, the augmentation- and the elimination-method. The former method yields the descriptor form of the system motion, a set of differential-algebraic equations (DAE), and the latter the state space representation, a minimal set of ordinary differential equations (ODE). Both of these methods are surveyed. Particular emphasis is on the discussion of recursive computational schemes, generating the equations of motion with a number of operations, which is proportional to the number N of system bodies (O(N)-formulations). For simulation purposes one would like to create that set of system equations, which can be generated most efficiently and for which the most efficient and reliable solution techniques are available. Numerical solution techniques for ODE have been studied in great detail and they are well-developed. By contrast, DAE have not been investigated for such a long time. In view of new developments in the latter field the generation of all the equations required for an efficient and reliable solution of DAE describing multibody system motion is discussed. These methods, i.e., an O(N)-formulation and new techniques for solving DAE, are implemented in the SIMPACK code. Its capabilities are illustrated by simulation of multibody robot models.

Schwertassek, R.↗

CAML: Commutative Algebra Machine Learning─A Case Study on Protein–Ligand Binding Affinity Prediction

Recently, Suwayyid and Wei introduced commutative algebra as an emerging paradigm for machine learning and data science. In this work, we propose commutative algebra machine learning (CAML) for the prediction of protein−ligand binding affinities. Specifically, we apply persistent Stanley−Reisner theory, a key concept in combinatorial commutative algebra, to the affinity predictions of protein−ligand binding and metalloprotein−ligand binding. We present three new algorithms, i.e., element-specific commutative algebra, category-specific commutative algebra, and commutative algebra on bipartite complexes, to tackle the complexity of data involved in (metallo) protein−ligand complexes. We show that the proposed CAML outperforms other state-of-theart methods in (metallo) protein−ligand binding affinity predictions, indicating the great potential of commutative algebra learning.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Quantization of anomaly coefficients in 6D N = ( 1 , 0 ) supergravity

We obtain new constraints on the anomaly coefficients of 6D N = ( 1 , 0 ) supergravity theories using local and global anomaly cancellation conditions. We show how these constraints can be strengthened if we assume that the theory is well-defined on any spin space-time with an arbitrary gauge bundle. We distinguish the constraints depending on the gauge algebra only from those depending on the global structure of the gauge group. Our main constraint states that the coefficients of the anomaly polynomial for the gauge group G should be an element of 2H 4 (BG; Z) $\otimes$ Λ S where Λ S is the unimodular string charge lattice. We show that the constraints in their strongest form are realized in F-theory compactifications. In the process, we identify the cocharacter lattice, which determines the global structure of the gauge group, within the homology lattice of the compactification manifold.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Discrete One-Dimensional Coverage Process on a Renewal Process

Consider the following coverage model on ℕ, for each site i∈ℕ associate a pair (ξ{sub i},R{sub i}) where (ξ{sub i}){sub i≥0} is a 1-dimensional undelayed discrete renewal point process and (R{sub i}){sub i≥0} is an i.i.d. sequence of ℕ-valued random variables. At each site where ξ{sub i}=1 start an interval of length R{sub i}. Coverage occurs if every site of ℕ is covered by some interval. We obtain sharp conditions for both, positive and null probability of coverage. As corollaries, we extend results of the literature of rumor processes and discrete one-dimensional Boolean percolation.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Domain-decomposition nonlinear manifold reduced order model

This software combines nonlinear-manifold reduced order models (NM-ROMs) with domain decomposition (DD) techniques. NM-ROMs, which utilize a shallow, sparse autoencoder trained with full order model (FOM) snapshot data, approximate the FOM state on a nonlinear manifold. These models offer advantages over linear-subspace ROMs (LS-ROMs) particularly in scenarios with slowly decaying Kolmogorov n-width. However, the training of NM-ROMs involves a number of parameters that scale with the size of the FOM, and storing high-dimensional FOM snapshots can significantly increase the cost of ROM training for extreme-scale problems. To mitigate these costs, the software employs DD to partition the FOM into smaller subdomains, computes NM-ROMs for each, and then integrates these to form a global NM-ROM. This strategy offers multiple benefits: it enables parallel training of subdomain NM-ROMs, reduces the number of parameters needed, decreases the dimensional requirements of subdomain FOM training data, and allows for customization to the unique characteristics of each FOM subdomain. The use of a shallow, sparse autoencoder architecture in each subdomain NM-ROM facilitates the application of hyper-reduction (HR), simplifying the nonlinear complexities and enhancing computational speed. This software marks the inaugural application of NM-ROM combined with HR to a DD problem. It features an algebraic DD reformulation of the FOM, training of NM-ROMs with HR for each subdomain, and employs a sequential quadratic programming (SQP) solver for the evaluation of the coupled global NMROM. The effectiveness of the DD NM-ROM with HR is numerically demonstrated on the 2D steady-state Burgers' equation, showing an order of magnitude improvement in accuracy over the DD LS-ROM with HR.

Diaz, AlejandroN↗

Physical, numerical, and computational challenges of modeling neutrino transport in core-collapse supernovae

The proposal that core collapse supernovae are neutrino driven is still the subject of active investigation more than 50 years after the seminal paper by Colgate and White. The modern version of this paradigm, which we owe to Wilson, proposes that the supernova shock wave is powered by neutrino heating, mediated by the absorption of electron-flavor neutrinos and antineutrinos emanating from the proto-neutron star surface, or neutrinosphere. Neutrino weak interactions with the stellar core fluid, the theory of which is still evolving, are flavor and energy dependent. The associated neutrino mean free paths extend over many orders of magnitude and are never always small relative to the stellar core radius. Thus, neutrinos are never always fluid like. Instead, a kinetic description of them in terms of distribution functions that determine the number density of neutrinos in the six-dimensional phase space of position, direction, and energy, for both neutrinos and antineutrinos of each flavor, or in terms of angular moments of these neutrino distributions that instead provide neutrino number densities in the four-dimensional phase-space subspace of position and energy, is needed. In turn, the computational challenge is twofold: (i) to map the kinetic equations governing the evolution of these distributions or moments onto discrete representations that are stable, accurate, and, perhaps most important, respect physical laws such as conservation of lepton number and energy and the Fermi–Dirac nature of neutrinos and (ii) to develop efficient, supercomputer-architecture-aware solution methods for the resultant nonlinear algebraic equations. In this review, we present the current state of the art in attempts to meet this challenge.

79 ASTRONOMY AND ASTROPHYSICS↗

Dynamics retrieval from stochastically weighted incomplete data by low-pass spectral analysis

Time-resolved serial femtosecond crystallography (TR-SFX) provides access to protein dynamics on sub-picosecond timescales, and with atomic resolution. Due to the nature of the experiment, these datasets are often highly incomplete and the measured diffracted intensities are affected by partiality. To tackle these issues, one established procedure is that of splitting the data into time bins, and averaging the multiple measurements of equivalent reflections within each bin. This binning and averaging often involve a loss of information. Here, we propose an alternative approach, which we call low-pass spectral analysis (LPSA). In this method, the data are projected onto the subspace defined by a set of trigonometric functions, with frequencies up to a certain cutoff. This approach attenuates undesirable high-frequency features and facilitates retrieving the underlying dynamics. A time-lagged embedding step can be included prior to subspace projection to improve the stability of the results with respect to the parameters involved. Subsequent modal decomposition allows to produce a low-rank description of the system's evolution. Using a synthetic time-evolving model with incomplete and partial observations, we analyze the LPSA results in terms of quality of the retrieved signal, as a function of the parameters involved. We compare the performance of LPSA to that of a range of other sophisticated data analysis techniques. We show that LPSA allows to achieve excellent dynamics reconstruction at modest computational cost. Finally, we demonstrate the superiority of dynamics retrieval by LPSA compared to time binning and merging, which is, to date, the most commonly used method to extract dynamical information from TR-SFX data.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗