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,045 records · Page 58

A projection method for particle resampling

Particle discretizations of partial differential equations are advantageous for high-dimensional kinetic models in phase-space due to their better scalability than continuum approaches with respect to dimension. Complex processes collectively referred to as particle noise hamper long time simulations with particle methods. One approach to address this problem is particle mesh adaptivity, or remapping, known as particle resampling and remeshing. Here, this work introduces a resampling method that projects particles to and from a (finite element) function space. The method is simple, using standard sparse linear algebra and finite element techniques, and it preserves all moments up to the order of a polynomial represented exactly by the continuum function space. It is distinguished from most other mesh-based methods in that new particle positions and number are decoupled from the mesh, allowing particle and continuum meshes to be adapted relatively independently. While this work is developed with structured particle and continuum phase-space grids on 1X + 1V Vlasov-Poisson models of Landau damping and two-stream instability, the method is well-suited to unstructured grids. Stable long time dynamics are demonstrated up to time T = 500. Reproducibility artifacts and data are publicly available.

Kinetic methods↗

Topological Rigidity and Non-Abelian Defect Junctions in Chiral Nematic Systems with Effective Biaxial Symmetry

We study topologically stable defect structures in systems where the defect line classification in three dimensions and associated algebra of interactions (the fundamental group) are governed by the non-Abelian eight-element group, the quaternions 𝑄 8 . The non-Abelian character of the defect algebra leads to a topological rigidity of bound defect pairs, and trivalent junctions which are the building blocks of multijunction trivalent networks. We realize such structures in laboratory chiral nematics and analyze their behavior analytically, along with numerical modeling.

Liquid crystals↗

Computing Relative Joint Positions of Robot Arms

Vector-algebra method developed for extracting Denavit-Hartenberg parameters for any assembled robot arm. Method for extracting relative joint geometry of robot arms useful to researchers who need data for existing robot arms for either validation of mathematical models or for studies involving actual control of these devices. Method, does not require robot arm to be disassembled, also useful in recalibration of misalined or bent robot arm and becomes useful industrial procedure. Merit of method is errors not propagated.

Barker, L. K.↗

Maxwell's second- and third-order equations of transfer for non-Maxwellian gases

Condensed algebraic forms for Maxwell's second- and third-order equations of transfer are developed for the case of molecules described by either elastic hard spheres, inverse-power potentials, or by Bird's variable hard-sphere model. These hardly reduced, yet exact, equations provide a new point of origin, when using the moment method, in seeking approximate solutions in the kinetic theory of gases for molecular models that are physically more realistic than that provided by the Maxwell model. An important by-product of the analysis when using these second- and third-order relations is that a clear mathematical connection develops between Bird's variable hard-sphere model and that for the inverse-power potential.

Baganoff, D.↗

Non-invertible symmetries and LSM-type constraints on a tensor product Hilbert space

We discuss the exact non-invertible Kramers-Wannier symmetry of 1+1d lattice models on a tensor product Hilbert space of qubits. This symmetry is associated with a topological defect and a conserved operator, and the latter can be presented as a matrix product operator. Importantly, unlike its continuum counterpart, the symmetry algebra involves lattice translations. Consequently, it is not described by a fusion category. In the presence of this defect, the symmetry algebra involving parity/time-reversal is realized projectively, which is reminiscent of an anomaly. Different Hamiltonians with the same lattice non-invertible symmetry can flow in their continuum limits to infinitely many different fusion categories (with different Frobenius-Schur indicators), including, as a special case, the Ising CFT. The non-invertible symmetry leads to a constraint similar to that of Lieb-Schultz-Mattis, implying that the system cannot have a unique gapped ground state. It is either in a gapless phase or in a gapped phase with three (or a multiple of three) ground states, associated with the spontaneous breaking of the lattice non-invertible symmetry.

Seiberg, Nathan (ORCID:000000033897046X)↗

Tensor Decompositions for Count Data that Leverage Stochastic and Deterministic Optimization

