Search NASA⌕ Search

SEARCH · Search NASA

Results for “algorithmic differentiation”

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 469 records · Page 26

Solvable rational extensions of the isotonic oscillator

Highlights: > We obtain in a new way the solvable rational extensions of the isotonic oscillator. > The method is systematic without resorting to any ansatz. > We use a generalization of the SUSY quantum partnership to excited states. > They are regularized by specific discrete symmetries of the potential. > The proof of the shape invariance of the extensions is direct. - Abstract: Combining recent results on rational solutions of the Riccati-Schroedinger equations for shape invariant potentials to the finite difference Baecklund algorithm and specific symmetries of the isotonic potential, we show that it is possible to generate the three infinite sets (L1, L2 and L3 families) of regular rational solvable extensions of this potential in a very direct and transparent way.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Three-dimensional simulation of unstable gravity-driven infiltration of water into a porous medium

Infiltration of water in dry porous media is subject to a powerful gravity-driven instability. Although the phenomenon of unstable infiltration is understood, its description using continuum mathematical models has posed a significant challenge for several decades. The classical model of water flow in the unsaturated flow, the Richards equation, is unable to reproduce the instability. In this work, we present a computational study of a model of unsaturated flow in porous media that extends the Richards equation and is capable of predicting the instability and captures the key features of gravity fingering quantitatively. The extended model is based on a phase-field formulation and is fourth-order in space. The new model poses a set of challenges for numerical discretizations, such as resolution of evolving interfaces, stiffness in space and time, treatment of singularly perturbed equations, and discretization of higher-order spatial partial–differential operators. We develop a numerical algorithm based on Isogeometric Analysis, a generalization of the finite element method that permits the use of globally-smooth basis functions, leading to a simple and efficient discretization of higher-order spatial operators in variational form. We highlight the accuracy, efficiency and robustness of our method with several examples in two and three dimensions in both homogeneous and strongly heterogeneous media. We simulate, for the first time, unstable gravity-driven infiltration in three dimensions, and confirm that the new theory reproduces the fundamental features of water infiltration into a porous medium. Our findings are consistent with classical experimental observations that demonstrate a transition from stable to unstable fronts depending on the infiltration flux.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

CCQE, 2p2h excitations and ν—energy reconstruction

We analyze the MiniBooNE muon neutrino CCQE-like dσ/dT{sub μ} d cos θ{sub μ} data using a theoretical model that, among other nuclear effects, includes RPA correlations and 2p2h (multinucleon) mechanisms. These corrections turn out to be essential for the description of the data. We find that MiniBooNE CCQE-like data are fully compatible with former determinations of the nucleon axial mass M{sub A} ∼ 1.05 GeV. This is in sharp contrast with several previous analysis where anomalously large values of M{sub A} ∼ 1.4 GeV have been suggested. We also show that because of the the multinucleon mechanism effects, the algorithm used to reconstruct the neutrino energy is not adequate when dealing with quasielastic-like events. Finally, we analyze the MiniBooNE unfolded cross section, and show that it exhibits an excess (deficit) of low (high) energy neutrinos, which is an artifact of the unfolding process that ignores 2p2h mechanisms.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

PyDREAM: high-dimensional parameter inference for biological models in python

Biological models contain many parameters whose values are difficult to measure directly via experimentation and therefore require calibration against experimental data. Markov chain Monte Carlo (MCMC) methods are suitable to estimate multivariate posterior model parameter distributions, but these methods may exhibit slow or premature convergence in high-dimensional search spaces. Here, we present PyDREAM, a Python implementation of the (Multiple-Try) Differential Evolution Adaptive Metropolis [DREAM(ZS)] algorithm developed by Vrugt and ter Braak (2008) and Laloy and Vrugt (2012). PyDREAM achieves excellent performance for complex, parameter-rich models and takes full advantage of distributed computing resources, facilitating parameter inference and uncertainty estimation of CPU-intensive biological models.

59 BASIC BIOLOGICAL SCIENCES↗

Spectral Galerkin solver for intense beam Vlasov equilibria in nonlinear constant focusing channels

Here a numerical method is described for producing stationary solutions of the Vlasov-Poisson system describing a relativistic charged-particle beam in a constant focusing accelerator channel, confined transversely by a general (linear or nonlinear) focusing potential. The method utilizes a variant of the spectral Galerkin algorithm to solve a nonlinear partial differential equation (PDE) in two degrees of freedom for the beam space charge potential in equilibrium. Numerical convergence with an increasing number of computed spectral modes is investigated for several benchmark problems. Preservation of the stationary phase space density is verified using a strongly nonlinear focusing channel based on the Integrable Optics Test Accelerator at Fermi National Accelerator Laboratory.

43 PARTICLE ACCELERATORS↗

A Preconditioned Low-Rank Projection Method with a Rank-Reduction Scheme for Stochastic Partial Differential Equations

