Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “problem”

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 631 records · Page 35

Analysis of the weighted shifted boundary method for the Poisson and Stokes problems

The Shifted Boundary Method (SBM) belongs to the class of unfitted (or immersed, or embedded) finite element methods, and relies on reformulating the original boundary value problem over a surrogate (approximate) computational domain. Accuracy is maintained by properly shifting the location and values of the boundary conditions. This avoids integration over cut cells and the associated implementation issues. Recently, the Weighted SBM (WSBM) was proposed for the Navier-Stokes equations with free surfaces and the Stokes flow with moving boundaries. The attribute “weighted” in the name WSBM stems from the fact that its variational form is weighted with the elemental volume fraction of active fluid. The motivation for the development of the WSBM was the preservation of the volume of active fluid to a higher degree of accuracy, which in turn resulted in improved stability and robustness characteristics in moving-boundary, time-dependent simulations. In this article, we present the numerical analysis of the WSBM formulations for the Poisson and Stokes problems. We give mathematical conditions under which the bilinear forms defining the discrete variational formulations are uniformly coercive (Poisson problem) or inf-sup stable (Stokes problem). By these results, stability and optimal convergence is proven in the natural norm; L2-error estimates can also be derived.

Approximate domain boundaries↗

NeuroSEM: A hybrid framework for simulating multiphysics problems by coupling PINNs and spectral elements

Multiphysics problems that are characterized by complex interactions among fluid dynamics, heat transfer, structural mechanics, and electromagnetics, are inherently challenging due to their coupled nature. While experimental data on certain state variables may be available, integrating these data with numerical solvers remains a significant challenge. Physics-informed neural networks (PINNs) have shown promising results in various engineering disciplines, particularly in handling noisy data and solving inverse problems in partial differential equations (PDEs). However, their effectiveness in forecasting nonlinear phenomena in multiphysics regimes, particularly involving turbulence, is yet to be fully established. Here, this study introduces NeuroSEM, a hybrid framework integrating PINNs with the highfidelity Spectral Element Method (SEM) solver, Nektar++. NeuroSEM leverages the strengths of both PINNs and SEM, providing robust solutions for multiphysics problems. PINNs are trained to assimilate data and model physical phenomena in specific subdomains, which are then integrated into the Nektar++ solver. We demonstrate the efficiency and accuracy of NeuroSEM for thermal convection in cavity flow and flow past a cylinder. The framework effectively handles data assimilation by addressing those subdomains and state variables where the data is available. We applied NeuroSEM to the Rayleigh-B´enard convection system, including cases with missing thermal boundary conditions and noisy datasets. Finally, we applied the proposed NeuroSEM framework to real particle image velocimetry (PIV) data to capture flow patterns characterized by horseshoe vortical structures. Our results indicate that NeuroSEM accurately models the physical phenomena and assimilates the data within the specified subdomains. The framework’s plug-and-play nature facilitates its extension to other multiphysics or multiscale problems. Furthermore, NeuroSEM is optimized for efficient execution on emerging integrated GPU-CPU architectures. This hybrid approach enhances the accuracy and efficiency of simulations, making it a powerful tool for tackling complex engineering challenges in various scientific domains.

42 ENGINEERING↗

Generalized spectral decomposition for stochastic nonlinear problems

We present an extension of the generalized spectral decomposition method for the resolution of nonlinear stochastic problems. The method consists in the construction of a reduced basis approximation of the Galerkin solution and is independent of the stochastic discretization selected (polynomial chaos, stochastic multi-element or multi-wavelets). Two algorithms are proposed for the sequential construction of the successive generalized spectral modes. They involve decoupled resolutions of a series of deterministic and low-dimensional stochastic problems. Compared to the classical Galerkin method, the algorithms allow for significant computational savings and require minor adaptations of the deterministic codes. The methodology is detailed and tested on two model problems, the one-dimensional steady viscous Burgers equation and a two-dimensional nonlinear diffusion problem. These examples demonstrate the effectiveness of the proposed algorithms which exhibit convergence rates with the number of modes essentially dependent on the spectrum of the stochastic solution but independent of the dimension of the stochastic approximation space.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

An accurate, stable and efficient domain-type meshless method for the solution of MHD flow problems

