Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “mathematics computing”

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,189 records · Page 66

Enumeration reduction algorithm for the characterization of multi-primary LED systems

Multi-primary tunable LED lighting systems can generate a vast number of spectral outputs, with the exact number depending on the resolution of the control signal and number of LED primaries. Computing all combinations to identify optimal spectral power distributions (SPDs) with a specified chromaticity would require a tremendous amount of time and computational power. Here, an enumeration reduction (ER) algorithm is described to reduce the computation time by defining a bounding pyramid in the three-dimensional tristimulus space that maps to the circumscribed square of the target region in the chromaticity diagram. This method enables computing only the necessary amount of tristimulus values (and resulting chromaticity coordinates) for SPDs that fall into a user-defined target chromaticity area, reducing computation time by avoiding the need to generate each combination and calculate its chromaticity coordinates. The results show that the proposed ER algorithm can greatly reduce the time – up to 922 times in a series of tests – to determine a set of metamers compared to a full enumeration computation.

47 OTHER INSTRUMENTATION↗

Development and Validation of a Simulation Tool to Predict the Combined Structural, Electrical, Electrochemical and Thermal Responses of Automotive Batteries

Battery safety is one of the most important design factors of electrified vehicles (EVs) since battery failure may lead to a catastrophic consequence. To improve the safety of battery systems in EVs, battery behaviors under various abuse conditions should be well understood. One way to examine battery response under extreme conditions is to conduct abuse tests in different scenarios. They can provide first-hand pass/fail information on battery safety, but they are usually expensive and time-consuming, which is inconvenient during design iterations and optimization. On the other hand, computational modeling can predict the battery behaviors in a more efficient and cost-effective way, which becomes an important tool to evaluate battery safety. Modeling battery responses and failure is challenging since it involves multiple coupled physical processes, needs to consider complex material properties and is computationally intensive. This project aims to develop a practical simulation tool to predict the combined structural, electrical, electrochemical, and thermal responses of automotive batteries to crash-induced crush and short circuit and validate it for conditions relevant to automotive crash. Advanced material constitutive models will be utilized to capture the mechanical response of cell components. Moreover, methods will be developed to reduce computational complexity of the model and allow battery safety simulations to extend from cell-level to module/pack level with affordable computational resources.

25 ENERGY STORAGE↗

Parallelization and Performance Portability in Hydrodynamics Codes

With the eve of Exascale computing, performance and portability are at the forefront of all scientific codes. Adding more cores and more energy to a system is no longer a sustainable way to achieve performance, and extra effort must now be made to improve performance in all areas of code and code development. Using hydrodynamic codes as a basis, this work explores numerous techniques to achieve performance in different ways. Adaptive mesh refinement (AMR) is a necessary technique to improve memory optimization in mesh-based simulations. However it is invasive and conventionally difficult to integrate into existing applications, so we present a new branch of AMR to create a smooth transition to these optimizations, which not only improves performance, but also greatly reduces developer effort. We introduce the concept of this improvement as Phantom-Cell AMR, and assess theoretically the improvements, as well as present an application of its use. Other work included involves and investigation into an efficient data structure that ensures optimal memory layout for cache performance, with a target of making codes performant and portable across all architectures. All of the work targets both performance and portability, not just on CPU hardware, but specifically across GPU architectures. Parallel performance is key to all of the methods presented, but the research makes a great effort to improve the portability of all applications to prepare for current high performance computing systems and those on the horizon.

97 MATHEMATICS AND COMPUTING↗

Codesign for the Masses

In this position paper we will address challenges and opportunities relating to the design and codesign of application specific circuits. Given our background as computational scientists, our perspective is from the viewpoint of a highly motivated application developer as opposed to career computer architects

97 MATHEMATICS AND COMPUTING↗

Toward Well-Provenanced Computer System Benchmarking: An Update

This report provides an update on the current design, implementation, and usage of bueno, a Python framework enabled by container technology that supports gradations of reproducibility for wellprovenanced benchmarking of sequential and parallel programs. The ultimate goal of the bueno project is to provide convenient access to mechanisms that aid in the automated generation, collection, and dissemination of data relevant for experimental reproducibility in computer system benchmarking.

97 MATHEMATICS AND COMPUTING↗

The 70th Anniversary of the MANIAC at Los Alamos

