Sign in to use this feature.

Years

Between: -

Subjects

remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline

Journals

remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline

Article Types

Countries / Regions

remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline

Search Results (2,350)

Search Parameters:
Keywords = partial differential equations

Order results
Result details
Results per page
Select all
Export citation of selected articles as:
28 pages, 4456 KiB  
Article
Neural Networks-Based Analytical Solver for Exact Solutions of Fractional Partial Differential Equations
by Shanhao Yuan, Yanqin Liu, Limei Yan, Runfa Zhang and Shunjun Wu
Fractal Fract. 2025, 9(8), 541; https://doi.org/10.3390/fractalfract9080541 (registering DOI) - 16 Aug 2025
Abstract
This paper introduces an innovative artificial neural networks-based analytical solver for fractional partial differential equations (fPDEs), combining neural networks (NNs) with symbolic computation. Leveraging the powerful function approximation ability of NNs and the exactness of symbolic methods, our approach achieves notable improvements in [...] Read more.
This paper introduces an innovative artificial neural networks-based analytical solver for fractional partial differential equations (fPDEs), combining neural networks (NNs) with symbolic computation. Leveraging the powerful function approximation ability of NNs and the exactness of symbolic methods, our approach achieves notable improvements in both computational speed and solution precision. The efficacy of the proposed method is validated through four numerical examples, with results visualized using three-dimensional surface plots, contour mappings, and density distributions. Numerical experiments demonstrate that the proposed framework successfully derives exact solutions for fPDEs without relying on data samples. This research provides a novel methodological framework for solving fPDEs, with broad applicability across scientific and engineering fields. Full article
32 pages, 425 KiB  
Article
Asymptotic Analysis of a Kernel-Type Estimator for Parabolic Stochastic Partial Differential Equations Driven by Cylindrical Sub-Fractional Brownian Motion
by Abdelmalik Keddi, Salim Bouzebda and Fethi Madani
Mathematics 2025, 13(16), 2627; https://doi.org/10.3390/math13162627 - 15 Aug 2025
Abstract
The main purpose of the present paper is to investigate the problem of estimating the time-varying coefficient in a stochastic parabolic equation driven by a sub-fractional Brownian motion. More precisely, we introduce a kernel-type estimator for the time-varying coefficient θ(t) [...] Read more.
The main purpose of the present paper is to investigate the problem of estimating the time-varying coefficient in a stochastic parabolic equation driven by a sub-fractional Brownian motion. More precisely, we introduce a kernel-type estimator for the time-varying coefficient θ(t) in the following evolution equation:du(t,x)=(A0+θ(t)A1)u(t,x)dt+dξH(t,x),x[0,1],t(0,T],u(0,x)=u0(x), where ξH(t,x) is a cylindrical sub-fractional Brownian motion in L2[0,T]×[0,1], and A0+θ(t)A1 is a strongly elliptic differential operator. We obtain the asymptotic mean square error and the limiting distribution of the proposed estimator. These results are proved under some standard conditions on the kernel and some mild conditions on the model. Finally, we give an application for the confidence interval construction. Full article
(This article belongs to the Special Issue Partial Differential Equations in Applied Mathematics)
30 pages, 7155 KiB  
Article
An Improved Causal Physics-Informed Neural Network Solution of the One-Dimensional Cahn–Hilliard Equation
by Jinyu Hu and Jun-Jie Huang
Appl. Sci. 2025, 15(16), 8863; https://doi.org/10.3390/app15168863 - 11 Aug 2025
Viewed by 135
Abstract
Physics-Informed Neural Networks (PINNs) provide a promising framework for solving partial differential equations (PDEs). By incorporating temporal causality, Causal PINN improves training stability in time-dependent problems. However, applying Causal PINN to higher-order nonlinear PDEs, such as the Cahn–Hilliard equation (CHE), presents notable challenges [...] Read more.
Physics-Informed Neural Networks (PINNs) provide a promising framework for solving partial differential equations (PDEs). By incorporating temporal causality, Causal PINN improves training stability in time-dependent problems. However, applying Causal PINN to higher-order nonlinear PDEs, such as the Cahn–Hilliard equation (CHE), presents notable challenges due to the inefficient utilization of temporal information. This inefficiency often results in numerical instabilities and physically inconsistent solutions. This study systematically analyzes the limitations of Causal PINN in solving the one-dimensional CHE. To resolve these issues, we propose a novel framework called APM (Adaptive Progressive Marching)-PINN that enhances temporal representation and improves model robustness. APM-PINN mainly integrates a progressive temporal marching strategy, a causality-based adaptive sampling algorithm, and a residual-based adaptive loss weighting mechanism (effective with the chemical potential reformulation). Comparative experiments on two one-dimensional CHE test cases show that APM-PINN achieves relative errors consistently near 10−3 or even 10−4. It also preserves mass conservation and energy dissipation better. The promising results highlight APM-PINN’s potential for the accurate, stable modeling of complex high-order dynamic systems. Full article
Show Figures