The aim of the present paper is the development of an efficient numerical algorithm for the solution of magnetohydrodynamics flow problems for regular and irregular geometries subject to Dirichlet, Neumann and Robin boundary conditions. Toward this, the meshless point collocation method (MPCM) is used for MHD flow problems in channels with fully insulating or partially insulating and partially conducting walls, having rectangular, circular, elliptical or even arbitrary cross sections. MPC is a truly meshless and computationally efficient method. The maximum principle for the discrete harmonic operator in the meshfree point collocation method has been proven very recently, and the convergence proof for the numerical solution of the Poisson problem with Dirichlet boundary conditions have been attained also. Additionally, in the present work convergence is attained for Neumann and Robin boundary conditions, accordingly. The shape functions are constructed using the Moving Least Squares (MLS) approximation. The refinement procedure with meshless methods is obtained with an easily handled and fully automated manner. We present results for Hartmann number up to 10{sup 5}. The numerical evidences of the proposed meshless method demonstrate the accuracy of the solutions after comparing with the exact solution and the conventional FEM and BEM, for the Dirichlet, Neumann and Robin boundary conditions of interior problems with simple or complex boundaries.

97 MATHEMATICS AND COMPUTING↗

Interlocked optimization and fast gradient algorithm for a seismic inverse problem

Highlights: {yields} A 2D extension of the 1D nonlinear inversion of well-seismic data is given. {yields} Appropriate regularization yields a well-determined large scale inverse problem. {yields} An interlocked optimization loop acts as an efficient preconditioner. {yields} The adjoint state method is used to compute the misfit function gradient. {yields} Domain decomposition method yields an efficient parallel implementation. - Abstract: We give a nonlinear inverse method for seismic data recorded in a well from sources at several offsets from the borehole in a 2D acoustic framework. Given the velocity field, approximate values of the impedance are recovered. This is a 2D extension of the 1D inversion of vertical seismic profiles . The inverse problem generates a large scale undetermined ill-conditioned problem. Appropriate regularization terms render the problem well-determined. An interlocked optimization algorithm yields an efficient preconditioning. A gradient algorithm based on the adjoint state method and domain decomposition gives a fast parallel numerical method. For a realistic test case, convergence is attained in an acceptable time with 128 processors.

97 MATHEMATICS AND COMPUTING↗

Scalable and efficient algorithms for the propagation of uncertainty from data through inference to prediction for large-scale problems, with application to flow of the Antarctic ice sheet

The majority of research on efficient and scalable algorithms in computational science and engineering has focused on the forward problem : given parameter inputs, solve the governing equations to determine output quantities of interest. In contrast, in this paper, we consider the broader question: given a (large-scale) model containing uncertain parameters, (possibly) noisy observational data, and a prediction quantity of interest, how do we construct efficient and scalable algorithms to (1) infer the model parameters from the data (the deterministic inverse problem ), (2) quantify the uncertainty in the inferred parameters (the Bayesian inference problem), and (3) propagate the resulting uncertain parameters through the model to issue predictions with quantified uncertainties (the forward uncertainty propagation problem )? We present efficient and scalable algorithms for this end-to-end, data-to-prediction process under the Gaussian approximation and in the context of modeling the flow of the Antarctic ice sheet and its effect on loss of grounded ice to the ocean. The ice is modeled as a viscous, incompressible, creeping, shear-thinning fluid. The observational data come from satellite measurements of surface ice flow velocity, and the uncertain parameter field to be inferred is the basal sliding parameter, represented by a heterogeneous coefficient in a Robin boundary condition at the base of the ice sheet. The prediction quantity of interest is the present-day ice mass flux from the Antarctic continent to the ocean. We show that the work required for executing this data-to-prediction process—measured in number of forward (and adjoint) ice sheet model solves—is independent of the state dimension, parameter dimension, data dimension, and the number of processor cores. The key to achieving this dimension independence is to exploit the fact that, despite their large size, the observational data typically provide only sparse information on model parameters. This property can be exploited to construct a low rank approximation of the linearized parameter-to-observable map via randomized SVD methods and adjoint-based actions of Hessians of the data misfit functional.

54 ENVIRONMENTAL SCIENCES↗

Variational Bayesian strategies for high-dimensional, stochastic design problems