March 2022 is the 70th anniversary of the MANIAC, the first fully electronic computer at Los Alamos. The MANIAC was constructed when electronic computing and its associated industry were still in their infancy. Early computer centers like Los Alamos had to build their own systems and invent the methods for using them. This pioneering effort gave Los Alamos and the few places like it an outsized influence on the emerging electronic computing field, shaping the computing technologies and methods we experience today. This report highlights the history of the MANIAC and "recalls the hard work and ingenuity of the people at Los Alamos who helped to invent the modern field of scientific computing, using vacuum tubes and paper tape to build the Lab’s continuing computing legacy."

96 KNOWLEDGE MANAGEMENT AND PRESERVATION↗

A Hardware and Software Co-design Framework for Energy Efficient Neuromorphic Systems

Neuromorphic systems can be realized by a variety of algorithms and architectures. A common understanding is that spiking neuromorphic designs, which encode information into spatio-temporal spiking events, are both a biologically-accurate and efficient way of processing information. However, representing the information through timing relationships induces sophisticated circuit designs in traditional CMOS-based implementations. In recent years, high-capacity resistive memory (RRAM, aka, memristor) has demonstrated great potential in mimicking synaptic behaviors. Several RRAM-based spiking neuromorphic designs exist, most of which focus on rate coding schemes. These designs simplify circuit implementations of neuron models and explore challenges such as unsatisfactory speed, resolution, and performance. As an alternative, we will explore temporal coding spiking neuromorphic systems that encode information as the relative timing of neuron activations (spikes), which have been proven to be more adaptive and energy-efficient. Developing a neuromorphic system for spiking neural network (SNN) inference and online training, however, faces some major technical challenges: (1) It lacks circuit implementation support for temporal-coding SNN to achieve satisfying power efficiency and accuracy; (2) Although existing research works have investigated memristive synapse and neuron designs for spike-timing-dependent plasticity, the non-ideal conditions in implementation, such as device variations and signal degradation, degrade online learning accuracy of large scale systems; and (3) Non-optimized, inter-layer data traffic in SNNs, leads to unnecessary data communication costs. In this project, we plan to address these challenges by a hardware and software co-design framework that incorporates solutions at the circuit, architecture, and algorithm levels. At the circuit-level, we will elaborate on the in-situ SNN processing element designs for supporting both inference and online training modes. Variation-aware schemes will be studied to improve reliability. At the architecture level, we propose a pipelined, asynchronous architecture to retain the timing resolution of spikes. At the algorithm level, we will investigate an innovative SNN training algorithm for enabling activation sparsification and reducing unnecessary data communication costs. This neuromorphic system will provide an effective solution to real-life energy-constrained applications and significantly contribute to the exploration of next-generation high-performance computing systems under the DOE context.

97 MATHEMATICS AND COMPUTING↗

SPARC-X: Quantum simulations at extreme scale - reactive dynamics from first principles

We have developed the massively parallel electronic structure code SPARC-X: a computational framework for performing Kohn-Sham Density Functional Theory (DFT) calculations that can scale linearly with the number of atoms in the system, while being able to leverage petascale and emerging exascale parallel computers to study chemical phenomena at unprecedented length and time scales. SPARC-X exploits a recent breakthrough in electronic structure methodologies: systematically improvable, strictly local, orthonormal, discontinuous real-space bases that efficiently and systematically capture the local chemistry of the system. With further adaptation using new machine-learning techniques and the use of the massively parallel Spectral Quadrature (SQ) electronic structure method, the algorithmic complexity and prefactor associated with DFT calculations involving semilocal as well as hybrid functionals are dramatically reduced. Using petascale computational resources, SPARC-X enables quantum mechanical simulations at length and time scales previously accessible only by empirical approaches, e.g., 1,000,000 atoms for a few picoseconds using semilocal functionals or 1,000 atoms for a few picoseconds using hybrid functionals. Using exascale resources, the sizes and times targeted are two orders of magnitude larger. Such a capability has applications in a wide variety of chemical sciences, including reactive interfaces where large length- and/or long time-scales are needed and traditional force fields fail. This is particularly important in dynamic catalysis, where bond breaking and formation must be understood in detail. We developed, tested, and employed the SPARC-X framework to understand the photocatalytic properties of TiO 2 nanoparticles, revealing finite size effects that cannot be captured with standard model systems or functionals. This integrated development and application strategy ensures that SPARC-X remains a robust, efficient, and scalable software package for quantum simulations on current petascale and emerging exascale computing resources.

