Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “VECTOR SPACE”

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

Kappa Snyder deformations of Minkowski spacetime, realizations, and Hopf algebra

We present Lie-algebraic deformations of Minkowski space with undeformed Poincare algebra. These deformations interpolate between Snyder and {kappa}-Minkowski space. We find realizations of noncommutative coordinates in terms of commutative coordinates and derivatives. By introducing modules, it is shown that, although deformed and undeformed structures are not isomorphic at the level of vector spaces, they are isomorphic at the level of Hopf-algebraic action on corresponding modules. Invariants and tensors with respect to Lorentz algebra are discussed. A general mapping from {kappa}-deformed Snyder to Snyder space is constructed. The deformed Leibniz rule, the Hopf structure, and the star product are found. Special cases, particularly Snyder and {kappa}-Minkowski in Maggiore-type realizations, are discussed. The same generalized Hopf-algebraic structures are considered as well in the case of an arbitrary allowable kind of realization, and results are given perturbatively up to second order in deformation parameters.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Intelligent feature selection techniques for pattern classification of Lamb wave signals

Lamb wave interaction with flaws is a complex, three-dimensional phenomenon, which often frustrates signal interpretation schemes based on mode arrival time shifts predicted by dispersion curves. As the flaw severity increases, scattering and mode conversion effects will often dominate the time-domain signals, obscuring available information about flaws because multiple modes may arrive on top of each other. Even for idealized flaw geometries the scattering and mode conversion behavior of Lamb waves is very complex. Here, multi-mode Lamb waves in a metal plate are propagated across a rectangular flat-bottom hole in a sequence of pitch-catch measurements corresponding to the double crosshole tomography geometry. The flaw is sequentially deepened, with the Lamb wave measurements repeated at each flaw depth. Lamb wave tomography reconstructions are used to identify which waveforms have interacted with the flaw and thereby carry information about its depth. Multiple features are extracted from each of the Lamb wave signals using wavelets, which are then fed to statistical pattern classification algorithms that identify flaw severity. In order to achieve the highest classification accuracy, an optimal feature space is required but it’s never known a priori which features are going to be best. For structural health monitoring we make use of the fact that physical flaws, such as corrosion, will only increase over time. This allows us to identify feature vectors which are topologically well-behaved by requiring that sequential classes “line up” in feature vector space. An intelligent feature selection routine is illustrated that identifies favorable class distributions in multi-dimensional feature spaces using computational homology theory. Betti numbers and formal classification accuracies are calculated for each feature space subset to establish a correlation between the topology of the class distribution and the corresponding classification accuracy.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A simple procedure for construction of the orthonormal basis vectors of irreducible representations of O(5) in the O T ( 3 ) Ⓧ O N ( 2 ) basis

We report a simple and effective algebraic isospin projection procedure for constructing orthonormal basis vectors of irreducible representations of O(5) ⊃ OT(3) Ⓧ O$_\mathscr{N}$ (2) from those in the canonical O(5) ⊃ SU Λ (2) Ⓧ SU I (2) basis is outlined. The expansion coefficients are components of null space vectors of the projection matrix with four nonzero elements in each row in general. Explicit formulae for evaluating O T (3)-reduced matrix elements of O(5) generators are derived.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Stability of solution mappings for parametric bilevel vector equilibrium problems

In this paper, we first revisit the parametric bilevel vector equilibrium problems in Hausdorff topological vector spaces. Then we study the stability conditions such as (Hausdorff) upper semicontinuity, (Hausdorff) lower semicontinuity, outer-continuity and outer-openness of solutions for such problems. Many examples are provided to illustrate the essentialness of the imposed assumptions. For the applications, we obtain the stability results for the parametric vector variational inequality problems with equilibrium constraints and parametric vector optimization problems with equilibrium constraints.

97 MATHEMATICS AND COMPUTING↗

A Semantic Relatedness Approach for Traceability Link Recovery

Human analysts working with automated tracing tools need to directly vet candidate traceability links in order to determine the true traceability information. Currently, human intervention happens at the end of the traceability process, after candidate traceability links have already been generated. This often leads to a decline in the results accuracy. In this paper, we propose an approach, based on semantic relatedness (SR), which brings human judgment to an earlier stage of the tracing process by integrating it into the underlying retrieval mechanism. SR tries to mimic human mental model of relevance by considering a broad range of semantic relations, hence producing more semantically meaningful results. We evaluated our approach using three datasets from different application domains, and assessed the tracing results via six different performance measures concerning both result quality and browsability. The empirical evaluation results show that our SR approach achieves a significantly better performance in recovering true links than a standard Vector Space Model (VSM) in all datasets. Our approach also achieves a significantly better precision than Latent Semantic Indexing (LSI) in two of our datasets.

