{"title":"求解第二类弱奇异积分方程的插值方法","authors":"E. S. Shoukralla","doi":"10.11648/j.acm.20211003.14","DOIUrl":null,"url":null,"abstract":"We establish a new straightforward interpolation method for solving linear Volterra integral equations with weakly singular kernels. The proposed method is fundamentally different from all other published methods for solving this type of equations. We have modified some vector-matrix barycentric Lagrange interpolation formulas to be convenient for interpolating the kernel twice concerning the two variables of the kernel and introducing new ideas for selecting interpolation nodes that ensure isolation of the singularity of the kernel. We create two rules for selecting the distribution nodes of the two kernel variables that do not allow the denominator of the kernel to contain an imaginary value. We interpolate the unknown and data functions into the corresponding interpolant polynomial; each of the same degree via three matrices, one of which is a monomial. By applying the presented method based on the two created rules, we transformed the kernel into a double interpolant polynomial with a degree equal to that of the unknown function via five matrices, two of which are monomials. We substitute the interpolate unknown function twice; on the left side and on the right side of the integral equation to get an algebraic linear system without applying the collocation method. The solution of this system yields the unknown coefficients matrix that is necessary to find the interpolant solution. We solve three different examples for different values of the upper integration variable. The obtained results as shown in tables and figures prove that the obtained interpolate solutions are extraordinarily faster to converge to the exact ones using interpolants of lowest degrees and give better results than those obtained by other methods. This confirms the originality and the potential of the presented method.","PeriodicalId":55503,"journal":{"name":"Applied and Computational Mathematics","volume":null,"pages":null},"PeriodicalIF":4.6000,"publicationDate":"2021-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Interpolation Method for Solving Weakly Singular Integral Equations of the Second Kind\",\"authors\":\"E. S. Shoukralla\",\"doi\":\"10.11648/j.acm.20211003.14\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We establish a new straightforward interpolation method for solving linear Volterra integral equations with weakly singular kernels. The proposed method is fundamentally different from all other published methods for solving this type of equations. We have modified some vector-matrix barycentric Lagrange interpolation formulas to be convenient for interpolating the kernel twice concerning the two variables of the kernel and introducing new ideas for selecting interpolation nodes that ensure isolation of the singularity of the kernel. We create two rules for selecting the distribution nodes of the two kernel variables that do not allow the denominator of the kernel to contain an imaginary value. We interpolate the unknown and data functions into the corresponding interpolant polynomial; each of the same degree via three matrices, one of which is a monomial. By applying the presented method based on the two created rules, we transformed the kernel into a double interpolant polynomial with a degree equal to that of the unknown function via five matrices, two of which are monomials. We substitute the interpolate unknown function twice; on the left side and on the right side of the integral equation to get an algebraic linear system without applying the collocation method. The solution of this system yields the unknown coefficients matrix that is necessary to find the interpolant solution. We solve three different examples for different values of the upper integration variable. The obtained results as shown in tables and figures prove that the obtained interpolate solutions are extraordinarily faster to converge to the exact ones using interpolants of lowest degrees and give better results than those obtained by other methods. This confirms the originality and the potential of the presented method.\",\"PeriodicalId\":55503,\"journal\":{\"name\":\"Applied and Computational Mathematics\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":4.6000,\"publicationDate\":\"2021-06-30\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Applied and Computational Mathematics\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://doi.org/10.11648/j.acm.20211003.14\",\"RegionNum\":2,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"MATHEMATICS, APPLIED\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Applied and Computational Mathematics","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.11648/j.acm.20211003.14","RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"MATHEMATICS, APPLIED","Score":null,"Total":0}
Interpolation Method for Solving Weakly Singular Integral Equations of the Second Kind
We establish a new straightforward interpolation method for solving linear Volterra integral equations with weakly singular kernels. The proposed method is fundamentally different from all other published methods for solving this type of equations. We have modified some vector-matrix barycentric Lagrange interpolation formulas to be convenient for interpolating the kernel twice concerning the two variables of the kernel and introducing new ideas for selecting interpolation nodes that ensure isolation of the singularity of the kernel. We create two rules for selecting the distribution nodes of the two kernel variables that do not allow the denominator of the kernel to contain an imaginary value. We interpolate the unknown and data functions into the corresponding interpolant polynomial; each of the same degree via three matrices, one of which is a monomial. By applying the presented method based on the two created rules, we transformed the kernel into a double interpolant polynomial with a degree equal to that of the unknown function via five matrices, two of which are monomials. We substitute the interpolate unknown function twice; on the left side and on the right side of the integral equation to get an algebraic linear system without applying the collocation method. The solution of this system yields the unknown coefficients matrix that is necessary to find the interpolant solution. We solve three different examples for different values of the upper integration variable. The obtained results as shown in tables and figures prove that the obtained interpolate solutions are extraordinarily faster to converge to the exact ones using interpolants of lowest degrees and give better results than those obtained by other methods. This confirms the originality and the potential of the presented method.
期刊介绍:
Applied and Computational Mathematics (ISSN Online: 2328-5613, ISSN Print: 2328-5605) is a prestigious journal that focuses on the field of applied and computational mathematics. It is driven by the computational revolution and places a strong emphasis on innovative applied mathematics with potential for real-world applicability and practicality.
The journal caters to a broad audience of applied mathematicians and scientists who are interested in the advancement of mathematical principles and practical aspects of computational mathematics. Researchers from various disciplines can benefit from the diverse range of topics covered in ACM. To ensure the publication of high-quality content, all research articles undergo a rigorous peer review process. This process includes an initial screening by the editors and anonymous evaluation by expert reviewers. This guarantees that only the most valuable and accurate research is published in ACM.