Figure 1

17 pages, 310 KiB  
Article
Analytical Solutions for Generalized Stochastic HSC-KdV Equations with Variable Coefficients Using Hermite Transform and F-Expansion Method
by Mohammed Zakarya, Nadiah Zafer Al-Shehri, Hegagi M. Ali, Mahmoud A. Abd-Rabo and Haytham M. Rezk
Axioms 2025, 14(8), 624; https://doi.org/10.3390/axioms14080624 - 10 Aug 2025
Viewed by 125
Abstract
This study focuses on analyzing the generalized HSC-KdV equations characterized by variable coefficients and Wick-type stochastic (Wt.S) elements. To derive white noise functional (WNF) solutions, we employ the Hermite transform, the homogeneous balance principle, and the Fe (F-expansion) technique. Leveraging the inherent [...] Read more.
This study focuses on analyzing the generalized HSC-KdV equations characterized by variable coefficients and Wick-type stochastic (Wt.S) elements. To derive white noise functional (WNF) solutions, we employ the Hermite transform, the homogeneous balance principle, and the Fe (F-expansion) technique. Leveraging the inherent connection between hypercomplex system (HCS) theory and white noise (WN) analysis, we establish a comprehensive framework for exploring stochastic partial differential equations (PDEs) involving non-Gaussian parameters (N-GP). As a result, exact solutions expressed through Jacobi elliptic functions (JEFs) and trigonometric and hyperbolic forms are obtained for both the variable coefficients and stochastic forms of the generalized HSC-KdV equations. An illustrative example is included to validate the theoretical findings. Full article
27 pages, 7729 KiB  
Article
Autonomous Exploration in Unknown Indoor 2D Environments Using Harmonic Fields and Monte Carlo Integration
by Dimitrios Kotsinis, George C. Karras and Charalampos P. Bechlioulis
Sensors 2025, 25(16), 4894; https://doi.org/10.3390/s25164894 - 8 Aug 2025
Viewed by 144
Abstract
Efficient autonomous exploration in unknown obstacle cluttered environments with interior obstacles remains a challenging task for mobile robots. In this work, we present a novel exploration process for a non-holonomic agent exploring 2D spaces using onboard LiDAR sensing. The proposed method generates velocity [...] Read more.
Efficient autonomous exploration in unknown obstacle cluttered environments with interior obstacles remains a challenging task for mobile robots. In this work, we present a novel exploration process for a non-holonomic agent exploring 2D spaces using onboard LiDAR sensing. The proposed method generates velocity commands based on the calculation of the solution of an elliptic Partial Differential Equation with Dirichlet boundary conditions. While solving Laplace’s equation yields collision-free motion towards the free space boundary, the agent may become trapped in regions distant from free frontiers, where the potential field becomes almost flat, and consequently the agent’s velocity nullifies as the gradient vanishes. To address this, we solve a Poisson equation, introducing a source point on the free explored boundary which is located at the closest point from the agent and attracts it towards unexplored regions. The source values are determined by an exponential function based on the shortest path of a Hybrid Visibility Graph, a graph that models the explored space and connects obstacle regions via minimum-length edges. The computational process we apply is based on the Walking on Sphere algorithm, a method that employs Brownian motion and Monte Carlo Integration and ensures efficient calculation. We validate the approach using a real-world platform; an AmigoBot equipped with a LiDAR sensor, controlled via a ROS-MATLAB interface. Experimental results demonstrate that the proposed method provides smooth and deadlock-free navigation in complex, cluttered environments, highlighting its potential for robust autonomous exploration in unknown indoor spaces. Full article
(This article belongs to the Special Issue Radar Remote Sensing and Applications—2nd Edition)
Show Figures

Figure 1