97 MATHEMATICS AND COMPUTING↗

Understanding Spin Coherence in Polyoxometalate-Based Molecular Qubits

This research advances the understanding of spin decoherence mechanisms and addresses the grand challenges in quantum information science of generating and stabilizing quantum states that may be manipulated with single-atom precision. It is accomplished using unique capabilities developed at PNNL for ion soft landing and spatially resolved vibrational spectroscopy of well-defined supported molecular qubit (MQ) arrays. It addresses knowledge gaps impeding the development of MQ-based quantum devices by answering two scientific questions: 1) Can we minimize spin-lattice relaxation rates by tuning the substrate-MQ interface? 2) What is the optimum number of spin centers that enables sufficient coherent signal generation prior to decoherence through inter-MQ and MQ-support interactions? The objective is to develop predictive design principles for prolonging spin coherence lifetimes in arrays of optically-addressable MQs for quantum computing applications.

97 MATHEMATICS AND COMPUTING↗

I/O routing in a multidimensional torus network

A method, system and computer program product are disclosed for routing data packet in a computing system comprising a multidimensional torus compute node network including a multitude of compute nodes, and an I/O node network including a plurality of I/O nodes. In one embodiment, the method comprises assigning to each of the data packets a destination address identifying one of the compute nodes; providing each of the data packets with a toio value; routing the data packets through the compute node network to the destination addresses of the data packets; and when each of the data packets reaches the destination address assigned to said each data packet, routing said each data packet to one of the I/O nodes if the toio value of said each data packet is a specified value. In one embodiment, each of the data packets is also provided with an ioreturn value used to route the data packets through the compute node network.

97 MATHEMATICS AND COMPUTING↗

Containerization in ATLAS Software Development and Data Production

The ATLAS experiment's software production and distribution on the grid benefits from a semi-automated infrastructure that provides up-to-date information about software usability and availability through the CVMFS dis-tribution service for all relevant systems. The software development process uses a Continuous Integration pipeline involving testing, validation, packag-ing and installation steps. For opportunistic sites that can not access CVMFS, containerized releases are needed. These standalone containers are currently created manually to support Monte-Carlo data production at such sites. In this paper we will describe an automated procedure for the containerization of AT-LAS software releases in the existing software development infrastructure, its motivation, integration and testing in the distributed computing system.

97 MATHEMATICS AND COMPUTING↗

Leverage Score Sampling for Parametric PDEs (Final Technical Report)

This final technical report summarizes the accomplishments of work performed under DOE Office of Science Award DE-SC0022266, which is titled “Leverage Score Sampling for Parametric PDEs”. The goal of the project was to extend methods from Randomized Numerical Linear Algebra (RandNLA) to tackle central computational challenges in model order reduction and uncertainty quantification (UQ) for parametric partial differential equations (PDEs). In particular, we sought to use importance sampling methods originally developed for RandNLA to develop sample efficient active learning algorithms for approximating high-dimensional scalar functions, e.g. by polynomials, Gaussian process models, and simple neural networks. Such methods can be immediately applied to developing surrogate models or to approximating quantity of interest (QoI) surfaces. In the context of PDEs, each sample used for learning equates to the solution of the differential equation for a particular set of parameters, so sample efficiency translates to improved computational efficiency for a variety of downstream tasks.

97 MATHEMATICS AND COMPUTING↗

Computing Poincaré maps using physics-informed deep learning

Outline: Describe principle of magnetically-confined nuclear fusion; Explain the role of Poincaré maps in fusion reactor design; Describe a new method for rapidly computing Poincaré maps using physics-informed machine learning

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

The Story of PI

The early history and the uses of the mathematical notation - pi - are presented through both film footage and computer animation in this 'Project Mathematics' series video. Pi comes from the first letter in the Greek word for perimeter. Archimedes, and early Greek mathematician, formulated the equations for the computation of a circle's area using pi and was the first person to seriously approximate pi numerically, although only to a few decimal places. By 1985, pi had been approximated to over one billion decimal places and was found to have no repeating pattern. One use of pi is the application of its approximation calculation as an analytical tool for determining the accuracy of supercomputers and software designs.

Apostol, Tom M.↗