Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Recursion”

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 451 records · Page 25
All sourcesNASA NTRSDOE OSTI
DOE OSTI2022

Fast Solution of Fully Implicit Runge--Kutta and Discontinuous Galerkin in Time for Numerical PDEs, Part I: the Linear Setting

Fully implicit Runge--Kutta (IRK) methods have many desirable properties as time integration schemes in terms of accuracy and stability, but high-order IRK methods are not commonly used in practice with numerical PDEs due to the difficulty of solving the stage equations. This paper introduces a theoretical and algorithmic preconditioning framework for solving the systems of equations that arise from IRK methods applied to linear numerical PDEs (without algebraic constraints). Additionally, this framework also naturally applies to discontinuous Galerkin discretizations in time. Under quite general assumptions on the spatial discretization that yield stable time integration, the preconditioned operator is proven to have condition number bounded by a small, order-one constant, independent of the spatial mesh and time-step size, and with only weak dependence on number of stages/polynomial order; for example, the preconditioned operator for 10th-order Gauss IRK has condition number less than two, independent of the spatial discretization and time step. The new method can be used with arbitrary existing preconditioners for backward Euler-type time-stepping schemes and is amenable to the use of three-term recursion Krylov methods when the underlying spatial discretization is symmetric. The new method is demonstrated to be effective on various high-order finite-difference and finite element discretizations of linear parabolic and hyperbolic problems, demonstrating fast, scalable solution of up to 10th-order accuracy. The new method consistently outperforms existing block preconditioning approaches, and in several cases, the new method can achieve 4th-order accuracy using Gauss integration with roughly half the number of preconditioner applications and wallclock time as required using standard diagonally IRK methods.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

A Trajectory-Driven Algorithm for Differentiating SRB Measures on Unstable Manifolds

Sinai-Ruelle-Bowen (SRB) measures are limiting stationary distributions describing the statistical behavior of chaotic dynamical systems. Directional derivatives of SRB measure densities conditioned on unstable manifolds are critical in the sensitivity analysis of hyperbolic chaos. These derivatives, known as the SRB density gradients, are by-products of the regularization of Lebesgue integrals appearing in the original linear response expression. In this paper, we propose a novel trajectory- driven algorithm for computing the SRB density gradient defined for systems with high-dimensional unstable manifolds. We apply the concept of measure preservation together with the chain rule on smooth manifolds. Due to the recursive one-step nature of our derivations, the proposed procedure is memory-efficient and can be naturally integrated with existing Monte Carlo schemes widely used in computational chaotic dynamics. Here, we numerically show the exponential convergence of our scheme, analyze the computational cost, and present its use in the context of Monte Carlo integration.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Space-Split Algorithm for Sensitivity Analysis of Discrete Chaotic Systems With Multidimensional Unstable Manifolds

Accurate approximations of the change of a system's output and its statistics with respect to the input are highly desired in computational dynamics. Ruelle's linear response theory provides breakthrough mathematical machinery for computing the linear response of chaotic dynamical systems. In this paper, we propose an algorithm for sensitivity analysis of discrete chaos with an arbitrary number of positive Lyapunov exponents. We combine the concept of perturbation space-splitting, which regularizes Ruelle's original expression, together with measure-based parameterization of the expanding subspace. We use these tools to rigorously derive trajectory-following recursive relations that converge exponentially fast, and construct a memory-efficient Monte Carlo scheme for derivatives of the output statistics. Thanks to the regularization and lack of simplifying assumptions on the system's behavior, our method is immune to the common problems of other popular methods such as the exploding tangent solutions and unphysical shadowing directions. Here, we provide a ready-to-use algorithm, analyze its complexity, and demonstrate several numerical examples of sensitivity computation using physically-inspired low-dimensional systems.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2019

Extending the predictive power of perturbative QCD

