Search NASA⌕ Search

SEARCH · Search NASA

Results for “Computer Algebra”

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,063 records · Page 59
All sourcesNASA NTRSDOE OSTI
NASA NTRS1995

Numerical simulation of supersonic flow using a new analytical bleed boundary condition

A new analytical bleed boundary condition is used to compute flowfields for a strong oblique shock wave/boundary layer interaction with a baseline and three bleed rates at a freestream Mach number of 2.47 with an 8 deg shock generator. The computational results are compared to experimental Pitot pressure profiles and wall static pressures through the interaction region. An algebraic turbulence model is employed for the bleed and baseline cases, and a one equation model is also used for the baseline case where the boundary layer is separated.

Harloff, G. J.↗
NASA NTRS1980

Turbulence Modeling for Unsteady Transonic Flows

Conditionally sampled, ensemble-averaged velocity measurements, made with a laser velocimeter, were taken in the flowfield over the rear half of an 18% thick circular arc airfoil at zero incidence tested at M = 0.76 and at a Reynolds number based on chord of 11 x 10(exp 6). Data for one cycle of periodic unsteady flow having a reduced frequency f of 0.49 are analyzed. A series of compression waves, which develop in the early stages of the cycle, strengthen and coalesce into a strong shock wave that moves toward the airfoil leading edge. A thick shear layer forms downstream of the shock wave. The kinetic energy and shear stresses increase dramatically, reach a maximum when dissipation and diffusion of the turbulence exceed production, and then decrease substantially. The response lime of the turbulence to the changes brought about by the shock-wave passage upstream depends on the shock-wave strength and position in the boundary layer. The cycle completes itself when the shock wave passes the midchord, weakens, and the shear layer collapses. Remarkably good comparisons are found with computations that employ the time-dependent Reynolds averaged form of the Navier-Stokes equations using an algebraic eddy viscosity model, developed for steady flows.

Marvin, J. G.↗
NASA NTRS1980

Turbulence Modeling for Unsteady Transonic Flows

Conditionally sampled, ensemble-averaged velocity measurements, made with a laser velocimeter, were taken in the flowfield over the rear half of an 18% thick circular arc airfoil at zero incidence tested at M = 0.76 and of a Reynolds number based on chord of 11 x 10(exp 6). Data for one cycle of periodic unsteady flow having a reduced frequency bar-f of 0.49 are analyzed. A series of compression waves, which develop in the early stages of the cycle, strengthen and coalesce into a strong shock wave that moves toward the airfoil leading edge. A thick shear layer forms downstream of the shock wave. The kinetic energy and shear stresses increase dramatically, reach a maximum when dissipation and diffusion of the turbulence exceed production, and then decrease substantially. The response time of the turbulence to the changes brought about by the shock-wave passage upstream depends on the shock-wave strength and position in the boundary layer. The cycle completes itself when the shock wave passes the midchord, weakens, and the shear layer collapses. Remarkably good comparisons are found with computations that employ the time-dependent Reynolds averaged form of the Navier-Stokes equations using an algebraic eddy viscosity model, developed for steady flows.

Marvin, J. G.↗
NASA NTRS1996

High level language-based robotic control system

This invention is a robot control system based on a high level language implementing a spatial operator algebra. There are two high level languages included within the system. At the highest level, applications programs can be written in a robot-oriented applications language including broad operators such as MOVE and GRASP. The robot-oriented applications language statements are translated into statements in the spatial operator algebra language. Programming can also take place using the spatial operator algebra language. The statements in the spatial operator algebra language from either source are then translated into machine language statements for execution by a digital control computer. The system also includes the capability of executing the control code sequences in a simulation mode before actual execution to assure proper action at execution time. The robot's environment is checked as part of the process and dynamic reconfiguration is also possible. The languages and system allow the programming and control of multiple arms and the use of inward/outward spatial recursions in which every computational step can be related to a transformation from one point in the mechanical robot to another point to name two major advantages.

Rodriguez, Guillermo↗
DOE OSTI2022

Two-Stage Gauss-Seidel Preconditioners and Smoothers for Krylov Solvers on a GPU Cluster: Preprint

