Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Algebraic structures”

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 289 records · Page 16
All sourcesNASA NTRSDOE OSTI
DOE OSTI2024

Algebraic discrete quantum harmonic oscillator with dynamic resolution scaling

We develop an algebraic formulation for the discrete quantum harmonic oscillator (DQHO) from the Hamiltonian for two, coupled QHOs and provide a physical picture for the Kravchuk function eigenstates of the oscillator. The familiar $\mathfrak{su}(2)$ structure of the coupled QHO Hamiltonian divides its spectrum into sets corresponding to the DQHO at different resolutions. In addition to energy ladder operators, the formulation allows for the introduction of resolution ladder operators connecting all DQHOs with different resolutions, thus enabling the dynamic scaling of the resolution of finite degree-of-freedom quantum simulations. The coherent state of the DQHO is constructed, and its expected position is proven to oscillate as a classical harmonic oscillator. The DQHO coherent state recovers that of the quantum harmonic oscillator at large resolution.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Kink-antikink collisions and multi-bounce resonance windows in higher-order field theories

In this work, we study collisions of coherent structures in higher-order field-theoretic models, such as the Φ 8 , Φ 10 and Φ 12 ones. The main distinguishing feature, of the example models considered herein, is that the collision arises due to the long-range interacting algebraic tails of these solitary waves. We extend the approach to suitably initialize the relevant kinks, in the additional presence of finite initial velocity, in order to minimize the dispersive wave radiation potentially created by their slow spatial decay. We find that, when suitably initialized, these models still feature the multi-bounce resonance windows earlier found in models in which the kinks bear exponential tails, such as the Φ 4 and Φ 6 field theories among others. Also present is the self-similar structure of the associated windows with three- and more-bounce windows at the edges of two- and lower-bounce ones. Moreover, phenomenological but highly accurate (and predictive), scaling relations are derived for the dependence of the time between consecutive collisions and, e.g., the difference in kinetic energy between the incoming one and the critical one for one-bounces. Such scalings are traced extensively over two-bounce collision windows throughout the three models, hinting at the possibility of an analytical theory in this direction.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2021

Machine learning and algebraic approaches towards complete matter spectra in 4d F-theory

Motivated by engineering vector-like (Higgs) pairs in the spectrum of 4d F-theory compactifications, we combine machine learning and algebraic geometry techniques to analyze line bundle cohomologies on families of holomorphic curves. To quantify jumps of these cohomologies, we first generate 1.8 million pairs of line bundles and curves embedded in dP 3 , for which we compute the cohomologies. A white-box machine learning approach trained on this data provides intuition for jumps due to curve splittings, which we use to construct additional vector-like Higgs-pairs in an F-Theory toy model. We also find that, in order to explain quantitatively the full dataset, further tools from algebraic geometry, in particular Brill-Noether theory, are required. Using these ingredients, we introduce a diagrammatic way to express cohomology jumps across the parameter space of each family of matter curves, which reflects a stratification of the F-theory complex structure moduli space in terms of the vector-like spectrum. Furthermore, these insights provide an algorithmically efficient way to estimate the possible cohomology dimensions across the entire parameter space.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2024

Simulating image coaddition with the Nancy Grace Roman Space Telescope – I. Simulation methodology and general results

The upcoming Nancy Grace Roman Space Telescope will carry out a wide-area survey in the near-infrared. A key science objective is the measurement of cosmic structure via weak gravitational lensing. Roman data will be undersampled, which introduces new challenges in the measurement of source galaxy shapes; a potential solution is to use linear algebra-based coaddition techniques such as imcom that combine multiple undersampled images to produce a single oversampled output mosaic with a desired ‘target’ point spread function (PSF). We present here an initial application of imcom to 0.64 square degrees of simulated Roman data, based on the Roman branch of the Legacy Survey of Space and Time (LSST) Dark Energy Science Collaboration (DESC) Data Challenge 2 (DC2) simulation. We show that imcom runs successfully on simulated data that includes features such as plate scale distortions, chip gaps, detector defects, and cosmic ray masks. We simultaneously propagate grids of injected sources and simulated noise fields as well as the full simulation. We quantify the residual deviations of the PSF from the target (the ‘leakage’), as well as noise properties of the output images; we discuss how the overall tiling pattern as well as Moiré patterns appear in the final leakage and noise maps. We include appendices on interpolation algorithms and the interaction of undersampling with image processing operations that may be of broader applicability. The companion paper (‘Paper II’) explores the implications for weak lensing analyses.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2023

Tools for analysis of optimization models