The predictive power of perturbative QCD (pQCD) depends on two important issues: (1) how to eliminate the renormalization scheme-and-scale ambiguities at fixed order, and (2) how to reliably estimate the contributions of unknown higher-order terms using information from the known pQCD series. The Principle of Maximum Conformality (PMC) satisfies all of the principles of the renormalization group and eliminates the scheme-and-scale ambiguities by the recursive use of the renormalization group equation to determine the scale of the QCD running coupling αs at each order. Moreover, the resulting PMC predictions are independent of the choice of the renormalization scheme, satisfying the key principle of renormalization group invariance. In this paper, we show that by using the conformal series derived using the PMC single-scale procedure, in combination with the Padé Approximation Approach (PAA), one can achieve quantitatively useful estimates for the unknown higher-order terms from the known perturbative series. We illustrate this procedure for three hadronic observables R e + e – , R τ , and Γ( H → bb¯) which are each known to 4 loops in pQCD. We show that if the PMC prediction for the conformal series for an observable (of leading order α p s ) has been determined at order αns, then the [ ] = [0/n–p] Padé series provides quantitatively useful predictions for the higher-order terms. We also show that the PMC + PAA predictions agree at all orders with the fundamental, scheme-independent Generalized Crewther relations which connect observables, such as deep inelastic neutrino-nucleon scattering, to hadronic e + e – annihilation. Furthermore, by using the combination of the PMC series and the Padé method, the predictive power of pQCD theory can be greatly improved.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2023

Searches for new phenomena in events with two leptons, jets, and missing transverse momentum in 139 fb –1 of √s = 13 TeV $pp$ collisions with the ATLAS detector

Searches for new phenomena inspired by supersymmetry in final states containing an e + e – or μ + μ – pair, jets, and missing transverse momentum are presented. These searches make use of proton–proton collision data with an integrated luminosity of 139 fb –1 , collected during 2015–2018 at a centre-of-mass energy √s = 13 TeV by the ATLAS detector at the Large Hadron Collider. Two searches target the pair production of charginos and neutralinos. One uses the recursive-jigsaw reconstruction technique to follow up on excesses observed in 36.1 fb –1 of data, and the other uses conventional event variables. The third search targets pair production of coloured supersymmetric particles (squarks or gluinos) decaying through the next-to-lightest neutralino ($\tilde{χ}$$^{0}_{2}$) via a slepton ($\tilde{ℓ}$) or Z boson into ℓ + ℓ – $\tilde{χ}$$^{0}_{1}$ , resulting in a kinematic endpoint or peak in the dilepton invariant mass spectrum. The data are found to be consistent with the Standard Model expectations. Results are interpreted using simplified models and exclude masses up to 900 GeV for electroweakinos, 1550 GeV for squarks, and 2250 GeV for gluinos.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2023

Extending the predictive power of perturbative QCD using the principle of maximum conformality and the Bayesian analysis

In addition to the evaluation of high-order loop contributions, the precision and predictive power of perturbative QCD (pQCD) predictions depends on two important issues: (1) how to achieve a reliable, convergent fixed-order series, and (2) how to reliably estimate the contributions of unknown higher-order terms. The recursive use of renormalization group equation, together with the Principle of Maximum Conformality (PMC), eliminates the renormalization scheme-and-scale ambiguities of the conventional pQCD series. The result is a conformal, scale-invariant series of finite order which also satisfies all of the principles of the renormalization group. In this paper we propose a novel Bayesian-based approach to estimate the size of the unknown higher order contributions based on an optimized analysis of probability distributions. We show that by using the PMC conformal series, in combination with the Bayesian analysis, one can consistently achieve high degree of reliability estimates for the unknown high order terms. Thus the predictive power of pQCD can be greatly improved. We illustrate this procedure for two pQCD observables: R e+e– and R τ , which are each known up to four loops in pQCD. Numerical analyses confirm that by using the scale-independent and more convergent PMC conformal series, one can achieve reliable Bayesian probability estimates for the unknown higher-order contributions.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2017

Control of Networked Traffic Flow Distribution: A Stochastic Distribution System Perspective

