Gurjinder Singh, Arvind Garg, Rajat Singla, Vinay Kanwar
In this article, a two-parameter class of hybrid block methods for integrating first-order initial value ordinary differential systems is proposed. The methods exhibit hybrid nature which helps in bypassing the first Dahlquist barrier existing for linear multistep methods. The approach used in the development of a class of methods is purely interpolation and collocation technique. The class of methods is based on four intra-step points from which two intra-step points have been optimized by using an optimization strategy. In this optimization strategy, the values of two intra-step points are obtained by minimizing the local truncation errors of the formulas at the points and .The order of accuracy of the proposed methods is six. A method as a special case of this class of methods is considered and developed into a block form which produces approximate numerical solutions at several points simultaneously. Further, the method is formulated into an adaptive step-size algorithm using an embedded type procedure. This method which is a special case of this class of methods has been tested on six well-known first-order differential systems.
本文提出了一阶初值常微分系统积分的一类双参数混合块法。该方法表现出混合性质,有助于绕过线性多步骤方法存在的第一Dahlquist势垒。在一类方法的开发中使用的方法是纯粹的插值和搭配技术。该类方法基于四个步内点,其中两个步内点通过使用优化策略进行优化。在此优化策略中,通过最小化公式在x n + 1 / 2和x处的局部截断误差,得到两个步内点的值所提方法的精度阶数为6。作为这类方法的一个特例,我们考虑了一种方法,并将其发展成一种块形式,它可以同时在几个点上产生近似的数值解。此外,该方法采用嵌入型程序形成自适应步长算法。这个方法是这类方法的一个特例,已经在六个著名的一阶微分系统上进行了检验。
{"title":"A novel two-parameter class of optimized hybrid block methods for integrating differential systems numerically","authors":"Gurjinder Singh, Arvind Garg, Rajat Singla, Vinay Kanwar","doi":"10.1002/cmm4.1214","DOIUrl":"10.1002/cmm4.1214","url":null,"abstract":"<p>In this article, a two-parameter class of hybrid block methods for integrating first-order initial value ordinary differential systems is proposed. The methods exhibit hybrid nature which helps in bypassing the first Dahlquist barrier existing for linear multistep methods. The approach used in the development of a class of methods is purely interpolation and collocation technique. The class of methods is based on four intra-step points from which two intra-step points have been optimized by using an optimization strategy. In this optimization strategy, the values of two intra-step points are obtained by minimizing the local truncation errors of the formulas at the points <math>\u0000 <mrow>\u0000 <msub>\u0000 <mrow>\u0000 <mi>x</mi>\u0000 </mrow>\u0000 <mrow>\u0000 <mi>n</mi>\u0000 <mo>+</mo>\u0000 <mn>1</mn>\u0000 <mo>/</mo>\u0000 <mn>2</mn>\u0000 </mrow>\u0000 </msub>\u0000 </mrow></math> and <math>\u0000 <mrow>\u0000 <msub>\u0000 <mrow>\u0000 <mi>x</mi>\u0000 </mrow>\u0000 <mrow>\u0000 <mi>n</mi>\u0000 <mo>+</mo>\u0000 <mn>1</mn>\u0000 </mrow>\u0000 </msub>\u0000 </mrow></math>.The order of accuracy of the proposed methods is six. A method as a special case of this class of methods is considered and developed into a block form which produces approximate numerical solutions at several points simultaneously. Further, the method is formulated into an adaptive step-size algorithm using an embedded type procedure. This method which is a special case of this class of methods has been tested on six well-known first-order differential systems.</p>","PeriodicalId":100308,"journal":{"name":"Computational and Mathematical Methods","volume":"3 6","pages":""},"PeriodicalIF":0.0,"publicationDate":"2021-11-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1002/cmm4.1214","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91332636","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}
Pedro Alonso Velázquez, Jorge Jiménez Meana, Juan Manuel Peña Ferrández, María Luisa Serrano Ortega
In this work, several algorithms have been implemented with Matlab to obtain an algorithmic characterizations of almost strictly sign regular matrices using Neville elimination.
{"title":"A collection of efficient tools to work with almost strictly sign regular matrices","authors":"Pedro Alonso Velázquez, Jorge Jiménez Meana, Juan Manuel Peña Ferrández, María Luisa Serrano Ortega","doi":"10.1002/cmm4.1212","DOIUrl":"10.1002/cmm4.1212","url":null,"abstract":"<p>In this work, several algorithms have been implemented with Matlab to obtain an algorithmic characterizations of almost strictly sign regular matrices using Neville elimination.</p>","PeriodicalId":100308,"journal":{"name":"Computational and Mathematical Methods","volume":"3 6","pages":""},"PeriodicalIF":0.0,"publicationDate":"2021-11-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1002/cmm4.1212","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90819506","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}
In this work we study the change of the structure of a regular pencil when we perform small perturbations over some of its rows and the other rows remain unaltered. We provide necessary conditions when several rows are perturbed, and prove them to be sufficient to prescribe the homogenous invariant factors or the Weyr characteristic of the resulting pencil when one row is perturbed.
{"title":"The change of the Weierstrass structure under one row perturbation","authors":"Itziar Baragaña, Alicia Roca","doi":"10.1002/cmm4.1211","DOIUrl":"10.1002/cmm4.1211","url":null,"abstract":"<p>In this work we study the change of the structure of a regular pencil when we perform small perturbations over some of its rows and the other rows remain unaltered. We provide necessary conditions when several rows are perturbed, and prove them to be sufficient to prescribe the homogenous invariant factors or the Weyr characteristic of the resulting pencil when one row is perturbed.</p>","PeriodicalId":100308,"journal":{"name":"Computational and Mathematical Methods","volume":"3 6","pages":""},"PeriodicalIF":0.0,"publicationDate":"2021-11-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1002/cmm4.1211","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87421869","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}
In this article, a hybrid scheme for a two-parameter elliptic problem with regular exponential and boundary layers on Shishkin mesh is analyzed. The hybrid scheme comprises the central difference method in the layer region and the upwind method in the regular part. The use of the central difference in layer region results in a more accurate resolution of layers. The method is shown to have first-order parameter uniform convergence. The numerical results corroborate the error estimates presented here.
{"title":"Hybrid method for two parameter singularly perturbed elliptic boundary value problems","authors":"Anuradha Jha, Mohan Krishen Kadalbajoo","doi":"10.1002/cmm4.1210","DOIUrl":"10.1002/cmm4.1210","url":null,"abstract":"<p>In this article, a hybrid scheme for a two-parameter elliptic problem with regular exponential and boundary layers on Shishkin mesh is analyzed. The hybrid scheme comprises the central difference method in the layer region and the upwind method in the regular part. The use of the central difference in layer region results in a more accurate resolution of layers. The method is shown to have first-order parameter uniform convergence. The numerical results corroborate the error estimates presented here.</p>","PeriodicalId":100308,"journal":{"name":"Computational and Mathematical Methods","volume":"3 6","pages":""},"PeriodicalIF":0.0,"publicationDate":"2021-11-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1002/cmm4.1210","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86916121","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}
Solving stiff, singular, and singularly perturbed initial value problems (IVPs) has always been challenging for researchers working in different fields of science and engineering. In this research work, an attempt is made to devise a family of nonlinear methods among which second- to fourth-order methods are not only stable but acceptable as well under order stars' conditions. These features make them more suitable for solving stiff and singular systems in ordinary differential equations. Methods with remaining orders are either zero- or conditionally stable. The theoretical analysis contains local truncation error, consistency, and order of accuracy of the proposed nonlinear methods. Furthermore, both fixed and variable stepsize approaches are introduced wherein the latter improves the performance of the devised methods. The applicability of the methods for solving the system of IVPs is also described. When used to solve problems from physical and real-life applications, including nonlinear logistic growth and stiff model for flame propagation, the proposed methods are found to have good results.
{"title":"A new family of \u0000 \u0000 𝒜\u0000 −\u0000 acceptable nonlinear methods with fixed and variable stepsize approach","authors":"Sania Qureshi, Amanullah Soomro, Evren Hınçal","doi":"10.1002/cmm4.1213","DOIUrl":"10.1002/cmm4.1213","url":null,"abstract":"<p>Solving stiff, singular, and singularly perturbed initial value problems (IVPs) has always been challenging for researchers working in different fields of science and engineering. In this research work, an attempt is made to devise a family of nonlinear methods among which second- to fourth-order methods are not only <math>\u0000 <mrow>\u0000 <mi>𝒜</mi>\u0000 <mo>−</mo>\u0000 </mrow></math> stable but <math>\u0000 <mrow>\u0000 <mi>𝒜</mi>\u0000 <mo>−</mo>\u0000 </mrow></math> acceptable as well under order stars' conditions. These features make them more suitable for solving stiff and singular systems in ordinary differential equations. Methods with remaining orders are either zero- or conditionally stable. The theoretical analysis contains local truncation error, consistency, and order of accuracy of the proposed nonlinear methods. Furthermore, both fixed and variable stepsize approaches are introduced wherein the latter improves the performance of the devised methods. The applicability of the methods for solving the system of IVPs is also described. When used to solve problems from physical and real-life applications, including nonlinear logistic growth and stiff model for flame propagation, the proposed methods are found to have good results.</p>","PeriodicalId":100308,"journal":{"name":"Computational and Mathematical Methods","volume":"3 6","pages":""},"PeriodicalIF":0.0,"publicationDate":"2021-11-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1002/cmm4.1213","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88922027","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}
Mahantesh M. Nandeppanavar, Kemparaju M. Chandrashekhar, Raveendra Nagaraj
An analysis of stagnation point flow of heat and mass transfer of double diffusive mixed-convective stream with radiating vertical plate and convective boundary conditions. The Runge–Kutta method with shooting procedure is used to solve the transformed equations mathematically. An accuracy of the numerical procedure has been validated through a restriction of the current work compared with prior available results. The shear surface stress, Nusselt and Sherwood number are increased with increase in Prandtl number. The Biot number is investigated and observed that to increase the Prandtl number, the friction coefficient, Nusselt number and Sherwood number are increased. The impact of pertinent constraints on distinct flow parameters are determined and analyzed through tables and graphs.
{"title":"Effect of Richardson number on stagnation point flow of double diffusive mixed convective slip flow of magnetohydrodynamic Casson fluid: A numerical study","authors":"Mahantesh M. Nandeppanavar, Kemparaju M. Chandrashekhar, Raveendra Nagaraj","doi":"10.1002/cmm4.1209","DOIUrl":"10.1002/cmm4.1209","url":null,"abstract":"<p>An analysis of stagnation point flow of heat and mass transfer of double diffusive mixed-convective stream with radiating vertical plate and convective boundary conditions. The Runge–Kutta method with shooting procedure is used to solve the transformed equations mathematically. An accuracy of the numerical procedure has been validated through a restriction of the current work compared with prior available results. The shear surface stress, Nusselt and Sherwood number are increased with increase in Prandtl number. The Biot number <math>\u0000 <mrow>\u0000 <mi>Bi</mi>\u0000 <mo>></mo>\u0000 <mn>0.1</mn>\u0000 </mrow></math> is investigated and observed that to increase the Prandtl number, the friction coefficient, Nusselt number and Sherwood number are increased. The impact of pertinent constraints on distinct flow parameters are determined and analyzed through tables and graphs.</p>","PeriodicalId":100308,"journal":{"name":"Computational and Mathematical Methods","volume":"3 6","pages":""},"PeriodicalIF":0.0,"publicationDate":"2021-11-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1002/cmm4.1209","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88678124","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}
The aim of this article is to show a way in which the problem of predicting the evolution of an epidemic may be tackled by describing it in the framework of Boltzmann's kinetic theory, as it has been developed and applied in the last years to complex systems by a suitable modification of the Boltzmann equation, via a suitable reinterpretation of state variables and the introduction of the notion of «functional subsystems». Accordingly, in this article we model an arbitrary (national) population S as a complex system, split in two functional subsystems, the first containing all single individuals of S and the second containing the «care tools», that are to be meant as available places in hospitals with a sufficient number of physicians and of equipments for intensive cares. The state variable on the first subsystem will be the «health state», and the state variable on the other will be the «effectiveness». We shall then write a system of nonlinear ordinary differential equations which gives the evolution of the probability distribution on the set of possible values of the health states. By assigning data partly on the basis of plausibility assumptions and partly as estimated from those furnished by institutions of Campania region, the system takes a form allowing the numerical simulation of such evolution, which will be performed and presented in a forthcoming paper.
{"title":"Modeling epidemics by means of the stochastic description of complex systems","authors":"Bruno Carbonaro","doi":"10.1002/cmm4.1208","DOIUrl":"10.1002/cmm4.1208","url":null,"abstract":"<p>The aim of this article is to show a way in which the problem of predicting the evolution of an epidemic may be tackled by describing it in the framework of Boltzmann's kinetic theory, as it has been developed and applied in the last years to complex systems by a suitable modification of the Boltzmann equation, via a suitable reinterpretation of state variables and the introduction of the notion of «functional subsystems». Accordingly, in this article we model an arbitrary (national) population <i>S</i> as a complex system, split in two functional subsystems, the first containing all single individuals of <i>S</i> and the second containing the «care tools», that are to be meant as available places in hospitals with a sufficient number of physicians and of equipments for intensive cares. The state variable on the first subsystem will be the «health state», and the state variable on the other will be the «effectiveness». We shall then write a system of nonlinear ordinary differential equations which gives the evolution of the probability distribution on the set of possible values of the health states. By assigning data partly on the basis of plausibility assumptions and partly as estimated from those furnished by institutions of Campania region, the system takes a form allowing the numerical simulation of such evolution, which will be performed and presented in a forthcoming paper.</p>","PeriodicalId":100308,"journal":{"name":"Computational and Mathematical Methods","volume":"3 6","pages":""},"PeriodicalIF":0.0,"publicationDate":"2021-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1002/cmm4.1208","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83391753","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}
Eduardo R. Conde López, Miguel Ángel Toledo Municio, Eduardo Salete Casino
Dam safety is a relevant aspect in our society due to the importance of its functions (power generation, water supply, lamination of floods) and due to the potentially catastrophic consequences of a serious breakdown or breakage. Dam safety analyses are fundamentally based on behavior models, which are idealizations of the dam-foundation that allow us to calculate the dam's response to a certain combination of actions. The comparison of this response with the real one, measured by the auscultation or survey devices, is the main element to determine the safety status of the structure. To improve this analysis, it is necessary to increase the accuracy of the numerical models obtaining a digital twin that allows knowing, in a faithful way, how the structure is going to work in normal and extreme situations.
{"title":"Optimization of numerical models through instrumentation data integration: Digital twin models for dams","authors":"Eduardo R. Conde López, Miguel Ángel Toledo Municio, Eduardo Salete Casino","doi":"10.1002/cmm4.1205","DOIUrl":"10.1002/cmm4.1205","url":null,"abstract":"<p>Dam safety is a relevant aspect in our society due to the importance of its functions (power generation, water supply, lamination of floods) and due to the potentially catastrophic consequences of a serious breakdown or breakage. Dam safety analyses are fundamentally based on behavior models, which are idealizations of the dam-foundation that allow us to calculate the dam's response to a certain combination of actions. The comparison of this response with the real one, measured by the auscultation or survey devices, is the main element to determine the safety status of the structure. To improve this analysis, it is necessary to increase the accuracy of the numerical models obtaining a digital twin that allows knowing, in a faithful way, how the structure is going to work in normal and extreme situations.</p>","PeriodicalId":100308,"journal":{"name":"Computational and Mathematical Methods","volume":"3 6","pages":""},"PeriodicalIF":0.0,"publicationDate":"2021-10-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1002/cmm4.1205","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82586682","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}
Stefano Nardean, Massimiliano Ferronato, Ahmad S. Abushaikha
In this work, we present an original block preconditioner to improve the convergence of Krylov solvers for the simulation of two-phase flow in porous media. In our modeling approach, the set of coupled governing equations is addressed in a fully implicit fashion, where Darcy's law and mass conservation are discretized in an original way by combining the mixed hybrid finite element (MHFE) and the finite volume (FV) methods. The solution to the sequence of large-size nonsymmetric linearized systems of equations that stem during a full-transient simulation represents the most time and resource consuming task, thus motivating the need for efficient preconditioned Krylov solvers. The proposed preconditioner exploits the block structure of the Jacobian matrix while coping with the nonsymmetric nature of the individual blocks. Both academic and realistic applications have been used to challenge the preconditioner, allowing to point out its robustness, stability and overall computational efficiency.
{"title":"A block preconditioner for two-phase flow in porous media by mixed hybrid finite elements","authors":"Stefano Nardean, Massimiliano Ferronato, Ahmad S. Abushaikha","doi":"10.1002/cmm4.1207","DOIUrl":"10.1002/cmm4.1207","url":null,"abstract":"<p>In this work, we present an original block preconditioner to improve the convergence of Krylov solvers for the simulation of two-phase flow in porous media. In our modeling approach, the set of coupled governing equations is addressed in a fully implicit fashion, where Darcy's law and mass conservation are discretized in an original way by combining the mixed hybrid finite element (MHFE) and the finite volume (FV) methods. The solution to the sequence of large-size nonsymmetric linearized systems of equations that stem during a full-transient simulation represents the most time and resource consuming task, thus motivating the need for efficient preconditioned Krylov solvers. The proposed preconditioner exploits the block structure of the Jacobian matrix while coping with the nonsymmetric nature of the individual blocks. Both academic and realistic applications have been used to challenge the preconditioner, allowing to point out its robustness, stability and overall computational efficiency.</p>","PeriodicalId":100308,"journal":{"name":"Computational and Mathematical Methods","volume":"3 6","pages":""},"PeriodicalIF":0.0,"publicationDate":"2021-10-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1002/cmm4.1207","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79000846","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}
Big data mining is related to large-scale data analysis and faces computational cost-related challenges due to the exponential growth of digital technologies. Classical data mining algorithms suffer from computational deficiency, memory utilization, resource optimization, scale-up, and speed-up related challenges in big data mining. Sampling is one of the most effective data reduction techniques that reduces the computational cost, improves scalability and computational speed with high efficiency for any data mining algorithm in single and multiple machine execution environments. This study suggested a Euclidean distance-based stratum method for stratum creation and a stratified random sampling-based big data mining model using the K-Means clustering (SSK-Means) algorithm in a single machine execution environment. The performance of the SSK-Means algorithm has achieved better cluster quality, speed-up, scale-up, and memory utilization against the random sampling-based K-Means and classical K-Means algorithms using silhouette coefficient, Davies Bouldin index, Calinski Harabasz index, execution time, and speedup ratio internal measures.
{"title":"Euclidean distance stratified random sampling based clustering model for big data mining","authors":"Kamlesh Kumar Pandey, Diwakar Shukla","doi":"10.1002/cmm4.1206","DOIUrl":"10.1002/cmm4.1206","url":null,"abstract":"<p>Big data mining is related to large-scale data analysis and faces computational cost-related challenges due to the exponential growth of digital technologies. Classical data mining algorithms suffer from computational deficiency, memory utilization, resource optimization, scale-up, and speed-up related challenges in big data mining. Sampling is one of the most effective data reduction techniques that reduces the computational cost, improves scalability and computational speed with high efficiency for any data mining algorithm in single and multiple machine execution environments. This study suggested a Euclidean distance-based stratum method for stratum creation and a stratified random sampling-based big data mining model using the K-Means clustering (SSK-Means) algorithm in a single machine execution environment. The performance of the SSK-Means algorithm has achieved better cluster quality, speed-up, scale-up, and memory utilization against the random sampling-based K-Means and classical K-Means algorithms using silhouette coefficient, Davies Bouldin index, Calinski Harabasz index, execution time, and speedup ratio internal measures.</p>","PeriodicalId":100308,"journal":{"name":"Computational and Mathematical Methods","volume":"3 6","pages":""},"PeriodicalIF":0.0,"publicationDate":"2021-10-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1002/cmm4.1206","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77407540","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}