Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “solution regularity”

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 109 records · Page 6
All sourcesNASA NTRSDOE OSTI
DOE OSTI2024

The eXtended virtual element method for elliptic problems with weakly singular solutions

This paper introduces a novel eXtended virtual element method, an extension of the conforming virtual element method. The X-VEM is formulated by incorporating appropriate enrichment functions in the local spaces. The method is designed to handle highly generic enrichment functions, including singularities arising from fractured domains. By achieving consistency on the enrichment space, the method is proven to achieve arbitrary approximation orders even in the presence of singular solutions. The paper includes a complete convergence analysis under general assumptions on mesh regularity, and numerical experiments validating the method’s accuracy on various mesh families, demonstrating optimal convergence rates in the L 2 - and H 1 - norms on fractured or L-shaped domains.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Anisotropic physics-regularized interpretable machine learning of microstructure evolution

Anisotropic Physics-Regularized Interpretable Machine Learning Microstructure Evolution (APRIMME) is a general-purpose machine learning solution for grain growth simulations. In prior work, PRIMME employed a deep neural network to predict site-specific migration as a function of its neighboring sites to model normal, isotropic, grain growth behavior. This work aims to extend this method by incorporating grain boundary misorientation-based grain growth behavior. APRIMME is trained on anisotropic simulations created using the Monte Carlo-Potts (MCP) model. Furthermore, the results of this work are compared statistically using grain radius, number of sides per grain, mean neighborhood misorientations, and the standard deviation of triple junction dihedral angles, and are found to match in most cases. The exceptions are small and seem to be related to two causes: (1) the deterministic model of APRIMME is learning from the stochastic simulations of MCP, which seems to accentuate triple junction behaviors; and, (2) a bias against very small grains is made evident in a quicker decrease in grains than expected at the beginning of an APRIMME simulation. APRIMME is also evaluated for its general ability to capture anisotropic grain growth behavior by first investigating different test case initial conditions, including a circle grain, three grain, and hexagonal grain microstructures.

36 MATERIALS SCIENCE↗
DOE OSTI2025

Using Apptainer in a Pilot-based Distributed Workload

GlideinWMS is a pilot and pressure-based workload manager for distributed scientific computing. Many experiments like CMS and Fermilab’s Neutrino experiments use it to provision elastic clusters for their analysis and simulations, split into close to a million concurrent jobs. Most user jobs require containers, and the pilots use Apptainer to set up the desired platform. For the pilots that run as regular batch jobs, Apptainer is safer, lighter, and easier to use than other containerization solutions. Many images used by the pilots are expanded SIF images distributed via the CernVM-FS: this combination is very efficient. At Fermilab, for example, we store on GitHub Dockerfiles that mimic the platform in the worker nodes of local clusters. GitHub workflows build and push the images to Docker Hub, and a service periodically pulls and converts them to the expanded SIF images in the CernVM-FS, so the scientists can find a familiar environment everywhere. Apptainer has also been used to run services inside the pilot jobs, like benchmarks that characterize the worker node being used, or a Triton Inference Server that allows sharing a GPU with all the jobs that run in parallel on a node.

