Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “numerical mathematics”

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 901 records · Page 50
All sourcesNASA NTRSDOE OSTI
DOE OSTI2021

SIERRA Multimechanics Module: Aria Thermal Theory Manual (V.5.0)

Aria is a Galerkin finite element based program for solving coupled-physics problems described by systems of PDEs and is capable of solving nonlinear, implicit, transient and direct-to-steady state problems in two and three dimensions on parallel architectures. The suite of physics currently supported by Aria includes thermal energy transport, species transport, and electrostatics as well as generalized scalar, vector and tensor transport equations. Additionally, Aria includes support for manufacturing process flows via the incompressible Navier-Stokes equations specialized to a low Reynolds number ( Re < 1) regime. Enhanced modeling support of manufacturing processing is made possible through use of either arbitrary Lagrangian-Eulerian (ALE) and level set based free and moving boundary tracking in conjunction with quasi-static nonlinear elastic solid mechanics for mesh control. Coupled physics problems are solved in several ways including fully-coupled Newtons method with analytic or numerical sensitivities, fully-coupled Newton-Krylov methods and a loosely-coupled nonlinear iteration about subsets of the system that are solved using combinations of the aforementioned methods. Error estimation, uniform and dynamic -adaptivity and dynamic load balancing are some of Arias more advanced capabilities.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Simulation of Reverse Osmosis Membrane Compaction Using Material Point Method

Reverse Osmosis (RO) is a promising technology to address the impending water-crisis in the upcoming decades. RO at high salinities and high pressures is challenging due to membrane compaction that changes its porosity and permeability. In this study, we present a simulation methodology for membrane structural mechanics to understand pore size distribution and permeability variations under high pressure. We use the material point method (MPM), that solves the solid mechanics equations in a Lagrangian framework. MPM provides many features that make it well-suited for simulating mesoporous membranes. The Lagrangian framework allows for large deformations, easy integration of constitutive models and direct import of complex geometries as particles. The spatial discretization in our MPM solver is achieved using linear or cubic-spline shape functions while the time integration is carried out using the explicit Euler method. A series of images containing detailed pore structures obtained from X-ray tomography is first converted to a collection of material points. Compressive loads are applied to the top layer of the membrane to simulate the application of pressure. The membrane deformation and pore size distribution before and after load application are reported and compared with the experimental measurements. The presentation discusses the numerical methods used, the performance of the solver on high-performance computing machines, and the results of membrane compact in detail.

compaction↗
DOE OSTI2023

Observational Assessment of Metocean Conditions in the WFIP3 Region

The WFIP3 project, sponsored by the U.S. Department of Energy, is aimed at improving our understanding of the physics of the atmosphere and ocean that dictate the structure and variability of the wind resource within the MABL. As part of the project, a long-term offshore field campaign will take place along the U.S. East Coast to provide an unprecedented characterization of the MABL in the vicinity of the Massachusetts/Rhode Island wind energy lease areas. The unprecedented observational data set collected in the WFIP3 field campaign will allow intensive numerical modeling development and validation efforts. To inform the field campaign design and the preliminary studies associated with it, here we perform a characterization of the MABL and ocean conditions by leveraging available observations in the region.

lidars↗
DOE OSTI2022

Implementation of a practical Markov chain Monte Carlo sampling algorithm in PyBioNetFit