99 GENERAL AND MISCELLANEOUS↗

Investigations on the hierarchy of reference frames in geodesy and geodynamics

Problems related to reference directions were investigated. Space and time variant angular parameters are illustrated in hierarchic structures or towers. Using least squares techniques, model towers of triads are presented which allow the formation of linear observation equations. Translational and rotational degrees of freedom (origin and orientation) are discussed along with and the notion of length and scale degrees of freedom. According to the notion of scale parallelism, scale factors with respect to a unit length are given. Three-dimensional geodesy was constructed from the set of three base vectors (gravity, earth-rotation and the ecliptic normal vector). Space and time variations are given with respect to a polar and singular value decomposition or in terms of changes in translation, rotation, deformation (shear, dilatation or angular and scale distortions).

Grafarend, E. W.↗

Theoretical formulation of finite-dimensional discrete phase spaces: II. On the uncertainty principle for Schwinger unitary operators

We introduce a self-consistent theoretical framework associated with the Schwinger unitary operators whose basic mathematical rules embrace a new uncertainty principle that generalizes and strengthens the Massar–Spindel inequality. Among other remarkable virtues, this quantum-algebraic approach exhibits a sound connection with the Wiener–Khinchin theorem for signal processing, which permits us to determine an effective tighter bound that not only imposes a new subtle set of restrictions upon the selective process of signals and wavelet bases, but also represents an important complement for property testing of unitary operators. Moreover, we establish a hierarchy of tighter bounds, which interpolates between the tightest bound and the Massar–Spindel inequality, as well as its respective link with the discrete Weyl function and tomographic reconstructions of finite quantum states. We also show how the Harper Hamiltonian and discrete Fourier operators can be combined to construct finite ground states which yield the tightest bound of a given finite-dimensional state vector space. Such results touch on some fundamental questions inherent to quantum mechanics and their implications in quantum information theory. -- Highlights: •Conception of a quantum-algebraic framework embracing a new uncertainty principle for unitary operators. •Determination of new restrictions upon the selective process of signals and wavelet bases. •Demonstration of looser bounds interpolating between the tightest bound and the Massar–Spindel inequality. •Construction of finite ground states properly describing the tightest bound. •Establishment of an important connection with the discrete Weyl function.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Automation of POST Cases via External Optimizer and "Artificial p2" Calculation

During early conceptual design of complex systems, speed and accuracy are often at odds with one another. While many characteristics of the design are fluctuating rapidly during this phase there is nonetheless a need to acquire accurate data from which to down-select designs as these decisions will have a large impact upon program life-cycle cost. Therefore enabling the conceptual designer to produce accurate data in a timely manner is tantamount to program viability. For conceptual design of launch vehicles, trajectory analysis and optimization is a large hurdle. Tools such as the industry standard Program to Optimize Simulated Trajectories (POST) have traditionally required an expert in the loop for setting up inputs, running the program, and analyzing the output. The solution space for trajectory analysis is in general non-linear and multi-modal requiring an experienced analyst to weed out sub-optimal designs in pursuit of the global optimum. While an experienced analyst presented with a vehicle similar to one which they have already worked on can likely produce optimal performance figures in a timely manner, as soon as the "experienced" or "similar" adjectives are invalid the process can become lengthy. In addition, an experienced analyst working on a similar vehicle may go into the analysis with preconceived ideas about what the vehicle's trajectory should look like which can result in sub-optimal performance being recorded. Thus, in any case but the ideal either time or accuracy can be sacrificed. In the authors' previous work a tool called multiPOST was created which captures the heuristics of a human analyst over the process of executing trajectory analysis with POST. However without the instincts of a human in the loop, this method relied upon Monte Carlo simulation to find successful trajectories. Overall the method has mixed results, and in the context of optimizing multiple vehicles it is inefficient in comparison to the method presented POST's internal optimizer functions like any other gradient-based optimizer. It has a specified variable to optimize whose value is represented as optval, a set of dependent constraints to meet with associated forms and tolerances whose value is represented as p2, and a set of independent variables known as the u-vector to modify in pursuit of optimality. Each of these quantities are calculated or manipulated at a certain phase within the trajectory. The optimizer is further constrained by the requirement that the input u-vector must result in a trajectory which proceeds through each of the prescribed events in the input file. For example, if the input u-vector causes the vehicle to crash before it can achieve the orbital parameters required for a parking orbit, then the run will fail without engaging the optimizer, and a p2 value of exactly zero is returned. This poses a problem, as this "non-connecting" region of the u-vector space is far larger than the "connecting" region which returns a non-zero value of p2 and can be worked on by the internal optimizer. Finding this connecting region and more specifically the global optimum within this region has traditionally required the use of an expert analyst.

