Computational and Mathematical Methods最新文献

筛选
英文 中文
Invariant measure for continuous open chain of contours with discrete time 离散时间连续开链轮廓的不变测度
Computational and Mathematical Methods Pub Date : 2021-09-28 DOI: 10.1002/cmm4.1197
Marina V. Yashina, Alexander G. Tatashev
{"title":"Invariant measure for continuous open chain of contours with discrete time","authors":"Marina V. Yashina,&nbsp;Alexander G. Tatashev","doi":"10.1002/cmm4.1197","DOIUrl":"10.1002/cmm4.1197","url":null,"abstract":"<p>A dynamical system is studied. This system belongs to the class of contour networks introduced by A.P. Buslaev. The system is a version of the system called an open chain of contours. Continuous and discrete versions of the system were considered earlier. The system contains <i>N</i> contours. There is one adjacent contour for the utmost left and the utmost right contour, and there are two adjacent contours for any other contour. There is a common point of any two adjacent contours. This point is called a node. There is a cluster in each contour. For the continuous version, the cluster is a segment, moving with constant velocity if there is no delay. For the discrete version, the cluster is a group of adjacent particles. Delays are due to that two clusters may not move through the same node simultaneously. The main system characteristic, studied earlier, is the average velocity of clusters. In this paper, the continious and discrete version of the open chain of contours are considered. The following version of the system is also considered. Each cluster is a segment, and the cluster is shifted onto the distance <i>α</i> at any discrete moment if no delay occurs. We have obtained the limit distribution of the system states. We have also obtained the limit state distribution (invariant measure) for the open chain of contours with continuous state space and continuos time and for the open chain of contours with discrete state space and discrete time.</p>","PeriodicalId":100308,"journal":{"name":"Computational and Mathematical Methods","volume":"3 6","pages":""},"PeriodicalIF":0.0,"publicationDate":"2021-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1002/cmm4.1197","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89964564","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Numerical approximations for a class of nonlinear higher order singular boundary value problem by using homotopy perturbation and variational iteration method 用同伦摄动和变分迭代法求解一类非线性高阶奇异边值问题
Computational and Mathematical Methods Pub Date : 2021-09-28 DOI: 10.1002/cmm4.1195
Biswajit Pandit, Amit Kumar Verma, Ravi P. Agarwal
{"title":"Numerical approximations for a class of nonlinear higher order singular boundary value problem by using homotopy perturbation and variational iteration method","authors":"Biswajit Pandit,&nbsp;Amit Kumar Verma,&nbsp;Ravi P. Agarwal","doi":"10.1002/cmm4.1195","DOIUrl":"10.1002/cmm4.1195","url":null,"abstract":"<p>In this work, we focus on the non-linear fourth order class of singular boundary value problem which contains the parameter <math>\u0000 <mrow>\u0000 <mi>λ</mi>\u0000 </mrow></math>. We convert this non-linear differential equation into third order non-linear differential equation. The third order problem is singular, non self adjoint, and nonlinear. Moreover, depending upon <math>\u0000 <mrow>\u0000 <mi>λ</mi>\u0000 </mrow></math>, it admits multiple solutions. Hence, it is too difficult to capture these solutions by any discrete method such as finite difference and so forth. Here we develop an iterative technique with the help of homotopy perturbation method and variational iteration method in a suitable way. Convergence of this series solution is studied in a novel way. We compute these solutions numerically. For small positive values of <math>\u0000 <mrow>\u0000 <mi>λ</mi>\u0000 </mrow></math>, singular BVP has two solutions while solutions can not be found for large positive values of <math>\u0000 <mrow>\u0000 <mi>λ</mi>\u0000 </mrow></math>. Furthermore, we also find dual solutions for <math>\u0000 <mrow>\u0000 <mi>λ</mi>\u0000 <mo>&lt;</mo>\u0000 <mn>0</mn>\u0000 </mrow></math>.</p>","PeriodicalId":100308,"journal":{"name":"Computational and Mathematical Methods","volume":"3 6","pages":""},"PeriodicalIF":0.0,"publicationDate":"2021-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1002/cmm4.1195","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83353944","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
An efficient family of Steffensen-type methods with memory for solving systems of nonlinear equations 一类求解非线性方程组的具有记忆的steffensen型有效方法
Computational and Mathematical Methods Pub Date : 2021-09-22 DOI: 10.1002/cmm4.1192
Mona Narang, Saurabh Bhatia, Vinay Kanwar
{"title":"An efficient family of Steffensen-type methods with memory for solving systems of nonlinear equations","authors":"Mona Narang,&nbsp;Saurabh Bhatia,&nbsp;Vinay Kanwar","doi":"10.1002/cmm4.1192","DOIUrl":"10.1002/cmm4.1192","url":null,"abstract":"<p>The article discusses derivative-free algorithms with and without memory for solving numerically nonlinear systems. We proposed a family of fifth- and sixth-order schemes and extended them to algorithms with memory. We further discuss the convergence and computational efficiency of these algorithms. Numerical examples of mixed Hammerstein integral equation, discrete nonlinear ordinary differential equation, and Fisher's partial differential equation with Neumann's boundary conditions are discussed to demonstrate the convergence and efficiency of these schemes. Finally, some numerical results are included to examine the performance of the developed methods.</p>","PeriodicalId":100308,"journal":{"name":"Computational and Mathematical Methods","volume":"3 6","pages":""},"PeriodicalIF":0.0,"publicationDate":"2021-09-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1002/cmm4.1192","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80255999","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Data curation in the Internet of Things: A decision model approach 物联网中的数据管理:决策模型方法
Computational and Mathematical Methods Pub Date : 2021-09-20 DOI: 10.1002/cmm4.1191
Francisco José de Haro-Olmo, Álvaro Valencia-Parra, Ángel Jesús Varela-Vaca, José Antonio Álvarez-Bermejo
{"title":"Data curation in the Internet of Things: A decision model approach","authors":"Francisco José de Haro-Olmo,&nbsp;Álvaro Valencia-Parra,&nbsp;Ángel Jesús Varela-Vaca,&nbsp;José Antonio Álvarez-Bermejo","doi":"10.1002/cmm4.1191","DOIUrl":"10.1002/cmm4.1191","url":null,"abstract":"<p>Current Internet of Things (IoT) scenarios have to deal with many challenges especially when a large amount of heterogeneous data sources are integrated, that is, data curation. In this respect, the use of poor-quality data (i.e., data with problems) can produce terrible consequence from incorrect decision-making to damaging the performance in the operations. Therefore, using data with an acceptable level of usability has become essential to achieve success. In this article, we propose an IoT-big data pipeline architecture that enables data acquisition and data curation in any IoT context. We have customized the pipeline by including the DMN4DQ approach to enable us the measuring and evaluating data quality in the data produced by IoT sensors. Further, we have chosen a real dataset from sensors in an agricultural IoT context and we have defined a decision model to enable us the automatic measuring and assessing of the data quality with regard to the usability of the data in the context.</p>","PeriodicalId":100308,"journal":{"name":"Computational and Mathematical Methods","volume":"3 6","pages":""},"PeriodicalIF":0.0,"publicationDate":"2021-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1002/cmm4.1191","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74430662","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 3
Convergence of collocation methods for solving periodic boundary value problems for renewal equations defined through finite-dimensional boundary conditions 求解由有限维边界条件定义的更新方程周期边值问题的配点法的收敛性
Computational and Mathematical Methods Pub Date : 2021-09-08 DOI: 10.1002/cmm4.1190
Alessia Andò
{"title":"Convergence of collocation methods for solving periodic boundary value problems for renewal equations defined through finite-dimensional boundary conditions","authors":"Alessia Andò","doi":"10.1002/cmm4.1190","DOIUrl":"10.1002/cmm4.1190","url":null,"abstract":"<p>The problem of computing periodic solutions can be expressed as a boundary value problem and solved numerically via piecewise collocation. Here, we extend to renewal equations the corresponding method for retarded functional differential equations in (K. Engelborghs et al., <i>SIAM J Sci Comput</i>., 22 (2001), pp. 1593–1609). The theoretical proof of the convergence of the method has been recently provided in (A. Andò and D. Breda, <i>SIAM J Numer Anal</i>., 58 (2020), pp. 3010–3039) for retarded functional differential equations and in (A. Andò and D. Breda, submitted in 2021) for renewal equations and consists in both cases in applying the abstract framework in (S. Maset, <i>Numer Math</i>., 133 (2016), pp. 525–555) to a reformulation of the boundary value problem featuring an infinite-dimensional boundary condition. We show that, in the renewal case, the proof can also be carried out and even simplified when considering the standard formulation, defined by boundary conditions of finite dimension.</p>","PeriodicalId":100308,"journal":{"name":"Computational and Mathematical Methods","volume":"3 6","pages":""},"PeriodicalIF":0.0,"publicationDate":"2021-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1002/cmm4.1190","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88490896","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 5
A numerical method for solution of incompressible Navier–Stokes equations in streamfunction-vorticity formulation 流函数涡度型不可压缩Navier-Stokes方程的数值解法
Computational and Mathematical Methods Pub Date : 2021-08-26 DOI: 10.1002/cmm4.1188
Saad Raza, Abdul Rauf, Jamilu Sabi'u, Abdullah Shah
{"title":"A numerical method for solution of incompressible Navier–Stokes equations in streamfunction-vorticity formulation","authors":"Saad Raza,&nbsp;Abdul Rauf,&nbsp;Jamilu Sabi'u,&nbsp;Abdullah Shah","doi":"10.1002/cmm4.1188","DOIUrl":"10.1002/cmm4.1188","url":null,"abstract":"<p>In this work, we have proposed a numerical approach for solving the incompressible Navier–Stokes equations in the streamfunction-vorticity formulation. The numerical scheme is based on the diagonally implicit fractional-step <math>\u0000 <mrow>\u0000 <mi>θ</mi>\u0000 <mo>−</mo>\u0000 </mrow></math>(DIFST) method used for the time discretization and the conforming finite element method for the spatial discretization. The accuracy and efficiency of the scheme are validated by solving some benchmark problems. The numerical simulations are carried out using the DUNE-PDELab open-source software package. The comparison of DIFST scheme with different time discretization schemes is provided in terms of CPU time. Also, different solvers with preconditioners are investigated for solving the resulting algebraic system of equations numerically.</p>","PeriodicalId":100308,"journal":{"name":"Computational and Mathematical Methods","volume":"3 6","pages":""},"PeriodicalIF":0.0,"publicationDate":"2021-08-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1002/cmm4.1188","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83620889","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Approximate solution of the electrostatic nanocantilever model via optimal perturbation iteration method 静电纳米反杠杆模型的最优摄动迭代近似解
Computational and Mathematical Methods Pub Date : 2021-08-24 DOI: 10.1002/cmm4.1189
Waleed Adel, Sinan Deniz
{"title":"Approximate solution of the electrostatic nanocantilever model via optimal perturbation iteration method","authors":"Waleed Adel,&nbsp;Sinan Deniz","doi":"10.1002/cmm4.1189","DOIUrl":"10.1002/cmm4.1189","url":null,"abstract":"<p>In this article, a new technique is used to solve the nonlinear boundary value problem of a cantilever-type nanoelectromechanical system. The technique is called the optimal perturbation iteration method and it is used to solve the problem in the form of a nonlinear differential equation with negative power-law nonlinearity. A convergence and error estimation of the proposed method is presented proving that the method is convergent. Results for the application of the proposed technique are demonstrated through two examples and the tables and figures prove that the method is efficient and straightforward.</p>","PeriodicalId":100308,"journal":{"name":"Computational and Mathematical Methods","volume":"3 6","pages":""},"PeriodicalIF":0.0,"publicationDate":"2021-08-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1002/cmm4.1189","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75380727","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
On an efficient modification of the Chebyshev method 切比雪夫方法的一种有效改进
Computational and Mathematical Methods Pub Date : 2021-08-18 DOI: 10.1002/cmm4.1187
José Antonio Ezquerro, Miguel Ángel Hernández-Verón, Ángel Alberto Magreñán
{"title":"On an efficient modification of the Chebyshev method","authors":"José Antonio Ezquerro,&nbsp;Miguel Ángel Hernández-Verón,&nbsp;Ángel Alberto Magreñán","doi":"10.1002/cmm4.1187","DOIUrl":"10.1002/cmm4.1187","url":null,"abstract":"<p>An efficient modification of the Chebyshev method is constructed from approximating the second derivative of the operator involved by combinations of the operator in different points and it is used to locate, separate, and approximate the solutions of a Chandrasekhar integral equation from analysing its global convergence.</p>","PeriodicalId":100308,"journal":{"name":"Computational and Mathematical Methods","volume":"3 6","pages":""},"PeriodicalIF":0.0,"publicationDate":"2021-08-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1002/cmm4.1187","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85421436","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Ball comparison between frozen Potra and Schmidt–Schwetlick schemes with dynamical analysis 冻结Potra和Schmidt-Schwetlick方案的动力学比较
Computational and Mathematical Methods Pub Date : 2021-08-18 DOI: 10.1002/cmm4.1186
Michael Argyros, Ioannis K. Argyros, Daniel González, Ángel Alberto Magreñán, Alejandro Moysi, Íñigo Sarría
{"title":"Ball comparison between frozen Potra and Schmidt–Schwetlick schemes with dynamical analysis","authors":"Michael Argyros,&nbsp;Ioannis K. Argyros,&nbsp;Daniel González,&nbsp;Ángel Alberto Magreñán,&nbsp;Alejandro Moysi,&nbsp;Íñigo Sarría","doi":"10.1002/cmm4.1186","DOIUrl":"10.1002/cmm4.1186","url":null,"abstract":"<p>In this article, we propose a new research related to the convergence of the frozen Potra and Schmidt–Schwetlick schemes when we apply to equations. The purpose of this study is to introduce a comparison between two solutions to equations under the same conditions. In particular, we show the convergence radius and the uniqueness ball coincidence, while the error estimates are generally different. In this work, we extended the local convergence for Banach space valued operators using only the divided difference of order one and the first derivative of the schemes. This is a great advantage since we improve convergence by avoiding calculating higher-order derivatives that can either be difficult or not even exist. On the other hand, we also present a dynamical study of the behavior of a method compared with its no frozen alternative in order to see the behavior of both. We will study the basins of attraction of the two methods to three different polynomials involving two real, three real, and two real and two complex different solutions.</p>","PeriodicalId":100308,"journal":{"name":"Computational and Mathematical Methods","volume":"3 6","pages":""},"PeriodicalIF":0.0,"publicationDate":"2021-08-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1002/cmm4.1186","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84890960","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Bifurcation analysis and chaos control of discrete prey–predator model incorporating novel prey–refuge concept 包含新猎物-避难所概念的离散猎物-捕食者模型的分岔分析与混沌控制
Computational and Mathematical Methods Pub Date : 2021-08-11 DOI: 10.1002/cmm4.1185
Prasun K. Santra, Ghanshaym S. Mahapatra, Ganga R. Phaijoo
{"title":"Bifurcation analysis and chaos control of discrete prey–predator model incorporating novel prey–refuge concept","authors":"Prasun K. Santra,&nbsp;Ghanshaym S. Mahapatra,&nbsp;Ganga R. Phaijoo","doi":"10.1002/cmm4.1185","DOIUrl":"10.1002/cmm4.1185","url":null,"abstract":"<p>This article investigates a prey–predator model incorporating a novel refuge proportional to prey and inverse proportion to the predator. We find conditions for the local asymptotic stability of fixed points of the proposed prey–predator model. This article presents Neimark–Sacker bifurcation (NSB) and period-doubling bifurcation (PDB) at particular parameter values for positive equilibrium points of the proposed refuge-based prey–predator system. The system exhibits the chaotic dynamics at increasing values of the bifurcation parameter. The hybrid control methodology will control the chaos of the proposed prey–predator dynamical system and discuss the chaotic situation for different biological parameters through graphical analysis. Numerical simulations support the theoretical outcome and long-term chaotic behavior over a broad range of parameters.</p>","PeriodicalId":100308,"journal":{"name":"Computational and Mathematical Methods","volume":"3 6","pages":""},"PeriodicalIF":0.0,"publicationDate":"2021-08-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1002/cmm4.1185","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77776546","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 9
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信