Pub Date : 2024-07-11DOI: 10.1007/s12190-024-02179-0
Najat Chefnaj, Khalid Hilal, Ahmed Kajouni
In this paper, we establish the existence and uniqueness of solutions for a class of initial value problems involving implicit fractional differential equations with a fractional (Psi )-Caputo derivative on time scales. We employ fixed point theorems by Banach, a nonlinear alternative of Leray-Schauder’s type, and Krasnoselskii’s theorem to establish these results. Finally, we present two examples to demonstrate the effectiveness of the obtained analytical results.
{"title":"Existence and uniqueness of solutions for $$Psi $$ -Caputo fractional neutral sequential differential equations on time scales","authors":"Najat Chefnaj, Khalid Hilal, Ahmed Kajouni","doi":"10.1007/s12190-024-02179-0","DOIUrl":"https://doi.org/10.1007/s12190-024-02179-0","url":null,"abstract":"<p>In this paper, we establish the existence and uniqueness of solutions for a class of initial value problems involving implicit fractional differential equations with a fractional <span>(Psi )</span>-Caputo derivative on time scales. We employ fixed point theorems by Banach, a nonlinear alternative of Leray-Schauder’s type, and Krasnoselskii’s theorem to establish these results. Finally, we present two examples to demonstrate the effectiveness of the obtained analytical results.</p>","PeriodicalId":15034,"journal":{"name":"Journal of Applied Mathematics and Computing","volume":"35 1","pages":""},"PeriodicalIF":2.2,"publicationDate":"2024-07-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141586684","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-07-11DOI: 10.1007/s12190-024-02174-5
Javad A. Asadzade, Nazim I. Mahmudov
In this manuscript, we investigate a fractional stochastic neutral differential equation with time delay, which includes both deterministic and stochastic components. Our primary objective is to rigorously prove the existence of a unique solution that satisfies given initial conditions. Furthermore, we extend our research to investigate the finite-time stability of the system by examining trajectory behavior over a given period. We employ advanced mathematical approaches to systematically prove finite-time stability, providing insights on convergence and stability within the stated interval. Using illustrative examples, we strengthen this all-encompassing examination into the complicated dynamics and stability features of fractionally ordered stochastic systems with time delays. The implications of our results extend to various fields, such as control theory, engineering, and financial mathematics, where understanding the stability of complex systems is crucial.
{"title":"Finite time stability analysis for fractional stochastic neutral delay differential equations","authors":"Javad A. Asadzade, Nazim I. Mahmudov","doi":"10.1007/s12190-024-02174-5","DOIUrl":"https://doi.org/10.1007/s12190-024-02174-5","url":null,"abstract":"<p>In this manuscript, we investigate a fractional stochastic neutral differential equation with time delay, which includes both deterministic and stochastic components. Our primary objective is to rigorously prove the existence of a unique solution that satisfies given initial conditions. Furthermore, we extend our research to investigate the finite-time stability of the system by examining trajectory behavior over a given period. We employ advanced mathematical approaches to systematically prove finite-time stability, providing insights on convergence and stability within the stated interval. Using illustrative examples, we strengthen this all-encompassing examination into the complicated dynamics and stability features of fractionally ordered stochastic systems with time delays. The implications of our results extend to various fields, such as control theory, engineering, and financial mathematics, where understanding the stability of complex systems is crucial.</p>","PeriodicalId":15034,"journal":{"name":"Journal of Applied Mathematics and Computing","volume":"24 1","pages":""},"PeriodicalIF":2.2,"publicationDate":"2024-07-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141586719","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-07-11DOI: 10.1007/s12190-024-02177-2
Mukesh Kumar Rawani, Amit Kumar Verma, Carlo Cattani
A numerical scheme based on the Haar wavelets coupled with the nonstandard finite difference scheme is presented to solve the variable-order time-fractional generalized Burgers’ equation (VO-TFGBE). In the proposed technique, firstly, we approximate the time-fractional derivative by the nonstandard finite difference (NSFD) scheme and convert the VO-TFGBE into the nonlinear ordinary differential equation at each time level, and then we apply the Haar wavelet series approximation for the space derivatives. The proposed technique requires only one dimensional Haar wavelet approximation with a significantly smaller number of Haar coefficients to solve time-dependent partial differential equations. The presence of the NSFD scheme provides flexibility to choose different denominator functions and also provides high accuracy for large temporal step sizes. The convergence and stability of the proposed technique are discussed. Some test examples are solved to demonstrate the effectiveness of the technique and validate the theoretical results.
{"title":"An efficient algorithm for solving the variable-order time-fractional generalized Burgers’ equation","authors":"Mukesh Kumar Rawani, Amit Kumar Verma, Carlo Cattani","doi":"10.1007/s12190-024-02177-2","DOIUrl":"https://doi.org/10.1007/s12190-024-02177-2","url":null,"abstract":"<p>A numerical scheme based on the Haar wavelets coupled with the nonstandard finite difference scheme is presented to solve the variable-order time-fractional generalized Burgers’ equation (VO-TFGBE). In the proposed technique, firstly, we approximate the time-fractional derivative by the nonstandard finite difference (NSFD) scheme and convert the VO-TFGBE into the nonlinear ordinary differential equation at each time level, and then we apply the Haar wavelet series approximation for the space derivatives. The proposed technique requires only one dimensional Haar wavelet approximation with a significantly smaller number of Haar coefficients to solve time-dependent partial differential equations. The presence of the NSFD scheme provides flexibility to choose different denominator functions and also provides high accuracy for large temporal step sizes. The convergence and stability of the proposed technique are discussed. Some test examples are solved to demonstrate the effectiveness of the technique and validate the theoretical results.</p>","PeriodicalId":15034,"journal":{"name":"Journal of Applied Mathematics and Computing","volume":"43 1","pages":""},"PeriodicalIF":2.2,"publicationDate":"2024-07-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141608297","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-07-09DOI: 10.1007/s12190-024-02160-x
Abeer M. Al-Bugami, M. A. Abdou, A. M. S. Mahdy
This study describes a new effective technique for solving mixed partial integro-differential equations that are nonlinear with discontinuous kernels (NMPI-DEs). We have used two well-known different numerical techniques, the toeplitz matrix technique (TMT), and the product Nystrom technique (PNT). We have outlined the characteristics of TMT and PNT in both cases, as well as the significance of each approach for characterizing and demystifying the problems’ complexity. These methods have used to convert a system of nonlinear algebraic equations has been derived from the nonlinear Fredholm integral equation (NFIE). Banach’s fixed point theory is employed to investigate the existence and uniqueness of the solution to the nonlinear mixed integral problem. Compared to other approaches, these strategies have shown excellent results in the first instance of being utilized to solve this kind of complex problem. Lastly, a comparison of the two distinct approaches is shown using several cases by using tables and figures. The Maple software has been utilized to compute and obtain all of the numerical results.
本研究介绍了一种新的有效技术,用于求解具有不连续内核的非线性混合偏积分微分方程(NMPI-DE)。我们使用了两种著名的不同数值技术:托普利兹矩阵技术(TMT)和尼斯特罗姆乘积技术(PNT)。我们概述了 TMT 和 PNT 在这两种情况下的特点,以及每种方法在描述和揭示问题复杂性方面的意义。这些方法用于转换由非线性弗雷德霍姆积分方程(NFIE)导出的非线性代数方程系统。巴拿赫定点理论被用来研究非线性混合积分问题解的存在性和唯一性。与其他方法相比,这些策略在首次用于解决此类复杂问题时就显示出了卓越的效果。最后,我们利用表格和数字对这两种不同的方法进行了比较。所有数值结果均使用 Maple 软件计算得出。
{"title":"Numerical simulation, existence and uniqueness for solving nonlinear mixed partial integro-differential equations with discontinuous kernels","authors":"Abeer M. Al-Bugami, M. A. Abdou, A. M. S. Mahdy","doi":"10.1007/s12190-024-02160-x","DOIUrl":"https://doi.org/10.1007/s12190-024-02160-x","url":null,"abstract":"<p>This study describes a new effective technique for solving mixed partial integro-differential equations that are nonlinear with discontinuous kernels (NMPI-DEs). We have used two well-known different numerical techniques, the toeplitz matrix technique (TMT), and the product Nystrom technique (PNT). We have outlined the characteristics of TMT and PNT in both cases, as well as the significance of each approach for characterizing and demystifying the problems’ complexity. These methods have used to convert a system of nonlinear algebraic equations has been derived from the nonlinear Fredholm integral equation (NFIE). Banach’s fixed point theory is employed to investigate the existence and uniqueness of the solution to the nonlinear mixed integral problem. Compared to other approaches, these strategies have shown excellent results in the first instance of being utilized to solve this kind of complex problem. Lastly, a comparison of the two distinct approaches is shown using several cases by using tables and figures. The Maple software has been utilized to compute and obtain all of the numerical results.</p>","PeriodicalId":15034,"journal":{"name":"Journal of Applied Mathematics and Computing","volume":"26 1","pages":""},"PeriodicalIF":2.2,"publicationDate":"2024-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141572975","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
The complex q-rung orthopair fuzzy sets are an important way to express uncertain and ambiguous information, and they are superior to the complex fuzzy sets, complex intuitionistic fuzzy sets, complex pythagorean fuzzy sets, and complex fermatean fuzzy sets. This paper extend the notion of q-rung orthopair fuzzy sets to complex q-rung orthopair fuzzy sets. Interaction aggregation operators are often used in various fields to solve multi-attribute decision-making Problems. By utilizing arithmetic and geometric operators, some well-known complex q-rung orthopair fuzzy interaction aggregation operators such as complex q-rung orthopair fuzzy interaction weighted average operator, complex q-rung orthopair fuzzy interaction weighted geometric operator, complex q-rung orthopair fuzzy interaction order weighted operator, complex q-rung orthopair fuzzy interaction order weighted geometric operator, complex q-rung orthopair fuzzy interaction hybrid operator, and complex q-rung orthopair fuzzy interaction hybrid geometric operator have been developed. In addition, some of the unique properties of these newly established operators are investigated. Finally, we explore a decision-making approach to solve multi-attribute decision-making Problem. The viability and flexibility of the suggested technique is explored with the help of a numerical example and the proposed results are compared with several existing approaches.
{"title":"Multi-attribute decision-making problem using complex q-rung orthopair fuzzy interaction aggregation operators","authors":"Ziad Khan, Ikhtesham Ullah, Fawad Hussain, Tariq Rahim, Rashid Jan, Madad Khan","doi":"10.1007/s12190-024-02170-9","DOIUrl":"https://doi.org/10.1007/s12190-024-02170-9","url":null,"abstract":"<p>The complex <i>q</i>-rung orthopair fuzzy sets are an important way to express uncertain and ambiguous information, and they are superior to the complex fuzzy sets, complex intuitionistic fuzzy sets, complex pythagorean fuzzy sets, and complex fermatean fuzzy sets. This paper extend the notion of <i>q</i>-rung orthopair fuzzy sets to complex <i>q</i>-rung orthopair fuzzy sets. Interaction aggregation operators are often used in various fields to solve multi-attribute decision-making Problems. By utilizing arithmetic and geometric operators, some well-known complex <i>q</i>-rung orthopair fuzzy interaction aggregation operators such as complex <i>q</i>-rung orthopair fuzzy interaction weighted average operator, complex <i>q</i>-rung orthopair fuzzy interaction weighted geometric operator, complex <i>q</i>-rung orthopair fuzzy interaction order weighted operator, complex <i>q</i>-rung orthopair fuzzy interaction order weighted geometric operator, complex <i>q</i>-rung orthopair fuzzy interaction hybrid operator, and complex <i>q</i>-rung orthopair fuzzy interaction hybrid geometric operator have been developed. In addition, some of the unique properties of these newly established operators are investigated. Finally, we explore a decision-making approach to solve multi-attribute decision-making Problem. The viability and flexibility of the suggested technique is explored with the help of a numerical example and the proposed results are compared with several existing approaches.</p>","PeriodicalId":15034,"journal":{"name":"Journal of Applied Mathematics and Computing","volume":"9 1","pages":""},"PeriodicalIF":2.2,"publicationDate":"2024-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141572974","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-07-05DOI: 10.1007/s12190-024-02167-4
Di Gan, Guo-Feng Zhang, Zhao-Zheng Liang
In this paper, we study preconditioners for all-at-once systems arising from the discretization of time-fractional sub-diffusion equations. Due to the use of high-order accurate formulas in time fractional derivative, the coefficient matrix does not have a Toeplitz structure. We reconstructed the coefficient matrix so that the all-at-once system has a non-symmetric Toeplitz-like structure. Based on the non-symmetric Toplitz-like structure of the new system, we designed a preconditioner that can be quickly diagonalized by discrete sine transform and fast Fourier transform techniques. we show that the spectrum of the preconditioned matrix are clustered around 1. Also, we verified the effectiveness of the proposed preconditioner by numerical experiments.
{"title":"An efficient preconditioner for linear systems arising from high-order accurate schemes of time fractional diffusion equations","authors":"Di Gan, Guo-Feng Zhang, Zhao-Zheng Liang","doi":"10.1007/s12190-024-02167-4","DOIUrl":"https://doi.org/10.1007/s12190-024-02167-4","url":null,"abstract":"<p>In this paper, we study preconditioners for all-at-once systems arising from the discretization of time-fractional sub-diffusion equations. Due to the use of high-order accurate formulas in time fractional derivative, the coefficient matrix does not have a Toeplitz structure. We reconstructed the coefficient matrix so that the all-at-once system has a non-symmetric Toeplitz-like structure. Based on the non-symmetric Toplitz-like structure of the new system, we designed a preconditioner that can be quickly diagonalized by discrete sine transform and fast Fourier transform techniques. we show that the spectrum of the preconditioned matrix are clustered around 1. Also, we verified the effectiveness of the proposed preconditioner by numerical experiments.</p>","PeriodicalId":15034,"journal":{"name":"Journal of Applied Mathematics and Computing","volume":"34 1","pages":""},"PeriodicalIF":2.2,"publicationDate":"2024-07-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141550173","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-07-04DOI: 10.1007/s12190-024-02175-4
Ali Turab, Andrés Montoyo, Josué-Antonio Nescolarde-Selva
This study undertakes a comprehensive analysis of second-order Ordinary Differential Equations (ODEs) to examine animal avoidance behaviors, specifically emphasizing analytical and computational aspects. By using the Picard–Lindelöf and fixed-point theorems, we prove the existence of unique solutions and examine their stability according to the Ulam-Hyers criterion. We also investigate the effect of external forces and the system’s sensitivity to initial conditions. This investigation applies Euler and Runge–Kutta fourth-order (RK4) methods to a mass-spring-damper system for numerical approximation. A detailed analysis of the numerical approaches, including a rigorous evaluation of both absolute and relative errors, demonstrates the efficacy of these techniques compared to the exact solutions. This robust examination enhances the theoretical foundations and practical use of such ODEs in understanding complex behavioral patterns, showcasing the connection between theoretical understanding and real-world applications.
{"title":"Stability and numerical solutions for second-order ordinary differential equations with application in mechanical systems","authors":"Ali Turab, Andrés Montoyo, Josué-Antonio Nescolarde-Selva","doi":"10.1007/s12190-024-02175-4","DOIUrl":"https://doi.org/10.1007/s12190-024-02175-4","url":null,"abstract":"<p>This study undertakes a comprehensive analysis of second-order Ordinary Differential Equations (ODEs) to examine animal avoidance behaviors, specifically emphasizing analytical and computational aspects. By using the Picard–Lindelöf and fixed-point theorems, we prove the existence of unique solutions and examine their stability according to the Ulam-Hyers criterion. We also investigate the effect of external forces and the system’s sensitivity to initial conditions. This investigation applies Euler and Runge–Kutta fourth-order (RK4) methods to a mass-spring-damper system for numerical approximation. A detailed analysis of the numerical approaches, including a rigorous evaluation of both absolute and relative errors, demonstrates the efficacy of these techniques compared to the exact solutions. This robust examination enhances the theoretical foundations and practical use of such ODEs in understanding complex behavioral patterns, showcasing the connection between theoretical understanding and real-world applications.</p>","PeriodicalId":15034,"journal":{"name":"Journal of Applied Mathematics and Computing","volume":"14 1","pages":""},"PeriodicalIF":2.2,"publicationDate":"2024-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141550174","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-07-03DOI: 10.1007/s12190-024-02165-6
Jun Li, Shu-Xin Miao, Xiangtuan Xiong
In this paper, to further enhance the efficiency of the improved alternating positive semi-definite splitting (IAPSS) preconditioner proposed by Ren et al. (Numer Algorithms 91:1363–1379, 2022. https://doi.org/10.1007/s11075-022-01305-y), the modified IAPSS preconditioner is established, which can be applied to GMRES method to solve the double saddle point problems. The construction idea of the preconditioner is to modify several sub-matrices in the IAPSS preconditioner. Theoretically, the iteration method generated by the proposed preconditioner is unconditionally convergent for all positive parameters. Furthermore, the selection of the parameters is discussed in detail. Finally, the performance of the preconditioner is verified by the two examples of the liquid crystal director model and the mixed Stokes/Darcy model.
{"title":"A modified improved alternating positive semi-definite splitting preconditioner for double saddle point problems","authors":"Jun Li, Shu-Xin Miao, Xiangtuan Xiong","doi":"10.1007/s12190-024-02165-6","DOIUrl":"https://doi.org/10.1007/s12190-024-02165-6","url":null,"abstract":"<p>In this paper, to further enhance the efficiency of the improved alternating positive semi-definite splitting (IAPSS) preconditioner proposed by Ren et al. (Numer Algorithms 91:1363–1379, 2022. https://doi.org/10.1007/s11075-022-01305-y), the modified IAPSS preconditioner is established, which can be applied to GMRES method to solve the double saddle point problems. The construction idea of the preconditioner is to modify several sub-matrices in the IAPSS preconditioner. Theoretically, the iteration method generated by the proposed preconditioner is unconditionally convergent for all positive parameters. Furthermore, the selection of the parameters is discussed in detail. Finally, the performance of the preconditioner is verified by the two examples of the liquid crystal director model and the mixed Stokes/Darcy model.</p>","PeriodicalId":15034,"journal":{"name":"Journal of Applied Mathematics and Computing","volume":"241 1","pages":""},"PeriodicalIF":2.2,"publicationDate":"2024-07-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141523206","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-07-02DOI: 10.1007/s12190-024-02173-6
Hoorieh Fakhari, Akbar Mohebbi
In this paper, we propose an efficient numerical algorithm for the solution of fourth-order time fractional partial integro-differential equation with a weakly singular kernel. In time direction, we use second-order finite difference schemes to discretize the Caputo fractional derivative and also singular integral term. To achieve fully discrete scheme, we apply Galerkin method using generalized Jacobi polynomials as basis, which satisfy essentially all the underlying homogeneous boundary conditions. The proposed method is fast and efficient due to the resulting sparse coefficient matrices. We investigate the error estimate and prove that the method is convergent. Numerical results show the high accuracy and low CPU time of proposed method and confirmed the theoretical ones. Second-order accuracy in time direction and spectral accuracy in space component are also numerically demonstrated by some test problems. Finally we compare the numerical results with the results of other recently methods developed in literature.
本文提出了一种高效的数值算法,用于求解具有弱奇异内核的四阶时间分式偏积分微分方程。在时间方向上,我们使用二阶有限差分方案来离散 Caputo 分导数和奇异积分项。为了实现完全离散方案,我们采用了 Galerkin 方法,以广义雅可比多项式为基础,基本上满足了所有潜在的同质边界条件。由于所得到的系数矩阵稀疏,因此所提出的方法既快速又高效。我们对误差估计进行了研究,并证明该方法是收敛的。数值结果表明了所提方法的高精度和低 CPU 时间,并证实了理论结果。我们还通过一些测试问题数值证明了时间方向的二阶精度和空间分量的频谱精度。最后,我们将数值结果与文献中最近开发的其他方法的结果进行了比较。
{"title":"Galerkin spectral and finite difference methods for the solution of fourth-order time fractional partial integro-differential equation with a weakly singular kernel","authors":"Hoorieh Fakhari, Akbar Mohebbi","doi":"10.1007/s12190-024-02173-6","DOIUrl":"https://doi.org/10.1007/s12190-024-02173-6","url":null,"abstract":"<p>In this paper, we propose an efficient numerical algorithm for the solution of fourth-order time fractional partial integro-differential equation with a weakly singular kernel. In time direction, we use second-order finite difference schemes to discretize the Caputo fractional derivative and also singular integral term. To achieve fully discrete scheme, we apply Galerkin method using generalized Jacobi polynomials as basis, which satisfy essentially all the underlying homogeneous boundary conditions. The proposed method is fast and efficient due to the resulting sparse coefficient matrices. We investigate the error estimate and prove that the method is convergent. Numerical results show the high accuracy and low CPU time of proposed method and confirmed the theoretical ones. Second-order accuracy in time direction and spectral accuracy in space component are also numerically demonstrated by some test problems. Finally we compare the numerical results with the results of other recently methods developed in literature.</p>","PeriodicalId":15034,"journal":{"name":"Journal of Applied Mathematics and Computing","volume":"138 1","pages":""},"PeriodicalIF":2.2,"publicationDate":"2024-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141523205","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-06-29DOI: 10.1007/s12190-024-02163-8
Fazal Hayat, Shou-Jun Xu, Xuli Qi
For a given graph G, the second Zagreb eccentricity index (xi _2 (G)) is defined as the product of the eccentricities of two adjacent vertex pairs in G. This paper mainly studies the problem of determining the graphs that minimize the second Zagreb eccentricity index among n-vertex bipartite graphs with a fixed number of edges and diameter. To be specific, we determine the sharp lower bound on the second Zagreb eccentricity index over the bipartite graphs of order n in terms of fixed edges and diameter. The extremal graphs attaining these lower bounds are fully characterized.
对于给定的图 G,第二萨格勒布偏心指数(xi _2 (G))被定义为 G 中两个相邻顶点对的偏心率的乘积。本文主要研究在具有固定边数和直径的 n 个顶点双artite图中确定最小化第二萨格勒布偏心指数的图的问题。具体地说,我们确定了在固定边数和直径的 n 阶双方形中第二萨格勒布偏心指数的尖锐下限。达到这些下界的极值图被完全表征出来。
{"title":"Minimizing the second Zagreb eccentricity index in bipartite graphs with a fixed size and diameter","authors":"Fazal Hayat, Shou-Jun Xu, Xuli Qi","doi":"10.1007/s12190-024-02163-8","DOIUrl":"https://doi.org/10.1007/s12190-024-02163-8","url":null,"abstract":"<p>For a given graph <i>G</i>, the second Zagreb eccentricity index <span>(xi _2 (G))</span> is defined as the product of the eccentricities of two adjacent vertex pairs in <i>G</i>. This paper mainly studies the problem of determining the graphs that minimize the second Zagreb eccentricity index among <i>n</i>-vertex bipartite graphs with a fixed number of edges and diameter. To be specific, we determine the sharp lower bound on the second Zagreb eccentricity index over the bipartite graphs of order <i>n</i> in terms of fixed edges and diameter. The extremal graphs attaining these lower bounds are fully characterized.</p>","PeriodicalId":15034,"journal":{"name":"Journal of Applied Mathematics and Computing","volume":"59 1","pages":""},"PeriodicalIF":2.2,"publicationDate":"2024-06-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141506204","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}