The software is code for analyzing, debugging, and solving optimization models. The code implements several algorithms and provides convenient APIs to apply these algorithms to optimization models. The algorithms are primarily based on graph theory. They compute well-known partitions of graphs, and use these partitions to provide the user information about their optimization model, including diagnosing certain types of structural modeling errors. Some algorithms may be used as a subroutine to solve an optimization problem, and may call an optimization solver to facilitate this. Well-known linear algebra routines are called to provide further diagnostics. The software contains no data and no models other than toy models used for testing.

Parker, Robert↗
NASA NTRS1972

A finite element procedure for nonlinear prebuckling and initial postbuckling analysis

A procedure cast in a form appropriate to the finite element method is presented for geometrically nonlinear prebuckling and postbuckling structural analysis, including the identification of snap-through type of buckling. The principal features of this procedure are the use of direct iteration for solution of the nonlinear algebraic equations in the prebuckling range, an interpolation scheme for determination of the initial bifurcation point, a perturbation method in definition of the load-displacement behavior through the postbuckling regime, and extrapolation in determination of the limit point for snap-through buckling. Three numerical examples are presented in illustration of the procedure and in comparison with alternative approaches.

Mau, S. T.↗
NASA NTRS1982

A nonlocal theory of an electrostatic sinusoidal density drift instability

The stability of space plasmas in which the macroscopic variables vary in the direction x perpendicular to the magnetic field is usually studied by means of the local approximation, in which the fluctuating potential is assumed to be independent of x. To remove this approximation, a nonlocal problem is studied in which the background density, and hence the fluctuating potentials, are periodic in x. From the linear Vlasov/Poisson equations, a set of coupled, linear, homogeneous, algebraic equations relating the Fourier amplitudes of the eigensolution is derived. The equations are solved numerically and a hierarchy of exact eigenmodes characterized by different growth rates and spatial structures is found. At points where the density gradient is locally zero, the mode amplitude is generally several orders of magnitude lower than the peak amplitude. The dependence of these solutions on the parameters which define the background density perturbation is studied and a correspondence between these nonlocal results and those obtained with the local approximation is demonstrated.

Thomsen, M. F.↗
NASA NTRS1986

The computation of flow past an oblique wing using the thin-layer Navier-Stokes equations

Essential aspects are presented for computing flow past an oblique wing with the thin-layer Navier-Stokes equations. A new method is developed for generating a grid system around a realistic wing. This method utilizes a series of conformal transformations. The thin-shear-layer approximation and an algebraic eddy-viscosity turbulence model are used to simplify the Reynolds-averaged Navier-Stokes equations. An implicit, factored numerical scheme and the concept of pencil data structure are utilized. For the first time, some flow fields caused by the oblique wing in a supersonic free stream are discussed, emphasizing the separated vortex flows associated with such a wing.

Mehta, Unmeel↗
NASA NTRS1994

A note on the regularity of solutions of infinite dimensional Riccati equations

This note is concerned with the regularity of solutions of algebraic Riccati equations arising from infinite dimensional LQR and LQG control problems. We show that distributed parameter systems described by certain parabolic partial differential equations often have a special structure that smoothes solutions of the corresponding Riccati equation. This analysis is motivated by the need to find specific representations for Riccati operators that can be used in the development of computational schemes for problems where the input and output operators are not Hilbert-Schmidt. This situation occurs in many boundary control problems and in certain distributed control problems associated with optimal sensor/actuator placement.

Burns, John A.↗
NASA NTRS1996

Adaptive grid methods for RLV environment assessment and nozzle analysis

Rapid access to highly accurate data about complex configurations is needed for multi-disciplinary optimization and design. In order to efficiently meet these requirements a closer coupling between the analysis algorithms and the discretization process is needed. In some cases, such as free surface, temporally varying geometries, and fluid structure interaction, the need is unavoidable. In other cases the need is to rapidly generate and modify high quality grids. Techniques such as unstructured and/or solution-adaptive methods can be used to speed the grid generation process and to automatically cluster mesh points in regions of interest. Global features of the flow can be significantly affected by isolated regions of inadequately resolved flow. These regions may not exhibit high gradients and can be difficult to detect. Thus excessive resolution in certain regions does not necessarily increase the accuracy of the overall solution. Several approaches have been employed for both structured and unstructured grid adaption. The most widely used involve grid point redistribution, local grid point enrichment/derefinement or local modification of the actual flow solver. However, the success of any one of these methods ultimately depends on the feature detection algorithm used to determine solution domain regions which require a fine mesh for their accurate representation. Typically, weight functions are constructed to mimic the local truncation error and may require substantial user input. Most problems of engineering interest involve multi-block grids and widely disparate length scales. Hence, it is desirable that the adaptive grid feature detection algorithm be developed to recognize flow structures of different type as well as differing intensity, and adequately address scaling and normalization across blocks. These weight functions can then be used to construct blending functions for algebraic redistribution, interpolation functions for unstructured grid generation, forcing functions to attract/repel points in an elliptic system, or to trigger local refinement, based upon application of an equidistribution principle. The popularity of solution-adaptive techniques is growing in tandem with unstructured methods. The difficultly of precisely controlling mesh densities and orientations with current unstructured grid generation systems has driven the use of solution-adaptive meshing. Use of derivatives of density or pressure are widely used for construction of such weight functions, and have been proven very successful for inviscid flows with shocks. However, less success has been realized for flowfields with viscous layers, vortices or shocks of disparate strength. It is difficult to maintain the appropriate mesh point spacing in the various regions which require a fine spacing for adequate resolution. Mesh points often migrate from important regions due to refinement of dominant features. An example of this is the well know tendency of adaptive methods to increase the resolution of shocks in the flowfield around airfoils, but in the incorrect location due to inadequate resolution of the stagnation region. This problem has been the motivation for this research.