30 pages, 2112 KiB  
Article
Numerical Treatment of Hyperbolic-Type Problems with Single and Double Interfaces via Meshless Method
by Muhammad Asif, Naveed Akhtar, Farhan Khan, Faisal Bilal and Ioan-Lucian Popa
Axioms 2025, 14(8), 621; https://doi.org/10.3390/axioms14080621 - 8 Aug 2025
Viewed by 142
Abstract
Hyperbolic interface problems frequently arise in a wide range of scientific and engineering applications, particularly in scenarios involving wave propagation or transport phenomena across media with discontinuous properties. These problems are characterized by abrupt changes in material coefficients or domain features, which pose [...] Read more.
Hyperbolic interface problems frequently arise in a wide range of scientific and engineering applications, particularly in scenarios involving wave propagation or transport phenomena across media with discontinuous properties. These problems are characterized by abrupt changes in material coefficients or domain features, which pose significant challenges for numerical approximation. In this study, we propose an efficient and robust computational framework for solving one-dimensional hyperbolic interface problems with both single and double interfaces. The methodology combines the finite difference method (FDM) for time discretization with meshless radial basis functions (RBFs) for spatial approximation, enabling accurate resolution of interface discontinuities. This hybrid approach is adaptable to both linear and nonlinear models and is capable of handling constant as well as variable coefficients. Linear systems are solved using Gaussian elimination, while nonlinear systems are addressed through a quasi-Newton linearization method. To validate the performance of the proposed method, we compute the maximum absolute errors (MAEs) and root mean square errors (RMSEs) over various spatial and temporal discretizations. Numerical experiments demonstrate that the approach exhibits fast convergence, excellent accuracy, and ease of implementation, making it a practical tool for solving complex hyperbolic problems with interface conditions. Overall, the method provides a reliable and scalable solution for a class of problems where traditional numerical techniques often discontinuties. Full article
(This article belongs to the Special Issue Advanced Approximation Techniques and Their Applications, 2nd Edition)
Show Figures

Figure 1

26 pages, 819 KiB  
Review
A Survey of Analog Computing for Domain-Specific Accelerators
by Leonid Belostotski, Asif Uddin, Arjuna Madanayake and Soumyajit Mandal
Electronics 2025, 14(16), 3159; https://doi.org/10.3390/electronics14163159 - 8 Aug 2025
Viewed by 595
Abstract
Analog computing has re-emerged as a powerful tool for solving complex problems in various domains due to its energy efficiency and inherent parallelism. This paper summarizes recent advancements in analog computing, exploring discrete time and continuous time methods for solving combinatorial optimization problems, [...] Read more.
Analog computing has re-emerged as a powerful tool for solving complex problems in various domains due to its energy efficiency and inherent parallelism. This paper summarizes recent advancements in analog computing, exploring discrete time and continuous time methods for solving combinatorial optimization problems, solving partial differential equations and systems of linear equations, accelerating machine learning (ML) inference, multi-beam beamforming, signal processing, quantum simulation, and statistical inference. We highlight CMOS implementations that leverage switched-capacitor, switched-current, and radio-frequency circuits, as well as non-CMOS implementations that leverage non-volatile memory, wave physics, and stochastic processes. These advancements demonstrate high-speed, energy-efficient computations for computational electromagnetics, finite-difference time-domain (FDTD) solvers, artificial intelligence (AI) inference engines, wireless systems, and related applications. Theoretical foundations, experimental validations, and potential future applications in high-performance computing and signal processing are also discussed. Full article
Show Figures

Figure 1