Gauss-Seidel (GS) relaxation is often employed as a preconditioner for a Krylov solver or as a smoother for Algebraic Multigrid (AMG). However, the requisite sparse triangular solve is difficult to parallelize on many-core architectures such as graphics processing units (GPUs). In the present study, the performance of the sequential GS relaxation based on a triangular solve is compared with two-stage variants, replacing the direct triangular solve with a fixed number of inner Jacobi-Richardson (JR) iterations. When a small number of inner iterations is sufficient to maintain the Krylov convergence rate, the two-stage GS (GS2) often outperforms the sequential algorithm on many-core architectures. The GS2 algorithm is also compared with JR. When they perform the same number of ops for SpMV (e.g. three JR sweeps compared to two GS sweeps with one inner JR sweep), the GS2 iterations, and the Krylov solver preconditioned with GS2, may converge faster than the JR iterations. Moreover, for some problems (e.g. elasticity), it was found that JR may diverge with a damping factor of one, whereas two-stage GS may improve the convergence with more inner iterations. Finally, to study the performance of the two-stage smoother and preconditioner for a practical problem, these were applied to incompressible uid ow simulations on GPUs.

algebraic multigrid↗
NASA NTRS1993

Computation of flows in a turn-around duct and a turbine cascade using advanced turbulence models

Numerical investigation has been carried out to evaluate the capability of the Algebraic Reynolds Stress Model (ARSM) and the Nonlinear Stress Model (NLSM) to predict strongly curved turbulent flow in a turn-around duct (TAD). The ARSM includes the near-wall damping term of pressure-strain correlation phi(sub ij,w), which enables accurate prediction of individual Reynolds stress components in wall flows. The TAD mean flow quantities are reasonably well predicted by various turbulence models. The ARSM yields better predictions for both the mean flow and the turbulence quantities than the NLSM and the k-epsilon (k = turbulent kinetic energy, epsilon = dissipation rate of k) model. The NLSM also shows slight improvement over the k-epsilon model. However, all the models fail to capture the recovery of the flow from strong curvature effects. The formulation for phi(sub ij,w) appears to be incorrect near the concave surface. The hybrid k-epsilon/ARSM, Chien's k-epsilon model, and Coakley's q-omega (q = the square root of k, omega = epsilon/k) model have also been employed to compute the aerodynamics and heat transfer of a transonic turbine cascade. The surface pressure distributions and the wake profiles are predicted well by all the models. The k-epsilon model and the k-epsilon/ARSM model provide better predictions of heat transfer than the q-omega model. The k-epsilon/ARSM solutions show significant differences in the predicted skin friction coefficients, heat transfer rates and the cascade performance parameters, as compared to the k-epsilon model. The k-epsilon/ARSM model appears to capture, qualitatively, the anisotropy associated with by-pass transition.

Lakshminarayana, B.↗
NASA NTRS1996

Developments in Computational Modeling of Turbulent Flows

In this paper, we will discuss some recent model developments in two turbulence closure schemes. One is the Reynolds-stress algebraic equation model and the other is the Reynolds-stress transport equation model. Various model constraints required by the rapid distortion theory, the invariant theory and the realizability principle, etc. will be described in the model development.

Shih, Tsan-Hsing↗
DOE OSTI2022

Electromagnetic Transient (EMT) Simulation Algorithms for Evaluation of Large-Scale Extreme Fast Charging Systems (T&D Models)

Simulation of high-fidelity models of extreme fast charging (XFC) systems and large-area power grids with many XFCs can be time consuming in traditional simulators. Traditional simulators use a single method of discretization for all the components that results in imposing a large computational burden of inverting a large matrix as well as increased computations related to single method of discretization (that is typically a trapezoidal method). To overcome the problem of simulating large-area power grids with many XFCs, in this paper, advanced numerical simulation algorithms are applied for the first time together to reduce the dimension of matrix inversion. Here, the algorithms include numerical stiffness-based segregation, time constant-based segregation, clustering and aggregation on differential algebraic equations (DAEs), and multi-order integration approaches. These algorithms apply multiple discretization algorithms rather than a single discretization algorithm that further reduces the computational burden. The approaches mentioned here have resulted in speed-up of up to 18x in the simulation of a single distribution system with 15 XFCs and of up to 271x in the simulation of a transmission-distribution system with 300 XFCs in multiple distribution feeders with respect to conventional simulators (like power systems computer aided design [PSCAD]).

42 ENGINEERING↗
DOE OSTI2016

Scalable implicit incompressible resistive MHD with stabilized FE and fully-coupled Newton–Krylov-AMG

