Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “algebraic methods”

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 757 records · Page 42

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.↗

Universal spin dynamics in infinite-temperature one-dimensional quantum magnets

Here, we address the nature of spin dynamics in various integrable and non-integrable, isotropic and anisotropic quantum spin-$S$ chains, beyond the paradigmatic $S=1/2$ Heisenberg model. In particular, we investigate the algebraic long-time decay $\propto t^{-1/z}$ of the spin-spin correlation function at infinite temperature, using state-of-the-art simulations based on tensor network methods. We identify three universal regimes for the spin transport, independent of the exact microscopic model: (i) superdiffusive with $z=3/2$, as in the Kardar-Parisi-Zhang universality class, when the model is integrable with extra symmetries such as spin isotropy that drive the Drude weight to zero, (ii) ballistic with $z=1$ when the model is integrable with a finite Drude weight, and (iii) diffusive with $z=2$ with easy-axis anisotropy or without integrability, at variance with previous observations.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

End-to-end GPU acceleration of low-order-refined preconditioning for high-order finite element discretizations

In this article, we present algorithms and implementations for the end-to-end GPU acceleration of matrix-free low-order-refined preconditioning of high-order finite element problems. The methods described here allow for the construction of effective preconditioners for high-order problems with optimal memory usage and computational complexity. The preconditioners are based on the construction of a spectrally equivalent low-order discretization on a refined mesh, which is then amenable to, for example, algebraic multigrid preconditioning. The constants of equivalence are independent of mesh size and polynomial degree. For vector finite element problems in H(curl) and H(div) (e.g., for electromagnetic or radiation diffusion problems), a specially constructed interpolation–histopolation basis is used to ensure fast convergence. Detailed performance studies are carried out to analyze the efficiency of the GPU algorithms. The kernel throughput of each of the main algorithmic components is measured, and the strong and weak parallel scalability of the methods is demonstrated. The different relative weighting and significance of the algorithmic components on GPUs and CPUs is discussed. Results on problems involving adaptively refined nonconforming meshes are shown, and the use of the preconditioners on a large-scale magnetic diffusion problem using all spaces of the finite element de Rham complex is illustrated.

97 MATHEMATICS AND COMPUTING↗

High Order Wall-Modeled Large-Eddy Simulation on Mixed Unstructured Meshes

In the present study, an algebraic equilibrium wall model previously developed for hexahedral elements is extended to handle mixed meshes including prismatic, tetrahedral, and pyramidal elements in the context of a discontinuous high-order method. This extension is needed for complex geometries, for which high-order mixed elements (e.g., tetrahedral and pyramidal elements) are often necessary near solid walls to avoid meshing challenges. Various design decisions are discussed to achieve the best performance on massively parallel CPU/GPU architectures for a production-level high-order large-eddy simulation solver based on the flux reconstruction/correction procedure via reconstruction method, hpMusic. The extension to other elements is first evaluated using a benchmark channel flow problem at various Reynolds numbers. After that, flow over the NASA high-lift Common Research Model (CRM-HL) from the 4th AIAA High-lift Prediction Workshop is computed to further test the new implementation. Computational results at the third- and fourth-order accuracies are compared with experimental data.

Engineering↗

Distribution of mica polytypes among space groups.

All the possible space groups for mica polytypes are deduced by making use of the characteristics of the mica unit layer and stacking mode. The algebraic properties of the vector-stacking symbol of Ross et al. (1966) are examined, and a simple algorithm for deducing the space group from this symbol is presented. A method considered for enumerating all possible stacking sequences of mica polytypes makes use of a computer.

Takeda, H.↗

Control logic to track the outputs of a command generator or randomly forced target

A procedure is presented for synthesizing time-invariant control logic to cause the outputs of a linear plant to track the outputs of an unforced (or randomly forced) linear dynamic system. The control logic uses feed-forward of the reference system state variables and feedback of the plant state variables. The feed-forward gains are obtained from the solution of a linear algebraic matrix equation of the Liapunov type. The feedback gains are the usual regulator gains, determined to stabilize (or augment the stability of) the plant, possibly including integral control. The method is applied here to the design of control logic for a second-order servomechanism to follow a linearly increasing (ramp) signal, an unstable third-order system with two controls to track two separate ramp signals, and a sixth-order system with two controls to track a constant signal and an exponentially decreasing signal (aircraft landing-flare or glide-slope-capture with constant velocity).

Trankle, T. L.↗

Numerical solution of two-dimensional turbulent blunt body flows with an impinging shock

An implicit finite-difference method has been developed to compute two-dimensional, turbulent, blunt body flows with an impinging shock wave. The full time-averaged Navier-Stokes equations are solved with algebraic eddy viscosity and turbulent Prandtl number models employed for shear stress and heat flux. The irregular-shaped bow shock is treated as a discontinuity across which the Rankine-Hugoniot equations are applied. A Type III turbulent shock interference flow field has been computed and the numerical results compare favorably with existing experimental data. In addition, comparisons are made between the present implicit code and a previous explicit code.

