<?xml version="1.0" encoding="UTF-8"?>
    <!DOCTYPE article PUBLIC "-//NLM/DTD JATS (Z39.96) Journal Publishing DTD v1.2 20120330//EN" "http://jats.nlm.nih.gov/publishing/1.2/JATS-journalpublishing1.dtd">
    <!--<?xml-stylesheet type="text/xsl" href="article.xsl">-->
<article xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" article-type="research-article" dtd-version="1.2" xml:lang="en">
	<front>
		<journal-meta>
			<journal-id journal-id-type="eissn">3034-1566</journal-id>
			<journal-title-group>
				<journal-title>Cifra. Computer Sciences and Informatics</journal-title>
			</journal-title-group>
			<publisher>
				<publisher-name>Cifra LLC</publisher-name>
			</publisher>
		</journal-meta>
		<article-meta>
			<article-id pub-id-type="doi"/>
			<article-categories>
				<subj-group>
					<subject>Brief communication</subject>
				</subj-group>
			</article-categories>
			<title-group>
				<article-title>A Review of Modern Numerical Methods for PDEs with Emphasis on Physics-Informed and Operator Learning Approaches</article-title>
			</title-group>
			<contrib-group>
				<contrib contrib-type="author" corresp="yes">
					<name>
						<surname>Saba</surname>
						<given-names>Salah Majeed</given-names>
					</name>
					<email>saba.s@coeng.uobaghdad.edu.iq</email>
					<xref ref-type="aff" rid="aff-1">1</xref>
				</contrib>
			</contrib-group>
			<aff id="aff-1">
				<label>1</label>
				<institution>University of Baghdad</institution>
			</aff>
			<pub-date publication-format="electronic" date-type="pub" iso-8601-date="2026-07-29">
				<day>29</day>
				<month>07</month>
				<year>2026</year>
			</pub-date>
			<pub-date pub-type="collection">
				<year>2026</year>
			</pub-date>
			<volume>9</volume>
			<issue>11</issue>
			<fpage>1</fpage>
			<lpage>9</lpage>
			<history>
				<date date-type="received" iso-8601-date="2026-04-21">
					<day>21</day>
					<month>04</month>
					<year>2026</year>
				</date>
				<date date-type="accepted" iso-8601-date="2026-05-12">
					<day>12</day>
					<month>05</month>
					<year>2026</year>
				</date>
			</history>
			<permissions>
				<copyright-statement>Copyright: &amp;#x00A9; 2022 The Author(s)</copyright-statement>
				<copyright-year>2022</copyright-year>
				<license license-type="open-access" xlink:href="http://creativecommons.org/licenses/by/4.0/">
					<license-p>
						This is an open-access article distributed under the terms of the Creative Commons Attribution 4.0 International License (CC-BY 4.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited. See 
						<uri xlink:href="http://creativecommons.org/licenses/by/4.0/">http://creativecommons.org/licenses/by/4.0/</uri>
					</license-p>
					.
				</license>
			</permissions>
			<self-uri xlink:href=""/>
			<abstract>
				<p>The numerical simulation of the behavior of physical and engineering systems is essentially dominated by solving Partial Differential Equations (PDEs). Conventional discretization techniques, such as Finite Difference, Finite Element and Finite Volume, have been largely prominent in this discipline; however often they encounter limitations when the problem is of complex geometry, high dimension domain, or time to solution is critical. This manuscript discusses recent developments in numerical methods for PDEs with emphasis on developments from 2015 to 2025. The modern methods are classified in five categories: Spectral Methods, Meshfree Methods, Adaptive and Multiscale Methods, AI based and Probabilistic Methods and Hybrid Methods. We conduct a close examination of each category in terms of accuracy, computation cost, stability and scalability. A salient observation is a transformative impact of AI based techniques; Physics Informed Neural Networks (PINNs) and Deep Operators Networks (DeepONet) are particularly suitable for solving the high dimensional and inverse problem formulations. Still, high-order Discontinuous Galerkin methods and very flexible Meshfree methods, such as the Material Point Method (MPM), are continuing to be relevant. The manuscript in includes a comprehensive quantitative comparison, which is presented in Table 1, as well as four in-depth case studies that include Computational Fluid Dynamics, Solid Mechanics, Financial Mathematics, and Fluid Structure Interaction. We describe several outstanding challenges, such as the development of strict theoretical foundations for AI-driven solvers and the optimization of the use of these advanced techniques on high-performance computing platforms. Looking round the future, possible research directions are identified, notably the derivation of novel adaptive hybrid algorithms, which can lead further into the field.</p>
			</abstract>
			<kwd-group>
				<kwd>Partial Differential Equations</kwd>
				<kwd> High-Dimensional PDE</kwd>
				<kwd> Stability</kwd>
				<kwd> Physics-Informed Neural Network</kwd>
			</kwd-group>
		</article-meta>
	</front>
	<body>
		<sec>
			<title>HTML-content</title>
			<p>1. Introduction</p>
			<p>Partial differential equations (PDEs) form the language of mathematics that is used to describe dynamic phenomena in a realistic world. Moreover, in all time evolution scenarios, where the variation of the involved quantity is progressive, such as a meteorological index, a thermal diffusional index or even a financial index, the causal evolution of the quantity through time can be understood best under the paradigm of the PDEs, which describe the dynamics behind the scene. The Navier-Stokes equations for the motion of a fluid, the heat equation for the spreading of heat, and of course the most recent the Schrifer equation, important for Quantum Mechanics, are all examples of such problems. Such equations are the foundation for transformative advances in all kinds of scientific disciplines and are the kind of catalysts that result in new technologies and improved industrial design. Since there is no available and accurate solutions, such revolutionary advances would be unthinkable.</p>
			<p>In fact, this assertion has a special meaning since solving a problem in real life, in the form of partial differential equations (PDEs), analytically has always been very difficult. Not surprisingly, new ways to solve numbers were then devised; certain numbers were too hard to work with using traditional methods. In the past computational scientists have been able to give spectacular results by finite- difference, FDM, finite- element, FEM and finite- volume, FVM methodologies. However, as the difficulty increases so do the limitations of these techniques to deliver satisfactory results. For example, there is the challenge of dealing with complex geometries. In such cases, computational methods based on a mesh, such as FEM and FVM, are rather cumbersome since mesh creation and mesh refinement can dominate the computational workflow. Not to mention the curse of dimensionality, which further compounds the misery: With every new dimension, so many more degrees of computational misery. The traditional ways of doing things simply cannot keep up, as in quantum chemistry or financial modelling. The inverse problem is an extremely difficult problem as well. The parametric recovery of unknown parameters/boundary conditions to match available data is a time consuming and expensive (if not impossible) task using classical solvers. Real time prediction is also an important topic. Today's simulation needs to be very fast and reliable, such as for a digital twin or for an online control system, and here techniques must be able to provide answers in an instant. Conventional techniques need the full re-solution of the PDE at each timestep and hence are not feasible for immediate response. Thus, the need is high for methodologies, which can learn the solution procedure per se. In response to these challenges, a new round of research began: to build modern numerical methods that fully exploit the capabilities of computational resources available today, based on machine learning techniques, and with new knowledge from the numerical analysis that helps to overcome the limitations of legacy methods.</p>
			<p>The paper contains an extensive overview of the latest and notable numerical methods for partial differential equations, taking into account the period of 2015-2025 years. The good thing about this review is that it presents all these modern techniques in a systematic manner and gives a detailed and critical comparison of these techniques. This work aims to give detailed studies of the latest advances for: specifying the theoretical basis of the various sophisticated methods, assessing their performance with respect to classical methods, and to give recommendations to practitioners and scholars on how to select the most appropriate methodology fitting to the particular issue at hand in the context of the study on partial differential equations.</p>
			<p>This paper aims to:</p>
			<p>1. Organize up-to-date numerical techniques for solving PDEs into logical, coherent categories.</p>
			<p>2. Explore the rationale behind each strategy, what is effective, what is not, and why as it relates to math.</p>
			<p>3. To help bring to life real scientific and engineering applications of these methods through specific case studies.</p>
			<p>In particular, give an account of the direction, the best challenges in the field and the requirements for the more widespread use of these new techniques.</p>
			<p>In this statute, we will state the following: Classical Theory and methods (including high order and discrete schemes) reside in Section 2. There is a connection to modern numerical methods in Section 3. There is a full comparison and performance check in section 4 with all four benchmarks. Application is made in section 5. Future work and challenging issues yet to be solved are mentioned in section 6. This paper ends with Section 7.</p>
			<p>2. Theoretical Framework and Classical Methods</p>
			<p>An equation, partial differential equation (PDE), is a partial derivative differential equation with multiple independent variables and the unknown function and its partial derivatives. The level of difficulty maybe agreed on at the start by considering the highest order derivative which is a considerable amount of information about the type of solutions you will get, which will have the numerical methods that can work. The Laplace or Poisson equations are an example of an elliptic partial differential equation; elliptic problems typically occur in either steady-state or equilibrium. There are no singular solutions to elliptic PDEs and they are completely boundary dependent, for example, the difference between the solutions of the Laplace and Poisson equations is smooth throughout the domain. The PDEs that relate to laws of change in time (diffusion, heat conduction, etc.) are called parabolic PDEs: diffusion equation or Fokker-Planck equation. These involve initial conditions and boundary conditions since the solutions will grow in time. Then there are hyperbolic PDEs which occur whenever one has to deal with waves or transport phenomena: the classical examples are wave equation and advection equation. Solutions can here get quite crazy, with shock waves or jumps; it's strongly related to the propagation of information across the domain.</p>
			<p>A well-posed mathematical model using a PDE is one that satisfies the properties </p>
			<p>[1][2]</p>
			<p>- a solution exists;</p>
			<p>- the solution is unique;</p>
			<p>- the solution depends continuously on the initial and boundary data.</p>
			<p>Any proposed numerical method has to meet these criteria. In contrast, hyperbolic problems require schemes which can capture discontinuities without spurious oscillations, e.g., upwind differencing or shock-capturing schemes are useful for this type of problem.</p>
			<p> </p>
			<p>However, in fact, strong solution is a classical notion and particularly for PDEs non-smooth in coefficients or in solutions, this is usually found deficient. Hence weak solution, which is a core concept for finite element and other variational methods, has been adopted. The weak formulation of a PDE is done by multiplying the governing equation with a smooth test function [LATEX_FORMULA]v[/LATEX_FORMULA] and integrating everything over the computational domain [LATEX_FORMULA]\Omega[/LATEX_FORMULA] .By applying integration by parts (or Green's identity) on the derivatives acting on the unknown function [LATEX_FORMULA]u[/LATEX_FORMULA], transfer is made to the test function [LATEX_FORMULA]v[/LATEX_FORMULA], thus decreasing the required differentiability demand on [LATEX_FORMULA]u[/LATEX_FORMULA]. Therefore, one is looking for a solution u in some Sobolev space, typically [LATEX_FORMULA]H^1(\Omega)[/LATEX_FORMULA]  </p>
			<p>For a representative </p>
			<mml:math display="inline">
				<mml:mrow>
					<mml:mo>−</mml:mo>
					<mml:mo>∇</mml:mo>
					<mml:mi>·</mml:mi>
					<mml:mo stretchy="false">(</mml:mo>
					<mml:mi>a</mml:mi>
					<mml:mo>∇</mml:mo>
					<mml:mi>u</mml:mi>
					<mml:mo stretchy="false">)</mml:mo>
					<mml:mo>=</mml:mo>
					<mml:mi>f</mml:mi>
					<mml:mspace width="0.278em"/>
					<mml:mtext>in</mml:mtext>
					<mml:mspace width="0.278em"/>
					<mml:mi>Ω</mml:mi>
				</mml:mrow>
			</mml:math>
			<p>The weak formulation can be expressed as:</p>
			<mml:math display="inline">
				<mml:mrow>
					<mml:msub>
						<mml:mo>∫</mml:mo>
						<mml:mrow>
							<mml:mi>Ω</mml:mi>
						</mml:mrow>
					</mml:msub>
					<mml:mi>a</mml:mi>
					<mml:mspace width="0.167em"/>
					<mml:mo>∇</mml:mo>
					<mml:mi>u</mml:mi>
					<mml:mi>·</mml:mi>
					<mml:mo>∇</mml:mo>
					<mml:mi>v</mml:mi>
					<mml:mspace width="0.167em"/>
					<mml:mi>d</mml:mi>
					<mml:mi>x</mml:mi>
					<mml:mo>=</mml:mo>
					<mml:msub>
						<mml:mo>∫</mml:mo>
						<mml:mrow>
							<mml:mi>Ω</mml:mi>
						</mml:mrow>
					</mml:msub>
					<mml:mi>f</mml:mi>
					<mml:mi>v</mml:mi>
					<mml:mspace width="0.167em"/>
					<mml:mi>d</mml:mi>
					<mml:mi>x</mml:mi>
					<mml:mo>+</mml:mo>
					<mml:msub>
						<mml:mo>∫</mml:mo>
						<mml:mrow>
							<mml:mo>∂</mml:mo>
							<mml:mi>Ω</mml:mi>
						</mml:mrow>
					</mml:msub>
					<mml:mi>v</mml:mi>
					<mml:mspace width="0.167em"/>
					<mml:mo stretchy="false">(</mml:mo>
					<mml:mi>a</mml:mi>
					<mml:mspace width="0.167em"/>
					<mml:mo>∇</mml:mo>
					<mml:mi>u</mml:mi>
					<mml:mi>·</mml:mi>
					<mml:mi>n</mml:mi>
					<mml:mo stretchy="false">)</mml:mo>
					<mml:mspace width="0.167em"/>
					<mml:mi>d</mml:mi>
					<mml:mi>S</mml:mi>
				</mml:mrow>
			</mml:math>
			<p>This variational structure particularly suits that numerical implementation, allowing the use of piecewise polynomial basis functions which must at all times remain continuous (but not differentiable) across the element boundary. Flexibility such as this represents one of the strengths and versatility of FEM as a tool for PDEs in very complicated geometries.</p>
			<p>The simplest method is conceptually the method of Finite Difference Method which uses Taylor series approximations at nodes to approximate the derivatives.</p>
			<p>Core Concept: Discretization of the domain on a structured grid, substitute derivatives by finite difference quotients, forward, backward or central.</p>
			<p>Stability and convergence go hand in hand. According to the Lax equivalence theorem, only for a consistent scheme of a linear initial value problem do convergence and stability go hand in hand. Stability is not an abstract concept to be checked, generally through von Neumann analysis, for linear problems only. Perhaps this is where time-stepping is needed. Unless you watch it, you will be in trouble, particularly in the case of explicit schemes (cFL condition again).</p>
			<p>Then, when a higher accuracy is desired, it is a requirement that high-order finite difference schemes like WENO and compact schemes are used. Weighted Essentially Non-Oscillatory (WENO) is mainly used for hyperbolic problems, in particular when shocks are met. Several low order stencils are combined and weighed differently in the subsequent operations, from which the essence of the method appears. In smooth areas, there is always one weight which dominates the others and such high-order accuracy is achieved. The weights then fall off if they come close to a sharp drop, which decreases the unnecessary oscillations. Different schemes of operation are implemented in compact schemes, which are very tight stencil but take information from adjacent points. Higher accuracy is then achieved without having to increase computational effort to a great extent.</p>
			<p>The most classically used technique in structural and mechanical engineering, for the ability to adapt to various and diverse geometries.</p>
			<p>1. Kernel Concept: the domain is discretized to a mesh of simple elements, which can also include triangles and tetrahedron. Solution is approximated by a linear combination of piecewise polynomial basis functions defined on these elements.</p>
			<p>2. Advantages: expert handling of complex geometry, solid mathematics (Galerkin method), direct implementation of various boundary conditions.</p>
			<p>3. Discontinuous Galerkin Methods (DGM): discontinuous basis functions at element boundaries. With this local nature it has many advantages:</p>
			<p>· very high order accuracy: very high order accuracy is easily obtained p-refinement in DGM via increasing the polynomial degree within an element;</p>
			<p>· local conservation: the DGM is locally conservative, and thus it works well with hyperbolic conservation laws;</p>
			<p>· parallelization: since the message that must be sent between elements only concerns the adjacent elements, the method can be implemented in a parallel way easily. DGM is an important bridge between traditional FEM approaches and new high order methods, mainly in CFD </p>
			<p>[3][4][5]</p>
			<p>FVM is the method of choice in Computational Fluid Dynamics (CFD) and heat transfer because it is inherently conservative.</p>
			<p>1. Core Concept: domain is divided into a collection of non-overlapping control volumes (finite volumes). The PDE is integrated on each control volume to get a balance equation for the conserved quantity. The fluxes of variables through the boundaries of the control volume are then estimated.</p>
			<p>2. Strengths: conservation is upheld with precision even on unstructured meshes which is precondition of the real representation of transport phenomena. </p>
			<p>Flux Limiters and Riemann Solvers: in order to solve hyperbolic equations with the finite volume methodologies, Riemann solvers, such as Roe or HLL are used, in order to correctly evaluate the fluxes between the control volume, with special attention to discontinuities. Near shocks, nonphysically induced oscillations (sometimes called &quot;wiggles&quot;) should be suppressed by the use of flux limiters in order to preserve this Total Variation Diminishing (TVD) property of the solution. This renders the finite - volume method to be robustly applied for complicated, nonlinear flow regimes.</p>
			<p>3. Comparative Analysis and Performance Evaluation</p>
			<p>The choice of an optimal numerical scheme is a critical function of the partial differential equation to be considered, the geometry of the domain, the required accuracy and the available computational resources.</p>
			<p>A quantitative comparison of some of the key performance metrics is presented in Table 1.</p>
			<table-wrap id="T1">
				<label>Table 1</label>
				<caption>
					<p>Expanded Comparative Analysis of Modern Numerical Methods for PDEs</p>
				</caption>
				<table>
					<tr>
						<td>Method</td>
						<td>Accuracy (Order of Convergence)</td>
						<td>(Per Iteration)</td>
						<td> Memory Footprint</td>
						<td> Stability</td>
						<td>Scalability (High-D)</td>
						<td>Implementation Complexity</td>
						<td>Ideal Applications</td>
					</tr>
					<tr>
						<td>Spectral</td>
						<td>Exponential (for smooth solutions)</td>
						<td>High (Setup), Low (Solution)</td>
						<td>High</td>
						<td>High</td>
						<td>Low</td>
						<td>High</td>
						<td>Smooth solutions, simple domains, high- fidelity benchmarks</td>
					</tr>
					<tr>
						<td>Discontinuous Galerkin (DG)</td>
						<td>)</td>
						<td>Moderate/High</td>
						<td>Moderate</td>
						<td>High</td>
						<td>Moderate</td>
						<td>High</td>
						<td>Hyperbolic problems, complex geometries, local conservation</td>
					</tr>
					<tr>
						<td>Meshfree (MPM/SPH)</td>
						<td>)</td>
						<td> High (Particle- Grid Transfer)</td>
						<td>High</td>
						<td> Moderate (Requires Stabilization)</td>
						<td>Moderate</td>
						<td>Moderate</td>
						<td>[7]</td>
					</tr>
					<tr>
						<td>Adaptive (AMR)</td>
						<td>)</td>
						<td>Low (Effective Cost)</td>
						<td>Moderate</td>
						<td>Moderate</td>
						<td>Very High</td>
						<td>High</td>
						<td>[9]</td>
					</tr>
					<tr>
						<td>AI-based (PINNs)</td>
						<td>Moderate/High (Algebraic)</td>
						<td>Very High (Training), Low (Inference)</td>
						<td>Moderate</td>
						<td>High</td>
						<td>Moderate</td>
						<td>High</td>
						<td>[13]</td>
					</tr>
					<tr>
						<td>Operator Learning (DeepONet/FNO)</td>
						<td>High (Algebraic)</td>
						<td>Very High (Training), Very Low (Inference)</td>
						<td>Moderate</td>
						<td>High</td>
						<td>Moderate</td>
						<td>Moderate</td>
						<td>[16]</td>
					</tr>
				</table>
			</table-wrap>
			<p>Spectral Methods offer the best theoretical convergence for smooth solutions. The error decays as</p>
			<p>1. Spectral Methods offer the best theoretical convergence for smooth solutions. The error decays as </p>
			<mml:math display="inline">
				<mml:mrow>
					<mml:mi>𝒪</mml:mi>
					<mml:mo stretchy="false">(</mml:mo>
					<mml:msup>
						<mml:mi>N</mml:mi>
						<mml:mrow>
							<mml:mo>−</mml:mo>
							<mml:mi>p</mml:mi>
						</mml:mrow>
					</mml:msup>
					<mml:mo stretchy="false">)</mml:mo>
				</mml:mrow>
			</mml:math>
			<mml:math display="inline">
				<mml:mrow>
					<mml:mo stretchy="false">(</mml:mo>
					<mml:mi>p</mml:mi>
					<mml:mo stretchy="false">)</mml:mo>
				</mml:mrow>
			</mml:math>
			<p>2. Mesh-based and Meshfree Methods typically exhibit algebraic convergence, ( </p>
			<mml:math display="inline">
				<mml:mrow>
					<mml:mi>𝒪</mml:mi>
					<mml:mo stretchy="false">(</mml:mo>
					<mml:msup>
						<mml:mi>h</mml:mi>
						<mml:mrow>
							<mml:mo>−</mml:mo>
							<mml:mi>p</mml:mi>
						</mml:mrow>
					</mml:msup>
					<mml:mo stretchy="false">)</mml:mo>
				</mml:mrow>
			</mml:math>
			<mml:math display="inline">
				<mml:mrow>
					<mml:mo stretchy="false">(</mml:mo>
					<mml:mi>h</mml:mi>
					<mml:mo stretchy="false">)</mml:mo>
				</mml:mrow>
			</mml:math>
			<mml:math display="inline">
				<mml:mrow>
					<mml:mo stretchy="false">(</mml:mo>
					<mml:mi>p</mml:mi>
					<mml:mo stretchy="false">)</mml:mo>
				</mml:mrow>
			</mml:math>
			<mml:math display="inline">
				<mml:mrow>
					<mml:msup>
						<mml:mn>10</mml:mn>
						<mml:mrow>
							<mml:mo>−</mml:mo>
							<mml:mn>3</mml:mn>
						</mml:mrow>
					</mml:msup>
				</mml:mrow>
			</mml:math>
			<mml:math display="inline">
				<mml:mrow>
					<mml:msup>
						<mml:mn>10</mml:mn>
						<mml:mrow>
							<mml:mo>−</mml:mo>
							<mml:mn>5</mml:mn>
						</mml:mrow>
					</mml:msup>
				</mml:mrow>
			</mml:math>
			<mml:math display="inline">
				<mml:mrow>
					<mml:msub>
						<mml:mi>L</mml:mi>
						<mml:mn>2</mml:mn>
					</mml:msub>
				</mml:mrow>
			</mml:math>
			<p>AI-based Methods also show algebraic convergence, but the convergence rate is often difficult to predict and depends heavily on the network architecture, activation function, and optimization strategy. [10][11]</p>
			<p>Cost of Training: AI-based methods (PINNs, DeepONet) have an extremely high initial training cost, often requiring days or weeks on GPUs. However, their inference cost is negligible, making them ideal for repeated, fast queries (surrogate modelling).</p>
			<p>Cost of Solution: spectral techniques can be utilized with FFT to solve the problem fairly rapidly in simple domains; however, mesh-free methods or high-order FEM tend to be relatively more expensive owing to complex costs of matrix assemblies and high integration efforts.</p>
			<p>Scale: AI-based as well as Meshfree methods (because it is the inherent nature of being particle-/node based) can demonstrate improved scalability to high-dimensional problems compared to classical mesh-based approaches, in which the number of grid points grows exponentially.</p>
			<p> </p>
			<p>Problem: Poisson equation on a square domain with a solution that has a localized singularity (e.g., a re-entrant corner). Comparison:</p>
			<p>· the first method, spectral, fails because of the Gibbs phenomenon, causing global oscillations and loss of exponential convergence;</p>
			<p>· the second way, FEM/DGM, deals well with singularities using localized mesh refinement (h-refinement) near corners; in particular, the DGM can make flexible use of p-refinement away from the singularity combined with h-refinement close to it;</p>
			<p>· spectral bias predominantly affects the accuracy of PINNs, since the network has difficulties learning the solution high-frequency components close to singularity </p>
			<p>[14]</p>
			<p> </p>
			<p>Comparison:</p>
			<p>· FVM (WENO): highly robust and accurate, as the WENO scheme effectively suppresses oscillations near the shock while maintaining high order in smooth regions;</p>
			<p>· AMR-FVM: most efficient, as the AMR focuses computational effort only on the moving shock front, significantly reducing the total number of grid points and computational time for long-time integration </p>
			<p>[8]</p>
			<p>· SPH</p>
			<p> </p>
			<p>Problem: Option Pricing Using Black-Scholes Equation 100+ Underlying Assets Comparison:</p>
			<p>· traditional Methods Failing due to curse of dimensionality;</p>
			<p>· PINNs: address the problem successfully by making use of the universal approximation theorem of neural networks; while the computational complexity is greatly reduced when close to classical methods, the required training time is still a considerable amount;</p>
			<p>· DeepONet/FNO: after a relatively expensive training phase, these operator learning frameworks are capable of predicting option prices for new starting conditions or parameters - such as volatility - in milliseconds; as such, they are the favourite option for real time risk management and trading infrastructures; deepONet's tolerance to noisy input data makes it particularly attractive for realistic financial data sets </p>
			<p>[17][19]</p>
			<p>The problem of simulating a flexible structure (like a flag) in the midst of a fluid flow.</p>
			<p>Comparison:</p>
			<p>· FEM/FVM Coupled: this coupling involves very complex mesh deformations/remeshing at each time step, is very expensive, and may even fail due to mesh tangling which is a potential problem when the mesh is subjected to significant structural deformations;</p>
			<p>· Material Point Method (MPM): with an integrated MPM environment the fluid and solid can be modeled accurately and Voronoi particles maintain material interface without any difficulties, and momentum transfer from fluid to solid is naturally taken care of in Eulerian grid and can thus accept large deformations and free surface flow without any mesh tangling problems </p>
			<p>[7];</p>
			<p> </p>
			<p> </p>
			<p>Maturity of software is an important factor in the acceptance of numerical methods.</p>
			<p>· Classical Methods high mature and standardized (e.g. FEniCS for FEM, OpenFOAM for FVM);</p>
			<p>· AMR: there are mature frameworks in place, like AMReX (block-structured AMR), Chombo;</p>
			<p>· Meshfree: not as standardised in regards to software, many specialised codes (e.g. DualSPHysics for SPH, many research codes for MPM);</p>
			<p>· AI-based: rapidly evolving; DeepXDE is a popular general purpose PINN library and implementations of DeepONet and FNO are commonly found in the specialized repositories of research; the absence of one, mature and universally accepted framework is still a barrier to entry for many researchers.</p>
			<p> </p>
			<p>4. Applications Across Disciplines</p>
			<p>The modern numerical methods are driving breakthroughs across various scientific and engineering disciplines.</p>
			<p> </p>
			<p>CFD has become a mainstay of modern scientific activity, especially in the areas of turbulence modelling and in the case of complex flow regimes. Its evolution is led by the incorporation of sophisticated computational methods that allow describing physical phenomena, otherwise inaccessible in the past.</p>
			<p>1. AMR in Weather Prediction Global atmospheric and climate models cannot exist without Block structured Adaptive Mesh Refinement (AMR). By focusing computational resolution around localized meteorological activities like hurricanes or frontal activities, AMR allows these types of meteorological features to be faithfully simulated at an affordable cost of fine grids over the entire world. This type of selective refinement is necessary to both capture the fine scale dynamics responsible for storm evolution as well as the broader context of the planetary circulation.</p>
			<p>2. Spectral Methods in DNS The Direct Numerical Simulation (DNS) method of turbulence study uses spectral discretisation techniques due to their ability to describe the continuous spectrum of eddies with a greater level of accuracy. Spectral methods help to minimise the numerical dispersion and dissipation errors and hence make it possible to resolve the full set of scales of turbulence, from the largest energy bearing vortices, down to the dissipative microscales. The fidelity provided by spectral approaches is the basis for confident investigation of key fundamental turbulence processes, such as energy cascades and intermittency.</p>
			<p>3. PINNs for Turbulence Modelling A growing role of Physics-Informed Neural Networks (PINN) in learning subgrid-scale closure relations (i.e., Reynolds stresses) for Reynolds Averaged Navier Stokes (RANS) schemes. By incorporating the governing equations into the loss function, PINNs respect our understanding of the underlying physical principles while learning robust data-driven models from high resolution flow databases. The available empirical evidence does not rule out the possibility of such data--assisted closures being better than conventional algebraic models to predict on the basis of the physics governing the problem </p>
			<p>[18][20]</p>
			<p>4. Application of FNO for Real Time Flow Prediction The Fourier Neural Operator (FNO) has been shown to have an incredible capability in approximating the solution operator of the Navier Stokes equations. Using learning principle to produce flow field from the boundary conditions to whole flow fields, FNOs make it possible to reconstruct complex flow feelings with velocity and pressure in near instantaneous time for new configurations. This term do in the real-time represents a paradigm shift for the real-time control, optimisation and decision support in aerospace engineering and the design of industrial processes.</p>
			<p> </p>
			<p>1. Meshfree Methods for Fracture: SPH and Material Point Method (MPM) are highly effective for simulating material failure, fracture, and fragmentation, where the mesh in FEM would become severely distorted </p>
			<p>[7]</p>
			<p>2. FEM/ML Hybrids for Composite Materials: Machine learning models are trained on micro-scale simulations to predict the effective macro-scale properties of composite materials, which are then fed into a macro-scale FEM solver, significantly reducing the computational cost of multiscale analysis.</p>
			<p>3. Multiscale Simulation using VMS and ROMs: Variational Multiscale (VMS) methods have been used to stabilize FEM for nearly incompressible materials, while Reduced Order Models (ROMs) are more often applied in the context of fast and predictive models for structural health monitoring and fatigue analysis.</p>
			<p> </p>
			<p>Simulations of blood flow in arteries (hemodynamic) are crucial for the understanding of cardiovascular diseases and this is achieved by use of CFD and also PINNs. The mesh-free approach PINNs provide for solving the Navier-Stokes equations for specific arbitrary geometries of the arterial system can be used to give rapid, non-invasive estimations of blood pressure and flow rates </p>
			<p>[21]</p>
			<p> </p>
			<p>The high-dimensional PDEs are prevalent in these fields and are therefore good test beds for the use of AI-based methods.</p>
			<p>One is the financial mathematics with the pricing of the complex structure of financial derivatives being governed by higher-dimensional parabolic PDEs (e.g. Black-Scholes equation with multiple assets). These equations are solved using PINNs and DeepONet, thus offering fast and accurate pricing and risk management tools.</p>
			<p>Quantum Mechanics: The Schrödinger equation (time dependent) is a high dimensional PDE. PINNs are being explored for the case of both the wave function of the ground and excited states, to provide an alternative pathway to the wave function besides the ones taken by traditional quantum chemistry methods like Density Functional Theory (DFT).</p>
			<p> </p>
			<p>AMR and FVM for Seismic Wave Propagation: For AMR it's related to simulating the traversal of seismic waves. It can also model the near-surface effects (such as fault zones) at relatively coarser depth constraint grid in deep earth, given the coarse grid size could be a problem. Due to the natural conservation properties of FVM, it is widely used for modelling groundwater flow and transporting the contaminant.</p>
			<p>High-Dimensional Data Assimilation and Filtering: Many problems require probabilistic methods (particularly based on GPs and Bayesian inference) to assimilate huge quantities of noisy data (in particular weather and satellite images, seismic data, etc.) into PDE-based models for the purpose of weather forecasting and climate change prediction.</p>
			<p>5. Open Challenges and Future Directions</p>
			<p>Hyperparameter tuning sensitivity (loss function weighting, architecture of the network, etc.) and accuracy of measurement (which must not exceed (10-5Missing Mark : sup) error) are the two important factors which hinder the pinning methods. Further complications arise when trying to use neural networks to capture sharp gradients or high-frequency solutions — spectral bias, where neural networks learn low-frequency parts of the spectrum, dominates. Moreover, a proper and complete framework for analyzing the stability/convergence of Physics-Informed Neural Networks is still a major challenge for the field similar to the Lax Equivalence Theorem for finite difference schemes. So, their broader adoption to solve engineering problems that are safety critical requires their certification and verification, which can be achieved through AI-driven solvers.</p>
			<p>Meshfree approaches have demonstrated a tremendous flexibility, but a systematic and sound theory of the stability and convergence for highly nonlinear problems is still under development. Theories need to be further developed with respect to issues related to boundary conditions enforcement and choice of kernel functions </p>
			<p>[6]</p>
			<p> </p>
			<p>The need for the rigid data structure of high-level AMR algorithms and the nonlocal nature of some mesh-free and spectral methods invoked in combination pose a big challenge for achieving secure computational performance on petascale and exascale platforms. As opposed to the (intrinsic) parallelism provided by GPU architectures in the AI-based approaches, the data migration and data communication latencies are dramatically expanded and played in parallel to the highly irregular data schemas of AMR and Mesh-free approaches, which are mainly based on recurrent data exchange between processing elements.</p>
			<p> </p>
			<p>The basic assessment of the uncertainty in numerical solutions is done. The largely computational intensive Monte Carlo based approaches are typical for classical methods dealing with uncertainty quantification. Among the AI-based approaches, uncertainty quantification is a new research field, with techniques such as ensemble-based methods </p>
			<p>[27][18]</p>
			<p> </p>
			<p>Data-driven and physics-driven models need to be seamlessly integrated which is the future of the numerical methods. This includes:</p>
			<p>1. Adaptive Hybridization: algorithms that can adaptively switch from the use of a traditional solver (which has a high level of accuracy in the critical regions) to an AI-based surrogate (which has a high level of speed in the non-critical regions) that can be a multi-fidelity application, choosing the strengths of both.</p>
			<p>2. Physics Constrained Operator Learning: Directly encoding the hard constraints of classical numerical schemes, such as conservation, stability and so on into the structure of operator learning models (such as DeepONet, FNO and so on), and during the operator learning process, make sure that an operator can satisfy all fundamental laws. Hence, the generalization and robustness are improved.</p>
			<p>Operator learning based approaches (DeepONet, FNO) are promising to further change the face of simulation in the near future through generation of fast and reusable PDE solvers. This will enable:</p>
			<p>1. Digital Twin in Real Time: System behaviour prediction based on the data which is instantaneously available for control and optimisation.</p>
			<p>2. Design Optimization on a Fast Lane: Faster evaluation of parameters controlling designs that are modeled by complex PDEs.</p>
			<p>3. Learning Non-Local Operators: Extend the framework to take account of physics that is non-local, in particular physics described by fractional PDEs or integral equations, of great concern in materials science.</p>
			<p> </p>
			<p>New strengths of modern tools will be more and more committed to solve complex problems involving several disciplines:</p>
			<p>Climate Modelling: When Adapative Mesh Refinement of the Atmospheric Dynamics meets Artificial Intelligence Models to capture Complex Sub-Grid processes.</p>
			<p>Another critical research area not done to date, will be using the intrinsic architecture of physics-informed neural networks to learn the properties of materials with the source terms and boundary conditions obtained from sparse noisy measurements required by non-destructive testing and characterization of materials. One of the most important research thrusts is the development of efficient, data sensitive, inverse solvers.</p>
			<p>6. Conclusion</p>
			<p>This extensive paper discussed the evolution of numerical techniques for Partial Differential Equations from well established yet semi-classical techniques (FDM, FEM, FVM) to a myriad of modern and specialized techniques. Among the different types of methods, spectral methods assure maximum accuracy for smooth problems, Discontinuous Galerkin methods assure maximum order of accuracy with local conservation, Meshfree methods (like MPM) assure enhanced geometric flexibility, while Adaptive methods (such as AMR and AMG) assure computational efficiency. Finally, the most recent methods are those based on AI, like PINNs and DeepONet, able to tackle the long-existing problems of very-high-dimensionality and inverse problems.</p>
			<p>The conclusion is that there is simply no method that is good in all situations. The one that is best among the rest is always a conscious choice based upon features of the problem it would be applied in, as evidenced by the four larger benchmarks presented in detail. Current trends towards hybridization are on the rise, which combine the advantages from both traditional and modern methodologies for the development of solvers that are robust, accurate, and efficient. Even with the huge challenges ahead, especially in validating the theoretical rigor and enhancing the AI-based method performance at high accuracies, the field is at a juncture that has opened up into a transformative era catalysed by the collaboration of numerical analysis and machine learning. Continued work on next-generation adaptive hybrid algorithms and optimization for HPC will be vital to enable these modern methods to realize their full potential in solving the most challenging PDEs arising in science and engineering.</p>
		</sec>
		<sec sec-type="supplementary-material">
			<title>Additional File</title>
			<p>The additional file for this article can be found as follows:</p>
			<supplementary-material xmlns:xlink="http://www.w3.org/1999/xlink" id="S1" xlink:href="https://doi.org/10.5334/cpsy.78.s1">
				<!--[<inline-supplementary-material xlink:title="local_file" xlink:href="https://informatics.cifra.science/media/articles/25076.docx">25076.docx</inline-supplementary-material>]-->
				<!--[<inline-supplementary-material xlink:title="local_file" xlink:href="https://informatics.cifra.science/media/articles/25076.pdf">25076.pdf</inline-supplementary-material>]-->
				<label>Online Supplementary Material</label>
				<caption>
					<p>
						Further description of analytic pipeline and patient demographic information. DOI:
						<italic>
							<uri>https://doi.org/None</uri>
						</italic>
					</p>
				</caption>
			</supplementary-material>
		</sec>
	</body>
	<back>
		<ack>
			<title>Acknowledgements</title>
			<p/>
		</ack>
		<sec>
			<title>Competing Interests</title>
			<p/>
		</sec>
		<ref-list>
			<ref id="B1">
				<label>1</label>
				<mixed-citation publication-type="confproc">Evans L. C. Partial Differential Equations / L. C. Evans — Providence: American Mathematical Society, 2010. — 749 p. DOI: 10.1090/gsm/019.</mixed-citation>
			</ref>
			<ref id="B2">
				<label>2</label>
				<mixed-citation publication-type="confproc">Hadamard J. Sur les problèmes aux dérivées partielles et leur signification physique / J. Hadamard — 1902. — № 13. — p. 49–52.</mixed-citation>
			</ref>
			<ref id="B3">
				<label>3</label>
				<mixed-citation publication-type="confproc">Cockburn B. The development of discontinuous Galerkin methods for hyperbolic / B. Cockburn , G. E. Karniadakis , C.-W. Shu — 2000. — № 2. — p. 199–224.</mixed-citation>
			</ref>
			<ref id="B4">
				<label>4</label>
				<mixed-citation publication-type="confproc">Canuto C. Spectral Methods: Fundamentals in Single Domains / C. Canuto , M. Y. Hussaini , A. Quarteroni , T. A. Zang — Berlin: Springer, 2007. — 563 p.</mixed-citation>
			</ref>
			<ref id="B5">
				<label>5</label>
				<mixed-citation publication-type="confproc">Fasshauer G. E. Meshfree Approximation Methods with MATLAB / G. E. Fasshauer — Singapore: World Scientific, 2007. — 528 p. DOI: 10.1142/6437.</mixed-citation>
			</ref>
			<ref id="B6">
				<label>6</label>
				<mixed-citation publication-type="confproc">Al Mahmoud Z. Implementation of different types of meshfree technique in computational solid mechanics: a comprehensive review across nano, micro, and macro scales / Z. Al Mahmoud, B. Safaei , S. Sahmani — 2024. — № 1. — p. 1–45.</mixed-citation>
			</ref>
			<ref id="B7">
				<label>7</label>
				<mixed-citation publication-type="confproc">Sulsky D. A particle method for history-dependent materials with applications to solid mechanics / D. Sulsky , Z. Chen , H. L. Schreyer — 1994. — № 1–2. — p. 179–196.</mixed-citation>
			</ref>
			<ref id="B8">
				<label>8</label>
				<mixed-citation publication-type="confproc">Berger M. J. Local adaptive mesh refinement for shock hydrodynamics / M. J. Berger , P. Colella — 1989. — № 1. — p. 64–84. DOI: 10.1016/0021-9991(89)90035-1.</mixed-citation>
			</ref>
			<ref id="B9">
				<label>9</label>
				<mixed-citation publication-type="confproc">Stüben K. A review of algebraic multigrid / K. Stüben — 2001. — № 3. — p. 331–359.</mixed-citation>
			</ref>
			<ref id="B10">
				<label>10</label>
				<mixed-citation publication-type="confproc">Munshid K. S. Principally self-injective modules / K. S. Munshid , M. F. Hamid , J. R. Kider — 2022. — № 17. — p. 255–263.</mixed-citation>
			</ref>
			<ref id="B11">
				<label>11</label>
				<mixed-citation publication-type="confproc">Munshid K. S. Principally pure submodules / K. S. Munshid , M. F. Hamid , J. R. Kider — 2022. — № 2. — p. 917–922.</mixed-citation>
			</ref>
			<ref id="B12">
				<label>12</label>
				<mixed-citation publication-type="confproc">Munshid K. S. Some properties of strongly principally self-injective modules / K. S. Munshid , M. F. Hamid , J. R. Kider — 2022. — № 2. — p. 132–141.</mixed-citation>
			</ref>
			<ref id="B13">
				<label>13</label>
				<mixed-citation publication-type="confproc">Raissi M. Physics-informed neural networks: A deep learning framework for solving forward and inverse problems involving nonlinear partial differential equations / M. Raissi , P. Perdikaris , G. E. Karniadakis — 2019. — № 378. — p. 686–707. DOI: 10.1016/j.jcp.2018.10.045.</mixed-citation>
			</ref>
			<ref id="B14">
				<label>14</label>
				<mixed-citation publication-type="confproc">Xu Z.-Q. J. On understanding and overcoming spectral biases of deep neural network learning methods for solving PDEs / Z.-Q. J. Xu , L. Zhang , W. Cai — 2025. — № 530. — p. 27.</mixed-citation>
			</ref>
			<ref id="B15">
				<label>15</label>
				<mixed-citation publication-type="confproc">Lu L. Learning nonlinear operators via DeepONet based on the universal approximation theorem of operators / L. Lu , P. Jin, Z. Zhang — 2021. — № 3. — p. 218–229. DOI: 10.1038/s42256-021-00302-5.</mixed-citation>
			</ref>
			<ref id="B16">
				<label>16</label>
				<mixed-citation publication-type="confproc">Li Z. Fourier neural operator for parametric partial differential equations / Z. Li, N. Kovachki, K. Azizzadenesheli // International Conference on Learning Representations (ICLR). — Chad: Conference, 2021. — Iss. 25. — P. 20–25.</mixed-citation>
			</ref>
			<ref id="B17">
				<label>17</label>
				<mixed-citation publication-type="confproc">Lu L. A comprehensive and fair comparison of two neural operators (with practical extensions) based on FAIR data / L. Lu , X. Meng , S. Cai , Z. Mao — 2022. — № 393. — p. 25.</mixed-citation>
			</ref>
			<ref id="B18">
				<label>18</label>
				<mixed-citation publication-type="confproc">Sabbar Y. A review of modern stochastic modeling: SDE/SPDE numerics, data-driven identification, and generative methods with applications in biology and epidemiology / Y. Sabbar — 2025. — № 5. — p. 20–26.</mixed-citation>
			</ref>
			<ref id="B19">
				<label>19</label>
				<mixed-citation publication-type="confproc">Meuris B. Machine-learning-based spectral methods for partial differential equations / B. Meuris , D. Vlasenko , J. N. Kutz — 2023. — № 1. — p. 1–12. DOI: 10.1038/s41598-022-26602-3.</mixed-citation>
			</ref>
			<ref id="B20">
				<label>20</label>
				<mixed-citation publication-type="confproc">Cai S. Physics-informed neural networks (PINNs) for fluid mechanics: A review / S. Cai , Z. Mao , Z. Wang — 2021. — № 12. — p. 727–738.</mixed-citation>
			</ref>
			<ref id="B21">
				<label>21</label>
				<mixed-citation publication-type="confproc">Raissi M. Physics-informed neural networks for the forward and inverse problems of the Boussinesq equation / M. Raissi , P. Perdikaris , G. E. Karniadakis — 2020. — № 9. — p. 23–27.</mixed-citation>
			</ref>
		</ref-list>
	</back>
	<fundings/>
</article>