Herein, we consider the numerical solution of large systems of linear equations obtained from the stochastic Galerkin formulation of stochastic partial differential equations. We propose an iterative algorithm that exploits the Kronecker product structure of the linear systems. The proposed algorithm efficiently approximates the solutions in low-rank tensor format. Using standard Krylov subspace methods for the data in tensor format is computationally prohibitive due to the rapid growth of tensor ranks during the iterations. To keep tensor ranks low over the entire iteration process, we devise a rank-reduction scheme that can be combined with the iterative algorithm. The proposed rank-reduction scheme identifies an important subspace in the stochastic domain and compresses tensors of high rank on-the-fly during the iterations. The proposed reduction scheme is a coarse-grid method in that the important subspace can be identified inexpensively in a coarse spatial grid setting. The efficiency of the present method is displayed by numerical experiments on benchmark problems.

97 MATHEMATICS AND COMPUTING↗

AMReX: Block-structured adaptive mesh refinement for multiphysics applications

Block-structured adaptive mesh refinement (AMR) provides the basis for the temporal and spatial discretization strategy for a number of Exascale Computing Project applications in the areas of accelerator design, additive manufacturing, astrophysics, combustion, cosmology, multiphase flow, and wind plant modeling. AMReX is a software framework that provides a unified infrastructure with the functionality needed for these and other AMR applications to be able to effectively and efficiently utilize machines from laptops to exascale architectures. AMR reduces the computational cost and memory footprint compared to a uniform mesh while preserving accurate descriptions of different physical processes in complex multiphysics algorithms. AMReX supports algorithms that solve systems of partial differential equations in simple or complex geometries and those that use particles and/or particle–mesh operations to represent component physical processes. In this article, we will discuss the core elements of the AMReX framework such as data containers and iterators as well as several specialized operations to meet the needs of the application projects. In addition, we will highlight the strategy that the AMReX team is pursuing to achieve highly performant code across a range of accelerator-based architectures for a variety of different applications.

Zhang, Weiqun↗

Navier-Stokes Solvers and Generalizations for Reacting Flow Problems

This is an overview of our accomplishments during the final term of this grant (1 September 2008 -- 30 June 2012). These fall mainly into three categories: fast algorithms for linear eigenvalue problems; solution algorithms and modeling methods for partial differential equations with uncertain coefficients; and preconditioning methods and solvers for models of computational fluid dynamics (CFD).

97 MATHEMATICS AND COMPUTING↗

Final Report, DE-FG01-06ER25718 Domain Decomposition and Parallel Computing

The goal of this project is to develop and improve domain decomposition algorithms for a variety of partial differential equations such as those of linear elasticity and electro-magnetics.These iterative methods are designed for massively parallel computing systems and allow the fast solution of the very large systems of algebraic equations that arise in large scale and complicated simulations. A special emphasis is placed on problems arising from Maxwell's equation. The approximate solvers, the preconditioners, are combined with the conjugate gradient method and must always include a solver of a coarse model in order to have a performance which is independent of the number of processors used in the computer simulation. A recent development allows for an adaptive construction of this coarse component of the preconditioner.

97 MATHEMATICS AND COMPUTING↗

Variable Precision Computing

This report summarizes the activities and major accomplishments of the Variable Precision Computing Strategic Initiative project. The overarching goal of this project was to initiate and promote a new paradigm in High Performance Computing (HPC) that would fundamentally change how we represent and make use of representations of real numbers in finite precision and that would establish Lawrence Livermore National Laboratory (LLNL) as a leader in precision-related research for HPC. We pursued three integrated and concurrent research thrusts: new, more dynamic data representations to address data motion and capacity limitations; improved mixed precision algorithms to accelerate computation and to leverage new hardware; and new tools to help developers reason about precision and to automate code transformations. Within these thrust areas, we made significant advances in the use of compressed array data types in numerical calculations, in the theoretical justification, in improved performance, and in the prospects of hardware implementation; in the development of metrics to significantly reduce the storage needs of molecular dynamics simulations; in the development and analysis of efficient mixed-precision algorithms for time-dependent partial differential equations and for orthogonal factorization; and in the capability of tools that can analyze sensitivity of computed results to choices in precision and that can make automated code transformations based on such analysis. We established that there are definite opportunities to realize significant improvements in HPC above and beyond the 2x limits of traditional mixed precision using the technologies we have developed. The project produced numerous papers, presentations, and posters in important venues as well as open-source software contributions to the community, and many of the new capabilities have initiated or are being leveraged in ongoing projects.

97 MATHEMATICS AND COMPUTING↗

A clustering-based approach to ocean model–data comparison around Antarctica