This paper is concerned with a lesser-studied problem in the context of model-based, uncertainty quantification (UQ), that of optimization/design/control under uncertainty. The solution of such problems is hindered not only by the usual difficulties encountered in UQ tasks (e.g. the high computational cost of each forward simulation, the large number of random variables) but also by the need to solve a nonlinear optimization problem involving large numbers of design variables and potentially constraints. We propose a framework that is suitable for a class of such problems and is based on the idea of recasting them as probabilistic inference tasks. To that end, we propose a Variational Bayesian (VB) formulation and an iterative VB–Expectation-Maximization scheme that is capable of identifying a local maximum as well as a low-dimensional set of directions in the design space, along which, the objective exhibits the largest sensitivity. We demonstrate the validity of the proposed approach in the context of two numerical examples involving thousands of random and design variables. In all cases considered the cost of the computations in terms of calls to the forward model was of the order of 100 or less. The accuracy of the approximations provided is assessed by information-theoretic metrics.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Scalable posterior approximations for large-scale Bayesian inverse problems via likelihood-informed parameter and state reduction

Two prime bottlenecks to the solution of large-scale Bayesian inverse problems are the scaling of posterior sampling algorithms to high-dimensional parameter spaces and the computational cost of forward model evaluations. However, incomplete or noisy data, the state variation and parameter dependence of the forward model, and correlations in the prior collectively provide useful structure that can be exploited for dimension reduction in this setting—both in the parameter space of the inverse problem and in the state space of the forward model. To this end, we show how to jointly construct low-dimensional subspaces of the parameter space and the state space in order to accelerate the Bayesian solution of the inverse problem. As a byproduct of state dimension reduction, we also show how to identify low-dimensional subspaces of the data in problems with high-dimensional observations. These subspaces enable approximation of the posterior as a product of two factors: (i) a projection of the posterior onto a low-dimensional parameter subspace, wherein the original likelihood is replaced by an approximation involving a reduced model; and (ii) the marginal prior distribution on the high-dimensional complement of the parameter subspace. We introduce and compare several strategies for constructing these subspaces using only a limited number of forward and adjoint model simulations. The resulting posterior approximations can rapidly be characterized using standard sampling techniques, e.g., Markov chain Monte Carlo. Two numerical examples demonstrate the accuracy and efficiency of our approach: inversion of an integral equation in atmospheric remote sensing, where the data dimension is very high; and the inference of a heterogeneous transmissivity field in a groundwater system, which involves a partial differential equation forward model with high dimensional state and parameters.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Physics-informed neural networks for solving forward and inverse flow problems via the Boltzmann-BGK formulation

We report the Boltzmann equation with the Bhatnagar-Gross-Krook collision model (Boltzmann-BGK equation) has been employed to describe multiscale flows, i.e., from the hydrodynamic limit to free molecular flow. In this study we employ physics-informed neural networks (PINNs) to solve forward and inverse problems via the Boltzmann-BGK formulation (PINN-BGK), enabling PINNs to model flows in both the continuum and rarefied regimes. In particular, the PINN-BGK is composed of three sub-networks, i.e., the first for approximating the equilibrium distribution function, the second for approximating the non-equilibrium distribution function, and the third one for encoding the Boltzmann-BGK equation as well as the corresponding boundary/initial conditions. By minimizing the residuals of the governing equations and the mismatch between the predicted and provided boundary/initial conditions, we can approximate the Boltzmann-BGK equation for both continuous and rarefied flows. For forward problems, the PINN-BGK is utilized to solve various benchmark flows given boundary/initial conditions, e.g. Kovasznay flow, Taylor-Green flow, cavity flow, and micro Couette flow for Knudsen number up to 5. For inverse problems, we focus on rarefied flows in which accurate boundary conditions are difficult to obtain. We employ the PINN-BGK to infer the flow field in the entire computational domain given a limited number of interior scattered measurements on the velocity without using the (unknown) boundary conditions. Results for the two-dimensional micro Couette and micro cavity flows with Knudsen numbers ranging from 0.1 to 10 indicate that the PINN-BGK can infer the velocity field in the entire domain with good accuracy. Finally, we also present some results on using transfer learning to accelerate the training process. Specifically, we can obtain a three-fold speedup comparted to the standard training process (e.g., Adam plus L-BFG-B) for the two-dimensional flow problems considered in our work.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

New analytical solutions to the two-phase water faucet problem