There is growing interest to extend low-rank matrix decompositions to multi-way arrays, or tensors. One fundamental low-rank tensor decomposition is the canonical polyadic decomposition (CPD). The challenge of fitting a low-rank, nonnegative CPD model to Poisson-distributed count data is of particular interest. Several popular algorithms use local search methods to approximate the global maximum likelihood estimator from local minima. Simultaneously, a recent trend in theoretical computer science and numerical linear algebra leverages randomization to solve very large, hard problems. The typical approach is to use randomization for a fast approximation and determinism for refinement to yield effective algorithms with theoretical guarantees. Two popular algorithms for Poisson CPD reflect that emergent dichotomy: CP Alternating Poisson Regression is a deterministic algorithm and Generalized Canonical Polyadic decomposition makes use of stochastic algorithms in several variants. This work extends recent work to develop two new methods that leverage randomized and deterministic algorithms for improved accuracy and performance.

97 MATHEMATICS AND COMPUTING↗

An experimental investigation into the feasibility of a thermoelectric heat flux gage

An experiment was conducted to determine the feasibility of using a commerically available thermoelectric device as a heat flux gage. In certain research applications, the thermoelectric heat flux gage can provide a relatively simple means to model a warm fluid--cold wall. The experiment showed that heat flux through the gage could be correlated within two percent to the applied thermoelectric current through the device and the hot and cold side temperature with a simple algebraic equation.

Jones, J. C.↗

Studies of implicit and explicit solution techniques in transient thermal analysis of structures

Studies aimed at an increase in the efficiency of calculating transient temperature fields in complex aerospace vehicle structures are reported. The advantages and disadvantages of explicit and implicit algorithms are discussed and a promising set of implicit algorithms with variable time steps, known as GEARIB, is described. Test problems, used for evaluating and comparing various algorithms, are discussed and finite element models of the configurations are described. These problems include a coarse model of the Space Shuttle wing, an insulated frame tst article, a metallic panel for a thermal protection system, and detailed models of sections of the Space Shuttle wing. Results generally indicate a preference for implicit over explicit algorithms for transient structural heat transfer problems when the governing equations are stiff (typical of many practical problems such as insulated metal structures). The effects on algorithm performance of different models of an insulated cylinder are demonstrated. The stiffness of the problem is highly sensitive to modeling details and careful modeling can reduce the stiffness of the equations to the extent that explicit methods may become the best choice. Preliminary applications of a mixed implicit-explicit algorithm and operator splitting techniques for speeding up the solution of the algebraic equations are also described.

Adelman, H. M.↗

Relative control effectiveness technique with application to airplane control coordination

A method to select optimal combinations of the control variables of a linear system is reported. The combinations are chosen so that the control channels have their principal influences on selected fundamental modes of the system. A series of algebraic maximization problems is used to maximize the effects of the control channels on selected modes while simultaneously minimizing the effects on the remaining modes. The method is applied to the lateral and directional control of a linearized airplane model having ailerons, a rudder, and differential tail surfaces. Integration of these control eliminates oscillations present in the roll rate for a step lateral-control input and improves the sideslip response with reduced rolling motions for a step directional-control input. Inclusion of thrust-vectoring engine nozzles improves the roll rate capability of the airplane.

Lallman, F. J.↗

Selective Amnesia using Contrastive Subnet Erasure for Class Level Unlearning in Vision Models

We study concept-level forgetting in pretrained vision models: removing an entire semantic category so the system no longer recognizes that object in unseen images and contexts, rather than merely forgetting specific training examples. Prior work either applies blunt global projections or fine-tunes parameters, which can introduce collateral damage to unrelated features, add compute, and become unstable as forgetting strength increases. We introduce Contrastive Subnet Erasure (CSE), a training-free, encoder-centric edit that targets a compact set of channels most responsible for the class and attenuates them in a calibrated manner. The modification is algebraically folded into the subsequent layer, yielding no inference-time overhead and leaving task heads unchanged. To evaluate whether forgetting generalizes beyond the data used to specify the class, we introduce a cross dataset protocol in which the class is defined on a source dataset and performance is measured on a disjoint target dataset drawn from a different distribution with no shared images. This setup tests whether the model still fails to recognize the object when it looks different or appears in new scenes, and it helps avoid overfitting to patterns in the source dataset. Across CIFAR 10, CIFAR 100, and ImageNet under this protocol, CSE achieves stronger forgetting of the target class while better preserving non target utility than existing baselines in both single class and multi class settings. Overall, CSE provides a simple, stable, and deployment-ready mechanism for class-level unlearning in vision.