Abstract Summary Bayesian inference in biological modeling commonly relies on Markov chain Monte Carlo (MCMC) sampling of a multidimensional and non-Gaussian posterior distribution that is not analytically tractable. Here, we present the implementation of a practical MCMC method in the open-source software package PyBioNetFit (PyBNF), which is designed to support parameterization of mathematical models for biological systems. The new MCMC method, am, incorporates an adaptive move proposal distribution. For warm starts, sampling can be initiated at a specified location in parameter space and with a multivariate Gaussian proposal distribution defined initially by a specified covariance matrix. Multiple chains can be generated in parallel using a computer cluster. We demonstrate that am can be used to successfully solve real-world Bayesian inference problems, including forecasting of new Coronavirus Disease 2019 case detection with Bayesian quantification of forecast uncertainty. Availability and implementation PyBNF version 1.1.9, the first stable release with am, is available at PyPI and can be installed using the pip package-management system on platforms that have a working installation of Python 3. PyBNF relies on libRoadRunner and BioNetGen for simulations (e.g. numerical integration of ordinary differential equations defined in SBML or BNGL files) and Dask.Distributed for task scheduling on Linux computer clusters. The Python source code can be freely downloaded/cloned from GitHub and used and modified under terms of the BSD-3 license (https://github.com/lanl/pybnf). Online documentation covering installation/usage is available (https://pybnf.readthedocs.io/en/latest/). A tutorial video is available on YouTube (https://www.youtube.com/watch?v=2aRqpqFOiS4&t=63s). Supplementary information Supplementary data are available at Bioinformatics online.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2020

Estimating posterior quantity of interest expectations in a multilevel scalable framework

Scalable approaches for uncertainty quantification are necessary for characterizing prediction confidence in large-scale subsurface flow simulations with uncertain permeability. To this end we explore a multilevel Monte Carlo approach for estimating posterior moments of a particular quantity of interest, where we employ an element-agglomerated algebraic multigrid (AMG) technique to generate the hierarchy of coarse spaces with guaranteed approximation properties for both the generation of spatially correlated random fields and the forward simulation of Darcy's law to model subsurface flow. In both these components (sampling and forward solves), we exploit solvers that rely on state-of-the-art scalable AMG. To illustrate the applicability of this approach, numerical tests are performed on two 3D examples-a unit cube and an egg-shaped domain with an irregular boundary-where the scalability of each simulation as well as the scalability of the overall algorithm are demonstrated.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

MFNets: data efficient all-at-once learning of multifidelity surrogates as directed networks of information sources

We present an approach for constructing a surrogate from ensembles of information sources of varying cost and accuracy. The multifidelity surrogate encodes connections between information sources as a directed acyclic graph, and is trained via gradient-based minimization of a nonlinear least squares objective. While the vast majority of state-of-the-art assumes hierarchical connections between information sources, our approach works with flexibly structured information sources that may not admit a strict hierarchy. The formulation has two advantages: (1) increased data efficiency due to parsimonious multifidelity networks that can be tailored to the application; and (2) no constraints on the training data—we can combine noisy, non-nested evaluations of the information sources. Finally, numerical examples ranging from synthetic to physics-based computational mechanics simulations indicate the error in our approach can be orders-of-magnitude smaller, particularly in the low-data regime, than single-fidelity and hierarchical multifidelity approaches.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

An aggregation-based nonlinear multigrid solver for two-phase flow and transport in porous media

A nonlinear multigrid solver for two-phase flow and transport in a mixed fractional-flow velocity-pressure-saturation formulation is proposed. The solver, which is under the framework of the full approximation scheme (FAS), extends our previous work on nonlinear multigrid for heterogeneous diffusion problems. The coarse spaces in the multigrid hierarchy are constructed by first aggregating degrees of freedom, and then solving some local flow problems. The mixed formulation and the choice of coarse spaces allow us to assemble the coarse problems without visiting finer levels during the solving phase, which is crucial for the scalability of multigrid methods. Specifically, a natural generalization of the upwind flux can be evaluated directly on coarse levels using the precomputed coarse flux basis vectors. We find that the resulting solver is applicable to problems discretized on general unstructured grids. The performance of the proposed nonlinear multigrid solver in comparison with the standard single level Newton's method is demonstrated through challenging numerical examples. It is observed that the proposed solver is robust for highly nonlinear problems and clearly outperforms Newton's method in the case of high Courant-Friedrichs-Lewy (CFL) numbers.

58 GEOSCIENCES↗
DOE OSTI2020

Operator inference for non-intrusive model reduction of systems with non-polynomial nonlinear terms

Here in this work we present a non-intrusive model reduction method to learn low-dimensional models of dynamical systems with non-polynomial nonlinear terms that are spatially local and that are given in analytic form. In contrast to state-of-the-art model reduction methods that are intrusive and thus require full knowledge of the governing equations and the operators of a full model of the discretized dynamical system, the proposed approach requires only the non-polynomial terms in analytic form and learns the rest of the dynamics from snapshots computed with a potentially black-box full-model solver. The proposed method learns operators for the linear and polynomially nonlinear dynamics via a least-squares problem, where the given non-polynomial terms are incorporated on the right-hand side. The least-squares problem is linear and thus can be solved efficiently in practice. The proposed method is demonstrated on three problems governed by partial differential equations, namely the diffusion–reaction Chafee–Infante model, a tubular reactor model for reactive flows, and a batch-chromatography model that describes a chemical separation process. The numerical results provide evidence that the proposed approach learns reduced models that achieve comparable accuracy as models constructed with state-of-the-art intrusive model reduction methods that require full knowledge of the governing equations.

42 ENGINEERING↗
DOE OSTI2020

Adaptive Hybridizable Discontinuous Galerkin discretization of the Grad–Shafranov equation by extension from polygonal subdomains

In this work, we propose a high-order adaptive numerical solver for the semilinear elliptic boundary value problem modeling magnetic plasma equilibrium in axisymmetric confinement devices. In the fixed boundary case, the equation is posed on curved domains with piecewise smooth curved boundaries that may present corners. The solution method we present is based on the hybridizable discontinuous Galerkin method and sidesteps the need for geometry-conforming triangulations thanks to a transfer technique that allows to approximate the solution using only a polygonal subset as computational domain. Moreover, the solver features automatic mesh refinement driven by a residual-based a posteriori error estimator. As the mesh is locally refined, the computational domain is automatically updated in order to always maintain the distance between the actual boundary and the computational boundary of the order of the local mesh diameter. Numerical evidence is presented of the suitability of the estimator as an approximate error measure for physically relevant equilibria with pressure pedestals, internal transport barriers, and current holes on realistic geometries.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2020

A Method for Dimensionally Adaptive Sparse Trigonometric Interpolation of Periodic Functions

We present a method for dimensionally adaptive sparse trigonometric interpolation of multidimensional periodic functions belonging to a smoothness class of finite order. This method targets applications where periodicity must be preserved and the precise anisotropy is not known a priori. To the authors' knowledge, this is the first instance of a dimensionally adaptive sparse interpolation algorithm that uses a trigonometric interpolation basis. The motivating application behind this work is the adaptive approximation of a multi-input model for a molecular potential energy surface (PES) where each input represents an angle of rotation. Our method is based on an anisotropic quasi-optimal estimate for the decay rate of the Fourier coefficients of the model; a least-squares fit to the coefficients of the interpolant is used to estimate the anisotropy. Thus, our adaptive approximation strategy begins with a coarse isotropic interpolant, which is gradually refined using the estimated anisotropic rates. The procedure takes several iterations where ever-more accurate interpolants are used to generate ever-improving anisotropy rates. We present several numerical examples of our algorithm where the adaptive procedure successfully recovers the theoretical “best” convergence rate, including an application to a periodic PES approximation. An open-source implementation of our algorithm resides in the Tasmanian UQ library developed at Oak Ridge National Laboratory.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Numerical methods for fractional Fokker–Planck equation with multiplicative Marcus Lévy noises

The Fokker–Planck equation (FPE) is an important deterministic tool for investigating stochastic dynamical systems. In this paper, we consider the space-time fractional FPE driven by multiplicative Marcus Lévy noises. Efficient numerical schemes are presented to solve the equations. Stability and convergence of the methods are also discussed. We give some numerical experiments to validate our schemes, and examine the effects of parameters on solutions. Additionally, we analyze the maximal likely trajectories and the critical time for the change of the most probability location.

Mathematics↗
DOE OSTI2022

Bridging Equipment Reliability Data and Robust Decisions in a Plant Operation Context

In order to reduce operation and maintenance (O&M) costs, nuclear power plants (NPPs) are moving from corrective and periodic maintenance to predictive maintenance strategies. Such transition requires changes on the data that needs to be retrieved and on the type of decision processes to be employed. Advanced monitoring and data analysis technologies are essential to support predictive strategies. They can in fact provide precise information about health of a component, track its degradation trends, and provide information of its expected failure time. With such information, maintenance operations for a component can be performed right before its expected failure time. This dynamic context of O&M operations requires new methods to analyze data, propagate component health information from the component to the system level, and optimize plant resources. In this respect, the risk informed asset management (RIAM) project has been tasked to develop and test this new class of methods into a risk analytics toolset. This toolset consists of data analytics tools coupled with reliability methods designed to manage plant assets and performances in a predictive maintenance context. This report shows the latest improvements on such development and the initial testing of our methods on the three main research areas that the RIAM project is focusing on. These areas are the following: equipment reliability data analytics, system reliability modeling, and plant resources optimization methods. We show how the methods developed in these areas can support predictive maintenance strategies by: 1) analyzing equipment reliability data (either in numeric and textual form), 2) assessing component and system health through an innovative margin-based reliability approach, and 3) identifying the most critical components and set optimal maintenance schedule based on plant economic and operational constraints.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

