Computational and Mathematical Methods最新文献

筛选
英文 中文
Effect of Richardson number on stagnation point flow of double diffusive mixed convective slip flow of magnetohydrodynamic Casson fluid: A numerical study Richardson数对磁流体双扩散混合对流滑移流动驻点流动影响的数值研究
Computational and Mathematical Methods Pub Date : 2021-11-06 DOI: 10.1002/cmm4.1209
Mahantesh M. Nandeppanavar, Kemparaju M. Chandrashekhar, Raveendra Nagaraj
{"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,&nbsp;Kemparaju M. Chandrashekhar,&nbsp;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>&gt;</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}
引用次数: 1
Modeling epidemics by means of the stochastic description of complex systems 用复杂系统的随机描述方法建模流行病
Computational and Mathematical Methods Pub Date : 2021-10-25 DOI: 10.1002/cmm4.1208
Bruno Carbonaro
{"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}
引用次数: 2
Optimization of numerical models through instrumentation data integration: Digital twin models for dams 通过仪器数据集成优化数值模型:水坝的数字孪生模型
Computational and Mathematical Methods Pub Date : 2021-10-16 DOI: 10.1002/cmm4.1205
Eduardo R. Conde López, Miguel Ángel Toledo Municio, Eduardo Salete Casino
{"title":"Optimization of numerical models through instrumentation data integration: Digital twin models for dams","authors":"Eduardo R. Conde López,&nbsp;Miguel Ángel Toledo Municio,&nbsp;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}
引用次数: 2
A block preconditioner for two-phase flow in porous media by mixed hybrid finite elements 多孔介质中两相流的混合有限元块预调节器
Computational and Mathematical Methods Pub Date : 2021-10-16 DOI: 10.1002/cmm4.1207
Stefano Nardean, Massimiliano Ferronato, Ahmad S. Abushaikha
{"title":"A block preconditioner for two-phase flow in porous media by mixed hybrid finite elements","authors":"Stefano Nardean,&nbsp;Massimiliano Ferronato,&nbsp;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}
引用次数: 3
Euclidean distance stratified random sampling based clustering model for big data mining 基于欧氏距离分层随机抽样的大数据挖掘聚类模型
Computational and Mathematical Methods Pub Date : 2021-10-15 DOI: 10.1002/cmm4.1206
Kamlesh Kumar Pandey, Diwakar Shukla
{"title":"Euclidean distance stratified random sampling based clustering model for big data mining","authors":"Kamlesh Kumar Pandey,&nbsp;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}
引用次数: 3
Solving Eikonal equation in 2D and 3D by generalized finite difference method 用广义有限差分法求解二维和三维Eikonal方程
Computational and Mathematical Methods Pub Date : 2021-10-10 DOI: 10.1002/cmm4.1203
Eduardo Salete, Jesús Flores, Ángel García, Mihaela Negreanu, Antonio M. Vargas, Francisco Ureña
{"title":"Solving Eikonal equation in 2D and 3D by generalized finite difference method","authors":"Eduardo Salete,&nbsp;Jesús Flores,&nbsp;Ángel García,&nbsp;Mihaela Negreanu,&nbsp;Antonio M. Vargas,&nbsp;Francisco Ureña","doi":"10.1002/cmm4.1203","DOIUrl":"10.1002/cmm4.1203","url":null,"abstract":"<p>In this article we propose an implementation, for irregular cloud of points, of the meshless method called generalized finite difference method to solve the fully nonlinear Eikonal equation in 2D and 3D. We obtain the explicit formulas for derivatives and solve the system of nonlinear equations using the Newton–Raphson method to obtain the approximate numerical values of the function for the discretization of the domain. It is also shown that the approximation of the scheme used is of second order. Finally, we provide several examples of its application over irregular domains in order to test accuracy of the scheme, as well as comparison with order numerical methods.</p>","PeriodicalId":100308,"journal":{"name":"Computational and Mathematical Methods","volume":"3 6","pages":""},"PeriodicalIF":0.0,"publicationDate":"2021-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1002/cmm4.1203","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84622658","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
Pricing passport option using higher order compact scheme 使用高阶紧凑方案定价护照选项
Computational and Mathematical Methods Pub Date : 2021-10-10 DOI: 10.1002/cmm4.1204
Ankur Kanaujiya, Siddhartha P. Chakrabarty
{"title":"Pricing passport option using higher order compact scheme","authors":"Ankur Kanaujiya,&nbsp;Siddhartha P. Chakrabarty","doi":"10.1002/cmm4.1204","DOIUrl":"10.1002/cmm4.1204","url":null,"abstract":"<p>Higher order compact scheme (HOC) is used for pricing both European and American type passport option. We consider the problem for two different cases, namely, the symmetric case (which has a closed form solution) and the non-symmetric case. For the symmetric case HOC schemes result in slightly improved results as compared to the classical Crank–Nicolson implicit method, while still giving approximately second order convergence rate. In order to improve the convergence rate, grid stretching near zero accumulated wealth is introduced in the HOC schemes. The consequent higher order compact scheme with grid stretching gives better results with the rate of convergence being close to third order. For non-symmetric case we also observe similar results for both European and American type passport option. In absence of any analytic formula for the non-symmetric case, convergence rate was calculated using double-mesh differences.</p>","PeriodicalId":100308,"journal":{"name":"Computational and Mathematical Methods","volume":"3 6","pages":""},"PeriodicalIF":0.0,"publicationDate":"2021-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1002/cmm4.1204","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80500256","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
An asymptotic streamline diffusion finite element method for singularly perturbed convection-diffusion delay differential equations with point source 点源奇摄动对流-扩散时滞微分方程的渐近流线扩散有限元法
Computational and Mathematical Methods Pub Date : 2021-10-08 DOI: 10.1002/cmm4.1201
Senthilkumar Sethurathinam, Subburayan Veerasamy, Rameshbabu Arasamudi, Ravi P. Agarwal
{"title":"An asymptotic streamline diffusion finite element method for singularly perturbed convection-diffusion delay differential equations with point source","authors":"Senthilkumar Sethurathinam,&nbsp;Subburayan Veerasamy,&nbsp;Rameshbabu Arasamudi,&nbsp;Ravi P. Agarwal","doi":"10.1002/cmm4.1201","DOIUrl":"https://doi.org/10.1002/cmm4.1201","url":null,"abstract":"<p>In this article, we presented an asymptotic SDFEM for singularly perturbed convection diffusion type differential difference equations with point source term. First, the solution is decomposed into two functions, among them one is the solution of delay differential equation and other one is the solution of differential equation with point source. Furthermore, using the asymptotic expansion approximation, the delay differential equation is modified as a nondelay differential equations. Streamline diffusion finite element methods are applied to approximate the solutions of the two problems. We prove that the present method gives an almost second-order convergence in maximum norm and square integrable norm, whereas first-order convergence in <math>\u0000 <mrow>\u0000 <msup>\u0000 <mrow>\u0000 <mi>H</mi>\u0000 </mrow>\u0000 <mrow>\u0000 <mn>1</mn>\u0000 </mrow>\u0000 </msup>\u0000 </mrow></math> norm. Numerical results are presented to validate the theoretical results.</p>","PeriodicalId":100308,"journal":{"name":"Computational and Mathematical Methods","volume":"3 6","pages":""},"PeriodicalIF":0.0,"publicationDate":"2021-10-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1002/cmm4.1201","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"137812567","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
Cyclic generalized iterated function systems 循环广义迭代函数系统
Computational and Mathematical Methods Pub Date : 2021-10-04 DOI: 10.1002/cmm4.1202
Rajan Pasupathi, Arya Kumar Bedabrata Chand, María Antonia Navascués, María Victoria Sebastián
{"title":"Cyclic generalized iterated function systems","authors":"Rajan Pasupathi,&nbsp;Arya Kumar Bedabrata Chand,&nbsp;María Antonia Navascués,&nbsp;María Victoria Sebastián","doi":"10.1002/cmm4.1202","DOIUrl":"10.1002/cmm4.1202","url":null,"abstract":"&lt;p&gt;In this article, we introduce the notion of cyclic generalized iterated function system (GIFS), which is a family of functions &lt;math&gt;\u0000 &lt;mrow&gt;\u0000 &lt;msub&gt;\u0000 &lt;mrow&gt;\u0000 &lt;mi&gt;f&lt;/mi&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;mrow&gt;\u0000 &lt;mn&gt;1&lt;/mn&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;/msub&gt;\u0000 &lt;mo&gt;,&lt;/mo&gt;\u0000 &lt;msub&gt;\u0000 &lt;mrow&gt;\u0000 &lt;mi&gt;f&lt;/mi&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;mrow&gt;\u0000 &lt;mn&gt;2&lt;/mn&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;/msub&gt;\u0000 &lt;mo&gt;,&lt;/mo&gt;\u0000 &lt;mi&gt;…&lt;/mi&gt;\u0000 &lt;mo&gt;,&lt;/mo&gt;\u0000 &lt;msub&gt;\u0000 &lt;mrow&gt;\u0000 &lt;mi&gt;f&lt;/mi&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;mrow&gt;\u0000 &lt;mi&gt;M&lt;/mi&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;/msub&gt;\u0000 &lt;mo&gt;:&lt;/mo&gt;\u0000 &lt;msup&gt;\u0000 &lt;mrow&gt;\u0000 &lt;mi&gt;X&lt;/mi&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;mrow&gt;\u0000 &lt;mi&gt;k&lt;/mi&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;/msup&gt;\u0000 &lt;mo&gt;→&lt;/mo&gt;\u0000 &lt;mi&gt;X&lt;/mi&gt;\u0000 &lt;/mrow&gt;&lt;/math&gt;, where each &lt;math&gt;\u0000 &lt;mrow&gt;\u0000 &lt;msub&gt;\u0000 &lt;mrow&gt;\u0000 &lt;mi&gt;f&lt;/mi&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;mrow&gt;\u0000 &lt;mi&gt;i&lt;/mi&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;/msub&gt;\u0000 &lt;/mrow&gt;&lt;/math&gt; is a cyclic generalized &lt;math&gt;\u0000 &lt;mrow&gt;\u0000 &lt;mi&gt;φ&lt;/mi&gt;\u0000 &lt;/mrow&gt;&lt;/math&gt;-contraction (contractive) map on a collection of subsets &lt;math&gt;\u0000 &lt;mrow&gt;\u0000 &lt;msubsup&gt;\u0000 &lt;mrow&gt;\u0000 &lt;mo&gt;{&lt;/mo&gt;\u0000 &lt;msub&gt;\u0000 &lt;mrow&gt;\u0000 &lt;mi&gt;B&lt;/mi&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;mrow&gt;\u0000 &lt;mi&gt;j&lt;/mi&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;/msub&gt;\u0000 &lt;mo&gt;}&lt;/mo&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;mrow&gt;\u0000 &lt;mi&gt;j&lt;/mi&gt;\u0000 &lt;mo&gt;=&lt;/mo&gt;\u0000 &lt;mn&gt;1&lt;/mn&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;mrow&gt;\u0000 &lt;mi&gt;p&lt;/mi&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;/msubsup&gt;\u0000 &lt;/mrow&gt;&lt;/math&gt; of a complete metric space &lt;math&gt;\u0000 &lt;mrow&gt;\u0000 &lt;mo&gt;(&lt;/mo&gt;\u0000 &lt;mi&gt;X&lt;/mi&gt;\u0000 &lt;mo&gt;,&lt;/mo&gt;\u0000 &lt;mi&gt;d&lt;/mi&gt;\u0000 &lt;mo&gt;)&lt;/mo&gt;\u0000 &lt;/mrow&gt;&lt;/math&gt; respectively, and &lt;math&gt;\u0000 &lt;mrow&gt;\u0000 &lt;mi&gt;k&lt;/mi&gt;\u0000 &lt;mo&gt;,&lt;/mo&gt;\u0000 &lt;mi&gt;M&lt;/mi&gt;\u0000 &lt;mo&gt;,&lt;/mo&gt;\u0000 &lt;mi&gt;p&lt;/mi&gt;\u0000 &lt;/mrow&gt;&lt;/math&gt; are natural numbers. When &lt;math&gt;\u0000 &lt;mrow&gt;\u0000 &lt;msub&gt;\u0000 &lt;mrow&gt;\u0000 &lt;mi&gt;B&lt;/mi&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;mrow&gt;\u0000 &lt;mi&gt;j&lt;/mi&gt;\u0000 &lt;/mr","PeriodicalId":100308,"journal":{"name":"Computational and Mathematical Methods","volume":"3 6","pages":""},"PeriodicalIF":0.0,"publicationDate":"2021-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1002/cmm4.1202","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90098401","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
Evolution algebras whose evolution operator is a homomorphism 演化算子为同态的演化代数
Computational and Mathematical Methods Pub Date : 2021-09-30 DOI: 10.1002/cmm4.1200
Desamparados Fernández-Ternero, Víctor Manuel Gómez-Sousa, Juan Núñez-Valdés
{"title":"Evolution algebras whose evolution operator is a homomorphism","authors":"Desamparados Fernández-Ternero,&nbsp;Víctor Manuel Gómez-Sousa,&nbsp;Juan Núñez-Valdés","doi":"10.1002/cmm4.1200","DOIUrl":"10.1002/cmm4.1200","url":null,"abstract":"<p>This article deals with the evolution operator of evolution algebras. We give a theorem that allows to characterize these algebras when this operator is a homomorphism of algebras of rank <math>\u0000 <mrow>\u0000 <mi>n</mi>\u0000 <mo>−</mo>\u0000 <mn>2</mn>\u0000 </mrow></math> and this result in turn allows us to extend the classification of this type of algebras, given in a previous result by ourselves in 2021, up to the case of dimension 4. For this purpose, we analyze and make use of an algorithm for the degenerate case. A computational study of the procedure is also made.</p>","PeriodicalId":100308,"journal":{"name":"Computational and Mathematical Methods","volume":"3 6","pages":""},"PeriodicalIF":0.0,"publicationDate":"2021-09-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1002/cmm4.1200","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82876915","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
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学术官方微信