Derivative-informed projected neural networks for high-dimensional parametric maps governed by PDEs

Aiming at the heat conduction equation, the heat conduction model is a very typical example of the partial differential equation. This paper focuses on the development and preliminary knowledge of the partial differential equation, the establishment of the heat conduction model and the solution of the heat conduction model. The partial differential equation with fractional Laplace operator is a kind of typical fractional partial differential equation, which has important applications in the fields of science and engineering. Fractional Laplace operator is a kind of nonlocal quasi-differential operator, which is the infinitesimal generator of L é vy steady-state process. It is essentially different from the classical Laplace operator, which leads to the disappearance of some classical properties, which generally brings difficulties to the study of this kind of problems. It is very difficult to solve the explicit solution of partial differential equation with fractional Laplace operator. In order to improve the accuracy and speed of solving partial differential equation, a high precision method for solving partial differential equation based on deep learning network is proposed. A multilayer radial basis function neural network is constructed and its structural layers are determined. By introducing subnetworks into each layer of the multilayer radial basis function neural network, a composite multilayer radial basis function neural network is constructed to improve the real function approximation performance and operation accuracy of the multilayer radial basis function neural network. The high-precision compound multi-layer radial basis function neural network is used to solve the partial differential equation. By giving a specific example of solving the partial differential equation, the solution effect of the method is tested. The results show that the method has very high solution accuracy under the four-layer network structure, which can improve about 1.5 orders of magnitude compared with the first layer. Under different number of training samples, it has higher solution accuracy and speed, and the comprehensive performance is superior. Therefore, it is a practical but challenging work to study the existence of solutions of partial differential equations with fractional Laplace operators. This paper mainly describes the research progress and trends of the existence of solutions of several classes of partial differential equations with fractional Laplace operators, including some of the work done by the author in this field in recent years.

Gaussian processes with built-in dimensionality reduction: Applications to high-dimensional uncertainty propagation

This paper explores the solutions of certain fractional partial differential equations using two methods; the first method involves separation of variables, which is a common technique for solving partial differential equations. However, since many equations cannot be separated in this way, the tensor product of Banach spaces method is applied to find the atomic solutions. To solve the resulting ordinary differential equations, the reproducing Kernel Hilbert space method is used to find numerical solutions, which are then used to find the numerical solution of the partial differential equation. The residual errors indicate that this method is effective and powerful. In summary, this paper presents a study on the solutions of certain fractional partial differential equations using two methods and demonstrates the effectiveness of these methods in finding numerical solutions.

Deep-time neural networks: An efficient approach for solving high-dimensional PDEs

The fractional partial differential equation is an equation with non-integer partial derivative which is now widely used in solving various problems so that in recent years, many researchers are interested to study fractional partial differential equation. The equation which is used in this paper is the non-homogeneous fractional partial differential equation. The aim of this study is to determine general solution of the partial differential equation through three different order equations (α; 1), (β; 2) and (α; β), where 0 < α ≤ 2 and 0 < β ≤ 1 by using Homotopy Analysis Method (HAM). Furthermore, by taking a convergent sequence, it will be analyzed that the convergence of the sequence of differential equations results in the sequence of solutions of partial fractional non-homogeneous partial differential equations converging to the solution function of the fractional partial differential equation.

Several research papers experimentally validated the derived theoretical solution of the partial differential equation (PDE) of Transient Land Drainage (TLD) using laboratory sand tanks, Hele-Shaw models, resistance networks, and field data. In this research, the main objective is to use an Arduino microcontroller linked with the LabVIEW software to derive experimentally-by using an RC analog circuit connected to the Arduino microcontroller - a solution to Kirchhoff’s partial differential equation describing the unsteady electrical flow through the RC circuit. The RC circuit electrically simulates a non-dimensional virtual aquifer for which an experimental Fourier sine series solution in terms of the analog components is to be derived and used for comparison with the theoretical Fourier sine series solution of the transient partial differential equation of land drainage. The derived Fourier sine series solution of the partial differential equation governing the unsteady electrical flow through the RC analog is written in a non-dimensional form to enable its general application to the case study of this research. Isochrones of the water table drawdown based on those derived from the analog solution are similar in trend and behavior to those of the theoretical solution, indicating that both Fourier solutions are physically and mathematically identical.

In scientific and engineering calculation, the effective solution of partial differential equations (PDEs) has great significance. This paper presents an innovative method based on the combination of a U-Net neural network with Fourier neural operators, aiming to improve the accuracy and efficiency of solving partial differential equations. U-Net neural networks with a unique encoding–decoder structure and hopping connections can efficiently extract and integrate spatial-domain features and accurately describe the spatial structure of PDEs. The Fourier neural operator combines the advantages of neural networks and Fourier transform to learn the mapping relationship of high-dimensional data by training the linear transformation parameters in the detailed frequency domain of the data. Fourier transform is used to explore and process the frequency-domain features and capture the frequency characteristics of the solution of partial differential equations. By combining the two, this method not only retains spatial details but also makes full use of frequency-domain information, which significantly reduces the dependence of the model on large-scale data and improves the generalization ability of the model. The experimental results show that compared with the traditional method, this method performs well in various complex partial differential equation (PDE) solving tasks and achieves high accuracy.