Dees, Patrick D.↗

Commuting projections on graphs

For a given (connected) graph, we consider vector spaces of (discrete) functions defined on its vertices and its edges. These two spaces are related by a discrete gradient operator, Grad and its adjoint, ₋Div, referred to as (negative) discrete divergence. We also consider a coarse graph obtained by aggregation of vertices of the original one. Then a coarse vertex space is identified with the subspace of piecewise constant functions over the aggregates. We consider the ℓ 2 -projection Q H onto the space of these piecewise constants. In the present paper, our main result is the construction of a projection π H from the original edge-space onto a properly constructed coarse edge-space associated with the edges of the coarse graph. The projections π H and Q H commute with the discrete divergence operator, i.e., we have div π H = Q H div. The respective pair of coarse edge-space and coarse vertexspace offer the potential to construct two-level, and by recursion, multilevel methods for the mixed formulation of the graph Laplacian which utilizes the discrete divergence operator. The performance of one two-level method with overlapping Schwarz smoothing and correction based on the constructed coarse spaces for solving such mixed graph Laplacian systems is illustrated on a number of graph examples.

97 MATHEMATICS AND COMPUTING↗

Algebraic multigrid for directed graph Laplacian linear systems (NS‐LAMG)

Summary We propose nonsymmetric lean algebraic multigrid (NS‐LAMG), a new algebraic multigrid algorithm for directed graph Laplacian systems that combines ideas from undirected graph Laplacian multigrid solvers and multigrid algorithms for Markov chain stationary distribution systems. Low‐degree elimination, proposed in LAMG for undirected graphs, is generalized to directed graphs and is a key component of NS‐LAMG. In the setup phase, we propose a simple stationary‐aggregation multigrid algorithms for Markov chain stationary distribution systems solver enhanced by low‐degree elimination to find the right null‐space vector that is used for the intergrid transfer operators. Numerical results show that low‐degree elimination improves performance and that NS‐LAMG outperforms generalized minimal residual method with restart and stable bi‐conjugate gradient method for real‐world, directed graph Laplacian linear systems.

Fox, Alyson↗

Macdonald index and chiral algebra

For any 4dN = 2 SCFT, there is a subsector described by a 2d chiral algebra. The vacuum character of the chiral algebra reproduces the Schur index of the corresponding 4d theory. The Macdonald index counts the same set of operators as the Schur index, but the former has one more fugacity than the latter. Here, we conjecture a prescription to obtain the Macdonald index from the chiral algebra. The vacuum module admits a filtration, from which we construct an associated graded vector space. From this grading, we conjecture a notion of refined character for the vacuum module of a chiral algebra, which reproduces the Macdonald index. We test this prescription for the Argyres-Douglas theories of type (A 1 , A 2n ) and (A 1 , D 2n+1 ) where the chiral algebras are given by Virasoro and $ˆ\atop{su}$(2) affine Kac-Moody algebra. When the chiral algebra has more than one family of generators, our prescription requires a knowledge of the generators from the 4d.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

A Type II Hamiltonian Variational Principle and Adjoint Systems for Lie Groups

We present a novel Type II variational principle on the cotangent bundle of a Lie group which enforces Type II boundary conditions, i.e., fixed initial position and final momentum. In general, such Type II variational principles are only globally defined on vector spaces or locally defined on general manifolds; however, by left translation, we are able to define this variational principle globally on cotangent bundles of Lie groups. Type II boundary conditions are particularly important for adjoint sensitivity analysis, which is our motivating application. As such, we additionally discuss adjoint systems on Lie groups, their properties, and how they can be used to solve optimization problems subject to dynamics on Lie groups.

97 MATHEMATICS AND COMPUTING↗