At signalized intersections, the traffic queues are controlled by traffic signal control settings and effective traffic lights control would realize both smooth traffic flow and minimize fuel consumption. Funded by the Energy Efficient Mobility Systems (EEMS) program of the Vehicle Technologies Office of the US Department of Energy, we performed a preliminary investigation on the modelling and control framework in context of urban network of signalized intersections. In specific, we developed a recursive input-output traffic queueing models. The queue formation can be modeled as a stochastic process where the number of vehicles entering each intersection is a random number. Further, we proposed a preliminary B-Spline stochastic modelling and control for a one-way single-lane corridor traffic system based on theory of stochastic distribution control that shapes the PDF of the queue length.

33 ADVANCED PROPULSION SYSTEMS↗
DOE OSTI2018

BootCMatch: A Software Package for Bootstrap AMG Based on GraphWeighted Matching

This article has two main objectives: one is to describe some extensions of an adaptive Algebraic Multigrid (AMG) method of the form previously proposed by the first and third authors, and a second one is to present a new software framework, named BootCMatch, which implements all the components needed to build and apply the described adaptive AMG both as a stand-alone solver and as a preconditioner in a Krylov method. The adaptive AMG presented is meant to handle general symmetric and positive definite (SPD) sparse linear systems, without assuming any a priori information of the problem and its origin; the goal of adaptivity is to achieve a method with a prescribed convergence rate. The presented method exploits a general coarsening process based on aggregation of unknowns, obtained by a maximum weight matching in the adjacency graph of the system matrix. More specifically, a maximum product matching is employed to define an effective smoother subspace (complementary to the coarse space), a process referred to as compatible relaxation, at every level of the recursive two-level hierarchical AMG process. Results on a large variety of test cases and comparisons with related work demonstrate the reliability and efficiency of the method and of the software.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Algorithms for Efficient Reproducible Floating Point Summation

We define “reproducibility” as getting bitwise identical results from multiple runs of the same program, perhaps with different hardware resources or other changes that should not affect the answer. Many users depend on reproducibility for debugging or correctness. However, dynamic scheduling of parallel computing resources, combined with nonassociative floating point addition, makes reproducibility challenging even for summation, or operations like the BLAS. We describe a “reproducible accumulator” data structure (the “binned number”) and associated algorithms to reproducibly sum binary floating point numbers, independent of summation order. We use a subset of the IEEE Floating Point Standard 754-2008 and bitwise operations on the standard representations in memory. Our approach requires only one read-only pass over the data, and one reduction in parallel, using a 6-word reproducible accumulator (more words can be used for higher accuracy), enabling standard tiling optimization techniques. Summing n words with a 6-word reproducible accumulator requires approximately 9 n floating point operations (arithmetic, comparison, and absolute value) and approximately 3 n bitwise operations. The final error bound with a 6-word reproducible accumulator and our default settings can be up to 2 29 times smaller than the error bound for conventional (recursive) summation on ill-conditioned double-precision inputs.

Computer Science↗
DOE OSTI2024

A Formalization of Core Why3 in Coq

Intermediate verification languages like Why3 and Boogie have made it much easier to build program verifiers, transforming the process into a logic compilation problem rather than a proof automation one. Why3 in particular implements a rich logic for program specification with polymorphism, algebraic data types, recursive functions and predicates, and inductive predicates; it translates this logic to over a dozen solvers and proof assistants. Accordingly, it serves as a backend for many tools, including Frama-C, EasyCrypt, and GNATProve for Ada SPARK. But how can we be sure that these tools are correct? The alternate foundational approach, taken by tools like VST and CakeML, provides strong guarantees by implementing the entire toolchain in a proof assistant, but these tools are harder to build and cannot directly take advantage of SMT solver automation. As a first step toward enabling automated tools with similar foundational guarantees, we give a formal semantics in Coq for the logic fragment of Why3. We show that our semantics are useful by giving a correct-by-construction natural deduction proof system for this logic, using this proof system to verify parts of Why3's standard library, and proving sound two of Why3's transformations used to convert terms and formulas into the simpler logics supported by the backend solvers.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2016