Tannehill, J. C.↗

Programs for high-speed Fourier, Mellin and Fourier-Bessel transforms

Several FORTRAN program modules for performing one-dimensional and two-dimensional discrete Fourier transforms, Mellin, and Fourier-Bessel transforms are described along with programs that realize the algebra of high speed Fourier transforms on a computer. The programs can perform numerical harmonic analysis of functions, synthesize complex optical filters on a computer, and model holographic image processing methods.

Ikhabisimov, D. K.↗

A nearly-linear computational-cost scheme for the forward dynamics of an N-body pendulum

The dynamic equations of motion of an n-body pendulum with spherical joints are derived to be a mixed system of differential and algebraic equations (DAE's). The DAE's are kept in implicit form to save arithmetic and preserve the sparsity of the system and are solved by the robust implicit integration method. At each solution point, the predicted solution is corrected to its exact solution within given tolerance using Newton's iterative method. For each iteration, a linear system of the form J delta X = E has to be solved. The computational cost for solving this linear system directly by LU factorization is O(n exp 3), and it can be reduced significantly by exploring the structure of J. It is shown that by recognizing the recursive patterns and exploiting the sparsity of the system the multiplicative and additive computational costs for solving J delta X = E are O(n) and O(n exp 2), respectively. The formulation and solution method for an n-body pendulum is presented. The computational cost is shown to be nearly linearly proportional to the number of bodies.

Chou, Jack C. K.↗

Experiments with conjugate gradient algorithms for homotopy curve tracking

There are algorithms for finding zeros or fixed points of nonlinear systems of equations that are globally convergent for almost all starting points, i.e., with probability one. The essence of all such algorithms is the construction of an appropriate homotopy map and then tracking some smooth curve in the zero set of this homotopy map. HOMPACK is a mathematical software package implementing globally convergent homotopy algorithms with three different techniques for tracking a homotopy zero curve, and has separate routines for dense and sparse Jacobian matrices. The HOMPACK algorithms for sparse Jacobian matrices use a preconditioned conjugate gradient algorithm for the computation of the kernel of the homotopy Jacobian matrix, a required linear algebra step for homotopy curve tracking. Here, variants of the conjugate gradient algorithm are implemented in the context of homotopy curve tracking and compared with Craig's preconditioned conjugate gradient method used in HOMPACK. The test problems used include actual large scale, sparse structural mechanics problems.

Irani, Kashmira M.↗

Development of an algebraic turbulence model for analysis of propulsion flows

A simple turbulence model that will be applicable to propulsion flows having both wall bounded and unbounded regions was developed and installed within the PARC Navier-Stokes code by linking two existing algebraic turbulence models. The first is the Modified Mixing Length (MML) model which is optimized for wall bounded flows. The second is the Thomas model, the standard algebraic turbulence model in PARC which has been used to calculate both bounded and unbounded turbulent flows but was optimized for the latter. This paper discusses both models and the method employed to link them into one model (referred to as the MMLT model). The PARC code with the MMLT model was applied to two dimensional turbulent flows over a flat plate and over a backward facing step to validate and optimize the model and to compare its predictions to those obtained with the three turbulence models already available in PARC.

Georgiadis, N. J.↗

Development of an algebraic turbulence model for analysis of propulsion flows

A simple turbulence model that will be applicable to propulsion flows having both wall bounded and unbounded regions was developed and installed within the PARC Navier-Stokes code by linking two existing algebraic turbulence models. The first is the Modified Mixing Length (MML) model which is optimized for wall bounded flows. The second is the Thomas model, the standard algebraic turbulence model in PARC which has been used to calculate both bounded and unbounded turbulent flows but was optimized for the latter. This paper discusses both models and the method employed to link them into one model (referred to as the MMLT model). The PARC code with the MMLT model was applied to two dimensional turbulent flows over a flat plate and over a backward facing step to validate and optimize the model and to compare its predictions to those obtained with the three turbulence models already available in PARC.

Georgiadis, N. J.↗

ALDF Data Retrieval Algorithms for Validating the Optical Transient Detector (OTD) and the Lightning Imaging Sensor (LIS)

A linear algebraic solution is provided for the problem of retrieving the location and time of occurrence of lightning ground strikes from in Advanced Lightning Direction Finder (ALDF) network. The ALDF network measures field strength, magnetic bearing, and arrival time of lightning radio emissions and solutions for the plane (i.e.. no Earth curvature) are provided that implement all of these measurements. The accuracy of the retrieval method is tested using computer-simulated data sets and the relative influence of bearing and arrival time data on the outcome of the final solution is formally demonstrated. The algorithm is sufficiently accurate to validate NASA's Optical Transient Detector (OTD) and Lightning Imaging System (LIS). We also introduce a quadratic planar solution that is useful when only three arrival time measurements are available. The algebra of the quadratic root results are examined in detail to clarify what portions of the analysis region lead to fundamental ambiguities in source location. Complex root results are shown to be associated with the presence of measurement errors when the lightning source lies near an outer sensor baseline of the ALDF network. For arbitrary noncollinear network geometries and in the absence of measurement errors, it is shown that the two quadratic roots are equivalent (no source location ambiguity) on the outer sensor baselines. The accuracy of the quadratic planar method is tested with computer-generated data sets and the results are generally better than those obtained from the three station linear planar method when bearing errors are about 2 degrees.

Koshak, W. J.↗

A mixed-mode crack analysis of rectilinear anisotropic solids using conservation laws of elasticity

A very simple and convenient method of analysis for studying two-dimensional mixed-mode crack problems in rectilinear anisotropic solids is presented. The analysis is formulated on the basis of conservation laws of anisotropic elasticity and of fundamental relationships in anisotropic fracture mechanics. The problem is reduced to a system of linear algebraic equations in mixed-mode stress intensity factors. One of the salient features of the present approach is that it can determine directly the mixed-mode stress intensity solutions from the conservation integrals evaluated along a path removed from the crack-tip region without the need of solving the corresponding complex near-field boundary value problem. Several examples with solutions available in the literature are solved to ensure the accuracy of the current analysis. This method is further demonstrated to be superior to other approaches in its numerical simplicity and computational efficiency. Solutions of more complicated and practical engineering problems dealing with the crack emanating from a circular hole in composites are presented also to illustrate the capacity of this method.

Wang, S. S.↗

Time-explicit Darwin PIC algorithm

A new approach to Darwin particle-in-cell plasma simulation is described. Using a finite-element approach, the vector potential is assured to be exactly solenoidal. This allows writing the system of multi-species particles as an action-at-a-distance Hamiltonian system. Applying recently-developed explicit symplectic methods to this gives a time-explicit algorithm with all desired properties. Elliptic systems for the electrostatic and magneto-static portions of the problem are inverted efficiently by an algebraic multi-grid algorithm. The algorithm is implemented in a two-dimensional Cartesian-geometry code and tested by application to Weibel instability and to Alfvén wave dynamics. Results show the effectiveness of this approach. Extensions to arbitrary meshes and to a partially time-implicit scheme are briefly discussed.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Fractonic coset construction for spontaneously broken translations

We study the homogeneous breaking of spatial translation symmetry concomitantly with the spontaneous breaking of other internal and spacetime symmetries, including dilations. We use the symmetry-breaking pattern as the only input to derive, via the coset construction, general effective field theories for the symmetry-originated modes associated with Goldstone’s theorem, namely the Nambu-Goldstone candidates. Through explicit computations, we show that integrating out the explicit massive Nambu-Goldstone candidates or imposing symmetric constraints, namely the inverse Higgs constraints, to express massive modes in terms of the massless ones leads to physically distinct effective field theories. This sensitivity to the chosen method can be traced back to the homogeneous breaking of translations, the homogeneous aspect of the breaking induces a mixing between internal and spacetime symmetries at the level of the Lie algebra. This, in turn, leads to subtle discussions about the inverse Higgs constraints, in particular that they lead to a loss of generality in our specific examples. The derived general effective field theories also give rise to a broad class of theories exhibiting emergent enhanced shift symmetries, which constrain the mobility of the modes. The latter are referred to as fractonic modes. Published by the American Physical Society 2025

Chavda, Ameya (ORCID:0000000211731605)↗

Co-design for Particle Applications at Exascale

Co-design across the Exascale Computing Project (ECP) has been critical for both enabling science applications and bringing disparate communities together. Developing and porting applications to the various high-performance computing (HPC) architectures on pre-exascale and exascale computers has been quite challenging due to the diversity of hardware features and software stacks. The Co-design Center for Particle Applications (CoPA) has developed and enhanced the Cabana and PROGRESS/BML libraries to facilitate the creation of new particle applications, make existing particle applications exascale capable, and allow teams to explore new capabilities. Particle methods from atomistic, mesoscale, continuum, through cosmological scales have been built with Cabana, along with new possibilities for application coupling. Similarly, the PROGRESS/BML library has enabled quantum particle applications with linear algebra solvers to use advanced hardware. Across these CoPA-developed libraries, the co-design abstraction layer combines performance portability with math library support to facilitate separation of concerns and directly support science runs.

97 MATHEMATICS AND COMPUTING↗

A natural conservative flux difference splitting for the hyperbolic systems of gasdynamics

Gasdynamic hyperbolic systems are treated by a novel conservative flux difference splitting upwind method which is applicable to explicit or implicit and iterative or direct schemes, for marching in time or space with the Euler or compressible Navier-Stokes equations. The method is able to capture sharp shocks correctly by maintaining global conservation. The embedded characteristics formulation is cast in the volumetric internal energy primitive variable, which is effective for real as well as perfect gases. Higher order upwind formulae are constructed from the distribution of pieces of the simple internal flux difference splitting, and the method reverts to first order at the appropriate points in order not to violate the domain of dependence by differencing across discontinuities. At insignificant computational overhead, switching is done by simple algebraic extensions of the truth functions that determine upwind direction for the first order scheme.

Lombard, C. K.↗