Search NASA⌕ Search

SEARCH · Search NASA

Results for “partial differential equations”

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 73 records · Page 4

On the removal of boundary errors caused by Runge-Kutta integration of non-linear partial differential equations

It has been previously shown that the temporal integration of hyperbolic partial differential equations (PDE's) may, because of boundary conditions, lead to deterioration of accuracy of the solution. A procedure for removal of this error in the linear case has been established previously. In the present paper we consider hyperbolic (PDE's) (linear and non-linear) whose boundary treatment is done via the SAT-procedure. A methodology is present for recovery of the full order of accuracy, and has been applied to the case of a 4th order explicit finite difference scheme.

Abarbanel, Saul↗

Reliable Real-Time Solution of Parametrized Partial Differential Equations: Reduced-Basis Output Bound Methods

We present a technique for the rapid and reliable prediction of linear-functional outputs of elliptic (and parabolic) partial differential equations with affine parameter dependence. The essential components are (i) (provably) rapidly convergent global reduced basis approximations, Galerkin projection onto a space W(sub N) spanned by solutions of the governing partial differential equation at N selected points in parameter space; (ii) a posteriori error estimation, relaxations of the error-residual equation that provide inexpensive yet sharp and rigorous bounds for the error in the outputs of interest; and (iii) off-line/on-line computational procedures, methods which decouple the generation and projection stages of the approximation process. The operation count for the on-line stage, in which, given a new parameter value, we calculate the output of interest and associated error bound, depends only on N (typically very small) and the parametric complexity of the problem; the method is thus ideally suited for the repeated and rapid evaluations required in the context of parameter estimation, design, optimization, and real-time control.

Prudhomme, C.↗

Solution of partial differential equations on vector and parallel computers

The present status of numerical methods for partial differential equations on vector and parallel computers was reviewed. The relevant aspects of these computers are discussed and a brief review of their development is included, with particular attention paid to those characteristics that influence algorithm selection. Both direct and iterative methods are given for elliptic equations as well as explicit and implicit methods for initial boundary value problems. The intent is to point out attractive methods as well as areas where this class of computer architecture cannot be fully utilized because of either hardware restrictions or the lack of adequate algorithms. Application areas utilizing these computers are briefly discussed.

Ortega, J. M.↗

Solution of partial differential equations on vector and parallel computers

The present status of numerical methods for partial differential equations on vector and parallel computers was reviewed. The relevant aspects of these computers are discussed and a brief review of their development is included, with particular attention paid to those characteristics that influence algorithm selection. Both direct and iterative methods are given for elliptic equations as well as explicit and implicit methods for initial boundary value problems. The intent is to point out attractive methods as well as areas where this class of computer architecture cannot be fully utilized because of either hardware restrictions or the lack of adequate algorithms. Application areas utilizing these computers are briefly discussed.

Ortega, J. M.↗

Weak baselines and reporting biases lead to overoptimism in machine learning for fluid-related partial differential equations

One of the most promising applications of machine learning in computational physics is to accelerate the solution of partial differential equations (PDEs). The key objective of machine-learning-based PDE solvers is to output a sufficiently accurate solution faster than standard numerical methods, which are used as a baseline comparison. Here, we first perform a systematic review of the ML-for-PDE-solving literature. Out of all of the articles that report using ML to solve a fluid-related PDE and claim to outperform a standard numerical method, we determine that 79% (60/76) make a comparison with a weak baseline. Second, we find evidence that reporting biases are widespread, especially outcome reporting and publication biases. We conclude that ML-for-PDE-solving research is overoptimistic: weak baselines lead to overly positive results, while reporting biases lead to under-reporting of negative results. To a large extent, these issues seem to be caused by factors similar to those of past reproducibility crises: researcher degrees of freedom and a bias towards positive results. We call for bottom-up cultural changes to minimize biased reporting as well as top-down structural reforms to reduce perverse incentives for doing so.

97 MATHEMATICS AND COMPUTING↗

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↗

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↗

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.↗

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.↗