Progress Version 1.0

Software library for parallel rapid order N and graph-based recursive electronic structure solvers with applications to material science, chemistry, and molecular biology.

Niklasson, AndersM.↗
DOE OSTI2018

Mota Mapper: A Multi-Objective Topology-Aware Mapper Library

Mota is a library that provides several heuristics for mapping tasks to compute ranks (processes) on a networked computer cluster or supercomputer. It was originally designed for task placement of adaptive mesh refinement codes (AMR). It is multi-objective in the sense that it simultaneously balances (potentially multiple types of) computational load on each rank as well as the communication traffic between the boxes. The heuristics used for mapping include algorithms such as greedy list assignment and space-filling curves, as well as algorithms from graph analysis such as adjacency matrix bandwidth reduction, recursive bisection, and greedy graph placement.

Chan, Cy↗
DOE OSTI2017

ExaSP2

ExaSP2 is a reference implementation of typical linear algebra algorithms and workloads for a quantum molecular dynamics (QMD) electronic structure code. The algorithm is based on a recursive second-order Fermi-Operator expansion method (SP2) and is tailored for density functional based tight-binding calculations of material systems.

Negre, Christian↗
DOE OSTI2019

Ranger-based Iterative Random Forest

Iterative Random Forest (iRF) is an improvement upon the classic Random Forest, using weighted iterations to distill the forests. Ranger is a C++ implementation of random forest or recursive partitioning, particularly suited for high dimensional data. Ranger-Based iRF uses Ranger as a base Random Forest codebase upon which iterative and scalability aspects have been added.

Jacobson, DanielA↗
DOE OSTI2020

Scalable Linked Dynamic Equilibrium (SLiDE)

SLiDE (Scalable Linked Dynamic Equilibrium) replicates the blueNOTE (National Open source Tools for general Equilibrium analysis) datastream from the Wisconsin National Data Consortium. From there, it produces a recursive dynamic computable general equilibrium model of the US states and eventually the global/national economies. The datastream operations have been set up to allow for scalability of both regions and sectors represented. The model has the capability to flexibly define functional forms similar to other general equilibrium model construction software.

Hughes, Caroline↗
DOE OSTI2020

Hydra Network Automatic Configuration (Hydra Autoconfig) v1

Hydra Autoconfig is an algorithm and software program to automatically configure a resilient network of independent ASICs that are capable of being connected as a Hydra network. The Hydra network itself is described in an invention disclosure titled: "Ad-Hoc Networks of Readout ASICs for Reliable Detector Instrumentation" (2020-091). The Hydra Autoconfig software works by first configuring a Hydra node. Then it recursively builds a Hydra network by attempting to link to each available upstream node in succession, keeping links that are verified. It then repeats on each newly generated node until no possible links remain. Once it is so configured, a reliable Hydra network of ASICs remains that can be reconfigured later to respond to damage or malfunction of one or more of the constituent ASICs.

Grace, Carl↗
DOE OSTI2023

Ciel

Compiler optimizations can alter the numerical results of scientific computing applications. When numerical results differ significantly between compilers, optimization levels, and floating-point hardware, these numerical inconsistencies can impact programming productivity. Ciel is a framework that helps programmers identify locations in the source code that are affected by compiler optimizations in CPU and GPU code. Ciel uses a floating-point precision enhancement strategy, guided by a recursive bisection search algorithm with increasing search granularity, to identify the program expressions that induce numerical inconsistencies due to compiler optimizations.

Miao, Wenjun↗
DOE OSTI2022

Acoustic Data Analytics For Predictive Technologies

The software utilizes frequency, amplitude, and phase features from sensor signals (either raw or processed) that are extracted using recursive frequency analysis, enabling (1) understanding of reactor operations under different operating conditions, (2) identifying of quiescent frequency ranges for sensor development, (3) system controls (4) predictive analytics, (5) structural health monitoring, and (6) loose part monitoring.

Smith, JamesA.↗