Kotevska, Olivera [ORNL] (ORCID:0000000316772243)↗

Compare linear-system solver and preconditioner stacks with emphasis on GPU performance and propose phase-2 NGP solver development pathway

The goal of the ExaWind project is to enable predictive simulations of wind farms comprised of many megawatt-scale turbines situated in complex terrain. Predictive simulations will require computational fluid dynamics (CFD) simulations for which the mesh resolves the geometry of the turbines and captures the rotation and large deflections of blades. Whereas such simulations for a single turbine are arguably petascale class, multi-turbine wind farm simulations will require exascale-class resources. The primary physics codes in the ExaWind project are Nalu-Wind, which is an unstructured-grid solver for the acoustically incompressible Navier-Stokes equations, and OpenFAST, which is a whole-turbine simulation code. The Nalu-Wind model consists of the mass-continuity Poisson-type equation for pressure and a momentum equation for the velocity. For such modeling approaches, simulation times are dominated by linear-system setup and solution for the continuity and momentum systems. For the ExaWind challenge problem, the moving meshes greatly affect overall solver costs as reinitialization of matrices and recomputation of preconditioners is required at every time step. In this report we evaluated GPU-performance baselines for the linear solvers in the Trilinos and hypre solver stacks using two representative Nalu-Wind simulations: an atmospheric boundary layer precursor simulation on a structured mesh, and a fixed-wing simulation using unstructured overset meshes. Both strong-scaling and weak-scaling experiments were conducted on the OLCF supercomputer Summit and similar proxy clusters. We focused on the performance of multi-threaded Gauss-Seidel and two-stage Gauss-Seidel that are extensions of classical Gauss-Seidel; of one-reduce GMRES, a communication-reducing variant of the Krylov GMRES; and algebraic multigrid methods that incorporate the afore-mentioned methods. The team has established that AMG methods are capable of solving linear systems arising from the fixed-wing overset meshes on CPU, a critical intermediate result for ExaWind FY20 Q3 and Q4 milestones. For the fixed-wing strong-scaling study (model with 3M grid-points), the team identified that Nalu-Wind simulations with the new Trilinos and hypre solvers scale to modest GPU counts, maintaining above 70% efficiency up to 6 GPUs. However, there still remain significant bottlenecks to performance: matrix assembly (hypre), AMG setup (hypre and Trilinos) In the weak-scaling experiments (going from 0.4M to 211M gridpoints), it's shown that the solver apply phases are faster on GPUs, but that Nalu-Wind simulation times grow, primarily due to the multigrid-setup process. Finally, based on the report outcomes, we propose a linear solver path-forward for the remainder of the ExaWind project. Near term, the NREL team will continue their work on GPU-based linear-system assembly. They will also investigate how the use of alternatives to the NVIDIA UVM (unified virtual memory) paradigm affects performance. Longer term, the NREL team will evaluate algorithmic performance on other types of accelerators and merge their improvements back to the main hypre repository branch. Near term, the Trilinos team will address performance bottlenecks identified in this milestone, such as implementing a GPU-based segregated momentum solve and reusing matrix graphs across linear-system assembly phases. Longer term, the Trilinos team will do detailed analysis and optimization of multigrid setup.

17 WIND ENERGY↗

An algebraic convolution formulation for multiple-scattering correction in small-angle neutron scattering

