Search NASA⌕ Search

SEARCH · Search NASA

Results for “partial differential equation”

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

Generalized fractional approach to solving partial differential equations with arbitrary dispersion relations

The dynamics of physical systems are typically modeled by partial differential equations (PDEs). Because of the complexity in physical systems, PDE models rely on approximations or limiting cases. To model the full complexity of physical systems, it is necessary to use multiscale approaches where appropriate models are used at each level. Alternatively, complexity can be directly tackled by fractional integrodifferential equations that must be derived for each system. Here, we argue that complexity can be restored in PDEs by describing them from a fractional calculus perspective. Rather than deriving a fractional integrodifferential equation, we reinterpret the dispersion relation of the system by use of the Riesz definition, which contains the required information relating the energy and momentum space of the system and thus fully describes their dynamics. The approach is demonstrated by two examples: the Landau–Lifshitz equation in a 1D ferromagnetic chain and a modified KdV equation supporting surface gravity waves or Euler dispersion. The presented approach is applicable to fluids, soft matter, and solid-state matter and can be readily generalized to higher dimensions and more complex systems. While numerical calculations are needed to determine the fractional operator, the approach is analytical and can be utilized to determine analytical solutions and investigate nonlinear problems.

97 MATHEMATICS AND COMPUTING↗

Stochastic basis adaptation and spatial domain decomposition for partial differential equations with random coefficients

We present a novel approach for high-dimensional stochastic partial differential equations that decomposes the computational domain into smaller disjoint subdomains and reduces the random dimension in each subdomain to save computational costs. The proposed approach combines spatial domain decomposition and stochastic basis adaptation in each subdomain. We adapt the stochastic basis in each subdomain such that the local solution has a low-dimensional random space representation. To compute the stochastic solution in each subdomain, we use the Neumann-Neumann algorithm, where we first estimate the interface solution and then evaluate the interior solution in each subdomain using the interface solution as a boundary condition. The interior solutions in each subdomain are computed independently of each other, which reduces the operation count from $\approx O(N^\alpha)$ to $\approx O(M^\alpha),$ where $N$ is the total number of degrees of freedom, $M$ is the number of degrees of freedom in each subdomain, and the exponent $\alpha>1$ depends on the uncertainty quantification method used. In addition, the localized nature of solutions makes the proposed approach highly parallelizable. We illustrate the accuracy and efficiency of the approach for a steady-state diffusion equation with a random space-dependent diffusion coefficient.

uncertainty quantification, basis adaptation↗

Non-Intrusive Parallel-in-Time Solvers for Partial Differential Equations (Final Report)

Many time-dependent problems and simulations are often modeled using Partial Differential Equations. Traditional modeling approaches that use sequential time-stepping are reaching a bottleneck in optimizing efficiency. The Center of Applied Science and Computing at Lawrence Livermore National Laboratory extensively works on parallelizing these algorithms to leverage the increasing computational power from the growing number of processors in computer hardware. In particular, they aim to design non-intrusive algorithms that can generalize to a variety of problems and sizes without requiring additional information from or modifications on the original problems. Multigrid Reduction in Time (MGRIT) is a parallel-in-time algorithm that is designed to be non-intrusive. This project focuses on increasing the efficiency of MGRIT by approximating the coarse-grid operator using machine learning approaches as a means to find the most non-intrusive, or general, solution.

97 MATHEMATICS AND COMPUTING↗

Spherical means of solutions of partial differential equations in a conical region

The spherical means of the solutions of a linear partial differential equation Lu = f in a conical region are studied. The conical region is bounded by a surface generated by curvilinear ti surfaces. The spherical mean is the average of u over a constant ti surface. The conditions on the linear differential operator, L, and on the orthogonal coordinates (ti, eta, zeta) are established so that the spherical mean of the solution subjected to the appropriate boundary and initial conditions can be determined directly as a problem with only space variable. Conditions are then established so that the spherical mean of the solution in one concial region will be proportional to that of a known solution in another conical region. Applications to various problems of mathematical physics and their physical interpretations are presented.

