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,531 records · Page 85

Thermodynamic efficiency limits of classical and bifacial multi-junction tandem solar cells: An analytical approach

Bifacial tandem cells promise to reduce three fundamental losses (i.e., above-bandgap, below bandgap, and the uncollected light between panels) inherent in classical single junction photovoltaic (PV) systems. The successive filtering of light through the bandgap cascade and the requirement of current continuity make optimization of tandem cells difficult and accessible only to numerical solution through computer modeling. The challenge is even more complicated for bifacial design. In this paper, we use an elegantly simple analytical approach to show that the essential physics of optimization is intuitively obvious, and deeply insightful results can be obtained with a few lines of algebra. This powerful approach reproduces, as special cases, all of the known results of conventional and bifacial tandem cells and highlights the asymptotic efficiency gain of these technologies.

Alam, Muhammad Ashraful (ORCID:0000000187756043)↗

Rotational symmetry protected edge and corner states in Abelian topological phases

Spatial symmetries can enrich the topological classification of interacting quantum matter and endow systems with non-trivial strong topological invariants (protected by internal symmetries) with additional "weak" topological indices. In this paper, we study the edge physics of systems with a non-trivial shift invariant, which is protected by either a continuous $\text{U}(1)_r$ or discrete $\text{C}_n$ rotation symmetry, along with internal $\text{U}(1)_c$ charge conservation. Specifically, we construct an interface between two systems which have the same Chern number but are distinguished by their Wen-Zee shift and, through analytic arguments supported by numerics, show that the interface hosts counter-propagating gapless edge modes which cannot be gapped by arbitrary local symmetry-preserving perturbations. Using the Chern-Simons field theory description of two-dimensional Abelian topological orders, we then prove sufficient conditions for continuous rotation symmetry protected gapless edge states using two complementary approaches. One relies on the algebraic Lagrangian sub-algebra framework for gapped boundaries while the other uses a more physical flux insertion argument. For the case of discrete rotation symmetries, we extend the field theory approach to show the presence of fractional corner charges for Abelian topological orders with gappable edges, and compute them in the case where the Abelian topological order is placed on the two-dimensional surface of a Platonic solid. Finally, our work paves the way for studying the edge physics associated with spatial symmetries in symmetry enriched topological phases.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

A Navier-Stokes fast solver for turbulence modeling applications

A computer code for the evaluation and/or optimization of the predicative potential of second order turbulent closure models in simple two dimensional flow configurations is discussed. A procedure for the numerical solution of the steady constant property Navier-Stokes equations are described together with algebraic, one dimensional and two dimensional equations of turbulence closure models. Four turbulence models are compared with several sets of experimental data. The effects of initial conditions and boundary conditions are also described. The effects of purely numerical parameters, such as mesh size, boundary locations, and convergence criteria are presented.

Murphy, J. D.↗

DCA_Tools

HPC software for ab-initio, condensed-matter physics, quantum mechanics calculations needs to be built on top of well tested libraries some of which address requirements unique to the programming domain. During the development of the DCA++ code, that we use in our research, we have developed a collection of libraries that may be of use to other computational scientists working in the same or similar domains. The libraries include: a) a pythonic input-language system, b) tensors whose shape is constructed from generalized dimension objects such at time domains. frequency domains, momentum domains, vertex domains et. al. and c) linear algebra operations that resolve to BLA/LAPACK operations when possible. This supports the implementation of Greens functions and operations on them such as are used in condensed matter physics.

Summers, Michael S↗

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

Development of a Hybrid RANS/LES Method for Turbulent Mixing Layers