Leveraging operator learning to accelerate convergence of the preconditioned conjugate gradient method

We propose a new deflation strategy to accelerate the convergence of the preconditioned conjugate gradient (PCG) method for solving parametric large-scale linear systems of equations. Unlike traditional deflation techniques that rely on eigenvector approximations or recycled Krylov subspaces, we generate the deflation subspaces using operator learning, specifically the Deep Operator Network (DeepONet). To this aim, we introduce two complementary approaches for assembling the deflation operators. The first approach approximates near-null space vectors of the discrete PDE operator using the basis functions learned by the DeepONet. The second approach directly leverages solutions predicted by the DeepONet. To further enhance convergence, we also propose several strategies for prescribing the sparsity pattern of the deflation operator. Here, a comprehensive set of numerical experiments encompassing steady-state, time-dependent, scalar, and vector-valued problems posed on both structured and unstructured geometries is presented and demonstrates the effectiveness of the proposed DeepONet-based deflated PCG method, as well as its generalization across a wide range of model parameters and problem resolutions.

Deflation↗

Scalable Bayesian optimization with randomized prior networks

Several fundamental problems in science and engineering consist of global optimization tasks involving unknown high-dimensional (black-box) functions that map a set of controllable variables to the outcomes of an expensive experiment. Bayesian Optimization (BO) techniques are known to be effective in tackling global optimization problems using a relatively small number objective function evaluations, but their performance suffers when dealing with high-dimensional outputs. To overcome the major challenge of dimensionality, here we propose a deep learning framework for BO and sequential decision making based on bootstrapped ensembles of neural architectures with randomized priors. Using appropriate architecture choices, we show that the proposed framework can approximate functional relationships between design variables and quantities of interest, even in cases where the latter take values in high-dimensional vector spaces or even infinite-dimensional function spaces. In the context of BO, we augmented the proposed probabilistic surrogates with re-parameterized Monte Carlo approximations of multiple-point (parallel) acquisition functions, as well as methodological extensions for accommodating black-box constraints and multi-fidelity information sources. We test the proposed framework against state-of-the-art methods for BO and demonstrate superior performance across several challenging tasks with high-dimensional outputs, including a constrained multi-fidelity optimization task involving shape optimization of rotor blades in turbo-machinery.

97 MATHEMATICS AND COMPUTING↗

Importance of Engineered and Learned Molecular Representations in Predicting Organic Reactivity, Selectivity, and Chemical Properties

Machine-readable chemical structure representations are foundational in all attempts to harness machine learning for the prediction of reactivities, selectivities, and chemical properties directly from molecular structure. The featurization of discrete chemical structures into a continuous vector space is a critical phase undertaken before model selection, and the development of new ways to quantitatively encode molecules is an active area of research. Here, we highlight the application and suitability of different representations, from expert-guided “engineered” descriptors to automatically “learned” features, in different prediction tasks relevant to organic and organometallic chemistry, where differing amounts of training data are available. These tasks include statistical models of stereo- and enantioselectivity, thermochemistry, and kinetics developed using experimental and quantum chemical data. The use of expert-guided molecular descriptors provides an opportunity to incorporate chemical knowledge, domain expertise, and physical constraints into statistical modeling. In applications to stereoselective organic and organometallic catalysis, where data sets may be relatively small and 3D-geometries and conformations play an important role, mechanistically informed features can be used successfully to obtain predictive statistical models that are also chemically interpretable. We provide an overview of several recent applications of this approach to obtain quantitative models for reactivity and selectivity, where topological descriptors, quantum mechanical calculations of electronic and steric properties, along with conformational ensembles, all feature as essential ingredients of the molecular representations used. Alternatively, more flexible, general-purpose molecular representations such as attributed molecular graphs can be used with machine learning approaches to learn the complex relationship between a structure and prediction target. This approach has the potential to out-perform more traditional representation methods such as “hand-crafted” molecular descriptors, particularly as data set sizes grow. One area where this is particularly relevant is in the use of large sets of quantum mechanical data to train quantitative structure–property relationships. A general approach toward curating useful data sets and training highly accurate graph neural network models is discussed in the context of organic bond dissociation enthalpies, where this strategy outperforms regression using precomputed descriptors. Finally, we describe how graph neural network predictions can be incorporated into mechanistically informed statistical models of chemical reactivity and selectivity. Once trained, this approach avoids the expensive computational overhead associated with quantum mechanical calculations, while maintaining chemical interpretability. We illustrate examples for which fast predictions of bond dissociation enthalpy and of the identities of radicals formed through cleavage of a molecule’s weakest bond are used in simple physical models of site-selectivity and reactivity.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Deep Koopman operators for causal discovery