Here, we discuss that the computational solution of the governing balance equations for mass, momentum, heat transfer and magnetic induction for resistive magnetohydrodynamics (MHD) systems can be extremely challenging. These difficulties arise from both the strong nonlinear, nonsymmetric coupling of fluid and electromagnetic phenomena, as well as the significant range of time- and length-scales that the interactions of these physical mechanisms produce. This paper explores the development of a scalable, fully-implicit stabilized unstructured finite element (FE) capability for 3D incompressible resistive MHD. The discussion considers the development of a stabilized FE formulation in context of the variational multiscale (VMS) method, and describes the scalable implicit time integration and direct-to-steady-state solution capability. The nonlinear solver strategy employs Newton–Krylov methods, which are preconditioned using fully-coupled algebraic multilevel preconditioners. These preconditioners are shown to enable a robust, scalable and efficient solution approach for the large-scale sparse linear systems generated by the Newton linearization. Verification results demonstrate the expected order-of-accuracy for the stabilized FE discretization. The approach is tested on a variety of prototype problems, that include MHD duct flows, an unstable hydromagnetic Kelvin–Helmholtz shear layer, and a 3D island coalescence problem used to model magnetic reconnection. Initial results that explore the scaling of the solution methods are also presented on up to 128K processors for problems with up to 1.8B unknowns on a CrayXK7.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Unitarity methods in AdS/CFT

We develop a systematic unitarity method for loop-level AdS scattering amplitudes, dual to non-planar CFT correlators, from both bulk and boundary perspectives. We identify cut operators acting on bulk amplitudes that put virtual lines on shell, and show how the conformal partial wave decomposition of the amplitudes may be efficiently computed by gluing lower-loop amplitudes. A central role is played by the double discontinuity of the amplitude, which has a direct relation to these cuts. We then exhibit a precise, intuitive map between the diagrammatic approach in the bulk using cutting and gluing, and the algebraic, holographic unitarity method of [1] that constructs the non-planar correlator from planar CFT data. Our analysis focuses mostly on four-point, one-loop diagrams — we compute cuts of the scalar bubble, triangle and box, as well as some one-particle reducible diagrams — in addition to the five-point tree and four-point double-ladder. Analogies with S-matrix unitarity methods are drawn throughout.

79 ASTRONOMY AND ASTROPHYSICS↗
NASA NTRS1980

Computer-aided analysis of nonlinear problems in transport phenomena

The paper describes algorithms for equilibrium and steady-state problems with coefficients in the expansions derived by the Galerkin weighted residual method and calculated from the resulting sets of nonlinear algebraic equations by the Newton-Raphson method. Initial approximations are obtained from nearby solutions by continuation techniques as parameters are varied. The Newton-Raphson technique is preferred because the Jacobian of the solution is useful for continuation, for analyzing the stability of solutions, for detecting bifurcation of solution families, and for computing asymptotic estimates of the effects on any solution of small changes in parameters, boundary conditions, and boundary shape.

Brown, R. A.↗
NASA NTRS2014

Bifurcation Analysis Using Rigorous Branch and Bound Methods

For the study of nonlinear dynamic systems, it is important to locate the equilibria and bifurcations occurring within a specified computational domain. This paper proposes a new approach for solving these problems and compares it to the numerical continuation method. The new approach is based upon branch and bound and utilizes rigorous enclosure techniques to yield outer bounding sets of both the equilibrium and local bifurcation manifolds. These sets, which comprise the union of hyper-rectangles, can be made to be as tight as desired. Sufficient conditions for the existence of equilibrium and bifurcation points taking the form of algebraic inequality constraints in the state-parameter space are used to calculate their enclosures directly. The enclosures for the bifurcation sets can be computed independently of the equilibrium manifold, and are guaranteed to contain all solutions within the computational domain. A further advantage of this method is the ability to compute a near-maximally sized hyper-rectangle of high dimension centered at a fixed parameter-state point whose elements are guaranteed to exclude all bifurcation points. This hyper-rectangle, which requires a global description of the bifurcation manifold within the computational domain, cannot be obtained otherwise. A test case, based on the dynamics of a UAV subject to uncertain center of gravity location, is used to illustrate the efficacy of the method by comparing it with numerical continuation and to evaluate its computational complexity.

Smith, Andrew P.↗
NASA NTRS1990

Numerical study of vortical flow over a sideslipping delta wing