20 pages, 1818 KiB  
Article
Aeroelastic Oscillations of Cantilever Beams Reinforced by Carbon Nanotubes Based on a Modified Third-Order Piston Theory
by Mehdi Alimoradzadeh, Francesco Tornabene and Rossana Dimitri
Appl. Sci. 2025, 15(15), 8700; https://doi.org/10.3390/app15158700 - 6 Aug 2025
Viewed by 180
Abstract
This work analyzes the aero-elastic oscillations of cantilever beams reinforced by carbon nanotubes (CNTs). Four different distributions of single-walled CNTs are assumed as the reinforcing phase, in the thickness direction of the polymeric matrix. A modified third-order piston theory is used as an [...] Read more.
This work analyzes the aero-elastic oscillations of cantilever beams reinforced by carbon nanotubes (CNTs). Four different distributions of single-walled CNTs are assumed as the reinforcing phase, in the thickness direction of the polymeric matrix. A modified third-order piston theory is used as an accurate tool to model the supersonic air flow, rather than a first-order piston theory. The nonlinear dynamic equation governing the problem accounts for Von Kármán-type nonlinearities, and it is derived from Hamilton’s principle. Then, the Galerkin decomposition technique is adopted to discretize the nonlinear partial differential equation into a nonlinear ordinary differential equation. This is solved analytically according to a multiple time scale method. A comprehensive parametric analysis was conducted to assess the influence of CNT volume fraction, beam slenderness, Mach number, and thickness ratio on the fundamental frequency and lateral dynamic deflection. Results indicate that FG-X reinforcement yields the highest frequency response and lateral deflection, followed by UD and FG-A patterns, whereas FG-O consistently exhibits the lowest performance metrics. An increase in CNT volume fraction and a reduction in slenderness ratio enhance the system’s stiffness and frequency response up to a critical threshold, beyond which a damped beating phenomenon emerges. Moreover, higher Mach numbers and greater thickness ratios significantly amplify both frequency response and lateral deflections, although damping rates tend to decrease. These findings provide valuable insights into the optimization of CNTR composite structures for advanced aeroelastic applications under supersonic conditions, as useful for many engineering applications. Full article
Show Figures

Figure 1

20 pages, 6776 KiB  
Article
Computational Approaches to Assess Flow Rate Efficiency During In Situ Recovery of Uranium: From Reactive Transport to Streamline- and Trajectory-Based Methods
by Maksat Kurmanseiit, Nurlan Shayakhmetov, Daniar Aizhulov, Banu Abdullayeva and Madina Tungatarova
Minerals 2025, 15(8), 835; https://doi.org/10.3390/min15080835 - 6 Aug 2025
Viewed by 193
Abstract
This study presents a comprehensive computational analysis of flow rate efficiency during uranium extraction via the In Situ Recovery method. Using field data from a deposit located in Southern Kazakhstan, a series of mathematical models were developed to evaluate the distribution and balance [...] Read more.
This study presents a comprehensive computational analysis of flow rate efficiency during uranium extraction via the In Situ Recovery method. Using field data from a deposit located in Southern Kazakhstan, a series of mathematical models were developed to evaluate the distribution and balance of leaching solution. A reactive transport model incorporating uranium dissolution kinetics and acid–rock interactions were utilized to assess the accuracy of both traditional and proposed methods. The results reveal a significant spatial imbalance in sulfuric acid distribution, with up to 239.1 tons of acid migrating beyond the block boundaries. To reduce computational demands while maintaining predictive accuracy, two alternative methods, a streamline-based and a trajectory-based approach were proposed and verified. The streamline method showed close agreement with reactive transport modeling and was able to effectively identify the presence of intra-block reagent imbalance. The trajectory-based method provided detailed insight into flow dynamics but tended to overestimate acid overflow outside the block. Both alternative methods outperformed the conventional approach in terms of accuracy by accounting for geological heterogeneity and well spacing. The proposed methods have significantly lower computational costs, as they do not require solving complex systems of partial differential equations involved in reactive transport simulations. The proposed approaches can be used to analyze the efficiency of mineral In Situ Recovery at both the design and operational stages, as well as to determine optimal production regimes for reducing economic expenditures in a timely manner. Full article
(This article belongs to the Section Mineral Processing and Extractive Metallurgy)
Show Figures

Figure 1

19 pages, 1905 KiB  
Article
Fuzzy Frankot–Chellappa Algorithm for Surface Normal Integration
by Saeide Hajighasemi and Michael Breuß
Algorithms 2025, 18(8), 488; https://doi.org/10.3390/a18080488 - 6 Aug 2025
Viewed by 162
Abstract
In this paper, we propose a fuzzy formulation of the classic Frankot–Chellappa algorithm by which surfaces can be reconstructed using normal vectors. In the fuzzy formulation, the surface normal vectors may be uncertain or ambiguous, yielding a fuzzy Poisson partial differential equation that [...] Read more.
In this paper, we propose a fuzzy formulation of the classic Frankot–Chellappa algorithm by which surfaces can be reconstructed using normal vectors. In the fuzzy formulation, the surface normal vectors may be uncertain or ambiguous, yielding a fuzzy Poisson partial differential equation that requires appropriate definitions of fuzzy derivatives. The solution of the resulting fuzzy model is approached by adopting a fuzzy variant of the discrete sine transform, which results in a fast and robust algorithm for surface reconstruction. An adaptive defuzzification strategy is also introduced to improve noise handling in highly uncertain regions. In experiments, we demonstrate that our fuzzy Frankot–Chellappa algorithm achieves accuracy on par with the classic approach for smooth surfaces and offers improved robustness in the presence of noisy normal data. We also show that it can naturally handle missing data (such as gaps) in the normal field by filling them using neighboring information. Full article
(This article belongs to the Collection Feature Papers in Algorithms for Multidisciplinary Applications)
Show Figures