Multiple scattering in small-angle neutron scattering (SANS) redistributes spectral weight and distorts structural interpretation, particularly for thick or strongly scattering samples. We develop a finite-dimensional spectral desmearing framework that corrects multiple scattering without resorting to integral transforms or model-dependent extrapolation. The primary intensity is expanded in an orthonormal basis adapted to the isotropic transverse-momentum measure, under which convolution reduces to a recursive tensor contraction, allowing the Poisson-weighted multiple-scattering series to be evaluated directly in a finite-dimensional basis representation. This formulation yields a stable forward–inverse mapping between apparent and primary spectra. Numerical tests demonstrate convergence under repeated convolution and accurate recovery of the single-scattering intensity. Application to SANS measurements collected at multiple neutron facilities, including the Spallation Neutron Source, the High Flux Isotope Reactor, and the Institut Laue-Langevin, shows the quantitative reconstruction of the underlying primary spectrum across a wide range of transmission conditions, including strongly attenuating samples. Here, the method provides a stable, model-agnostic framework for multiple-scattering correction in SANS and enables consistent structural interpretation across instruments and scattering regimes.

Tung, Chi-Huan [Oak Ridge National Laboratory (ORN↗

Putting Priors in Mixture Density Mercer Kernels

This paper presents a new methodology for automatic knowledge driven data mining based on the theory of Mercer Kernels, which are highly nonlinear symmetric positive definite mappings from the original image space to a very high, possibly infinite dimensional feature space. We describe a new method called Mixture Density Mercer Kernels to learn kernel function directly from data, rather than using predefined kernels. These data adaptive kernels can en- code prior knowledge in the kernel using a Bayesian formulation, thus allowing for physical information to be encoded in the model. We compare the results with existing algorithms on data from the Sloan Digital Sky Survey (SDSS). The code for these experiments has been generated with the AUTOBAYES tool, which automatically generates efficient and documented C/C++ code from abstract statistical model specifications. The core of the system is a schema library which contains template for learning and knowledge discovery algorithms like different versions of EM, or numeric optimization methods like conjugate gradient methods. The template instantiation is supported by symbolic- algebraic computations, which allows AUTOBAYES to find closed-form solutions and, where possible, to integrate them into the code. The results show that the Mixture Density Mercer-Kernel described here outperforms tree-based classification in distinguishing high-redshift galaxies from low- redshift galaxies by approximately 16% on test data, bagged trees by approximately 7%, and bagged trees built on a much larger sample of data by approximately 2%.

Srivastava, Ashok N.↗

Interlaminar stress analysis of dropped-ply laminated plates and shells by a mixed method

A mixed method of approximation based on Reissner's variational principle is developed for the linear analysis of interlaminar stresses in laminated composites, with special interest in laminates that contain terminated internal plies (dropped-ply laminates). Two models are derived, one for problems of generalized plane deformation and the other for the axisymmetric response of shells of revolution. A layerwise approach is taken in which the stress field is assumed with an explicit dependence on the thickness coordinate in each layer. The dependence of the stress field on the thickness coordinate is determined such that the three-dimensional equilibrium equations are satisfied by the approximation. The solution domain is reduced to one dimension by integration through the thickness. Continuity of tractions and displacements between layers is imposed. The governing two-point boundary value problem is composed of a system of both differential and algebraic equations (DAE's) and their associated boundary conditions. Careful evaluation of the system of DAE's was required to arrive at a form that allowed application of a one-step finite difference approximation. A two-stage Gauss implicit Runge-Kutta finite difference scheme was used for the solution because of its relatively high degree of accuracy. Patch tests of the two models revealed problems with solution accuracy for the axisymmetric model of a cylindrical shell loaded by internal pressure. Parametric studies of dropped-ply laminate characteristics and their influence on the interlaminar stresses were performed using the generalized plane deformation model. Eccentricity of the middle surface of the laminate through the ply drop-off was found to have a minimal effect on the interlaminar stresses under longitudinal compression, transverse tension, and in-plane shear. A second study found the stiffness change across the ply termination to have a much greater influence on the interlaminar stresses.

Harrison, Peter N.↗

Multi-physics Preconditioning for Thermally Activated Batteries

Thermal batteries, also known as molten-salt batteries, are single-use reserve power systems activated by pyrotechnic heat generation, which transitions the solid electrolyte into a molten state. The simulation of these batteries relies on multiphysics modeling to evaluate performance and behavior under various conditions. This paper presents advancements in scalable preconditioning strategies for the Thermally Activated Battery Simulator (TABS) tool, enabling efficient solutions to the coupled electrochemical systems that dominate computational costs in thermal battery simulations. We propose a hierarchical block Gauss-Seidel preconditioner implemented through the Teko package in Trilinos, which effectively addresses the challenges posed by tightly coupled physics, including charge transport, porous flow, and species diffusion. The preconditioner leverages scalable subblock solvers, including smoothed aggregation algebraic multigrid (SA-AMG) methods and domain-decomposition techniques, to achieve robust convergence and parallel scalability. Strong and weak scaling studies demonstrate the solver’s ability to handle problem sizes up to 51.3 million degrees of freedom on 2048 processors, achieving near sub-second setup and solve times for the end-to-end electrochemical solve. These advancements significantly improve the computational efficiency and turnaround time of thermal battery simulations, paving the way for higher-resolution models and enabling the transition from 2D axisymmetric to full 3D simulations.

25 ENERGY STORAGE↗

Anomalies of non-invertible symmetries in (3+1)d

Anomalies of global symmetries are important tools for understanding the dynamics of quantum systems. We investigate anomalies of non-invertible symmetries in 3+1d using 4+1d bulk topological quantum field theories given by Abelian two-form gauge theories, with a 0-form permutation symmetry. Gauging the 0-form symmetry gives the 4+1d “inflow” symmetry topological field theory for the non-invertible symmetry. We find a two levels of anomalies: (1) the bulk may fail to have an appropriate set of loop excitations which can condense to trivialize the boundary dynamics, and (2) the “Frobenius-Schur indicator” of the non-invertible symmetry (generalizing the Frobenius-Schur indicator of 1+1d fusion categories) may be incompatible with trivial boundary dynamics. As a consequence we derive conditions for non-invertible symmetries in 3+1d to be compatible with symmetric gapped phases, and invertible gapped phases. Along the way, we see that the defects characterizing \mathbb{Z}_{4} ℤ 4 ordinary symmetry host worldvolume theories with time-reversal symmetry \mathsf{T} 𝖳 obeying the algebra \mathsf{T}^{2}=C 𝖳 2 = C or \mathsf{T}^{2}=(-1)^{F}C, 𝖳 2 = ( − 1 ) F C , with C C a unitary charge conjugation symmetry. We classify the anomalies of this symmetry algebra in 2+1d and further use these ideas to construct 2+1d topological orders with non-invertible time-reversal symmetry that permutes anyons. As a concrete realization of our general discussion, we construct new lattice Hamiltonian models in 3+1d with non-invertible symmetry, and constrain their dynamics.

Córdova, Clay↗

GaussFit - A system for least squares and robust estimation

GaussFit is a new computer program for solving least-squares and robust estimation problems. It has a number of unique features, including a complete programming language designed especially to formulate estimation problems, a built-in compiler and interpreter to support the programming language, and a built-in algebraic manipulator for calculating the required partial derivatives analytically. These features make GaussFit very easy to use, so that even complex problems can be set up and solved with minimal effort. GaussFit can correctly handle many cases of practical interest: nonlinear models, exact constraints, correlated observations, and models where the equations of condition contain more than one observed quantity. An experimental robust estimation capability is built into GaussFit so that data sets contaminated by outliers can be handled simply and efficiently.

Jefferys, W. H.↗

Numerical methods in laminar and turbulent flow; Proceedings of the 7th International Conference, Stanford Univ., CA, July 15-19, 1991. Vol. 7, pts. 1 & 2

Consideration is given to the impulse response of a laminar boundary layer and receptivity; numerical transition to turbulence in plane Poiseuille flow; large eddy simulation of turbulent wake flow; a viscous model and loss calculation of a multisplitter cascade; vortex initiation during dynamic stall of an airfoil; a numerical analysis of isothermal flow in a combustion chamber; and compressible flow calculations with a two-equation turbulence model and unstructured grids. Attention is also given to a 2D calculation of a buoyant flow around a burning sphere, a fast multigrid method for 3D turbulent incompressible flows, a streaming flow induced by an oscillating cascade of circular cylinders, an algebraic multigrid scheme for solving the Navier-Stokes equations on unstructured meshes; and nonlinear coupled multigrid solutions to thermal problems employing different nodal grid arrangements and convective transport approximations.

Taylor, C.↗