Ting, L.↗

Spherical means of solutions of partial differential equations in a conical region

The spherical means of the solutions of a linear partial differential equation Lu = f in a conical region are studied. The conical region is bounded by a surface generated by curvilinear xi lines and by two truncating xi surfaces. The spherical mean is the average of u over a constant xi surface. Conditions on the linear differential operator, L, and on the orthogonal coordinates xi, eta, and zeta are established so that the problem for the determination of the spherical mean of the solution subjected to the appropriate boundary and initial conditions can be reduced to a problem with only one space variable. Conditions are then established so that the spherical mean of the solution in one conical region will be proportional to that of a known solution in another conical region. Applications to various problems of mathematical physics and their physical interpretations are presented.

Ting, L.↗

Adaptive grid methods for partial differential equations

A number of techniques for constructing adaptive mesh generators for use in solving partial differential equations are reviewed in this paper. Techniques reviewed include methods based on steady grid generation schemes and those which are explicitly designed to determine grid speeds in a time-dependent or space-marching problem. Results for candidate methods are included and suggestions for areas of future research are suggested.

Anderson, D. A.↗

A score-based diffusion model approach for adaptive learning of stochastic partial differential equation solutions

In this paper, we propose a novel framework for adaptively learning the time-evolving solutions of stochastic partial differential equations (SPDEs) using score-based diffusion models within a recursive Bayesian inference setting. SPDEs play a central role in modeling complex physical systems under uncertainty, but their numerical solutions often suffer from model errors and reduced accuracy due to incomplete physical knowledge and environmental variability. To address these challenges, we encode the governing physics into the score function of a diffusion model using simulation data and incorporate observational information via a likelihood-based correction in a reverse-time stochastic differential equation. This enables adaptive learning through iterative refinement of the solution as new data becomes available. To improve computational efficiency in high-dimensional settings, we introduce the ensemble score filter, a training-free approximation of the score function designed for real-time inference. Numerical experiments on benchmark SPDEs demonstrate the accuracy and robustness of the proposed method under sparse and noisy observations.

97 MATHEMATICS AND COMPUTING↗

Conditional Karhunen-Loève expansion for uncertainty quantification and active learning in partial differential equation models

We use a conditional Karhunen-Lo` eve (KL) model to quantify and reduce uncertainty in a stochastic partial differential equation (SPDE) problem with partially-known space-dependent coefficient, Y (x). We assume that a small number of Y (x) measurements are available and model Y (x) with a KL expansion. We achieve reduction in uncertainty by conditioning the KL expansion coefficients on measurements. We consider two approaches for conditioning the KL expansion: In Approach 1, we condition the KL model first and then truncate it. In Approach 2, we first truncate the KL expansion and then condition it. We employ the conditional KL expansion together with Monte Carlo and sparse grid collocation methods to compute the moments of the solution of the SPDE problem. Uncertainty of the problem is further reduced by adaptively selecting additional observation locations using two active learning methods. Method 1 minimizes the variance of the PDE coefficient, while Method 2 minimizes the variance of the solution of the PDE. We demonstrate that conditioning leads to dimension reduction of the KL representation of Y (x). For a linear diffusion SPDE with uncertain log-normal coefficient, we show that Approach 1 provides a more accurate approximation of the conditional log-normal coefficient and solution of the SPDE than Approach 2 for the same number of random dimensions in a conditional KL expansion. Furthermore, Approach 2 provides a good estimate for the number of terms of the truncated KL expansion of the conditional field of Approach 1. Finally, we demonstrate that active learning based on Method 2 is more efficient for uncertainty reduction in the SPDE’s states (i.e., it leads to a larger reduction of the variance) than active learning using Method 2.

Conditioned Karhunen-Lo` eve expanion, machine lea↗

Inclusion of exact exchange in the noniterative partial-differential-equation method of electron-molecule scattering - Application to e-N2