Significant research has been underway for several years in NASA Glenn Research Center's nozzle branch to develop advanced computational methods for simulating turbulent flows in exhaust nozzles. The primary efforts of this research have concentrated on improving our ability to calculate the turbulent mixing layers that dominate flows both in the exhaust systems of modern-day aircraft and in those of hypersonic vehicles under development. As part of these efforts, a hybrid numerical method was recently developed to simulate such turbulent mixing layers. The method developed here is intended for configurations in which a dominant structural feature provides an unsteady mechanism to drive the turbulent development in the mixing layer. Interest in Large Eddy Simulation (LES) methods have increased in recent years, but applying an LES method to calculate the wide range of turbulent scales from small eddies in the wall-bounded regions to large eddies in the mixing region is not yet possible with current computers. As a result, the hybrid method developed here uses a Reynolds-averaged Navier-Stokes (RANS) procedure to calculate wall-bounded regions entering a mixing section and uses a LES procedure to calculate the mixing-dominated regions. A numerical technique was developed to enable the use of the hybrid RANS-LES method on stretched, non-Cartesian grids. With this technique, closure for the RANS equations is obtained by using the Cebeci-Smith algebraic turbulence model in conjunction with the wall-function approach of Ota and Goldberg. The LES equations are closed using the Smagorinsky subgrid scale model. Although the function of the Cebeci-Smith model to replace all of the turbulent stresses is quite different from that of the Smagorinsky subgrid model, which only replaces the small subgrid turbulent stresses, both are eddy viscosity models and both are derived at least in part from mixing-length theory. The similar formulation of these two models enables the RANS and LES equations to be solved with a single solution scheme and computational grid. The hybrid RANS-LES method has been applied to a benchmark compressible mixing layer experiment in which two isolated supersonic streams, separated by a splitter plate, provide the flows to a constant-area mixing section. Although the configuration is largely two dimensional in nature, three-dimensional calculations were found to be necessary to enable disturbances to develop in three spatial directions and to transition to turbulence. The flow in the initial part of the mixing section consists of a periodic vortex shedding downstream of the splitter plate trailing edge. This organized vortex shedding then rapidly transitions to a turbulent structure, which is very similar to the flow development observed in the experiments. Although the qualitative nature of the large-scale turbulent development in the entire mixing section is captured well by the LES part of the current hybrid method, further efforts are planned to directly calculate a greater portion of the turbulence spectrum and to limit the subgrid scale modeling to only the very small scales. This will be accomplished by the use of higher accuracy solution schemes and more powerful computers, measured both in speed and memory capabilities.

Georgiadis, Nicholas J.↗

Deploy threading in Nalu solver stack

The goal of the ExaWind project is to enable predictive simulations of wind farms composed of many MW-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 code in the ExaWind project is Nalu, which is an unstructured-grid solver for the acousticallyincompressible Navier-Stokes equations, and mass continuity is maintained through pressure projection. The 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 re-initialization of matrices and re-computation of preconditioners is required at every time step In this Milestone, we examine the effect of threading on the solver stack performance against flat-MPI results obtained from previous milestones using Haswell performance data full-turbine simulations. Whereas the momentum equations are solved only with the Trilinos solvers, we investigate two algebraic-multigrid preconditioners for the continuity equations: Trilinos/Muelu and HYPRE/BoomerAMG. These two packages embody smoothed-aggregation and classical Ruge-Stiiben AMG methods, respectively. In our FY18 Q2 report, we described our efforts to improve setup and solve of the continuity equations under flat-MPI parallelism. While significant improvement was demonstrated in the solve phase, setup times remained larger than expected. Starting with the optimized settings described in the Q2 report, we explore here simulation performance where OpenMP threading is employed in the solver stack. For Trilinos, threading is acheived through the Kokkos abstraction where, whereas HYPRE/BoomerAMG employs straight OpenMP. We examined results for our mid-resolution baseline turbine simulation configuration (229M DOF). Simulations on 2048 Haswell cores explored the effect of decreasing the number of MPI ranks while increasing the number of threads. Both HYPRE and Trilinos exhibited similar overal solution times, and both showed dramatic increases in simulation time in the shift from MPI ranks to OpenMP threads. This increase is attributed to the large amount of work per MPI rank starting at the single-thread configuration. Decreasing MPI ranks, while increasing threads, may be increasing simulation time due to thread synchronization and start-up overhead contributing to the latency and serial time in the model. These result showed that an MPI+OpenMP parallel decomposition will be more effective as the amount per MPI rank computation per MPI rank decreases and the communication latency increases. This idea was demonstrated in a strong scaling study of our low-resolution baseline model (29M DOF) with the Trilinos-HYPRE configuration. While MPI-only results showed scaling improvement out to about 1536 cores, engaging threading carried scaling improvements out to 4128 cores — roughly 7000 DOF per core. This is an important result as improved strong scaling is needed for simulations to be executed over sufficiently long simulated durations (i.e., for many timesteps). In addition to threading work described above, the team examined solver-performance improvements by exploring communication-overhead in the HYPRE-GMRES implementation through a communicationoptimal- GMRE algorithm (CO-GMRES), and offloading compute-intensive solver actions to GPUs. To those ends, a HYPRE mini-app was allow us to easily test different solver approaches and HYPRE parameter settings without running the entire Nalu code. With GPU acceleration on the Summitdev supercomputer, a 20x speedup was achieved for the overall preconditioner and solver execution time for the mini-app. A study on Haswell processors showed that CO-GMRES provides benefits as one increases MPI ranks.