A Multi-Function AAA Algorithm Applied to Frequency-Dependent Line Modeling: Preprint

We present a new multi-input rational approximation algorithm (MIAAA) and illustrate its advantages respect to the popular Vector Fitting (VF) algorithm using examples of approximations of admittance matrices discussed in a very recent paper and by the creators of VF. We show that not only MIAAA outperforms VF in terms of achieving better accuracy using a smaller number of poles, but also has no numerical issues to achieve convergence. In contrast to VF, MIAA is not sensitive to the location of input sample points and it does not require good estimates for the location of the desired approximation poles.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Approximate Inverse Chain Preconditioner: Iteration Count Case Study for Spectral Support Solvers

As the growing availability of computational power slows, there has been an increasing reliance on algorithmic advances. However, faster algorithms alone will not necessarily bridge the gap in allowing computational scientists to study problems at the edge of scientific discovery in the next several decades. Often, it is necessary to simplify or precondition solvers to accelerate the study of large systems of linear equations commonly seen in a number of scientific fields. Preconditioning a problem to increase efficiency is often seen as the best approach; yet, preconditioners which are fast, smart, and efficient do not always exist. Following the progress of [1], we present a new preconditioner for symmetric diagonally dominant (SDD) systems of linear equations. These systems are common in certain PDEs, network science, and supervised learning among others. Based on spectral support graph theory, this new preconditioner builds off of the work of [2], computing and applying a V-cycle chain of approximate inverse matrices. This preconditioner approach is both algebraic in nature as well as hierarchically-constrained depending on the condition number of the system to be solved. Due to its generation of an Approximate Inverse Chain of matrices, we refer to this as the AIC preconditioner. We further accelerate the AIC preconditioner by utilizing precomputations to simplify setup and multiplications in the con-text of an iterative Krylov-subspace solver. While these iterative solvers can greatly reduce solution time, the number of iterations can grow large quickly in the absence of good preconditioners. Initial results for the AIC preconditioner have shown a very large reduction in iteration counts for SDD systems as compared to standard preconditioners such as Incomplete Cholesky (ICC) and Multigrid (MG). We further show significant reduction in iteration counts against the more advanced Combinatorial Multigrid (CMG) preconditioner. We have further developed no-fill sparsification techniques to ensure that the computational cost of applying the AIC preconditioner does not grow prohibitively large as the depth of the V-cycle grows for systems with larger condition numbers. Our numerical results have shown that these sparsifiers maintain the sparsity structure of our system while also displaying significant reductions in iteration counts.1 2

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