Fast and scalable computation of shape-morphing nonlinear solutions with application to evolutional neural networks

Interface solutions of partial differential equations with point singularity

Bayesian optimal experimental design (OED) plays an important role in minimizing model uncertainty with limited experimental data in a Bayesian framework. In many applications, rather than minimizing the uncertainty in the inference of model parameters, one seeks to minimize the uncertainty of a model-dependent quantity of interest (QoI). This is known as goal-oriented OED (GOOED). Here, we consider GOOED for linear Bayesian inverse problems governed by large-scale models represented by partial differential equations (PDE) that are computationally expensive to solve. In particular, we consider optimal sensor placement by maximizing an expected information gain (EIG) for the QoI. We develop an efficient method to solve such problems by deriving a new formulation of the goal-oriented EIG. Based on this formulation we propose an offline-online decomposition scheme that achieves significant computational reduction by computing all of the PDE-dependent quantities in an offline stage just once, and optimizing the sensor locations in an online stage without solving any PDEs. Moreover, in the offline stage we need only to compute low-rank approximations of two Hessian-related operators. The computational cost of these low-rank approximations, measured by the number of PDE solves, does not depend on the parameter or data dimensions for a large class of elliptic, parabolic, and sufficiently dissipative hyperbolic inverse problem that exhibit dimension-independent rapid spectra decay. We carry out detailed error analysis for the approximate goal-oriented EIG due to the low-rank approximations of the two operators. Furthermore, in the online stage we extend a swapping greedy method to optimize the sensor locations developed in our recent work that is demonstrated to be more efficient than a standard greedy method. We conduct a numerical experiment for a contaminant transport inverse problem with an infinite-dimensional parameter field to demonstrate the efficiency, accuracy, and both data- and parameter-dimension independence of the proposed algorithm.

Physics Informed Extreme Learning Machine (PIELM)–A rapid method for the numerical solution of partial differential equations

A comparison of differential quadrature methods for the solution of partial differential equations

Partial differential equations (PDEs) are core tools for characterizing physical laws and are widely used in fluid mechanics, power systems, additive manufacturing, and other fields. However, traditional numerical methods are limited by mesh partitioning, leading to a trade-off between accuracy and efficiency in complex geometric domains and high-dimensional problems. While Physically Informed Neural Networks (PINNs) achieve meshless PDE solutions by embedding prior physical knowledge, they still face challenges such as insufficient accuracy, low training efficiency, and poor stability. This study aims to address the core bottlenecks of PINN in solving PDEs by proposing a systematic optimization strategy to improve its numerical solution accuracy, efficiency, and stability. Methodologically, firstly, a composite loss function containing PDE residuals and boundary initial condition constraints is constructed based on automatic differentiation techniques to ensure that the network satisfies physical laws. Secondly, the PINN training system is optimized, including using Neural Architecture Search (NAS-PINN) to automatically match the optimal network structure, designing an adaptive data sampling strategy to improve data utilization, and introducing parallel computing and hardware acceleration techniques to reduce training time. Finally, the effectiveness of the strategy is verified through classical PDEs and engineering problems. The results show that the optimized PINN achieves high-precision numerical approximation in classical PDE solutions and can efficiently solve forward design and backward parameter inversion problems in engineering scenarios. Compared with traditional methods, it exhibits stronger adaptability in complex geometric domains and high-dimensional problems, while improving training efficiency by more than 30% and significantly enhancing stability. This research not only enriches the optimization theory of PINN and provides an efficient new path for PDE numerical solutions, but also promotes the practical application of PINN in engineering fields such as fluid mechanics, additive manufacturing, and power systems, possessing significant theoretical value and application significance.

Wasserstein generative adversarial uncertainty quantification in physics-informed neural networks

We introduce novel adaptive methods to approximate moments of solutions of partial differential Equations (PDEs) with uncertain parametric inputs. A typical problem in Uncertainty Quantification is the approximation of the expected values of quantities of interest of the solution, which requires the efficient numerical approximation of high-dimensional integrals. We perform this task by a class of deterministic quasi-Monte Carlo integration rules derived from Polynomial lattices, that allows to control a-posteriori the integration error without querying the governing PDE and does not incur the curse of dimensionality. Based on an abstract formulation of adaptive finite element methods (AFEM) for deterministic problems, we infer convergence of the combined adaptive algorithms in the parameter and physical space. We propose a selection of examples of PDEs admissible for these algorithms. Finally, we present numerical evidence of convergence for a model diffusion PDE.