17 WIND ENERGY↗

GRID3D-v2: An updated version of the GRID2D/3D computer program for generating grid systems in complex-shaped three-dimensional spatial domains

In order to generate good quality systems for complicated three-dimensional spatial domains, the grid-generation method used must be able to exert rather precise controls over grid-point distributions. Several techniques are presented that enhance control of grid-point distribution for a class of algebraic grid-generation methods known as the two-, four-, and six-boundary methods. These techniques include variable stretching functions from bilinear interpolation, interpolating functions based on tension splines, and normalized K-factors. The techniques developed in this study were incorporated into a new version of GRID3D called GRID3D-v2. The usefulness of GRID3D-v2 was demonstrated by using it to generate a three-dimensional grid system in the coolent passage of a radial turbine blade with serpentine channels and pin fins.

Steinthorsson, E.↗

Proteus three-dimensional Navier-Stokes computer code, version 1.0. Volume 2: User's guide

A computer code called Proteus 3D was developed to solve the three-dimensional, Reynolds-averaged, unsteady compressible Navier-Stokes equations in strong conservation law form. The objective in this effort was to develop a code for aerospace propulsion applications that is easy to use and easy to modify. Code readability, modularity, and documentation were emphasized. The governing equations are solved in generalized nonorthogonal body-fitted coordinates, by marching in time using a fully-coupled ADI solution procedure. The boundary conditions are treated implicitly. All terms, including the diffusion terms, are linearized using second-order Taylor series expansions. Turbulence is modeled using either an algebraic or two-equation eddy viscosity model. The thin-layer or Euler equations may also be solved. The energy equation may be eliminated by the assumption of constant total enthalpy. Explicit and implicit artificial viscosity may be used. Several time step options are available for convergence acceleration. The documentation is divided into three volumes. This User's Guide describes the program's features, the input and output, the procedure for setting up initial conditions, the computer resource requirements, the diagnostic messages that may be generated, the job control language used to run the program, and several test cases.

Towne, Charles E.↗

Algebraic calculations for spectrum of superintegrable system from exceptional orthogonal polynomials

We introduce an extended Kepler–Coulomb quantum model in spherical coordinates. The Schrödinger equation of this Hamiltonian is solved in these coordinates and it is shown that the wave functions of the system can be expressed in terms of Laguerre, Legendre and exceptional Jacobi polynomials (of hypergeometric type). We construct ladder and shift operators based on the corresponding wave functions and obtain their recurrence formulas. These recurrence relations are used to construct higher-order, algebraically independent integrals of motion to prove superintegrability of the Hamiltonian. The integrals form a higher rank polynomial algebra. By constructing the structure functions of the associated deformed oscillator algebras we derive the degeneracy of energy spectrum of the superintegrable system.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Inverse patchy colloids with two and three patches. Analytical and numerical study

We propose an analytical solution of the multi-density Ornstein-Zernike equation supplemented by the associative Percus-Yevick closure relations specifically designed to describe the equilibrium properties of the novel class of patchy colloidal particles represented by the inverse patchy colloids with arbitrary number of patches. Using Baxter’s factorization method, we reduce solution of the problem to the solution of one nonlinear algebraic equation for the fraction of the particles with one non-bonded patch. We present closed-form expressions for the structure (structure factor) and thermodynamic (internal energy) properties of the system in terms of this fraction (and parameters of the model). We perform computer simulation studies and compare theoretical and computer simulation predictions for the pair distribution function, internal energy, and number of single and double bonds formed in the system, for two versions of the model, each with two and three patches. We consider the models with formation of the double bonds blocked by the patch-patch repulsion and the models without patch-patch repulsion. In general very good agreement between theoretical and computer simulation results is observed.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