Mambelli, Marco [Fermilab] (ORCID:0000000294892681↗
DOE OSTI2022

A Scalable Space-Time Domain Decomposition Approach for Solving Large Scale Nonlinear Regularized Inverse Ill Posed Problems in 4D Variational Data Assimilation

We address the development of innovative algorithms designed to solve the strong-constraint Four Dimensional Variational Data Assimilation (4DVar DA) problems in large scale applications. We present a space-time decomposition approach which employs the whole domain decomposition, i.e. both along the spacial and temporal direction in the overlapping case, and the partitioning of both the solution and the operator. Starting from the global functional defined on the entire domain, we get to a sort of regularized local functionals on the set of sub domains providing the order reduction of both the predictive and the Data Assimilation models. The algorithm convergence is developed. Performance in terms of reduction of time complexity and algorithmic scalability is discussed on the Shallow Water Equations on the sphere. The number of state variables in the model, the number of observations in an assimilation cycle, as well as numerical parameters as the discretization step in time and in space domain are defined on the basis of discretization grid used by data available at repository Ocean Synthesis/Reanalysis Directory of Hamburg University.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Recurrent neural network-based multiaxial plasticity model with regularization for physics-informed constraints

We report a recurrent neural network (RNN) based model is developed as a surrogate to predict nonlinear plastic response under multiaxial loading. The RNN-based model is trained and tested on stress versus strain curves generated using a numerical solution based on the classical radial return method. Besides simply learning the basic constitutive relationship, a novel approach is taken to enforce certain physical conditions. Specifically, regularization is employed to maintain non-negative plastic power density throughout the loading history thereby ensuring monotonically increasing plastic work and thermodynamic consistency. Enforcing physics in this manner permits coupling of the data-driven RNN approach with physics-based knowledge and laws. This has the effect of reducing the necessary amount of data and ensuring known physical laws are not violated. Since, once trained, the model need not perform the expensive task of solving nonlinear equations, its efficiency is orders of magnitude greater than its numerical counterpart. The RNN-based model has been trained on varied sets of data and the accuracy on test datasets validated. The developed model is general and robust and has widespread application such as in the simulation of metal forming, large scale plasticity, and part life prediction.

42 ENGINEERING↗
DOE OSTI2022

Rethinking the ill-posedness of the spectral function reconstruction — Why is it fundamentally hard and how Artificial Neural Networks can help

Reconstructing hadron spectral functions through Euclidean correlation functions are of the important missions in lattice QCD calculations. However, in a Källen–Lehmann (KL) spectral representation, the reconstruction is observed to be ill-posed in practice. It is usually ascribed to the fewer observation points compared to the number of points in the spectral function. In this paper, by solving the eigenvalue problem of continuous KL convolution, we show analytically that the ill-posedness of the inversion is fundamental and it exists even for continuous correlation functions. We discussed how to introduce regulators to alleviate the predicament, in which include the Artificial Neural Networks (ANNs) representations recently proposed by the Authors in another study. The uniqueness of solutions using ANNs representations is manifested analytically and validated numerically. Reconstructed spectral functions using different regularization schemes are also demonstrated, together with their eigen-mode decomposition. We observe that components with large eigenvalues can be reliably reconstructed by all methods, whereas those with low eigenvalues need to be constrained by regulators.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

BioXTAS RAW 2 : new developments for a free open-source program for small-angle scattering data reduction and analysis

BioXTAS RAW is a free open-source program for reduction, analysis and modelling of biological small-angle scattering data. Here, the new developments in RAW version 2 are described. These include improved data reduction using pyFAI ; updated automated Guinier fitting and D max finding algorithms; automated series ( e.g. size-exclusion chromatography coupled small-angle X-ray scattering or SEC-SAXS) buffer- and sample-region finding algorithms; linear and integral baseline correction for series; deconvolution of series data using regularized alternating least squares ( REGALS ); creation of electron-density reconstructions using electron density via solution scattering ( DENSS ); a comparison window showing residuals, ratios and statistical comparisons between profiles; and generation of PDF reports with summary plots and tables for all analysis. Furthermore, there is now a RAW API, which can be used without the graphical user interface (GUI), providing full access to all of the functionality found in the GUI. In addition to these new capabilities, RAW has undergone significant technical updates, such as adding Python 3 compatibility, and has entirely new documentation available both online and in the program.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Volumetric Rendering on Wavelet-Based Adaptive Grid

Numerical modeling of physical phenomena frequently involves processes across a wide range of spatial and temporal scales. In the last two decades, the advancements in wavelet-based numerical methodologies to solve partial differential equations, combined with the unique properties of wavelet analysis to resolve localized structures of the solution on dynamically adaptive computational meshes, make it feasible to perform large-scale numerical simulations of a variety of physical systems on a dynamically adaptive computational mesh that changes both in space and time. Volumetric visualization of the solution is an essential part of scientific computing, yet the existing volumetric visualization techniques do not take full advantage of multi-resolution wavelet analysis and are not fully tailored for visualization of a compressed solution on the wavelet-based adaptive computational mesh. Our objective is to explore the alternatives for the visualization of time-dependent data on space-time varying adaptive mesh using volume rendering while capitalizing on the available sparse data representation. Two alternative formulations are explored. The first one is based on volumetric ray casting of multi-scale datasets in wavelet space. Rather than working with the wavelets at the finest possible resolution, a partial inverse wavelet transform is performed as a preprocessing step to obtain scaling functions on a uniform grid at a user-prescribed resolution. As a result, a solution in physical space is represented by a superposition of scaling functions on a coarse regular grid and wavelets on an adaptive mesh. An efficient and accurate ray casting algorithm is based just on these coarse scaling functions. Additional details are added during the ray tracing by taking an appropriate number of wavelets into account based on support overlap with the interpolation point, wavelet coefficient magnitude, and other characteristics, such as opacity accumulation (front to back ordering) and deviation from frontal viewing direction. The second approach is based on complementing of wavelet-based adaptive mesh to the traditional Adaptive Mesh Refinement (AMR) mesh. Both algorithms are illustrated and compared to the existing volume visualization software for Rayleigh-Benard thermal convection and electron density data sets in terms of rendering time and visual quality for different data compression of both wavelet-based and AMR adaptive meshes.

Vezolainen, Alexei V.↗
DOE OSTI2024

Calcium-organic matter fouling in nanofiltration: Synchrotron-based X-ray fluorescence and absorption near-edge structure spectroscopy for speciation

Calcium (Ca)-enhanced organic matter (OM) fouling of nanofiltration (NF) membranes leads to reduced flux during desalination and requires frequent cleaning. Fouling mechanisms are not fully understood, which limits the development of targeted fouling control methods. This study employed synchrotron-based X-ray fluorescence (XRF) and X-ray absorption near-edge structure (XANES) spectroscopy to quantify the spatial distribution and mass of Ca deposition as well as changes in the Ca coordination environment characteristic of specific fouling mechanisms, respectively. Bench-scale filtration experiments were performed using feed solutions containing Ca and ten different types of organic matter (OM), as well as the common scalants, calcium carbonate (CaCO 3 ) and calcium sulfate (CaSO 4 ). Osmotic backwash (OB) was performed at regular intervals for fouling control. Ca-OM aggregation resulted in greater flux decline and lower flux recovery during OB than Ca conditioning of membranes followed by filtration of feed solution with OM. Linear combination fitting (LCF) of XANES absorption spectra from fouled membranes indicated that Ca-OM aggregation preferentially occurred for OM types that exhibited both high carboxylic group and negative charge density. Consequently, these OM types exhibited greater deposition of Ca and TOC on the membrane surface when compared to other OM types. For the coexistence of scalants and OM, Ca speciation within the fouling layer was characteristic of both Ca bound to the membrane (i.e. potential bridging, charge screening) as well as Ca-OM aggregation and deposition mechanisms, while a range of crystal polymorphs were observed to occur simultaneously. XRF and XANES represent powerful tools for the elucidation of NF fouling mechanisms by quantification of Ca deposition as well as Ca speciation. Fouling control methods should target OM types with high carboxyl group density and negative charge to neutralize or eliminate interactions with Ca.

42 ENGINEERING↗
DOE OSTI2021

A priori error analysis of high-order LL* (FOSLL*) finite element methods

A number of non-standard finite element methods have been proposed in recent years, each of which derives from a specific class of PDE-constrained norm minimization problems. The most notable examples are LL* methods. In this work, we argue that all high-order methods in this class should be expected to deliver substandard uniform h-refinement convergence rates. In fact, one may not even see rates proportional to the polynomial order p > 1 when the exact solution is a constant function. Here, we show that the convergence rate is limited by the regularity of an extraneous Lagrange multiplier variable which naturally appears via a saddle-point analysis. In turn, limited convergence rates appear because the regularity of this Lagrange multiplier is determined, in part, by the geometry of the domain. Numerical experiments support our conclusions.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Decomposing Loosely Coupled Mixed-Integer Programs for Optimal Microgrid Design

Microgrids are frequently employed in remote regions, in part because access to a larger electric grid is impossible, difficult, or compromises reliability and independence. Although small microgrids often employ spot generation, in which a diesel generator is attached directly to a load, microgrids that combine these individual loads and augment generators with photovoltaic cells and batteries as a distributed energy system are emerging as a safer, less costly alternative. In this work, we present a model that seeks the minimum-cost microgrid design and ideal dispatched power to support a small remote site for one year with hourly fidelity under a detailed battery model; this mixed-integer nonlinear program (MINLP) is intractable with commercial solvers but loosely coupled with respect to time. A mixed-integer linear program (MIP) approximates the model, and a partitioning scheme linearizes the bilinear terms. We introduce a novel policy for loosely coupled MIPs in which the system reverts to equivalent conditions at regular time intervals; this separates the problem into subproblems that we solve in parallel. We obtain solutions within 5% of optimality in at most six minutes across 14 MIP instances from the literature and solutions within 5% of optimality to the MINLP instances within 20 minutes.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

An ℓ 0 ℓ 2 -norm regularized regression model for construction of robust cluster expansions in multicomponent systems

In this work we introduce ℓ 0 ℓ 2 -norm regularization and hierarchy constraints into linear regression for the construction of cluster expansions to describe configurational disorder in materials. The approach is implemented through mixed integer quadratic programming (MIQP). The ℓ 2 -norm regularization is used to suppress intrinsic data noise, while the ℓ 0 -norm is used to penalize the number of nonzero elements in the solution. The hierarchy relation between clusters imposes relevant physics and is naturally included by the MIQP paradigm. As such, sparseness and cluster hierarchy can be well optimized to obtain a robust, converged set of effective cluster interactions with improved physical meaning. We demonstrate the effectiveness of ℓ 0 ℓ 2 -norm regularization in two high-component disordered rocksalt cathode material systems, where we compare the cross-validation, convergence speed, and the reproduction of phase diagrams, voltage profiles, and Li-occupancy energies with those of the conventional ℓ 1 -norm regularized cluster expansion models.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2021

Cardinality-Regularized Hawkes-Granger Model

We propose a new sparse Granger-causal learning framework for temporal event data. We focus on a specific class of point processes called the Hawkes process. We begin by pointing out that most of the existing sparse causal learning algorithms for the Hawkes process suffer from a singularity in maximum likelihood estimation. As a result, their sparse solutions can appear only as numerical artifacts. In this paper, we propose a mathematically well-defined sparse causal learning framework based on a cardinality-regularized Hawkes process, which remedies the pathological issues of existing approaches. We leverage the proposed algorithm for the task of instance-wise causal event analysis, where sparsity plays a critical role. We validate the proposed framework with two real use-cases, one from the power grid and the other from the cloud data center management domain.

Ide, Tsuyoshi↗
DOE OSTI2023

Stochastic projective splitting

Here, we present a new, stochastic variant of the projective splitting (PS) family of algorithms for inclusion problems involving the sum of any finite number of maximal monotone operators. This new variant uses a stochastic oracle to evaluate one of the operators, which is assumed to be Lipschitz continuous, and (deterministic) resolvents to process the remaining operators. Our proposal is the first version of PS with such stochastic capabilities. We envision the primary application being machine learning (ML) problems, with the method’s stochastic features facilitating “mini-batch” sampling of datasets. Since it uses a monotone operator formulation, the method can handle not only Lipschitz-smooth loss minimization, but also min–max and noncooperative game formulations, with better convergence properties than the gradient descent-ascent methods commonly applied in such settings. The proposed method can handle any number of constraints and nonsmooth regularizers via projection and proximal operators. We prove almost-sure convergence of the iterates to a solution and a convergence rate result for the expected residual, and close with numerical experiments on a distributionally robust sparse logistic regression problem.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Efficient quadrature rules for finite element discretizations of nonlocal equations

In this paper we design efficient quadrature rules for finite element discretizations of nonlocal diffusion problems with compactly supported kernel functions. Two of the main challenges in nonlocal modeling and simulations are the prohibitive computational cost and the nontrivial implementation of discretization schemes, especially in three-dimensional settings. In this work we circumvent both challenges by introducing a parametrized mollifying function that improves the regularity of the integrand, utilizing an adaptive integration technique, and exploiting parallelization. We first showthat the “mollified” solution converges to the exact one as the mollifying parameter vanishes, then we illustrate the consistency and accuracy of the proposed method on several two- and three-dimensional test cases. Furthermore, we demonstrate the good scaling properties of the parallel implementation of the adaptive algorithm and we compare the proposed method with recently developed techniques for efficient finite element assembly.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

An asymptotically compatible approach for Neumann-type boundary condition on nonlocal problems

In this paper we consider 2D nonlocal diffusion models with a finite nonlocal horizon parameter δ characterizing the range of nonlocal interactions, and consider the treatment of Neumann-like boundary conditions that have proven challenging for discretizations of nonlocal models. We propose a new generalization of classical local Neumann conditions by converting the local flux to a correction term in the nonlocal model, which provides an estimate for the nonlocal interactions of each point with points outside the domain. While existing 2D nonlocal flux boundary conditions have been shown to exhibit at most first order convergence to the local counter part as δ → 0, the proposed Neumann-type boundary formulation recovers the local case as O(δ 2 ) in the L∞(Ω) norm, which is optimal considering the O(δ 2 ) convergence of the nonlocal equation to its local limit away from the boundary. We analyze the application of this new boundary treatment to the nonlocal diffusion problem, and present conditions under which the solution of the nonlocal boundary value problem converges to the solution of the corresponding local Neumann problem as the horizon is reduced. To demonstrate the applicability of this nonlocal flux boundary condition to more complicated scenarios, we extend the approach to less regular domains, numerically verifying that we preserve second-order convergence for non-convex domains with corners. Finally, based on the new formulation for nonlocal boundary condition, we develop an asymptotically compatible meshfree discretization, obtaining a solution to the nonlocal diffusion equation with mixed boundary conditions that converges with O(δ 2 ) convergence.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Structure-preserving neural networks for the regularized entropy-based closure of a linear, kinetic, radiative transport equation

The main challenge of large-scale numerical simulation of radiation transport is the high memory and computation time requirements of discretization methods for kinetic equations. In this work, we derive and investigate a neural network-based approximation to the entropy-based closure method to accurately compute the solution of the multi-dimensional moment system with a low memory footprint and competitive computational time. We extend methods developed for the standard entropy-based closure to the regularized entropy-based closures. The main idea is to interpret structure-preserving neural network approximations of the regularized entropy-based closure as a two-stage approximation to the original entropy-based closure. We conduct a numerical analysis of this approximation and investigate optimal parameter choices. Our numerical experiments demonstrate that the method has a much lower memory footprint than traditional methods with competitive computation times and simulation accuracy. The code and all trained networks are provided on GitHub.

entropy closure↗
DOE OSTI2021

Efficient quadrature rules for finite element discretizations of nonlocal equations

Here, in this paper, we design efficient quadrature rules for finite element (FE) discretizations of nonlocal diffusion problems with compactly supported kernel functions. Two of the main challenges in nonlocal modeling and simulations are the prohibitive computational cost and the nontrivial implementation of discretization schemes, especially in three-dimensional settings. In this work, we circumvent both challenges by introducing a parametrized mollifying function that improves the regularity of the integrand, utilizing an adaptive integration technique, and exploiting parallelization. We first show that the “mollified” solution converges to the exact one as the mollifying parameter vanishes, then we illustrate the consistency and accuracy of the proposed method on several two- and three-dimensional test cases. Furthermore, we demonstrate the good scaling properties of the parallel implementation of the adaptive algorithm and we compare the proposed method with recently developed techniques for efficient FE assembly.

97 MATHEMATICS AND COMPUTING↗