Figure 1

19 pages, 474 KiB  
Article
Differential and Integral Equations Involving Multivariate Special Polynomials with Applications in Computer Modeling
by Mohra Zayed, Taghreed Alqurashi, Shahid Ahmad Wani, Dixon Salcedo and Mohammad Esmael Samei
Fractal Fract. 2025, 9(8), 512; https://doi.org/10.3390/fractalfract9080512 - 5 Aug 2025
Viewed by 210
Abstract
This work introduces a new family of multivariate hybrid special polynomials, motivated by their growing relevance in mathematical modeling, physics, and engineering. We explore their core properties, including recurrence relations and shift operators, within a unified structural framework. By employing the factorization method, [...] Read more.
This work introduces a new family of multivariate hybrid special polynomials, motivated by their growing relevance in mathematical modeling, physics, and engineering. We explore their core properties, including recurrence relations and shift operators, within a unified structural framework. By employing the factorization method, we derive various governing equations such as differential, partial differential, and integrodifferential equations. Additionally, we establish a related fractional Volterra integral equation, which broadens the theoretical foundation and potential applications of these polynomials. To support the theoretical development, we carry out computational simulations to approximate their roots and visualize the distribution of their zeros, offering practical insights into their analytical behavior. Full article
Show Figures

Figure 1

20 pages, 547 KiB  
Article
An Efficient Spectral Method for a Class of Asymmetric Functional-Order Diffusion–Wave Equations Using Generalized Chelyshkov Wavelets
by Quan H. Do and Hoa T. B. Ngo
Symmetry 2025, 17(8), 1230; https://doi.org/10.3390/sym17081230 - 4 Aug 2025
Viewed by 225
Abstract
Asymmetric functional-order (variable-order) fractional diffusion–wave equations (FO-FDWEs) introduce considerable computational challenges, as the fractional order of the derivatives can vary spatially or temporally. To overcome these challenges, a novel spectral method employing generalized fractional-order Chelyshkov wavelets (FO-CWs) is developed to efficiently solve such [...] Read more.
Asymmetric functional-order (variable-order) fractional diffusion–wave equations (FO-FDWEs) introduce considerable computational challenges, as the fractional order of the derivatives can vary spatially or temporally. To overcome these challenges, a novel spectral method employing generalized fractional-order Chelyshkov wavelets (FO-CWs) is developed to efficiently solve such equations. In this approach, the Riemann–Liouville fractional integral operator of variable order is evaluated in closed form via a regularized incomplete Beta function, enabling the transformation of the governing equation into a system of algebraic equations. This wavelet-based spectral scheme attains extremely high accuracy, yielding significantly lower errors than existing numerical techniques. In particular, numerical results show that the proposed method achieves notably improved accuracy compared to existing methods under the same number of basis functions. Its strong convergence properties allow high precision to be achieved with relatively few wavelet basis functions, leading to efficient computations. The method’s accuracy and efficiency are demonstrated on several practical diffusion–wave examples, indicating its suitability for real-world applications. Furthermore, it readily applies to a wide class of fractional partial differential equations (FPDEs) with spatially or temporally varying order, demonstrating versatility for diverse applications. Full article
(This article belongs to the Topic Numerical Methods for Partial Differential Equations)
Show Figures

Figure 1

