Pub Date : 2025-12-26DOI: 10.1016/j.cam.2025.117308
Julian Litz , Philippe Leleux , Carola Kruse , Joscha Gedicke , Martin J. Kühn
Tokamak fusion reactors are actively studied as a means of realizing energy production from plasma fusion. However, due to the substantial cost and time required to construct fusion reactors and run physical experiments, numerical experiments are indispensable for understanding plasma physics inside tokamaks, supporting the design and engineering phase, and optimizing future reactor designs. Geometric multigrid methods are optimal solvers for many problems that arise from the discretization of partial differential equations. It has been shown that the multigrid solver GMGPolar solves the 2D gyrokinetic Poisson equation in linear complexity and with only small memory requirements compared to other state-of-the-art solvers. In this paper, we present a completely refactored and object-oriented version of GMGPolar which offers two different matrix-free implementations. Among other things, we leverage the Sherman-Morrison formula to solve cyclic tridiagonal systems from circular line solvers without additional fill-in and we apply reordering to optimize cache access of circular and radial smoothing operations. With the Give approach, memory requirements are further reduced and speedups of four to seven are obtained for usual test cases. For the Take approach, speedups of 16 to 18 can be attained. In an additionally experimental setup of using GMGPolar as a preconditioner for conjugate gradients, this speedup could even be increased to factors between 25 and 37.
{"title":"Memory - and compute-optimized geometric multigrid GMGPolar for curvilinear coordinate representations – Applications to fusion plasma","authors":"Julian Litz , Philippe Leleux , Carola Kruse , Joscha Gedicke , Martin J. Kühn","doi":"10.1016/j.cam.2025.117308","DOIUrl":"10.1016/j.cam.2025.117308","url":null,"abstract":"<div><div>Tokamak fusion reactors are actively studied as a means of realizing energy production from plasma fusion. However, due to the substantial cost and time required to construct fusion reactors and run physical experiments, numerical experiments are indispensable for understanding plasma physics inside tokamaks, supporting the design and engineering phase, and optimizing future reactor designs. Geometric multigrid methods are optimal solvers for many problems that arise from the discretization of partial differential equations. It has been shown that the multigrid solver GMGPolar solves the 2D gyrokinetic Poisson equation in linear complexity and with only small memory requirements compared to other state-of-the-art solvers. In this paper, we present a completely refactored and object-oriented version of GMGPolar which offers two different matrix-free implementations. Among other things, we leverage the Sherman-Morrison formula to solve cyclic tridiagonal systems from circular line solvers without additional fill-in and we apply reordering to optimize cache access of circular and radial smoothing operations. With the <em>Give</em> approach, memory requirements are further reduced and speedups of four to seven are obtained for usual test cases. For the <em>Take</em> approach, speedups of 16 to 18 can be attained. In an additionally experimental setup of using GMGPolar as a preconditioner for conjugate gradients, this speedup could even be increased to factors between 25 and 37.</div></div>","PeriodicalId":50226,"journal":{"name":"Journal of Computational and Applied Mathematics","volume":"481 ","pages":"Article 117308"},"PeriodicalIF":2.6,"publicationDate":"2025-12-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145885869","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2025-12-26DOI: 10.1016/j.cam.2025.117272
Marcus J. Grote , Omar Lakkis , Carina S. Santos
Starting from a recent a posteriori error estimator for the finite element solution of the wave equation with explicit time-stepping [Grote, Lakkis, Santos, 2024], we devise a space-time adaptive strategy which includes both time evolving meshes and local time-stepping [Diaz, Grote, 2009] to overcome any overly stringent CFL stability restriction on the time-step due to local mesh refinement. Moreover, at each time-step the adaptive algorithm monitors the accuracy thanks to the error indicators and recomputes the current step on a refined mesh until the desired tolerance is met; meanwhile, the mesh is coarsened in regions of smaller errors. Leapfrog based local time-stepping is applied in all regions of local mesh refinement to incorporate adaptivity into fully explicit time integration with mesh change while retaining efficiency. Numerical results illustrate the optimal rate of convergence of the a posteriori error estimators on time evolving meshes.
{"title":"Adaptive FEM with explicit time integration for the wave equation","authors":"Marcus J. Grote , Omar Lakkis , Carina S. Santos","doi":"10.1016/j.cam.2025.117272","DOIUrl":"10.1016/j.cam.2025.117272","url":null,"abstract":"<div><div>Starting from a recent a posteriori error estimator for the finite element solution of the wave equation with explicit time-stepping [Grote, Lakkis, Santos, 2024], we devise a space-time adaptive strategy which includes both time evolving meshes and local time-stepping [Diaz, Grote, 2009] to overcome any overly stringent CFL stability restriction on the time-step due to local mesh refinement. Moreover, at each time-step the adaptive algorithm monitors the accuracy thanks to the error indicators and recomputes the current step on a refined mesh until the desired tolerance is met; meanwhile, the mesh is coarsened in regions of smaller errors. Leapfrog based local time-stepping is applied in all regions of local mesh refinement to incorporate adaptivity into fully explicit time integration with mesh change while retaining efficiency. Numerical results illustrate the optimal rate of convergence of the a posteriori error estimators on time evolving meshes.</div></div>","PeriodicalId":50226,"journal":{"name":"Journal of Computational and Applied Mathematics","volume":"481 ","pages":"Article 117272"},"PeriodicalIF":2.6,"publicationDate":"2025-12-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145886360","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2025-12-25DOI: 10.1016/j.cam.2025.117318
Igor Orynyak, Yurii Kuznetsov, Danylo Tavrov
Corotational beam splines (CBS) further develop the ideas of beam splines theories that flourished towards the end of the 20th century. CBS adopt the idea of Fowler and Wilson, whereby the conventional explicit or parametric representation of the dependence between spline coordinates is replaced with an implicit formulation through the introduction of local coordinate systems associated with the segments between consecutive control points. In the context of the problem of interpolation, our principal refinement of the Fowler-Wilson scheme is the insertion of dummy points between the real ones, thereby ensuring that the angles between the local coordinate systems are small enough. This enables us to employ the usual structural mechanics hypothesis that the sine of a small angle is approximately equal to its tangent and to the angle itself. Constructed in this manner, the CBS consists of the segments of clothoid placed between the real points. The clothoid is widely regarded as a curve both aesthetic appeal and a broad practical utility. However, the construction of clothoidal splines in practice requires specific numerical methods, whereas our CBS framework offers an easy and efficient alternative. We study whether the CBS can replace the clothoid in its traditional applications, focusing on the task of constructing clothoidal splines between two points with prescribed tangents and curvatures. A further major contribution of the paper is the generalization of all beam spline techniques, including CBS, by allowing for an additional third boundary condition, achieved at the cost of relaxing third-derivative continuity at certain dummy points.
{"title":"Efficient construction of clothoidal splines using corotational beam splines","authors":"Igor Orynyak, Yurii Kuznetsov, Danylo Tavrov","doi":"10.1016/j.cam.2025.117318","DOIUrl":"10.1016/j.cam.2025.117318","url":null,"abstract":"<div><div>Corotational beam splines (CBS) further develop the ideas of beam splines theories that flourished towards the end of the 20th century. CBS adopt the idea of Fowler and Wilson, whereby the conventional explicit or parametric representation of the dependence between spline coordinates is replaced with an implicit formulation through the introduction of local coordinate systems associated with the segments between consecutive control points. In the context of the problem of interpolation, our principal refinement of the Fowler-Wilson scheme is the insertion of dummy points between the real ones, thereby ensuring that the angles between the local coordinate systems are small enough. This enables us to employ the usual structural mechanics hypothesis that the sine of a small angle is approximately equal to its tangent and to the angle itself. Constructed in this manner, the CBS consists of the segments of clothoid placed between the real points. The clothoid is widely regarded as a curve both aesthetic appeal and a broad practical utility. However, the construction of clothoidal splines in practice requires specific numerical methods, whereas our CBS framework offers an easy and efficient alternative. We study whether the CBS can replace the clothoid in its traditional applications, focusing on the task of constructing clothoidal splines between two points with prescribed tangents and curvatures. A further major contribution of the paper is the generalization of all beam spline techniques, including CBS, by allowing for an additional third boundary condition, achieved at the cost of relaxing third-derivative continuity at certain dummy points.</div></div>","PeriodicalId":50226,"journal":{"name":"Journal of Computational and Applied Mathematics","volume":"481 ","pages":"Article 117318"},"PeriodicalIF":2.6,"publicationDate":"2025-12-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145885864","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2025-12-25DOI: 10.1016/j.cam.2025.117323
Deepak Kumar
The investigation of magnetohydrodynamic (MHD) boundary layer flow over a stretching sheet is of significant interest due to its wide-ranging applications in engineering and industrial processes. This study presents a comparative analysis of two efficient semi-analytical approaches-the Shehu Transform and the Elzaki Transform-each integrated with the Homotopy Perturbation Method (HPM) to solve the governing nonlinear flow equations. The proposed hybrid schemes, Shehu–HPM and Elzaki–HPM, exhibit remarkable computational efficiency, simplicity of implementation, and accuracy in generating rapidly convergent series solutions without discretization or linearization errors. The consistency of both techniques is validated through dual-solution pathways, demonstrating excellent agreement and underscoring the necessity of parallel analytical verification in nonlinear flow computations. Graphical interpretations reveal that the dimensionless stream function increases with an enhancement in the magnetic parameter (ranging from 0.1 to 900) for fixed stretching parameter and initial condition . Furthermore, the solution maintains stability at smaller time scales before transitioning to a growth regime at larger time values. Overall, the findings affirm the robustness, reliability, and complementary nature of the Shehu–HPM and Elzaki–HPM formulations in modeling complex MHD flow phenomena.
{"title":"A comparative study of two semi-analytical techniques for MHD viscous flow over a stretching sheet: Fusion of integral transform and homotopy perturbation method","authors":"Deepak Kumar","doi":"10.1016/j.cam.2025.117323","DOIUrl":"10.1016/j.cam.2025.117323","url":null,"abstract":"<div><div>The investigation of magnetohydrodynamic (MHD) boundary layer flow over a stretching sheet is of significant interest due to its wide-ranging applications in engineering and industrial processes. This study presents a comparative analysis of two efficient semi-analytical approaches-the Shehu Transform and the Elzaki Transform-each integrated with the Homotopy Perturbation Method (HPM) to solve the governing nonlinear flow equations. The proposed hybrid schemes, Shehu–HPM and Elzaki–HPM, exhibit remarkable computational efficiency, simplicity of implementation, and accuracy in generating rapidly convergent series solutions without discretization or linearization errors. The consistency of both techniques is validated through dual-solution pathways, demonstrating excellent agreement and underscoring the necessity of parallel analytical verification in nonlinear flow computations. Graphical interpretations reveal that the dimensionless stream function <span><math><mi>f</mi></math></span> increases with an enhancement in the magnetic parameter <span><math><mrow><mi>M</mi><mspace></mspace></mrow></math></span> (ranging from 0.1 to 900) for fixed stretching parameter <span><math><mi>β</mi></math></span> and initial condition <span><math><mi>α</mi></math></span>. Furthermore, the solution maintains stability at smaller time scales before transitioning to a growth regime at larger time values. Overall, the findings affirm the robustness, reliability, and complementary nature of the Shehu–HPM and Elzaki–HPM formulations in modeling complex MHD flow phenomena.</div></div>","PeriodicalId":50226,"journal":{"name":"Journal of Computational and Applied Mathematics","volume":"481 ","pages":"Article 117323"},"PeriodicalIF":2.6,"publicationDate":"2025-12-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145886358","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2025-12-25DOI: 10.1016/j.cam.2025.117284
Wanwan Zhu , Guanghua Ji
Our research focused on the adaptive weak Galerkin finite element method to solve the time-dependent Poisson-Nernst-Planck (PNP) equations. Through the utilization of the Helmholtz decomposition and elliptic reconstruction operator, a comprehensive analysis of a posteriori error estimates was conducted. Both the upper and lower bound error estimators for the electrostatic potential and ion concentrations were formulated, taking into account both spatial and temporal residuals. A time-step adaptation strategy was developed to adjust the time step, followed by the development of a temporal and spatial adaptive algorithm for solving the time-dependent PNP equations using the constructed a posteriori error estimators. The validity of our methodology was confirmed through numerical simulations.
{"title":"A posteriori error estimates of the weak Galerkin finite element method for time-dependent Poisson-Nernst-Planck equations","authors":"Wanwan Zhu , Guanghua Ji","doi":"10.1016/j.cam.2025.117284","DOIUrl":"10.1016/j.cam.2025.117284","url":null,"abstract":"<div><div>Our research focused on the adaptive weak Galerkin finite element method to solve the time-dependent Poisson-Nernst-Planck (PNP) equations. Through the utilization of the Helmholtz decomposition and elliptic reconstruction operator, a comprehensive analysis of a posteriori error estimates was conducted. Both the upper and lower bound error estimators for the electrostatic potential and ion concentrations were formulated, taking into account both spatial and temporal residuals. A time-step adaptation strategy was developed to adjust the time step, followed by the development of a temporal and spatial adaptive algorithm for solving the time-dependent PNP equations using the constructed a posteriori error estimators. The validity of our methodology was confirmed through numerical simulations.</div></div>","PeriodicalId":50226,"journal":{"name":"Journal of Computational and Applied Mathematics","volume":"482 ","pages":"Article 117284"},"PeriodicalIF":2.6,"publicationDate":"2025-12-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145886046","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
A fuzzy set lacks to determine the hesitancy of an element in terms of belongingness to a set, the same problem arises in forecasting time series data by the fuzzy set when there is the availability of multiple fuzzification methods to fuzzify the time series data to remove hesitancy in the system. In the present study, the HFS has been applied in time series forecasting and a HFTSF method is proposed by introducing essential concepts of weighted hesitant fuzzy Cartesian product, HFR, HFLRs, HFLGs and hesitant fuzzy defuzzification method. The basic steps followed in the mechanism of the proposed method are the construction of HFS by a partition of the UOD into intervals of equal and unequal length, distribution of weights based on the length of the interval, fuzzification of the data by using triangular membership function for equal and unequal intervals, construction of HFLRs and HFLGs, relation matrix obtained by weighted hesitant fuzzy Cartesian product, computation of hesitant fuzzy row vectors by max-min composition operation and finally hesitant defuzzification of the data. The proposed method is implemented over the enrollment data of the University of Alabama and the share price of SBI at Bombay stock exchange, India. Performance test, validity test, and statistical test are also examined on the forecasted value by the proposed method and well-known existing methods to examine the superiority of the proposed method. This article presents a novel prediction model that authentically captures methodological hesitancy which were absent in prior HFS based forecasting models due to reliant on aggregation operator that transform HFS into conventional fuzzy set. By directly formulating HFLRs through a weighted Cartesian product, our framework eliminates information loss. The model delivers a triple advantage: it maintain complete information integrity, guaranteeing interpretablity through a transparent calculus, and demonstrating superior accuracy and robustness against existing benchmarks in hesitant environment.
{"title":"Hesitant fuzzy time series forecasting: A novel approach to handle the hesitancy in the system","authors":"Kamlesh Bisht , Sanjay Kumar , Manish Pant , Seema Negi","doi":"10.1016/j.cam.2025.117322","DOIUrl":"10.1016/j.cam.2025.117322","url":null,"abstract":"<div><div>A fuzzy set lacks to determine the hesitancy of an element in terms of belongingness to a set, the same problem arises in forecasting time series data by the fuzzy set when there is the availability of multiple fuzzification methods to fuzzify the time series data to remove hesitancy in the system. In the present study, the HFS has been applied in time series forecasting and a HFTSF method is proposed by introducing essential concepts of weighted hesitant fuzzy Cartesian product, HFR, HFLRs, HFLGs and hesitant fuzzy defuzzification method. The basic steps followed in the mechanism of the proposed method are the construction of HFS by a partition of the UOD into intervals of equal and unequal length, distribution of weights based on the length of the interval, fuzzification of the data by using triangular membership function for equal and unequal intervals, construction of HFLRs and HFLGs, relation matrix obtained by weighted hesitant fuzzy Cartesian product, computation of hesitant fuzzy row vectors by max-min composition operation and finally hesitant defuzzification of the data. The proposed method is implemented over the enrollment data of the University of Alabama and the share price of SBI at Bombay stock exchange, India. Performance test, validity test, and statistical test are also examined on the forecasted value by the proposed method and well-known existing methods to examine the superiority of the proposed method. This article presents a novel prediction model that authentically captures methodological hesitancy which were absent in prior HFS based forecasting models due to reliant on aggregation operator that transform HFS into conventional fuzzy set. By directly formulating HFLRs through a weighted Cartesian product, our framework eliminates information loss. The model delivers a triple advantage: it maintain complete information integrity, guaranteeing interpretablity through a transparent calculus, and demonstrating superior accuracy and robustness against existing benchmarks in hesitant environment.</div></div>","PeriodicalId":50226,"journal":{"name":"Journal of Computational and Applied Mathematics","volume":"482 ","pages":"Article 117322"},"PeriodicalIF":2.6,"publicationDate":"2025-12-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145928203","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2025-12-25DOI: 10.1016/j.cam.2025.117279
Chunmei Wang , Shangyou Zhang
This paper introduces an efficient stabilizer-free weak Galerkin (WG) finite element method for solving the three-dimensional quad-curl problem. Leveraging bubble functions as a key analytical tool, the method extends the applicability of stabilizer-free WG approaches to non-convex elements in finite element partitions-a notable advancement over existing methods, which are restricted to convex elements. The proposed method maintains a simple, symmetric, and positive definite formulation. It achieves optimal error estimates for the exact solution in a discrete norm, as well as an optimal-order L2 error estimate for k > 2 and a sub-optimal order for the lowest order case . Numerical experiments are presented to validate the method’s efficiency and accuracy.
{"title":"Stabilizer-free weak galerkin methods for quad-Curl problems on polyhedral meshes without convexity assumptions","authors":"Chunmei Wang , Shangyou Zhang","doi":"10.1016/j.cam.2025.117279","DOIUrl":"10.1016/j.cam.2025.117279","url":null,"abstract":"<div><div>This paper introduces an efficient stabilizer-free weak Galerkin (WG) finite element method for solving the three-dimensional quad-curl problem. Leveraging bubble functions as a key analytical tool, the method extends the applicability of stabilizer-free WG approaches to non-convex elements in finite element partitions-a notable advancement over existing methods, which are restricted to convex elements. The proposed method maintains a simple, symmetric, and positive definite formulation. It achieves optimal error estimates for the exact solution in a discrete norm, as well as an optimal-order <em>L</em><sup>2</sup> error estimate for <em>k</em> > 2 and a sub-optimal order for the lowest order case <span><math><mrow><mi>k</mi><mo>=</mo><mn>2</mn></mrow></math></span>. Numerical experiments are presented to validate the method’s efficiency and accuracy.</div></div>","PeriodicalId":50226,"journal":{"name":"Journal of Computational and Applied Mathematics","volume":"481 ","pages":"Article 117279"},"PeriodicalIF":2.6,"publicationDate":"2025-12-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145885874","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2025-12-24DOI: 10.1016/j.cam.2025.117309
S. Cacace , R. Ferretti , G. Tatafiore
We consider a scheme of Semi-Lagrangian (SL) type for the numerical solution of Hamilton–Jacobi (HJ) equations on unstructured triangular grids. As it is well known, SL schemes are not well suited for unstructured grids, due to the cost of the point location phase; this drawback is augmented by the need for repeated minimization. In this work, we consider an existing, monotone version of the scheme, that works only on the basis of node values, and adapt the algorithm to the case of an unstructured grid, using the connectivity information. Then, applying a quadratic refinement to the numerical solution, we improve accuracy at the price of some extra computational cost. The scheme can be applied to both time-dependent and stationary HJ equations; in the latter case, we also study the construction of a fast policy iteration solver and of a parallel version. We perform a theoretical analysis of the two versions, and validate them with an extensive set of examples, both in the time-dependent and in the stationary case.
{"title":"Numerical Hopf–Lax formulae for Hamilton–Jacobi equations on unstructured geometries","authors":"S. Cacace , R. Ferretti , G. Tatafiore","doi":"10.1016/j.cam.2025.117309","DOIUrl":"10.1016/j.cam.2025.117309","url":null,"abstract":"<div><div>We consider a scheme of Semi-Lagrangian (SL) type for the numerical solution of Hamilton–Jacobi (HJ) equations on unstructured triangular grids. As it is well known, SL schemes are not well suited for unstructured grids, due to the cost of the point location phase; this drawback is augmented by the need for repeated minimization. In this work, we consider an existing, monotone version of the scheme, that works only on the basis of node values, and adapt the algorithm to the case of an unstructured grid, using the connectivity information. Then, applying a quadratic refinement to the numerical solution, we improve accuracy at the price of some extra computational cost. The scheme can be applied to both time-dependent and stationary HJ equations; in the latter case, we also study the construction of a fast policy iteration solver and of a parallel version. We perform a theoretical analysis of the two versions, and validate them with an extensive set of examples, both in the time-dependent and in the stationary case.</div></div>","PeriodicalId":50226,"journal":{"name":"Journal of Computational and Applied Mathematics","volume":"481 ","pages":"Article 117309"},"PeriodicalIF":2.6,"publicationDate":"2025-12-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145886357","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
In this paper, we investigate a steady system used for modelling propagation of reaction fronts in viscous fluids subject to a generalized Arrhenius law. The model consists of the incompressible Navier-Stokes equations for the fluid flow and a set of advection-diffusion equations for the temperature and degree of conversion. The resulting system is strongly coupled and presents many additional nonlinearities as the physical parameters such as the viscosity, diffusion and source terms are assumed to depend on the temperature and/or degree of conversion. Using a fixed-point method we prove the existence and uniqueness of the weak solution for the considered problem. To solve the associated fixed-point problem we consider an iterative scheme and its convergence is also studied in the present study. Here, the proposed scheme uncouples the computation of velocity, temperature and degree of conversion using the fixed-point iteration and we theoretically establish its convergence towards the unique solution of the considered model. Numerical results obtained for two test examples are presented to verify the theoretical analysis and to assess the performance of the proposed algorithm. The obtained computational results for both examples support the theoretical expectations for a good numerical convergence with the developed estimates.
{"title":"Well -posedness of coupled Navier-Stokes and advection-diffusion equations for propagation of reaction fronts in viscous fluids","authors":"Mofdi El-Amrani , Anouar Obbadi , Mohammed Seaid , Driss Yakoubi","doi":"10.1016/j.cam.2025.117277","DOIUrl":"10.1016/j.cam.2025.117277","url":null,"abstract":"<div><div>In this paper, we investigate a steady system used for modelling propagation of reaction fronts in viscous fluids subject to a generalized Arrhenius law. The model consists of the incompressible Navier-Stokes equations for the fluid flow and a set of advection-diffusion equations for the temperature and degree of conversion. The resulting system is strongly coupled and presents many additional nonlinearities as the physical parameters such as the viscosity, diffusion and source terms are assumed to depend on the temperature and/or degree of conversion. Using a fixed-point method we prove the existence and uniqueness of the weak solution for the considered problem. To solve the associated fixed-point problem we consider an iterative scheme and its convergence is also studied in the present study. Here, the proposed scheme uncouples the computation of velocity, temperature and degree of conversion using the fixed-point iteration and we theoretically establish its convergence towards the unique solution of the considered model. Numerical results obtained for two test examples are presented to verify the theoretical analysis and to assess the performance of the proposed algorithm. The obtained computational results for both examples support the theoretical expectations for a good numerical convergence with the developed estimates.</div></div>","PeriodicalId":50226,"journal":{"name":"Journal of Computational and Applied Mathematics","volume":"481 ","pages":"Article 117277"},"PeriodicalIF":2.6,"publicationDate":"2025-12-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145885862","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2025-12-24DOI: 10.1016/j.cam.2025.117295
Hasanen A. Hammad , Manal Elzain Mohamed Abdalla
The existence of solutions for non-autonomous integrodifferential evolution equations with nonlocal conditions is investigated in this article. Initially, existence results for mild solutions of the proposed equation are established through the leveraging of the theory of resolvent operators, fixed point theorems, and an estimation technique grounded in the measure of noncompactness. Finally, the applicability of the findings is illustrated by means of an example concerning a class of non-autonomous nonlocal partial integrodifferential equations.
{"title":"Applying fixed point approaches for solving non-autonomous integrodifferential evolution equations under mild conditions","authors":"Hasanen A. Hammad , Manal Elzain Mohamed Abdalla","doi":"10.1016/j.cam.2025.117295","DOIUrl":"10.1016/j.cam.2025.117295","url":null,"abstract":"<div><div>The existence of solutions for non-autonomous integrodifferential evolution equations with nonlocal conditions is investigated in this article. Initially, existence results for mild solutions of the proposed equation are established through the leveraging of the theory of resolvent operators, fixed point theorems, and an estimation technique grounded in the measure of noncompactness. Finally, the applicability of the findings is illustrated by means of an example concerning a class of non-autonomous nonlocal partial integrodifferential equations.</div></div>","PeriodicalId":50226,"journal":{"name":"Journal of Computational and Applied Mathematics","volume":"481 ","pages":"Article 117295"},"PeriodicalIF":2.6,"publicationDate":"2025-12-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145885865","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}