The Antarctic Continental Shelf seas (ACSS) are a critical, rapidly changing element of the Earth system. Analyses of global-scale general circulation model (GCM) simulations, including those available through the Coupled Model Intercomparison Project, Phase 6 (CMIP6), can help reveal the origins of observed changes and predict the future evolution of the ACSS. However, an evaluation of ACSS hydrography in GCMs is vital: previous CMIP ensembles exhibit substantial mean-state biases (reflecting, for example, misplaced water masses) with a wide inter-model spread. Because the ACSS are also a sparely sampled region, grid-point-based model assessments are of limited value. Our goal is to demonstrate the utility of clustering tools for identifying hydrographic regimes that are common to different source fields (model or data), while allowing for biases in other metrics (e.g., water mass core properties) and shifts in region boundaries. We apply K-means clustering to hydrographic metrics based on the stratification from one GCM (Community Earth System Model version 2; CESM2) and one observation-based product (World Ocean Atlas 2018; WOA), focusing on the Amundsen, Bellingshausen and Ross seas. When applied to WOA temperature and salinity profiles, clustering identifies “primary” and “mixed” regimes that have physically interpretable bases. For example, meltwater-freshened coastal currents in the Amundsen Sea and a region of high-salinity shelf water formation in the southwestern Ross Sea emerge naturally from the algorithm. Both regions also exhibit clearly differentiated inner- and outer-shelf regimes. The same analysis applied to CESM2 demonstrates that, although mean-state model biases in water mass T–S characteristics can be substantial, using a clustering approach highlights that the relative differences between regimes and the locations where each regime dominates are well represented in the model. CESM2 is generally fresher and warmer than WOA and has a limited fresh-water-enriched coastal regimes. Given the sparsity of observations of the ACSS, this technique is a promising tool for the evaluation of a larger model ensemble (e.g., CMIP6) on a circum-Antarctic basis.

54 ENVIRONMENTAL SCIENCES↗

AMReX

AMReX is a software framework for the development and implementation of massively parallel algorithms using block-structured adaptive mesh refinement (AMR). Block-structured AMR provides the basis for the temporal and spatial discretization strategy for a large variety of applications of interest to the DOE. AMReX provides a unified infrastructure with the functionality needed for applications to be able to effectively and efficiently utilize machines from laptops to exascale accelerator-based architectures. AMR reduces the computational cost and memory footprint compared to a uniform mesh while preserving accurate descriptions of different physical processes in complex multi-physics algorithms. AMReX supports algorithms that solve systems of partial differential equations (PDEs) in simple or complex geometries, and those that use particles and/or particle-mesh operations to represent component physical processes.

Zhang, Weiqun↗

Accuracy and convergence of a finite element algorithm for turbulent boundary layer flow

The Galerkin-Weighted Residuals formulation is employed to derive an implicit finite element solution algorithm for the nonlinear parabolic partial differential equation system governing turbulent boundary layer flow. Solution accuracy and convergence with discretization refinement are quantized in several error norms using linear and quadratic basis functions. Richardson extrapolation is used to isolate integration truncation error in all norms, and Newton iteration is employed for all equation solutions performed in double-precision. The mathematical theory supporting accuracy and convergence concepts for linear elliptic equations appears extensible to the nonlinear equations characteristic of turbulent boundary layer flow.

Soliman, M. O.↗

Theoretical and experimental analysis of laser altimeters for barometric measurements over the ocean

The statistical characteristics and the waveforms of ocean-reflected laser pulses are studied. The received signal is found to be corrupted by shot noise and time-resolved speckle. The statistics of time-resolved speckle and its effects on the timing accuracy of the receiver are studied in the general context of laser altimetry. For estimating the differential propagation time, various receiver timing algorithms are proposed and their performances evaluated. The results indicate that, with the parameters of a realistic altimeter, a pressure measurement accuracy of a few millibars is feasible. The data obtained from the first airborne two-color laser altimeter experiment are processed and analyzed. The results are used to verify the pressure measurement concept.

Tsai, B. M.↗

Numerical simulation of axisymmetric turbulent flow in combustors and diffusors

A method for predicting turbulent flow in combustors and diffusers is developed. The Navier-Stokes equations, incorporating a turbulence kappa-epsilon model equation, were solved in a nonorthogonal curvilinear coordinate system. The solution applied the finite volume method to discretize the differential equations and utilized the SIMPLE algorithm iteratively to solve the differenced equations. A zonal grid method, wherein the flow field was divided into several subsections, was developed. This approach permitted different computational schemes to be used in the various zones. In addition, grid generation was made a more simple task. However, treatment of the zonal boundaries required special handling. Boundary overlap and interpolating techniques were used and an adjustment of the flow variables was required to assure conservation of mass, momentum and energy fluxes. The numerical accuracy was assessed using different finite differencing methods, i.e., hybrid, quadratic upwind and skew upwind, to represent the convection terms. Flows in different geometries of combustors and diffusers were simulated and results compared with experimental data and good agreement was obtained.

Yung, Chain Nan↗

Visual perception and grasping for the extravehicular activity robot

The development of an approach to the visual perception of object surface information using laser range data in support of robotic grasping is discussed. This is a very important problem area in that a robot such as the EVAR must be able to formulate a grasping strategy on the basis of its knowledge of the surface structure of the object. A description of the problem domain is given as well as a formulation of an algorithm which derives an object surface description adequate to support robotic grasping. The algorithm is based upon concepts of differential geometry namely, Gaussian and mean curvature.

Starks, Scott A.↗