30 pages, 1721 KiB  
Article
Finite Integration Method with Chebyshev Expansion for Shallow Water Equations over Variable Topography
by Ampol Duangpan, Ratinan Boonklurb, Lalita Apisornpanich and Phiraphat Sutthimat
Mathematics 2025, 13(15), 2492; https://doi.org/10.3390/math13152492 - 2 Aug 2025
Viewed by 247
Abstract
The shallow water equations (SWEs) model fluid flow in rivers, coasts, and tsunamis. Their nonlinearity challenges analytical solutions. We present a numerical algorithm combining the finite integration method with Chebyshev polynomial expansion (FIM-CPE) to solve one- and two-dimensional SWEs. The method transforms partial [...] Read more.
The shallow water equations (SWEs) model fluid flow in rivers, coasts, and tsunamis. Their nonlinearity challenges analytical solutions. We present a numerical algorithm combining the finite integration method with Chebyshev polynomial expansion (FIM-CPE) to solve one- and two-dimensional SWEs. The method transforms partial differential equations into integral equations, approximates spatial terms via Chebyshev polynomials, and uses forward differences for time discretization. Validated on stationary lakes, dam breaks, and Gaussian pulses, the scheme achieved errors below 1012 for water height and velocity, while conserving mass with volume deviations under 105. Comparisons showed superior shock-capturing versus finite difference methods. For two-dimensional cases, it accurately resolved wave interactions over complex topographies. Though limited to wet beds and small-scale two-dimensional problems, the method provides a robust simulation tool. Full article
(This article belongs to the Special Issue Numerical Analysis and Scientific Computing for Applied Mathematics)
Show Figures

Figure 1

25 pages, 3362 KiB  
Article
The Double Laplace–Adomian Method for Solving Certain Nonlinear Problems in Applied Mathematics
by Oswaldo González-Gaxiola
AppliedMath 2025, 5(3), 98; https://doi.org/10.3390/appliedmath5030098 - 1 Aug 2025
Viewed by 186
Abstract
The objective of this investigation is to obtain numerical solutions for a variety of mathematical models in a wide range of disciplines, such as chemical kinetics, neurosciences, nonlinear optics, metallurgical separation/alloying processes, and asset dynamics in mathematical finance. This research features numerical simulations [...] Read more.
The objective of this investigation is to obtain numerical solutions for a variety of mathematical models in a wide range of disciplines, such as chemical kinetics, neurosciences, nonlinear optics, metallurgical separation/alloying processes, and asset dynamics in mathematical finance. This research features numerical simulations conducted with a remarkably low error measure, providing a visual representation of the examined models in these areas. The proposed method is the double Laplace–Adomian decomposition method, which facilitates the numerical acquisition and analysis of solutions. This paper presents the first report of numerical simulations employing this innovative methodology to address these problems. The findings are expected to benefit the natural sciences, mathematical modeling, and their practical applications, representing the innovative aspect of this article. Additionally, this method can analyze many classes of partial differential equations, whether linear or nonlinear, without the need for linearization or discretization. Full article
Show Figures

Figure 1

23 pages, 930 KiB  
Article
One-Dimensional Shallow Water Equations Ill-Posedness
by Tew-Fik Mahdi
Mathematics 2025, 13(15), 2476; https://doi.org/10.3390/math13152476 - 1 Aug 2025
Viewed by 319
Abstract
In 2071, the Hydraulic community will commemorate the second centenary of the Baré de Saint-Venant equations, also known as the Shallow Water Equations (SWE). These equations are fundamental to the study of open-channel flow. As non-linear partial differential equations, their solutions were largely [...] Read more.
In 2071, the Hydraulic community will commemorate the second centenary of the Baré de Saint-Venant equations, also known as the Shallow Water Equations (SWE). These equations are fundamental to the study of open-channel flow. As non-linear partial differential equations, their solutions were largely unattainable until the development of computers and numerical methods. Following 1960, various numerical schemes emerged, with Preissmann’s scheme becoming the most widely employed in many software applications. In the 1990s, some researchers identified a significant limitation in existing software and codes: the inability to simulate transcritical flow. At that time, Preissmann’s scheme was the dominant method employed in hydraulics tools, leading the research community to conclude that this scheme could not handle transcritical flow due to suspected instability. In response to this concern, several researchers suggested modifications to Preissmann’s scheme to enable the simulation of transcritical flow. This paper will demonstrate that these accusations against the Preissmann scheme are unfounded and that the proposed improvements are unnecessary. The observed instability is not due to the numerical method itself, but rather a mathematical instability inherent to the SWE, which can lead to ill-posed conditions if a specific derived condition is not met. In the context of a friction slope formula based on Manning or Chézy types, the condition for ill-posedness of the 1D shallow water equations simplifies to the Vedernikov number condition, which is necessary for roll waves to develop in uniform flow. This derived condition is also relevant for the formation of roll waves in unsteady flow when the 1D shallow water equations become ill-posed. Full article
(This article belongs to the Special Issue Computational Fluid Dynamics, 3rd Edition)
Show Figures

Figure 1

Back to TopTop