A fresh look at the photoelectron spectrum of bromobenzene: A third-order non-Dyson electron propagator study

The valence-shell ionization spectrum of bromobenzene, as a representative halogen substituted aromatic, was studied using the non-Dyson third-order algebraic-diagrammatic construction [nD-ADC(3)] approximation for the electron propagator. This method, also referred to as IP-ADC(3), was implemented as a part of the Q-Chem program and enables large-scale calculations of the ionization spectra, where the computational effort scales as n{sup 5} with respect to the number of molecular orbitals n. The IP-ADC(3) scheme is ideally suited for investigating low-lying ionization transitions, so fresh insight could be gained into the cationic state manifold of bromobenzene. In particular, the present IP-ADC(3) calculations with the cc-pVTZ basis reveal a whole class of low-lying low-intensity two-hole-one-particle (2h-1p) doublet and quartet states, which are relevant to various photoionization processes. The good qualitative agreement between the theoretical spectral profile for the valence-shell ionization transitions generated with the smaller cc-pVDZ basis set and the experimental photoelectron spectrum measured at a photon energy of 80 eV on the PLÉIADES beamline at the Soleil synchrotron radiation source allowed all the main features to be assigned. Some theoretical aspects of the ionization energy calculations concerning the use of various approximation schemes and basis sets are discussed.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

An alternative to Monte Carlo.

Histogram construction via algebraic Monte Carlo method, determining simultaneous effect of several input statistical variables on output variable

PROBABILITY THEORY↗

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

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↗

Computations of vortical supersonic flows over a blunt-nose-cylinder at high angles of attack

Three-dimensional, viscous, and separated flows over a blunt-nose-cylinder at 20, 32, and 44-deg attack angles were computed. The approaching freestream was at a Mach number of 1.6 and a unit Reynolds number of 2 x 10 to the 6th/ft with a total temperature of 585 R. The cylinder used for the computations had a length-to-diameter ratio of 6.67 with a base diameter of 3 in. The flowfield was dominated by large-scale and multiple vortices generated by crossflow separation. The effect of turbulence on the flow structure of one case was modeled algebraically with modifications to correct the length and velocity scales in the regions of separation. The mass averaged Navier-Stokes equations were solved by an approximately factored, upwind-biased, implicit, finite volume scheme. The initialization of the flows was enhanced by a mesh sequencing strategy applied to the diagonalized form of the discretized equations. The convergence to steady-state was accelerated by a multigrid algorithm and using the block inversions for the discretized equations. Calculations were compared with experimental results.

Baysal, O.↗

Heterogenous Acceleration for Linear Algebra in Multi-coprocessor Environments

We present an efficient and scalable programming model for the development of linear algebra in heterogeneous multi-coprocessor environments. The model incorporates some of the current best design and implementation practices for the heterogeneous acceleration of dense linear algebra (DLA). Examples are given as the basis for solving linear systems' algorithms - the LU, QR, and Cholesky factorizations. To generate the extreme level of parallelism needed for the efficient use of coprocessors, algorithms of interest are redesigned and then split into well-chosen computational tasks. The tasks execution is scheduled over the computational components of a hybrid system of multi-core CPUs and coprocessors using a light-weight runtime system. The use of lightweight runtime systems keeps scheduling overhead low, while enabling the expression of parallelism through otherwise sequential code. This simplifies the development efforts and allows the exploration of the unique strengths of the various hardware components.

Luszczek, Piotr R↗

R&D 100, 2016: Pyomo 4.0 – Python Optimization Modeling Objects

Pyomo provides a rich software environment for formulating and analyzing optimization applications. Pyomo supports the algebraic specification of complex sets of objectives and constraints, which enables optimization solvers to exploit problem structure to efficiently perform optimization.

97 MATHEMATICS AND COMPUTING↗