State-of-the-art short-term electricity market operation with solar generation: A review

With the accelerating penetration of solar energy in energy systems, market operations concerning the solar-associated intermittency are widely discussed. How to correctly model the solar generation in the market and solve the uncertainty-based operation problems call for solutions. Unlike other renewable resources, solar power can be more easily applied to the demand side through behind-the-meter installations in a distributed manner with significant future extensibility. The corresponding operational rules in the markets are largely being revised. Over the past two decades, with the development of deregulated power markets, numerous studies related to uncertainty-based market operations tend to transform the market from a deterministic and centralized framework to a stochastic and decentralized one. As the relevant literature is most recent, this paper reviews their contributions to electricity market operations with solar integration and underlines the research directions of this topic and ongoing industry practices. A thorough review of the electricity markets worldwide with solar energy is provided. A variety of proposed mathematical solutions to the problem are also addressed.

14 SOLAR ENERGY↗
DOE OSTI2020

Modeling Plant Metabolism: From Network Reconstruction to Mechanistic Models

Mathematical modeling of plant metabolism allows the plant science community to understand the organization of plant metabolism, obtain quantitative insights into metabolic functions, and derive engineering strategies for manipulation of metabolism. Among the various modeling approaches, metabolic pathway analysis can dissect the basic functional modes of subsections of core metabolism, such as photorespiration, and reveal how classical definitions of metabolic pathways have overlapping functionality. In current research using constraint-based modeling in plants, numerous computational tools are currently available to analyze large-scale and genome-scale metabolic networks. For 13 C-metabolic flux analysis, principles of isotopic steady state have been used to study heterotrophic plant tissues, while nonstationary isotope labeling approaches are amenable to the study of photoautotrophic and secondary metabolism. Enzyme kinetic models explore pathways in mechanistic detail, and we discuss different approaches to determine or estimate kinetic parameters. In this review, we describe recent advances and challenges in modeling plant metabolism.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2023