Thornburg, Hugh J.↗
DOE OSTI2021

Improving scalability of electronic structure code for molecular simulations in the presence of environment

A scalable density functional electronic code with Gaussian basis set, called UTEP-NRLMOL, is developed to perform simulations of molecular systems in the presence of the environment with particular attention to the memory requirements. In the electronic structure calculations, the memory and computation time are proportional to the number of atoms. Memory requirements for density functional calculations scale as N*N, where N is the number of atoms. While the recent advances in HPC offer platforms with large numbers of cores, the limited amount of memory available on a given node and poor scalability of the electronic structure codes hinder their efficient usage of these platforms. We have introduced new scaling and parallelization paradigms using MPI-3 shared-memory functionality combined with usage of sparse algebra and storage of matrices in sparse format. This extends the range of applicability of the UTEP-NRLMOL code to large systems over 10,000 atoms, or using up to 67,000 basis functions, and making use of HPC architectures using over 6,000 processors utilizing all available cores. We have also interfaced code with effective fragment potential and polarizable continuum model libraries. The code was used in simulations of several applications which are published in reputed scientific journals.

74 ATOMIC AND MOLECULAR PHYSICS↗
DOE OSTI2026

SCF Framework, HF Stability, and RPA Correlation for Jordan–Wigner-Transformed Spin Hamiltonians on Arbitrary Coupling Topologies

Mapping spins to fermions via the Jordan–Wigner (JW) transformation can render mean-field (Hartree–Fock, HF) descriptions effective for strongly correlated spin systems. As established in recent work, the application of such approaches is not limited by the nonlocal structure of JW strings or by site ordering because string operators can be absorbed into Thouless rotations of a Slater determinant, and the variational optimization of a unitary Lie-algebraic similarity transformation removes any ordering dependence. Leveraging these ideas, we develop a self-consistent field (SCF) scheme that expresses the mean-field energy as a functional of the single-particle density matrix, providing an alternative to gradient-based optimization of Thouless parameters. We derive the analytical orbital Hessian to diagnose HF stability and compute the ground-state correlation energy through the random-phase approximation (RPA). Benchmark results for the XXZ and J 1 –J 2 model on one- and two-dimensional lattices demonstrate that RPA significantly improves mean-field accuracy.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2023

cuAlign: Scalable Network Alignment on GPU Accelerators

Given two graphs, the objective of network alignment is to find the best one-to-one mapping of vertices in one graph (??) to vertices in the other (??), such that the number of overlaps is maximized. We say that edges(??, ??) ???and(??', ??') ??? are overlapped if ?? is mapped to ??' and ?? is mapped to??'. Network alignment is an important optimization problem with several applications in bioinformatics, computer vision and ontology matching. Since it is an NP-hard problem, efficient heuristics and scalable implementations are necessary. In this work, we introduce a new framework that combines the concepts of intra-network proximity using vertex embedding,Belief Propagation (BP) and approximate weighted matching, and provides qualitative improvements up to22%over state-of-the-art approaches. We also provide scalable implementations on GPU accelerators, demonstrating up to19×speedup for Belief Propagation and 3× speedup for approximate weighted matching relative to previous multithreaded implementation. A combination of combinatorial and algebraic kernels within the network alignment algorithm poses significant hurdles for parallelization. Load imbalance and irregular DRAM traffic limit achievable performance on GPUs. Our novel approach identifies and exploits unique structural proper-ties of the BP-based algorithm and employs code fusion to reduce data movement between different steps of the algorithm. Using a diverse set of inputs, we demonstrate qualitative improvements of our algorithms, and performance gains of our GPU-accelerated implementation. We believe that our work will enable algorithmic improvements and practical applications of network alignment.