Causal discovery aims to identify cause-effect mechanisms for better scientific understanding, explainable decision-making, and more accurate modeling. Standard statistical frameworks, such as Granger causality, lack the ability to quantify causal relationships in nonlinear dynamics due to the presence of complex feedback mechanisms, timescale mixing, and nonstationarity. Thus, applying these methods to study causal dynamics in real-world systems, such as the Earth, is a major challenge. Addressing this shortcoming, we leverage deep learning and a Koopman operator-theoretic formalism to present a class of causal discovery algorithms. Kausal uses deep Koopman operator methods to approximate nonlinear dynamics in a linearized vector space in which traditional causal inference methods such as Granger causality can be more easily applied. Our idealized experiments demonstrate Kausal’s superior ability in discovering and characterizing causal signals compared to existing deep learning and non-deep learning state-of-the-art approaches. Finally, the successful identification of major El Niño and La Niña events in observations showcases Kausal’s skill to handle real-world applications.

54 ENVIRONMENTAL SCIENCES↗

The reduced-description particle-in-cell model for the two plasmon decay instability

Recently, motivated by the resurgent interest in suprathermal electron generation by two plasmon decay (TPD) in direct-drive laser-fusion [J. A. Delettrez et al., Bull. Am. Phys. Soc. 53, 248 (2008); V. A. Smalyuk et al., Phys. Rev. Lett. 100, 185005 (2008); B. Yaakobi et al., Phys. Plasmas 12, 062703 (2005)], the fully kinetic, reduced-description, particle-in-cell (RPIC) methodology has been extended to include TPD. It provides a computationally efficient fully kinetic simulation tool, especially in nonlinear regimes where the Langmuir decay instability (LDI) is a dominant saturation mechanism. This RPIC methodology is an extension of the modeling of laser-plasma instabilities in underdense plasmas reported previously [H. X. Vu, B. Bezzerides, and D. F. DuBois, J. Comput. Phys. 156, 12 (1999)]. The relationship between RPIC and the extended Zakharov model previously used for TPD [D. F. DuBois, D. A. Russell, and H. A. Rose, Phys. Rev. Lett. 74, 3983 (1995)] is explored theoretically and tested in simulations. The modification of the electron velocity distribution - in particular, the generation of hot electrons - as calculated in RPIC leads to weakening of the wave turbulence excited by TPD compared to the Zakharov model predictions but the locations in wave vector space of important spectral features, e.g., arising from the LDI, of the nonlinear wave fluctuations are exactly the same in the two approaches. New results involving two oblique, overlapping laser beams, a common geometrical feature in direct-drive schemes, are presented. The two laser beams can cooperatively excite common primary Langmuir waves which initiate the LDI process.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Quantum dynamics study of fulvene double bond photoisomerization: The role of intramolecular vibrational energy redistribution and excitation energy

The double bond photoisomerization of fulvene has been studied with quantum dynamics calculations using the multi-configuration time-dependent Hartree method. Fulvene is a test case to develop optical control strategies based on the knowledge of the excited state decay mechanism. The decay takes place on a time scale of several hundred femtoseconds, and the potential energy surface is centered around a conical intersection seam between the ground and excited state. The competition between unreactive decay and photoisomerization depends on the region of the seam accessed during the decay. The dynamics are carried out on a four-dimensional model surface, parametrized from complete active space self-consistent field calculations, that captures the main features of the seam (energy and locus of the seam and associated branching space vectors). Wave packet propagations initiated by single laser pulses of 5-25 fs duration and 1.85-4 eV excitation energy show the principal characteristics of the first 150 fs of the photodynamics. Initially, the excitation energy is transferred to a bond stretching mode that leads the wave packet to the seam, inducing the regeneration of the reactant. The photoisomerization starts after the vibrational energy has flowed from the bond stretching to the torsional mode. In our propagations, intramolecular energy redistribution (IVR) is accelerated for higher excess energies along the bond stretch mode. Thus, the competition between unreactive decay and isomerization depends on the rate of IVR between the bond stretch and torsion coordinates, which in turn depends on the excitation energy. These results set the ground for the development of future optical control strategies.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