Light Elements R-matrix Analyses with the SAMMY Code towards the Foundation of Charged-particle Nuclear Data Libraries [Slides]
Abstract not provided.
97 MATHEMATICS AND COMPUTING↗
SEARCH · Engineering Papers
Results for “Mathematical programming”
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.
Validating TSLs for ENDF/B-VIII.1 [Slides]
The purpose of this talk is to determine whether there is well-defined, publicly available data to validate TSL files.
97 MATHEMATICS AND COMPUTING↗
Thoughts on SG 50 and MEDUSAL Database [Slides]
This presentation begins with a review of URR recommendations (Layer 1). Then follows with a demonstration of potential impact and future avenues to pursue.
97 MATHEMATICS AND COMPUTING↗
Differentiable Multiphysics Codes: A Breakthrough Technology for Simulation and Computing
This document summarizes the findings of a strategic planning exercise commissioned by the Weapons Simulation and Computing, Computational Physics (WSC/CP) program at the Lawrence Livermore National Laboratory (LLNL) in FY24. During the year, the committee met with multiple stakeholder communities to gather input, opinions, suggestions and concerns which have been incorporated throughout this document. The key findings from this exercise are summarized: • The development of multiphysics modelling and simulation (mod/sim) codes and software technologies, their deployment on exascale compute platforms, and their broad adoption across the NNSA is a major success of the Advanced Simulation and Computing (ASC) program and the Exascale Computing Project (ECP). Sustained investment in these core technologies is essential. • Today’s state of the art involves running ensembles of O(100K) simulations to perform uncertainty quantification (UQ) and design studies using multiple statistical methods such as Bayesian optimization to understand sensitivities of our models and explore parameterized design spaces. Even with exascale computing, we are practically limited to O(10) parameters in these studies since the number of simulations required to sample the space scales exponentially with the number of design parameters. • The data from these simulation ensembles is increasingly being used to train machine learned (ML) surrogates (or reduced order models, ROMs) which can then be used for optimization or real time design exploration. However, the trained surrogates are still limited in the number of parameters they can represent due to the sampling limitations previously noted. • Augmenting our suite of integrated multiphysics simulation codes, both current and emerging, with the ability to compute gradients (solution derivatives) of arbitrary simulation outputs with respect to (some or all) simulation inputs would be a breakthrough technology, opening the door to a new era of efficient and automated inverse design based on verified and validated mod/sim capabilities. • This capability, which we refer to as differentiable multiphysics codes (DMCs), would revolutionize both UQ and optimization studies by breaking the curse of dimensionality that presently limits our “gradient-free” ensemble based computing approach. A similar breakthrough occurred in the AI/ML community once the ability to compute gradients of arbitrary loss functions using back-propagation became commonplace. Gradient information from the multiphysics codes can also be used to dramatically improve the efficiency and scale of training of ML/ROM surrogates for rapid assessments. • Achieving this in our suite of codes will be a grand challenge, similar to the amount of effort that was required to transition from CPU to GPU computing. It will require buy-in from the entire WSC/CP program and beyond, including all integrated codes, physics and engineering models, third-party library dependencies and performance portability abstractions. It will also require investment in research and development of numerical methods for computing adjoints of coupled physics across multiple adaptively refined moving meshes and of stochastic (Monte Carlo) and mesh free (SPH) methods. • New software and numerical techniques, largely pioneered by the AI/ML community, make this feasible. Chief among these is automatic differentiation (AD), the ability to employ AD at point-wise locations in a physics calculation (instead of traditional black-box approaches) and the ability to perform “back-propagation in time” (or reverse mode AD) for non-linear partial differential equations (PDEs). Fundamentally, the conclusion of this strategic planning exercise is that the time is right to undertake a large scale effort in WSC, centered on the existing integrated codes, to continue the natural evolution of mod/sim in the age of AI/ML. Instead of attempting to replace mod/sim with purely data driven AI/ML models, we believe the key to success is to integrate AI/ML by building on top of the decades of hard-won knowledge and the verified/validated multiphysics modelling capability that is the hallmark of the ASC program.
97 MATHEMATICS AND COMPUTING↗
Phenomenological R -Matrix parameterization of direct, doorway, and compound nuclear reactions [Abstract]
Although formal expressions for scattering matrix accounting for direct, doorway, and compound nuclear (CN) resonant reactions have been derived several decades ago in both the transition ( T -)matrix formalism and the reactance ( K -)matrix formalism, the absence of corresponding expressions in phenomenological R -matrix formalism has limited the application of the latter to CN resonant reactions only. We remove this limitation by parameterizing direct, doorway, and CN resonant reactions in a phenomenological R -matrix scattering matrix, and provide a parameterization for a corresponding Reich-Moore approximation of eliminated capture channels. Direct reactions induce (previously neglected) mixing among the incoming or outgoing R -matrix channel wave functions, parameterized by real and orthonormal channel-rotation matrix, M , whereby the original scattering matrix U is transformed into M T UM . Any real and orthonormal matrix, M , can be equivalently expressed as e η , where η is a real and skew-symmetric 2 rotation-generating matrix that subsequently yields a more intuitive parameterization of eliminated direct capture reactions in Reich-Moore approximation. A phenomenological R -matrix parameterization of doorway reactions is inferred by equating the expression for reactance ( K -)matrix, given in terms of Brune’s alternative R -matrix parameterization, to a corresponding expression derived using Feshbach’s projection operator formalism. Assuming that all doorway states, just like CN states, are confined within spheres defined by R -matrix channel radii, a new R -matrix-like term induced by doorway states is gleaned, wherein each doorway state is parameterized by its energy, width, and the strength of its coupling to each CN state. Since a Reich-Moore approximation for retained-channel scattering matrix ought to approximate the effect of eliminated capture channels taking place via direct, doorway, or CN reactions, each of the three kinds of reactions contributing to the capture entails a corresponding Reich-Moore parameterization in a first-order approximation: direct contribution is parameterized by introducing finite diagonal elements of a retained-channel rotation-generating matrix, doorway contribution is parameterized by doorway capture widths, while CN contribution is parameterized by conventional Reich-Moore capture widths. We will present evidence of direct and doorway reactions observed in recent measurements of resolved resonance cross sections at the Gaerttner LINAC Center at Rensselaer Polytechnic Institute, and will outline a path for implementing this new R -matrix parameterization into the SAMMY nuclear data evaluation code.
73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
Creation of the VADER Code in SCALE [Slides]
This presentation details the creation of Validation Analysis Data Evaluation Resource (VADER) code in SCALE. This lecture highlights the USLSTATS program written in JAVA and its history. Additionally, it covers the integration of VADER with SCALE along with features and background information.
73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
An extension to V ORO ++ for multithreaded computation of Voronoi cells
V ORO ++ is a software library written in C++ for computing the Voronoi tessellation, a technique in computational geometry that is widely used for analyzing systems of particles. V ORO ++ was released in 2009 and is based on computing the Voronoi cell for each particle individually. Here, we take advantage of modern computer hardware, and extend the original serial version to allow for multithreaded computation of Voronoi cells via the OpenMP application programming interface. We test the performance of the code, and demonstrate that it can achieve parallel efficiencies greater than 95% in many cases. Further, the multithreaded extension follows standard OpenMP programming paradigms, allowing it to be incorporated into other programs. We provide an example of this using the VoroTop software library, performing a multithreaded Voronoi cell topology analysis of up to 102.4 million particles.
97 MATHEMATICS AND COMPUTING↗
User's Manual for the FE/NETL Onshore CO 2 EOR Cost Model, Version 1
This user's manual describes the conceptual and mathematical basis for the FE/NETL Onshore CO 2 EOR Cost Model (a Fortran program). The model performs a cash flow analysis to estimate the cost of implementing CO 2 EOR using supercritical CO 2 by incorporating oil field performance outputs for a pattern from the FE/NETL CO 2 Prophet Model (available on NETL's website along with its associated user's manuals under the Collection Name: FE/NETL CO 2 Prophet Model) and implementing patterns to develop an oil field for CO 2 EOR. The model calculates capital costs, operation and maintenance costs, and financing costs. The user’s manual also describes how to run the FE/NETL Onshore CO 2 EOR Cost Model, along with the model’s file structure, inputs and outputs. The FE/NETL Onshore CO 2 EOR Cost Model is available on NETL's website under the Collection Name: FE/NETL Onshore CO 2 EOR Cost Model.
54 ENVIRONMENTAL SCIENCES↗
Recent Developments in the R-Matrix Code SAMMY [Slides]
This presentation covers recent developments in the R-Matrix Code SAMMY. The presentation starts with a discussion around SAMMY releases. Secondly it provides updates in the program flow. The presentation concludes with goals and achievements in the modernization efforts.
97 MATHEMATICS AND COMPUTING↗
Parallel hybrid quantum-classical machine learning for kernelized time-series classification
Supervised time-series classification garners widespread interest because of its applicability throughout a broad application domain including finance, astronomy, biosensors, and many others. Here, in this work, we tackle this problem with hybrid quantum-classical machine learning, deducing pairwise temporal relationships between time-series instances using a timeseries Hamiltonian kernel (TSHK). A TSHK is constructed with a sum of inner products generated by quantum states evolved using a parameterized time evolution operator. This sum is then optimally weighted using techniques derived from multiple kernel learning. Because we treat the kernel weighting step as a differentiable convex optimization problem, our method can be regarded as an end-to-end learnable hybrid quantum-classical-convex neural network, or QCC-net, whose output is a data set-generalized kernel function suitable for use in any kernelized machine learning technique such as the support vector machine (SVM). Using our TSHK as input to a SVM, we classify univariate and multivariate time-series using quantum circuit simulators and demonstrate the efficient parallel deployment of the algorithm to 127-qubit superconducting quantum processors using quantum multi-programming.
97 MATHEMATICS AND COMPUTING↗
QCOR; A Language Extension Specification for the Heterogeneous Quantum-Classical Model of Computation
Quantum computing (QC) is an emerging computational paradigm that leverages the laws of quantum mechanics to perform elementary logic operations. Existing programming models for QC were designed with fault-tolerant hardware in mind, envisioning stand-alone applications. However, the susceptibility of near-term quantum computers to noise limits their stand-alone utility. To better leverage limited computational strengths of noisy quantum devices, hybrid algorithms have been suggested whereby quantum computers are used in tandem with their classical counterparts in a heterogeneous fashion. This modus operandi calls out for a programming model and a high-level programming language that natively and seamlessly supports heterogeneous quantum-classical hardware architectures in a single-source-code paradigm. Motivated by the lack of such a model, we introduce a language extension specification, called QCOR, which enables single-source quantum-classical programming. Programs written using the QCOR library–based language extensions can be compiled to produce functional hybrid binary executables. After defining QCOR’s programming model, memory model, and execution model, we discuss how QCOR enables variational, iterative, and feed-forward QC. Additionally, QCOR approaches quantum-classical computation in a hardware-agnostic heterogeneous fashion and strives to build on best practices of high-performance computing. The high level of abstraction in the language extension is intended to accelerate the adoption of QC by researchers familiar with classical high-performance computing.
97 MATHEMATICS AND COMPUTING↗
A novel matching formulation for startup costs in unit commitment
Here we present a novel formulation for startup cost computation in the unit commitment problem (UC). Both our proposed formulation and existing formulations in the literature are placed in a formal, theoretical dominance hierarchy based on their respective linear programming relaxations. Our proposed formulation is tested empirically against existing formulations on large-scale UC instances drawn from real-world data. While requiring more variables than the current state-of-the-art formulation, our proposed formulation requires fewer constraints, and is empirically demonstrated to be as tight as a perfect formulation for startup costs. This tightening can reduce the computational burden in comparison to existing formulations, especially for UC instances with large reserve margins and high penetration levels of renewables.
97 MATHEMATICS AND COMPUTING↗
LLNL Response to the DOE ASCR RFI, "Stewardship of Software for Scientific and High-Performance Computing"
For decades, Lawrence Livermore National Laboratory (LLNL) has been engaged in significant research, development, and support for software to enable scientific computing and, particularly, the use of high performance computing (HPC) in the NNSA mission space. In particular, the move in the mid-1990’s to simulation as a leading component of stockpile stewardship through the ASCI and the successor ASC programs, as well as the need for reliable data acquisition and control software for the National Ignition Facility, have been important drivers in building expertise in production-quality software development at LLNL. LLNL has also been a leader in the DOE SciDAC FASTMath Institute and the DOE Exascale Computing Project (ECP), both of which have striven to make scientific computing software – in particular, the enabling technologies underpinning simulation capabilities – more widely adopted and sustainable. As such, we believe that our experience can inform the broader goal of software stewardship for scientific and high-performance computing. LLNL strongly supports the formation of a new DOE ASCR program element in software stewardship and sustainment. Historically, DOE ASCR has funded applied mathematics and computer science research that has led to the development of important new capabilities and algorithms that are expressed as artifacts in research software. Such frameworks, libraries, and tools have seldom been directly funded to address the important issues of code maintenance, documentation, robustness, and community building. Software engineering and support have typically been done on the side in support of the ASCR-driven research products. DOE funding priorities have been slow to recognize that good software engineering, the kind that ensures research investments have more adoption and longevity, requires significant resources. Based upon our experiences, we have prepared this response to highlight the concerns and issues we believe to be important as DOE ASCR considers its role in scientific software stewardship. We believe that role is important and will require a significant investment of new funding to legitimately support the technologies past and future DOE ASCR investments have and will produce to facilitate their uptake and adoption in the broader scientific computing community. Following a summary of our involvement in scientific software development, the remainder our response is organized around the nine topics specifically identified in the RFI.
97 MATHEMATICS AND COMPUTING↗
Multi-shock design tools in double shell models
The essence of the project was to implement a program in python that demonstrated certain models put forth by fusion physicists. Across the time spent at Los Alamos National Laboratory, much was spent programming. Though fundamentally programmatical in nature, the task contained considerable difficulty hid within mathematically deriving and manipulating the models while maintaining data discretization. The result of solving these complications gave invaluable experience in applied mathematics. The final product, a piece of lengthy code, ended up having the full range of desired capabilities, with plans for more. Given the laser power history from a pulse shot on NIF, Omega, or any other Inertial Confinement Fusion facility, the code maps the terrain of radiation temperature inside the hohlraum throughout the period of the shot. Additionally, shock wave convergence prediction was implemented as additional capability. As the name of the project suggests, this tool acts as a compass of direction for researchers designing laser power profiles. Further development of this tool will undoubtedly assist in the research conducted on single and double-shell indirect ICF, consequently expanding the capabilities of operating stewardship over the national nuclear stockpile.
70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
Learning Symbolic Expressions: Mixed-Integer Formulations, Cuts, and Heuristics
Here, in this paper, we consider the problem of learning a regression function without assuming its functional form. This problem is referred to as symbolic regression. An expression tree is typically used to represent a solution function, which is determined by assigning operators and operands to the nodes. Cozad and Sahinidis propose a nonconvex mixed-integer nonlinear program (MINLP), in which binary variables are used to assign operators and nonlinear expressions are used to propagate data values through nonlinear operators, such as square, square root, and exponential. We extend this formulation by adding new cuts that improve the solution of this challenging MINLP. We also propose a heuristic that iteratively builds an expression tree by solving a restricted MINLP. We perform computational experiments and compare our approach with a mixed-integer program–based method and a neural network–based method from the literature.
97 MATHEMATICS AND COMPUTING↗
A Fast Temporal Decomposition Procedure for Long-Horizon Nonlinear Dynamic Programming
We propose a fast temporal decomposition procedure for solving long-horizon nonlinear dynamic programs. The core of the procedure is sequential quadratic programming (SQP) that utilizes a differentiable exact augmented Lagrangian as the merit function. Within each SQP iteration, we approximately solve the Newton system using an overlapping temporal decomposition strategy. We show that the approximate search direction is still a descent direction of the augmented Lagrangian provided the overlap size and penalty parameters are suitably chosen, which allows us to establish the global convergence. Moreover, we show that a unit step size is accepted locally for the approximate search direction and further establish a uniform, local linear convergence over stages. This local convergence rate matches the rate of the recent Schwarz scheme (Na et al. 2022). However, the Schwarz scheme has to solve nonlinear subproblems to optimality in each iteration, whereas we only perform a single Newton step instead. Numerical experiments validate our theories and demonstrate the superiority of our method.
97 MATHEMATICS AND COMPUTING↗
General purpose GPU programming made easy [Slides]
Abstract not provided.
97 MATHEMATICS AND COMPUTING↗
An infeasible-start framework for convex quadratic optimization, with application to constraint-reduced interior-point and other methods
A framework is proposed for solving general convex quadratic programs (CQPs) from an infeasible starting point by invoking an existing feasible-start algorithm tailored for inequality-constrained CQPs. The central tool is an exact penalty function scheme equipped with a penalty-parameter updating rule. The feasible-start algorithm merely has to satisfy certain general requirements, and so is the updating rule. Under mild assumptions, the framework is proved to converge on CQPs with both inequality and equality constraints and, at a negligible additional cost per iteration, produces an infeasibility certificate, together with a feasible point for an (approximately) ℓ 1 -least relaxed feasible problem, when the given problem does not have a feasible solution. The framework is applied to a feasible-start constraint-reduced interior-point algorithm previously proved to be highly performant on problems with many more inequality constraints than variables (“imbalanced”). Numerical comparison with popular codes (OSQP, qpOASES, MOSEK) is reported on both randomly generated problems and support-vector machine classifier training problems. The results show that the former typically outperforms the latter on imbalanced problems. Finally, application of the proposed infeasible-start framework to other feasible-start algorithms is briefly considered, and is tested on a simplex iteration.
97 MATHEMATICS AND COMPUTING↗