Xiang, Lizhi↗
DOE OSTI2025

Chiral soft algebras for $\mathcal{N}$ = $2$ gauge theory

Some time ago, Seiberg and Witten solved for moduli spaces of vacua parameterized by scalar vacuum expectation values in $\mathcal{N}$ = $2$ gauge theories. More recently, new vacua associated to soft theorems and asymptotic symmetries have been found. Furthermore, this paper takes some first steps towards a complete picture of the infrared geometry of $\mathcal{N}$ = $2$ gauge theory incorporating both of these infrared structures.

N = 2 gauge theory↗
NASA NTRS1978

Navier-Stokes calculations for laminar and turbulent hypersonic flow over indented nosetips

A time-accurate finite-difference Navier-Stokes code has been used to calculate the viscous flow over a severely indented blunt body in a supersonic stream. An algebraic turbulence model is used and the results are compared with experimental data from wind-tunnel tests. Qualitative agreement is obtained for the surface pressure distribution and flow-field structure, including the separated bubble in the indented region. However, uncertainties still exist in the heating calculations, which are attributed to the turbulence model. For both laminar and turbulent calculations, the flow exhibits a fundamental unsteady character at a frequency of about 50 kHz.

Rakich, J. V.↗
NASA NTRS1985

Algebraic grid generation using tensor product B-splines

Finite difference methods are more successful if the accompanying grid has lines which are smooth and nearly orthogonal. The development of an algorithm which produces such a grid when given the boundary description. Topological considerations in structuring the grid generation mapping are discussed. The concept of the degree of a mapping and how it can be used to determine what requirements are necessary if a mapping is to produce a suitable grid is examined. The grid generation algorithm uses a mapping composed of bicubic B-splines. Boundary coefficients are chosen so that the splines produce Schoenberg's variation diminishing spline approximation to the boundary. Interior coefficients are initially chosen to give a variation diminishing approximation to the transfinite bilinear interpolant of the function mapping the boundary of the unit square onto the boundary grid. The practicality of optimizing the grid by minimizing a functional involving the Jacobian of the grid generation mapping at each interior grid point and the dot product of vectors tangent to the grid lines is investigated. Grids generated by using the algorithm are presented.

Saunders, B. V.↗
DOE OSTI2022

GSoFa: Scalable Sparse Symbolic LU Factorization on GPUs

Decomposing a matrix $\mathbf {A}$ into a lower matrix $\mathbf {L}$ and an upper matrix $\mathbf {U}$, which is also known as LU decomposition, is an essential operation in numerical linear algebra. For a sparse matrix, LU decomposition often introduces more nonzero entries in the $\mathbf {L}$ and $\mathbf {U}$ factors than in the original matrix. A symbolic factorization step is needed to identify the nonzero structures of $\mathbf {L}$ and $\mathbf {U}$ matrices. Attracted by the enormous potentials of the Graphics Processing Units (GPUs), an array of efforts have surged to deploy various LU factorization steps except for the symbolic factorization, to the best of our knowledge, on GPUs. This article introduces gSoFa, the first GPU-based symbolic factorization design with the following three optimizations to enable scalable LU symbolic factorization for nonsymmetric pattern sparse matrices on GPUs. First, here we introduce a novel fine-grained parallel symbolic factorization algorithm that is well suited for the Single Instruction Multiple Thread (SIMT) architecture of GPUs. Second, we tailor supernode detection into a SIMT friendly process and strive to balance the workload, minimize the communication and saturate the GPU computing resources during supernode detection. Third, we introduce a three-pronged optimization to reduce the excessive space consumption problem faced by multi-source concurrent symbolic factorization. Taken together, gSoFa achieves up to 31× speedup from 1 to 44 Summit nodes (6 to 264 GPUs) and outperforms the state-of-the-art CPU project, on average, by 5×. Notably, gSoFa also achieves up to 47 percent of the peak memory throughput of a V100 GPU in the Summit Supercomputer.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Equilibrium field theory of magnetic monopoles in degenerate square spin ice: Correlations, entropic interactions, and charge screening regimes

In this work, we describe degenerate square spin as an ensemble of magnetic monopoles coupled via an emergent entropic field that subsumes the effect of the underlying spin vacuum. We compute their effective free energy, entropic interaction, correlations, screening, and structure factor, and find that they coincide with the experimental ones. Unlike in pyrochlore ices, a dimensional mismatch between real and entropic interactions leads to weak singularities at the pinch points and algebraic correlations at long distances. This algebraic screening can be, however, camouflaged by a pseudoscreening regime.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