Here, the one-dimensional water faucet problem is one of the classical benchmark problems originally proposed by Ransom to study the two-fluid two-phase flow model. With certain simplifications, such as massless gas phase and no wall and interfacial frictions, analytical solutions had been previously obtained for the transient liquid velocity and void fraction distribution. The water faucet problem and its analytical solutions have been widely used for the purposes of code assessment, benchmark and numerical verifications. In our previous study, the Ransom’s solutions were used for the mesh convergence study of a high-resolution spatial discretization scheme. It was found that, at the steady state, an anticipated second-order spatial accuracy could not be achieved, when compared to the existing Ransom’s analytical solutions. A further investigation showed that the existing analytical solutions do not actually satisfy the commonly used two-fluid single-pressure two-phase flow equations. In this work, we present a new set of analytical solutions of the water faucet problem at the steady state, considering the gas phase density’s effect on pressure distribution. This new set of analytical solutions are used for mesh convergence studies, from which anticipated second-order of accuracy is achieved for the 2nd order spatial discretization scheme. In addition, extended Ransom’s transient solutions for the gas phase velocity and pressure are derived, with the assumption of decoupled liquid and gas pressures. Numerical verifications on the extended Ransom’s solutions are also presented.

97 MATHEMATICS AND COMPUTING↗

Heuristic solutions to the single depot electric vehicle scheduling problem with next day operability constraints

This study focuses on the single depot electric vehicle scheduling problem (SDEVSP) within the broader context of the vehicle scheduling problem (VSP). By developing an effective scheduling model using mixed-integer linear programming, we generate bus blocks that accommodate electric vehicles (EVs), ensuring successful completion of each block while considering recharging requirements between blocks and during off-hours. Next day operability constraints are also incorporated, allowing for seamless repetition of blocks on subsequent days. The SDEVSP is known to be computationally complex, deriving optimal solutions unattainable for large-scale problems within reasonable timeframes. To address this, we propose a two-step solution approach: first solving the single depot VSP, and then addressing the block chaining problem (BCP) using the blocks generated in the first step. The BCP focuses on optimizing block combinations to facilitate recharging between consecutive blocks, considering operational constraints. Further, a case study conducted reveals that nearly 100% electrification for Chicago, IL and Austin, TX transit buses is viable yet requires 1.6 EVs at 150-mile range per diesel vehicle.

33 ADVANCED PROPULSION SYSTEMS↗

Count of eigenvalues in the generalized eigenvalue problem

We study isolated and embedded eigenvalues in the generalized eigenvalue problem defined by two self-adjoint operators with a positive essential spectrum and a finite number of isolated eigenvalues. The generalized eigenvalue problem determines the spectral stability of nonlinear waves in infinite-dimensional Hamiltonian systems. The theory is based on Pontryagin's invariant subspace theorem and extends beyond the scope of earlier papers of Pontryagin, Krein, Grillakis, and others. Our main results are (i) the number of unstable and potentially unstable eigenvalues equals the number of negative eigenvalues of the self-adjoint operators, (ii) the total number of isolated eigenvalues of the generalized eigenvalue problem is bounded from above by the total number of isolated eigenvalues of the self-adjoint operators, and (iii) the quadratic forms defined by the two self-adjoint operators are strictly positive on the subspace related to the continuous spectrum of the generalized eigenvalue problem. Applications to the localized solutions of the nonlinear Schroedinger equations are developed from the general theory.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Asymptotic analysis of boundary value and spectral problems in thin perforated regions with rapidly changing thickness and different limiting dimensions

Boundary value and spectral problems for an elliptic differential equation with rapidly oscillating coefficients in a thin perforated region with rapidly changing thickness are investigated. Descriptions of asymptotic algorithms for solutions of such problems in thin regions with different limiting dimensions are combined. For a mixed inhomogeneous boundary value problem a corrector is constructed and an asymptotic estimate in the corresponding Sobolev space is established. Asymptotic bounds for eigenvalues and eigenfunctions of the Neumann spectral problems are also found. Full asymptotic expansions for the eigenvalues and eigenfunctions are constructed under certain symmetry assumptions about the structure of the thin perforated region and the coefficients of the equations. Bibliography: 21 titles.

97 MATHEMATICS AND COMPUTING↗

On Euler's problem

We consider the classical problem on the tallest column which was posed by Euler in 1757. Bernoulli-Euler theory serves today as the basis for the design of high buildings. This problem is reduced to the problem of finding the potential for the Sturm-Liouville equation corresponding to the maximum of the first eigenvalue. The problem has been studied by many mathematicians but we give the first rigorous proof of the existence and uniqueness of the optimal column and we give new formulae which let us find it. Our method is based on a new approach consisting in the study of critical points of a related nonlinear functional. Bibliography: 6 titles.