The noniterative partial-differential-equation (PDE) approach to electron-molecule scattering of Onda and Temkin (1983) is modified to account for the effects of exchange explicitly. The exchange equation is reduced to a set of inhomogeneous equations containing no integral terms and solved noniteratively in a difference form; a method for propagating the solution to large values of r is described; the changes in the polarization potential of the original PDE method required by the inclusion of exact static exchange are indicated; and the results of computations for e-N2 scattering in the fixed-nuclei approximation are presented in tables and graphs and compared with previous calculations and experimental data. Better agreement is obtained using the modified PDE method.

Weatherford, C. A.↗

Nebo: An efficient, parallel, and portable domain-specific language for numerically solving partial differential equations

This study presents Nebo, a declarative domain-specific language embedded in C++ for discretizing partial differential equations for transport phenomena on multiple architectures. Application programmers use Nebo to write code that appears sequential but can be run in parallel, without editing the code. Currently Nebo supports single-thread execution, multi-thread execution, and many-core (GPU-based) execution. With single-thread execution, Nebo performs on par with code written by domain experts. With multi-thread execution, Nebo can linearly scale (with roughly 90% efficiency) up to 12 cores, compared to its single-thread execution. Moreover, Nebo’s many-core execution can be over 140x faster than its single-thread execution.

97 MATHEMATICS AND COMPUTING↗

Learning Only on Boundaries: A Physics-Informed Neural Operator for Solving Parametric Partial Differential Equations in Complex Geometries

Recently, deep learning surrogates and neural operators have shown promise in solving partial differential equations (PDEs). However, they often require a large amount of training data and are limited to bounded domains. In this work, we present a novel physics-informed neural operator method to solve parameterized boundary value problems without labeled data. By reformulating the PDEs into boundary integral equations (BIEs), we can train the operator network solely on the boundary of the domain. This approach reduces the number of required sample points from $O(N^d)$ to $O(N^{d-1}$), where $d$ is the domain’s dimension, leading to a significant acceleration of the training process. Additionally, our method can handle unbounded problems, which are unattainable for existing physics-informed neural networks (PINNs) and neural operators. Finally, our numerical experiments show the effectiveness of parameterized complex geometries and unbounded problems.

97 MATHEMATICS AND COMPUTING↗

Computer transformation of partial differential equations into any coordinate system

The use of tensors to provide a compact way of writing partial differential equations in a form valid in all coordinate systems is discussed. In order to find solutions to the equations with their boundary conditions they must be expressed in terms of the coordinate system under consideration. The process of arriving at these expressions from the tensor formulation was automated by a software system, TENSR. An allied system that analyzes the resulting expressions term by term and drops those that are negligible is also described.

Sullivan, R. D.↗

Extrapolation methods for dynamic partial differential equations

Several extrapolation procedures are presented for increasing the order of accuracy in time for evolutionary partial differential equations. These formulas are based on finite difference schemes in both the spatial and temporal directions. On practical grounds the methods are restricted to schemes that are fourth order in time and either second, fourth or sixth order in space. For hyperbolic problems the second order in space methods are not useful while the fourth order methods offer no advantage over the Kreiss-Oliger method unless very fine meshes are used. Advantages are first achieved using sixth order methods in space coupled with fourth order accuracy in time. Computational results are presented confirming the analytic discussions.

Turkel, E.↗

Learning emergent partial differential equations in a learned emergent space

We propose an approach to learn effective evolution equations for large systems of interacting agents. This is demonstrated on two examples, a well-studied system of coupled normal form oscillators and a biologically motivated example of coupled Hodgkin-Huxley-like neurons. For such types of systems there is no obvious space coordinate in which to learn effective evolution laws in the form of partial differential equations. In our approach, we accomplish this by learning embedding coordinates from the time series data of the system using manifold learning as a first step. In these emergent coordinates, we then show how one can learn effective partial differential equations, using neural networks, that do not only reproduce the dynamics of the oscillator ensemble, but also capture the collective bifurcations when system parameters vary. The proposed approach thus integrates the automatic, data-driven extraction of emergent space coordinates parametrizing the agent dynamics, with machine-learning assisted identification of an emergent PDE description of the dynamics in this parametrization.

97 MATHEMATICS AND COMPUTING↗