The three-dimensional vortical viscous flow past a sideslipping delta wing at a high angle of attack is numerically investigated. A computational method for calculating low-speed viscous flowfields is developed. The time-iterative method uses an implicit upwind-relaxation finite-difference algorithm with a nonsingular eigensystem to solve the preconditioned, three-dimensional, incompressible Navier-Stokes equations in curvilinear coordinates. An algebraic turbulence model is implemented to account for the eddy viscosity. The technique of local time stepping is incorporated to accelerate the rate of convergence to a steady-state solution. Computed results are compared with experimental data.

Hsu, C.-H.↗
DOE OSTI2023

A high-performance implementation of atomistic spin dynamics simulations on x86 CPUs

Atomistic spin dynamics simulations provide valuable information about the energy spectrum of magnetic materials in different phases, allowing one to identify instabilities and the nature of their excitations. However, the time cost of evaluating the dynamical correlation function S(q,t) increases quadratically as the number of spins N, leading to significant computational effort, making the simulation of large spin systems very challenging. In this work, here, we propose to use a highly optimized general matrix multiply (GEMM) subroutine to calculate the dynamical spin-spin correlation function that can achieve near-optimal hardware utilization. Furthermore, we fuse the element-wise operations in the calculation of S(q,t) into the in-house GEMM kernel, which results in further performance improvements of 44\% - 71\% on several relatively large lattice sizes when compared to the implementation that uses the GEMM subroutine in OpenBLAS, which is the state-of-the-art open source library for Basic Linear Algebra Subroutine (BLAS).

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Software for the frontiers of quantum chemistry: An overview of developments in the Q-Chem 5 package

This article summarizes technical advances contained in the fifth major release of the Q-Chem quantum chemistry program package, covering developments since 2015. A comprehensive library of exchange-correlation functionals, along with a suite of correlated many-body methods, continues to be a hallmark of the Q-Chem software. The many-body methods include novel variants of both coupled-cluster and configuration-interaction approaches along with methods based on the algebraic diagrammatic construction and variational reduced density-matrix methods. Methods highlighted in Q-Chem 5 include a suite of tools for modeling core-level spectroscopy, methods for describing metastable resonances, methods for computing vibronic spectra, the nuclear-electronic orbital method, and several different energy decomposition analysis techniques. High-performance capabilities including multithreaded parallelism and support for calculations on graphics processing units are described. Q-Chem boasts a community of well over 100 active academic developers, and the continuing evolution of the software is supported by an "open teamware" model and an increasingly modular design.

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

Porting hypre to heterogeneous computer architectures: Strategies and experiences

We report that linear systems are occurring in many applications, and solving them can take a large amount of the total simulation time. The high performance library hypre provides a variety of interfaces and linear solvers, including various multigrid methods, that have achieved good scalability on a variety of homogeneous parallel computer architectures. Heterogeneous architectures with nodes that have both CPUs and accelerators provide new challenges, since they require more fine-grained parallelism and reduced data movement between different memories on a single node as well as across nodes. We will discuss our experiences and strategies to port hypre to heterogeneous computers with accelerators, including the design of a new memory model, the use of abstractions, the BoxLoop macros in the structured and semi-structured interfaces, and the restructuring of algebraic multigrid (AMG) into modular components. We present numerical experiments comparing CPU and GPU performance for several test problems.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1989

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

OpenMP Target Task: Tasking and Target Offloading on Heterogeneous Systems

This work evaluated the use of OpenMP tasking with target GPU offloading as a potential solution for programming productivity and performance on heterogeneous systems. Also, it is proposed a new OpenMP specification to make the implementation of heterogeneous codes simpler by using OpenMP target task, which integrates both OpenMP tasking and target GPU offloading in a single OpenMP pragma. As a test case, the authors used one of the most popular and widely used Basic Linear Algebra Subprogram Level-3 routines: triangular solver (TRSM). To benefit from the heterogeneity of the current high-performance computing systems, the authors propose a different parallelization of the algorithm by using a nonuniform decomposition of the problem. This work used target GPU offloading inside OpenMP tasks to address the heterogeneity found in the hardware. This new approach can outperform the state-of-the-art algorithms, which use a uniform decomposition of the data, on both the CPU-only and hybrid CPU-GPU systems, reaching speedups of up to one order of magnitude. The performance that this approach achieves is faster than the IBM ESSL math library on CPU and competitive relative to a highly optimized heterogeneous CUDA version. One node of Oak Ridge National Laboratory’s supercomputer, Summit, was used for performance analysis.

Valero Lara, Pedro↗