A numerical study of the spectral radiative properties of packed bed with mixed bauxite and silica spheres

Bauxite and silica particles have gained increasing attention for applications in the field of concentrated solar power. In this work, a Monte Carlo ray-tracing simulation is performed to predict the radiative properties (absorptance, reflectance, and transmittance) of packed beds with mixed bauxite and silica spherical particles at wavelengths of 0.5, 2.6, 9.0, and 9.35 µm. These wavelengths are representative for the visible, near-infrared, and the mid-infrared regions that are important for solar and thermal radiation, respectively. A repeating unit-column approach is used to mathematically represent the particle bed. The effects of particle mixing ratio, volume fraction, and wavelength on the predicted radiative properties are examined. The obtained radiative properties are inputted to an inverse method to retrieve the effective absorption and scattering coefficients as well as the scattering albedo, which may be later used in a continuous-scale radiative heat transfer analysis. Furthermore, the independent scattering model is used to obtain the absorption coefficient and scattering albedo based on the absorption and scattering cross sections predicted by a Monte Carlo algorithm for a single particle. It is shown that the independent scattering model underpredicts the scattering coefficient for opaque particles but overpredicts the scattering coefficient for semitransparent particles for sufficiently high particle volume fractions. Here, the radiative properties calculated from the independent scattering model are compared to the full Monte Carlo simulation of the particle bed to examine the influence of particle mixing on dependent scattering.

42 ENGINEERING↗
DOE OSTI2023

Residuals-based distributionally robust optimization with covariate information

We consider data-driven approaches that integrate a machine learning prediction model within distributionally robust optimization (DRO) given limited joint observations of uncertain parameters and covariates. Our framework is flexible in the sense that it can accommodate a variety of regression setups and DRO ambiguity sets. We investigate asymptotic and finite sample properties of solutions obtained using Wasserstein, sample robust optimization, and phi-divergence-based ambiguity sets within our DRO formulations, and explore cross-validation approaches for sizing these ambiguity sets. Through numerical experiments, we validate our theoretical results, study the effectiveness of our approaches for sizing ambiguity sets, and illustrate the benefits of our DRO formulations in the limited data regime even when the prediction model is misspecified.

97 MATHEMATICS AND COMPUTING↗