Pub Date : 2024-07-04DOI: 10.1016/j.apnum.2024.06.022
Paulo B. Vasconcelos , Laurence Grammont , Nilson J. Lima
Tau Toolbox is a mathematical library for the solution of integro-differential problems, based on the spectral Lanczos' Tau method. Over the past few years, a class within the library, called polynomial, has been developed for approximating functions by classical orthogonal polynomials and it is intended to be an easy-to-use yet efficient object-oriented framework.
In this work we discuss how this class has been designed to solve linear ill-posed problems and we provide a description of the available methods, Tikhonov regularization and truncated singular value expansion. For the solution of the Fredholm integral equation of the first kind, which is built from a low-rank approximation of the kernel followed by a numerical truncated singular value expansion, an error estimate is given.
Numerical experiments illustrate that this approach is capable of efficiently compute good approximations of linear discrete ill-posed problems, even facing perturbed available data function, with no programming effort. Several test problems are used to evaluate the performance and reliability of the solvers.
The final product of this paper is the numerical solution of a first-kind integral equation, which is constructed using only two inputs from the user: the kernel and the right-hand side.
Tau Toolbox 是一个基于 Lanczos'Tau 光谱法的数学库,用于求解积分微分问题。在过去几年中,该库中开发了一个名为 "多项式 "的类,用于用经典正交多项式逼近函数,该类旨在成为一个易于使用且高效的面向对象框架。对于第一类弗雷德霍姆积分方程的求解,我们给出了误差估计值,该误差估计值是由核的低阶近似值和数值截断奇异值展开建立的。本文的最终成果是对一元积分方程的数值求解,用户只需输入内核和右边两个参数即可构建该方程。
{"title":"Low rank approximation in the computation of first kind integral equations with TauToolbox","authors":"Paulo B. Vasconcelos , Laurence Grammont , Nilson J. Lima","doi":"10.1016/j.apnum.2024.06.022","DOIUrl":"https://doi.org/10.1016/j.apnum.2024.06.022","url":null,"abstract":"<div><p><span>Tau Toolbox</span> is a mathematical library for the solution of integro-differential problems, based on the spectral Lanczos' Tau method. Over the past few years, a class within the library, called <span>polynomial</span>, has been developed for approximating functions by classical orthogonal polynomials and it is intended to be an easy-to-use yet efficient object-oriented framework.</p><p>In this work we discuss how this class has been designed to solve linear ill-posed problems and we provide a description of the available methods, Tikhonov regularization and truncated singular value expansion. For the solution of the Fredholm integral equation of the first kind, which is built from a low-rank approximation of the kernel followed by a numerical truncated singular value expansion, an error estimate is given.</p><p>Numerical experiments illustrate that this approach is capable of efficiently compute good approximations of linear discrete ill-posed problems, even facing perturbed available data function, with no programming effort. Several test problems are used to evaluate the performance and reliability of the solvers.</p><p>The final product of this paper is the numerical solution of a first-kind integral equation, which is constructed using only two inputs from the user: the kernel and the right-hand side.</p></div>","PeriodicalId":8199,"journal":{"name":"Applied Numerical Mathematics","volume":"205 ","pages":"Pages 1-15"},"PeriodicalIF":2.2,"publicationDate":"2024-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S0168927424001703/pdfft?md5=49b2fb7a69e48f47a313e9bf4b9ddaa9&pid=1-s2.0-S0168927424001703-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141593237","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-06-27DOI: 10.1016/j.apnum.2024.06.021
Shiqin Liu , Haijun Yu
We propose two efficient energetic spectral-element methods in time for marching nonlinear gradient systems with the phase-field Allen–Cahn equation as an example: one fully implicit nonlinear method and one semi-implicit linear method. Different from other spectral methods in time using spectral Petrov-Galerkin or weighted Galerkin approximations, the presented implicit method employs an energetic variational Galerkin form that can maintain the mass conservation and energy dissipation property of the continuous dynamical system. Another advantage of this method is its superconvergence. A high-order extrapolation is adopted for the nonlinear term to get the semi-implicit method. The semi-implicit method does not have superconvergence, but can be improved by a few Picard-like iterations to recover the superconvergence of the implicit method. Numerical experiments verify that the method using Legendre elements of degree three outperforms the 4th-order implicit-explicit backward differentiation formula and the 4th-order exponential time difference Runge-Kutta method, which were known to have best performances in solving phase-field equations. In addition to the standard Allen–Cahn equation, we also apply the method to a conservative Allen–Cahn equation, in which the conservation of discrete total mass is verified. The applications of the proposed methods are not limited to phase-field Allen–Cahn equations. They are suitable for solving general, large-scale nonlinear dynamical systems.
{"title":"Energetic spectral-element time marching methods for phase-field nonlinear gradient systems","authors":"Shiqin Liu , Haijun Yu","doi":"10.1016/j.apnum.2024.06.021","DOIUrl":"https://doi.org/10.1016/j.apnum.2024.06.021","url":null,"abstract":"<div><p>We propose two efficient energetic spectral-element methods in time for marching nonlinear gradient systems with the phase-field Allen–Cahn equation as an example: one fully implicit nonlinear method and one semi-implicit linear method. Different from other spectral methods in time using spectral Petrov-Galerkin or weighted Galerkin approximations, the presented implicit method employs an energetic variational Galerkin form that can maintain the mass conservation and energy dissipation property of the continuous dynamical system. Another advantage of this method is its superconvergence. A high-order extrapolation is adopted for the nonlinear term to get the semi-implicit method. The semi-implicit method does not have superconvergence, but can be improved by a few Picard-like iterations to recover the superconvergence of the implicit method. Numerical experiments verify that the method using Legendre elements of degree three outperforms the 4th-order implicit-explicit backward differentiation formula and the 4th-order exponential time difference Runge-Kutta method, which were known to have best performances in solving phase-field equations. In addition to the standard Allen–Cahn equation, we also apply the method to a conservative Allen–Cahn equation, in which the conservation of discrete total mass is verified. The applications of the proposed methods are not limited to phase-field Allen–Cahn equations. They are suitable for solving general, large-scale nonlinear dynamical systems.</p></div>","PeriodicalId":8199,"journal":{"name":"Applied Numerical Mathematics","volume":"205 ","pages":"Pages 38-59"},"PeriodicalIF":2.2,"publicationDate":"2024-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141606786","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 : 2024-06-26DOI: 10.1016/j.apnum.2024.06.020
Zibo Chen , Hu Shao , Pengjie Liu , Guoxin Li , Xianglin Rong
In this study, we introduce a novel hybrid conjugate gradient method with an adaptive strategy called asHCG method. The asHCG method exhibits the following characteristics. (i) Its search direction guarantees sufficient descent property without dependence on any line search. (ii) It possesses strong convergence for the uniformly convex function using a weak Wolfe line search, and under the same line search, it achieves global convergence for the general function. (iii) Employing the Armijo line search, it provides an approximate guarantee for worst-case complexity for the uniformly convex function. The numerical results demonstrate promising and encouraging performances in both unconstrained optimization problems and image restoration problems.
{"title":"An efficient hybrid conjugate gradient method with an adaptive strategy and applications in image restoration problems","authors":"Zibo Chen , Hu Shao , Pengjie Liu , Guoxin Li , Xianglin Rong","doi":"10.1016/j.apnum.2024.06.020","DOIUrl":"https://doi.org/10.1016/j.apnum.2024.06.020","url":null,"abstract":"<div><p>In this study, we introduce a novel hybrid conjugate gradient method with an adaptive strategy called asHCG method. The asHCG method exhibits the following characteristics. (i) Its search direction guarantees sufficient descent property without dependence on any line search. (ii) It possesses strong convergence for the uniformly convex function using a weak Wolfe line search, and under the same line search, it achieves global convergence for the general function. (iii) Employing the Armijo line search, it provides an approximate guarantee for worst-case complexity for the uniformly convex function. The numerical results demonstrate promising and encouraging performances in both unconstrained optimization problems and image restoration problems.</p></div>","PeriodicalId":8199,"journal":{"name":"Applied Numerical Mathematics","volume":"204 ","pages":"Pages 362-379"},"PeriodicalIF":2.2,"publicationDate":"2024-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141542140","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 : 2024-06-26DOI: 10.1016/j.apnum.2024.06.019
Anurag Kaur , V. Kanwar , Higinio Ramos
Investigation of the solutions of the coupled viscous Burgers system is crucial for realizing and understanding some physical phenomena in applied sciences. Particularly, Burgers equations are used in the modeling of fluid mechanics and nonlinear acoustics. In the present study, a modified meshless quadrature method based on radial basis functions is used to discretize the partial derivatives in the spatial variable. A technique to find the best value of the shape parameter is introduced. A high-resolution optimized hybrid block method is then used to solve the problem in the temporal variable. To validate the proposed method, several test problems are considered and the simulated results are compared with exact solutions and previous works. Moreover, a sensitivity analysis for parameter c is conducted, and the unconditional stability of the proposed algorithm has been validated.
研究耦合粘性布尔格斯系统的解对于实现和理解应用科学中的某些物理现象至关重要。特别是在流体力学和非线性声学建模中,布尔格斯方程被广泛应用。本研究采用基于径向基函数的修正无网格正交法来离散空间变量中的偏导数。研究还引入了一种寻找形状参数最佳值的技术。然后使用高分辨率优化混合分块法解决时间变量中的问题。为了验证所提出的方法,我们考虑了几个测试问题,并将模拟结果与精确解法和以前的工作进行了比较。此外,还对参数 c 进行了敏感性分析,并验证了所提算法的无条件稳定性。
{"title":"An optimized algorithm for numerical solution of coupled Burgers equations","authors":"Anurag Kaur , V. Kanwar , Higinio Ramos","doi":"10.1016/j.apnum.2024.06.019","DOIUrl":"https://doi.org/10.1016/j.apnum.2024.06.019","url":null,"abstract":"<div><p>Investigation of the solutions of the coupled viscous Burgers system is crucial for realizing and understanding some physical phenomena in applied sciences. Particularly, Burgers equations are used in the modeling of fluid mechanics and nonlinear acoustics. In the present study, a modified meshless quadrature method based on radial basis functions is used to discretize the partial derivatives in the spatial variable. A technique to find the best value of the shape parameter is introduced. A high-resolution optimized hybrid block method is then used to solve the problem in the temporal variable. To validate the proposed method, several test problems are considered and the simulated results are compared with exact solutions and previous works. Moreover, a sensitivity analysis for parameter <em>c</em> is conducted, and the unconditional stability of the proposed algorithm has been validated.</p></div>","PeriodicalId":8199,"journal":{"name":"Applied Numerical Mathematics","volume":"204 ","pages":"Pages 352-361"},"PeriodicalIF":2.2,"publicationDate":"2024-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141542142","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, the stability of θ-methods for delay differential equations is studied based on the test equation , where τ is a constant delay and A is a positive definite matrix. It is mainly considered the case where the matrices A and B are not simultaneosly diagonalizable and the concept of field of values is used to prove a sufficient condition for unconditional stability of these methods and another condition which also guarantees their stability, but according to the step size. The results obtained are also simplified for the case where the matrices A and B are simultaneously diagonalizable and compared with other similar works for the general case. Several numerical examples in which the theory discussed here is applied to parabolic problems given by partial delay differential equations with a diffusion term and a delayed term are presented, too.
本文基于检验方程 y′(t)=-Ay(t)+By(t-τ)(其中 τ 为常数延迟,A 为正定矩阵)研究了延迟微分方程的 θ 方法的稳定性。主要考虑矩阵 A 和 B 不能同时对角化的情况,并利用值域概念证明了这些方法无条件稳定性的充分条件和另一个也能保证其稳定性的条件,但取决于步长。对于矩阵 A 和 B 同时可对角化的情况,所获得的结果也进行了简化,并与其他针对一般情况的类似著作进行了比较。此外,还介绍了几个数值示例,这些示例将本文讨论的理论应用于带有扩散项和延迟项的偏延迟微分方程给出的抛物问题。
{"title":"On the stability of θ-methods for DDEs and PDDEs","authors":"Alejandro Rodríguez-Fernández , Jesús Martín-Vaquero","doi":"10.1016/j.apnum.2024.06.018","DOIUrl":"https://doi.org/10.1016/j.apnum.2024.06.018","url":null,"abstract":"<div><p>In this paper, the stability of <em>θ</em>-methods for delay differential equations is studied based on the test equation <span><math><msup><mrow><mi>y</mi></mrow><mrow><mo>′</mo></mrow></msup><mo>(</mo><mi>t</mi><mo>)</mo><mo>=</mo><mo>−</mo><mi>A</mi><mi>y</mi><mo>(</mo><mi>t</mi><mo>)</mo><mo>+</mo><mi>B</mi><mi>y</mi><mo>(</mo><mi>t</mi><mo>−</mo><mi>τ</mi><mo>)</mo></math></span>, where <em>τ</em> is a constant delay and <em>A</em> is a positive definite matrix. It is mainly considered the case where the matrices <em>A</em> and <em>B</em> are not simultaneosly diagonalizable and the concept of field of values is used to prove a sufficient condition for unconditional stability of these methods and another condition which also guarantees their stability, but according to the step size. The results obtained are also simplified for the case where the matrices <em>A</em> and <em>B</em> are simultaneously diagonalizable and compared with other similar works for the general case. Several numerical examples in which the theory discussed here is applied to parabolic problems given by partial delay differential equations with a diffusion term and a delayed term are presented, too.</p></div>","PeriodicalId":8199,"journal":{"name":"Applied Numerical Mathematics","volume":"204 ","pages":"Pages 312-328"},"PeriodicalIF":2.2,"publicationDate":"2024-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141542141","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 : 2024-06-21DOI: 10.1016/j.apnum.2024.06.017
Hassan Khosravian-Arab , Mehdi Dehghan
In recent years, various types of methods have been proposed to approximate the Caputo fractional derivative numerically. A common challenge of the methods is the non-local property of the Caputo fractional derivative which leads to the slow and memory consuming methods. Diffusive representation of fractional derivative is an efficient tool to overcome the mentioned challenge. This paper presents two new diffusive representations to approximate the Caputo fractional derivative of order . An error analysis of the newly presented methods together with some numerical examples is provided at the end.
{"title":"The sine and cosine diffusive representations for the Caputo fractional derivative","authors":"Hassan Khosravian-Arab , Mehdi Dehghan","doi":"10.1016/j.apnum.2024.06.017","DOIUrl":"https://doi.org/10.1016/j.apnum.2024.06.017","url":null,"abstract":"<div><p>In recent years, various types of methods have been proposed to approximate the Caputo fractional derivative numerically. A common challenge of the methods is the non-local property of the Caputo fractional derivative which leads to the slow and memory consuming methods. Diffusive representation of fractional derivative is an efficient tool to overcome the mentioned challenge. This paper presents two new diffusive representations to approximate the Caputo fractional derivative of order <span><math><mn>0</mn><mo><</mo><mi>α</mi><mo><</mo><mn>1</mn></math></span>. An error analysis of the newly presented methods together with some numerical examples is provided at the end.</p></div>","PeriodicalId":8199,"journal":{"name":"Applied Numerical Mathematics","volume":"204 ","pages":"Pages 265-290"},"PeriodicalIF":2.2,"publicationDate":"2024-06-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141482826","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 : 2024-06-19DOI: 10.1016/j.apnum.2024.06.016
X. Liu , M. Zhang , Z.W. Yang
This paper deals with the numerical threshold stability of a nonlinear age-space structured heroin transmission model. A semi-discrete system is established by spatially domain discretization of the original nonlinear age-space structured model. A threshold value is proposed in stability analysis of the semi-discrete system and named as a numerical basic reproduction number. Besides the role it plays in numerical threshold stability analysis, the numerical basic reproduction number can preserve qualitative properties of the exact basic reproduction number and converge to the latter while stepsizes vanish. A fully discrete system is established via a time discretization of the semi-discrete system, in which an implicit-explicit technique is implemented to ensure the preservation of the biological meanings (such as positivity) without CFL restriction. Some numerical experiments are exhibited in the end to confirm the conclusions and explore the final state.
{"title":"Numerical threshold stability of a nonlinear age-structured reaction diffusion heroin transmission model","authors":"X. Liu , M. Zhang , Z.W. Yang","doi":"10.1016/j.apnum.2024.06.016","DOIUrl":"https://doi.org/10.1016/j.apnum.2024.06.016","url":null,"abstract":"<div><p>This paper deals with the numerical threshold stability of a nonlinear age-space structured heroin transmission model. A semi-discrete system is established by spatially domain discretization of the original nonlinear age-space structured model. A threshold value is proposed in stability analysis of the semi-discrete system and named as a numerical basic reproduction number. Besides the role it plays in numerical threshold stability analysis, the numerical basic reproduction number can preserve qualitative properties of the exact basic reproduction number and converge to the latter while stepsizes vanish. A fully discrete system is established via a time discretization of the semi-discrete system, in which an implicit-explicit technique is implemented to ensure the preservation of the biological meanings (such as positivity) without CFL restriction. Some numerical experiments are exhibited in the end to confirm the conclusions and explore the final state.</p></div>","PeriodicalId":8199,"journal":{"name":"Applied Numerical Mathematics","volume":"204 ","pages":"Pages 291-311"},"PeriodicalIF":2.2,"publicationDate":"2024-06-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141482827","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 : 2024-06-19DOI: 10.1016/j.apnum.2024.06.014
Saurabh Kumar , Vikas Gupta , Dia Zeidan
In this research, we propose a novel and fast computational technique for solving a class of space-time fractional-order linear and non-linear partial differential equations. Caputo-type fractional derivatives are considered. The proposed method is based on the operational and pseudo-operational matrices for the fractional-order Lagrange polynomials. To carry out the method, first, we find the integer and fractional-order operational and pseudo-operational matrix of integration. The collocation technique and obtained operational and pseudo-operational matrices are then used to generate a system of algebraic equations by reducing the given space-time fractional differential problem. The resultant algebraic system is then easily solved by Newton's iterative methods. The upper bound of the fractional-order operational matrix of integration is also provided, which confirms the convergence of fractional-order Lagrange polynomial's approximation. Finally, some numerical experiments are conducted to demonstrate the applicability and usefulness of the suggested numerical scheme.
{"title":"An efficient collocation technique based on operational matrix of fractional-order Lagrange polynomials for solving the space-time fractional-order partial differential equations","authors":"Saurabh Kumar , Vikas Gupta , Dia Zeidan","doi":"10.1016/j.apnum.2024.06.014","DOIUrl":"https://doi.org/10.1016/j.apnum.2024.06.014","url":null,"abstract":"<div><p>In this research, we propose a novel and fast computational technique for solving a class of space-time fractional-order linear and non-linear partial differential equations. Caputo-type fractional derivatives are considered. The proposed method is based on the operational and pseudo-operational matrices for the fractional-order Lagrange polynomials. To carry out the method, first, we find the integer and fractional-order operational and pseudo-operational matrix of integration. The collocation technique and obtained operational and pseudo-operational matrices are then used to generate a system of algebraic equations by reducing the given space-time fractional differential problem. The resultant algebraic system is then easily solved by Newton's iterative methods. The upper bound of the fractional-order operational matrix of integration is also provided, which confirms the convergence of fractional-order Lagrange polynomial's approximation. Finally, some numerical experiments are conducted to demonstrate the applicability and usefulness of the suggested numerical scheme.</p></div>","PeriodicalId":8199,"journal":{"name":"Applied Numerical Mathematics","volume":"204 ","pages":"Pages 249-264"},"PeriodicalIF":2.2,"publicationDate":"2024-06-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141438115","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 : 2024-06-18DOI: 10.1016/j.apnum.2024.06.011
Aleksandar V. Pejčev , Lothar Reichel , Miodrag M. Spalević , Stefan M. Spalević
<div><p>The need to evaluate Gauss quadrature rules arises in many applications in science and engineering. It often is important to be able to estimate the quadrature error when applying an <em>ℓ</em>-point Gauss rule, <span><math><msub><mrow><mi>G</mi></mrow><mrow><mi>ℓ</mi></mrow></msub><mo>(</mo><mi>f</mi><mo>)</mo></math></span>, where <em>f</em> is an integrand of interest. Such an estimate often is furnished by applying another quadrature rule, <span><math><msub><mrow><mi>Q</mi></mrow><mrow><mi>k</mi></mrow></msub><mo>(</mo><mi>f</mi><mo>)</mo></math></span>, with <span><math><mi>k</mi><mo>></mo><mi>ℓ</mi></math></span> nodes, and using the difference <span><math><msub><mrow><mi>Q</mi></mrow><mrow><mi>k</mi></mrow></msub><mo>(</mo><mi>f</mi><mo>)</mo><mo>−</mo><msub><mrow><mi>G</mi></mrow><mrow><mi>ℓ</mi></mrow></msub><mo>(</mo><mi>f</mi><mo>)</mo></math></span> or its magnitude as an estimate for the quadrature error in <span><math><msub><mrow><mi>G</mi></mrow><mrow><mi>ℓ</mi></mrow></msub><mo>(</mo><mi>f</mi><mo>)</mo></math></span> or its magnitude. The classical approach to estimate the error in <span><math><msub><mrow><mi>G</mi></mrow><mrow><mi>ℓ</mi></mrow></msub><mo>(</mo><mi>f</mi><mo>)</mo></math></span> is to let <span><math><msub><mrow><mi>Q</mi></mrow><mrow><mi>k</mi></mrow></msub><mo>(</mo><mi>f</mi><mo>)</mo></math></span>, with <span><math><mi>k</mi><mo>=</mo><mn>2</mn><mi>ℓ</mi><mo>+</mo><mn>1</mn></math></span>, be the Gauss-Kronrod quadrature rule associated with <span><math><msub><mrow><mi>G</mi></mrow><mrow><mi>ℓ</mi></mrow></msub><mo>(</mo><mi>f</mi><mo>)</mo></math></span>. However, it is well known that the Gauss-Kronrod rule associated with a Gauss rule <span><math><msub><mrow><mi>G</mi></mrow><mrow><mi>ℓ</mi></mrow></msub><mo>(</mo><mi>f</mi><mo>)</mo></math></span> might not exist for certain measures that determine the Gauss rule and for certain numbers of nodes. This prompted M. M. Spalević <span>[1]</span> to develop generalized averaged Gauss rules, <span><math><msub><mrow><mover><mrow><mi>G</mi></mrow><mrow><mo>ˆ</mo></mrow></mover></mrow><mrow><mn>2</mn><mi>ℓ</mi><mo>+</mo><mn>1</mn></mrow></msub></math></span>, with <span><math><mn>2</mn><mi>ℓ</mi><mo>+</mo><mn>1</mn></math></span> nodes for estimating the error in <span><math><msub><mrow><mi>G</mi></mrow><mrow><mi>ℓ</mi></mrow></msub><mo>(</mo><mi>f</mi><mo>)</mo></math></span>. Similarly as for <span><math><mo>(</mo><mn>2</mn><mi>ℓ</mi><mo>+</mo><mn>1</mn><mo>)</mo></math></span>-node Gauss-Kronrod rules, <em>ℓ</em> nodes of the rule <span><math><msub><mrow><mover><mrow><mi>G</mi></mrow><mrow><mo>ˆ</mo></mrow></mover></mrow><mrow><mn>2</mn><mi>ℓ</mi><mo>+</mo><mn>1</mn></mrow></msub></math></span> agree with the nodes of <span><math><msub><mrow><mi>G</mi></mrow><mrow><mi>ℓ</mi></mrow></msub></math></span>. However, generalized averaged Gauss rules are not internal for some measures. They therefore may not be applicable when the integrand only is define
{"title":"A new class of quadrature rules for estimating the error in Gauss quadrature","authors":"Aleksandar V. Pejčev , Lothar Reichel , Miodrag M. Spalević , Stefan M. Spalević","doi":"10.1016/j.apnum.2024.06.011","DOIUrl":"https://doi.org/10.1016/j.apnum.2024.06.011","url":null,"abstract":"<div><p>The need to evaluate Gauss quadrature rules arises in many applications in science and engineering. It often is important to be able to estimate the quadrature error when applying an <em>ℓ</em>-point Gauss rule, <span><math><msub><mrow><mi>G</mi></mrow><mrow><mi>ℓ</mi></mrow></msub><mo>(</mo><mi>f</mi><mo>)</mo></math></span>, where <em>f</em> is an integrand of interest. Such an estimate often is furnished by applying another quadrature rule, <span><math><msub><mrow><mi>Q</mi></mrow><mrow><mi>k</mi></mrow></msub><mo>(</mo><mi>f</mi><mo>)</mo></math></span>, with <span><math><mi>k</mi><mo>></mo><mi>ℓ</mi></math></span> nodes, and using the difference <span><math><msub><mrow><mi>Q</mi></mrow><mrow><mi>k</mi></mrow></msub><mo>(</mo><mi>f</mi><mo>)</mo><mo>−</mo><msub><mrow><mi>G</mi></mrow><mrow><mi>ℓ</mi></mrow></msub><mo>(</mo><mi>f</mi><mo>)</mo></math></span> or its magnitude as an estimate for the quadrature error in <span><math><msub><mrow><mi>G</mi></mrow><mrow><mi>ℓ</mi></mrow></msub><mo>(</mo><mi>f</mi><mo>)</mo></math></span> or its magnitude. The classical approach to estimate the error in <span><math><msub><mrow><mi>G</mi></mrow><mrow><mi>ℓ</mi></mrow></msub><mo>(</mo><mi>f</mi><mo>)</mo></math></span> is to let <span><math><msub><mrow><mi>Q</mi></mrow><mrow><mi>k</mi></mrow></msub><mo>(</mo><mi>f</mi><mo>)</mo></math></span>, with <span><math><mi>k</mi><mo>=</mo><mn>2</mn><mi>ℓ</mi><mo>+</mo><mn>1</mn></math></span>, be the Gauss-Kronrod quadrature rule associated with <span><math><msub><mrow><mi>G</mi></mrow><mrow><mi>ℓ</mi></mrow></msub><mo>(</mo><mi>f</mi><mo>)</mo></math></span>. However, it is well known that the Gauss-Kronrod rule associated with a Gauss rule <span><math><msub><mrow><mi>G</mi></mrow><mrow><mi>ℓ</mi></mrow></msub><mo>(</mo><mi>f</mi><mo>)</mo></math></span> might not exist for certain measures that determine the Gauss rule and for certain numbers of nodes. This prompted M. M. Spalević <span>[1]</span> to develop generalized averaged Gauss rules, <span><math><msub><mrow><mover><mrow><mi>G</mi></mrow><mrow><mo>ˆ</mo></mrow></mover></mrow><mrow><mn>2</mn><mi>ℓ</mi><mo>+</mo><mn>1</mn></mrow></msub></math></span>, with <span><math><mn>2</mn><mi>ℓ</mi><mo>+</mo><mn>1</mn></math></span> nodes for estimating the error in <span><math><msub><mrow><mi>G</mi></mrow><mrow><mi>ℓ</mi></mrow></msub><mo>(</mo><mi>f</mi><mo>)</mo></math></span>. Similarly as for <span><math><mo>(</mo><mn>2</mn><mi>ℓ</mi><mo>+</mo><mn>1</mn><mo>)</mo></math></span>-node Gauss-Kronrod rules, <em>ℓ</em> nodes of the rule <span><math><msub><mrow><mover><mrow><mi>G</mi></mrow><mrow><mo>ˆ</mo></mrow></mover></mrow><mrow><mn>2</mn><mi>ℓ</mi><mo>+</mo><mn>1</mn></mrow></msub></math></span> agree with the nodes of <span><math><msub><mrow><mi>G</mi></mrow><mrow><mi>ℓ</mi></mrow></msub></math></span>. However, generalized averaged Gauss rules are not internal for some measures. They therefore may not be applicable when the integrand only is define","PeriodicalId":8199,"journal":{"name":"Applied Numerical Mathematics","volume":"204 ","pages":"Pages 206-221"},"PeriodicalIF":2.2,"publicationDate":"2024-06-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141434087","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 : 2024-06-17DOI: 10.1016/j.apnum.2024.06.012
Hui Yao
Numerical simulations of convective solid-liquid phase change problems have long been a complex problem due to the movement of the solid-liquid interface layer, which leads to a free boundary problem. This work develops a convective phase change heat transfer model based on the phase field method. The governing equations consist of the incompressible Navier-Stokes-Boussinesq equations, the heat transfer equation, and the Allen-Cahn equation. The Navier-Stokes equations are penalised for imposing zero velocity within the solid region. For numerical methods, the mini finite element approach (P1b-P1) is used to solve the momentum equation spatially, the temperature and the phase field are approximated by the P1b elements. In the temporal discretization, the phase field and the temperature are decoupled from the momentum equation by using the finite difference method, forming a solvable linear system. A maximum bound principle for the phase field is derived, coming with an estimation of the tolerance of the time step size, which depends on the temperature range. This estimation guides the time step choice in the simulation. The program is developed within the FreeFem++ framework, drawing on our previous work on phase field methods [1] and a mushy-region method toolbox for heat transfer [2]. The accuracy and effectiveness of the proposed method have been validated through real-world cases of melting and solidification with linear or nonlinear buyangcy force, respectively. The simulation results are in agreement with experiments in references.
{"title":"A phase field method for convective phase change problem preserving maximum bound principle","authors":"Hui Yao","doi":"10.1016/j.apnum.2024.06.012","DOIUrl":"https://doi.org/10.1016/j.apnum.2024.06.012","url":null,"abstract":"<div><p>Numerical simulations of convective solid-liquid phase change problems have long been a complex problem due to the movement of the solid-liquid interface layer, which leads to a free boundary problem. This work develops a convective phase change heat transfer model based on the phase field method. The governing equations consist of the incompressible Navier-Stokes-Boussinesq equations, the heat transfer equation, and the Allen-Cahn equation. The Navier-Stokes equations are penalised for imposing zero velocity within the solid region. For numerical methods, the mini finite element approach (<span>P1b-P1</span>) is used to solve the momentum equation spatially, the temperature and the phase field are approximated by the <span>P1b</span> elements. In the temporal discretization, the phase field and the temperature are decoupled from the momentum equation by using the finite difference method, forming a solvable linear system. A maximum bound principle for the phase field is derived, coming with an estimation of the tolerance of the time step size, which depends on the temperature range. This estimation guides the time step choice in the simulation. The program is developed within the <span>FreeFem++</span> framework, drawing on our previous work on phase field methods <span>[1]</span> and a mushy-region method toolbox for heat transfer <span>[2]</span>. The accuracy and effectiveness of the proposed method have been validated through real-world cases of melting and solidification with linear or nonlinear buyangcy force, respectively. The simulation results are in agreement with experiments in references.</p></div>","PeriodicalId":8199,"journal":{"name":"Applied Numerical Mathematics","volume":"204 ","pages":"Pages 232-248"},"PeriodicalIF":2.2,"publicationDate":"2024-06-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S0168927424001582/pdfft?md5=2072fce0ac49fb6e14195fb698625ef4&pid=1-s2.0-S0168927424001582-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141434086","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}