97 MATHEMATICS AND COMPUTING↗

SAGIPS: a physics-inspired scalable asynchronous generative inverse-problem solver

Abstract Solving large-scale inverse problems using deep-learning algorithms have become an essential part of modern research and industrial applications. The complexity of the underlying inverse problem may require the utilization of high performance computing systems which poses a challenge on the algorithmic design of the inverse problem solver. Most deep learning algorithms require, due to their design, custom parallelization techniques in order to be resource efficient while showing a reasonable convergence. In this paper we introduce a S calable A synchronous G enerative I nverse P roblem S olver (SAGIPS) on high-performance computing systems. We present a workflow that utilizes an asynchronous ring-allreduce algorithm to transfer the gradients of the generator network across multiple GPUs. Experiments with a scientific proxy application demonstrate that SAGIPS shows near linear weak scaling, together with a convergence quality that is comparable to traditional methods. The approach presented here allows leveraging Generative Adverserial Network across multiple GPUs, promising advancements in solving complex inverse problems at scale.

97 MATHEMATICS AND COMPUTING↗

Application of Markov Chain Monte Carlo Methods for Uncertainty Quantification in Inverse Transport Problems

Determination of the components of a radioactive source/shield system using the system’s radiation signature is of great importance in homeland security, material safeguards, and waste management. Although significant progress has been made toward solving this inverse transport problem in recent years, work remains to be done to quantify the uncertainty in reconstructed results. In this article we apply two Markov chain Monte Carlo (MCMC) approaches, the delayed rejection adaptive metropolis (DRAM) and differential evolution adaptive metropolis (DREAM) methods, to solve inverse problems and quantify uncertainty. The DRAM method uses delayed rejection combined with global adaptation of the proposal covariance matrix. Furthermore, the DREAM method hybridizes MCMC sampling with the differential evolution (DE) algorithm. In numerical test cases, the DRAM and DREAM methods are shown to be superior to a first-order inverse Hessian approach for problems with noisy data and multiple unknown quantities, with DREAM converging to the posterior distribution more quickly than DRAM. The DREAM and DRAM results indicate that a full posterior distribution is required to quantify uncertainty in many inverse transport problems.

98 NUCLEAR DISARMAMENT, SAFEGUARDS, AND PHYSICAL P↗

Hyperspherical Coulomb spheroidal basis in the Coulomb three-body problem

A hyperspherical Coulomb spheroidal (HSCS) representation is proposed for the Coulomb three-body problem. This is a new expansion in the set of well-known Coulomb spheroidal functions. The orthogonality of Coulomb spheroidal functions on a constant-hyperradius surface {rho} = const rather than on a constant-internuclear-distance surface R = const, as in the traditional Born-Oppenheimer approach, is a distinguishing feature of the proposed approach. Owing to this, the HSCS representation proves to be consistent with the asymptotic conditions for the scattering problem at energies below the threshold for three-body breakup: only a finite number of radial functions do not vanish in the limit of {rho}{yields}{infinity}, with the result that the formulation of the scattering problem becomes substantially simpler. In the proposed approach, the HSCS basis functions are considerably simpler than those in the well-known adiabatic hyperspherical representation, which is also consistent with the asymptotic conditions. Specifically, the HSCS basis functions are completely factorized. Therefore, there arise no problems associated with avoided crossings of adiabatic hyperspherical terms.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Convergence of Probability Densities Using Approximate Models for Forward and Inverse Problems in Uncertainty Quantification

Here, we analyze the convergence of probability density functions utilizing approximate models for both forward and inverse problems. We consider the standard forward uncertainty quantification problem where an assumed probability density on parameters is propagated through the approximate model to produce a probability density, often called a push-forward probability density, on a set of quantities of interest (QoI). The inverse problem considered in this paper seeks to update an initial probability density assumed on model input parameters such that the subsequent push-forward of this updated density through the parameter-to-QoI map matches a given probability density on the QoI. We prove that the densities obtained from solving the forward and inverse problems, using approximate models, converge to the true densities as the approximate models converge to the true models. Numerical results are presented to demonstrate convergence rates of densities for sparse grid approximations of parameter-to-QoI maps and standard spatial and temporal discretizations of PDEs and ODEs.

97 MATHEMATICS AND COMPUTING↗