利用混合深度网络预测Lotka‐Volterra方程的解

IF 3.2 3区 工程技术 Q2 MECHANICS Theoretical and Applied Mechanics Letters Pub Date : 2022-11-01 DOI:10.1016/j.taml.2022.100384
Zi-Fei Lin , Yan-Ming Liang , Jia-Li Zhao , Jiao-Rui Li
{"title":"利用混合深度网络预测Lotka‐Volterra方程的解","authors":"Zi-Fei Lin ,&nbsp;Yan-Ming Liang ,&nbsp;Jia-Li Zhao ,&nbsp;Jiao-Rui Li","doi":"10.1016/j.taml.2022.100384","DOIUrl":null,"url":null,"abstract":"<div><p>Prediction of Lotka-Volterra equations has always been a complex problem due to their dynamic properties. In this paper, we present an algorithm for predicting the Lotka-Volterra equation and investigate the prediction for both the original system and the system driven by noise. This demonstrates that deep learning can be applied in dynamics of population. This is the first study that uses deep learning algorithms to predict Lotka-Volterra equations. Several numerical examples are presented to illustrate the performances of the proposed algorithm, including Predator nonlinear breeding and prey competition systems, one prey and two predator competition systems, and their respective systems. All the results suggest that the proposed algorithm is feasible and effective for predicting Lotka-Volterra equations. Furthermore, the influence of the optimizer on the algorithm is discussed in detail. These results indicate that the performance of the machine learning technique can be improved by constructing the neural networks appropriately.</p></div>","PeriodicalId":46902,"journal":{"name":"Theoretical and Applied Mechanics Letters","volume":null,"pages":null},"PeriodicalIF":3.2000,"publicationDate":"2022-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S2095034922000642/pdfft?md5=206b18bf31ec90ab00a5aa32543d0d0b&pid=1-s2.0-S2095034922000642-main.pdf","citationCount":"6","resultStr":"{\"title\":\"Predicting solutions of the Lotka‐Volterra equation using hybrid deep network\",\"authors\":\"Zi-Fei Lin ,&nbsp;Yan-Ming Liang ,&nbsp;Jia-Li Zhao ,&nbsp;Jiao-Rui Li\",\"doi\":\"10.1016/j.taml.2022.100384\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>Prediction of Lotka-Volterra equations has always been a complex problem due to their dynamic properties. In this paper, we present an algorithm for predicting the Lotka-Volterra equation and investigate the prediction for both the original system and the system driven by noise. This demonstrates that deep learning can be applied in dynamics of population. This is the first study that uses deep learning algorithms to predict Lotka-Volterra equations. Several numerical examples are presented to illustrate the performances of the proposed algorithm, including Predator nonlinear breeding and prey competition systems, one prey and two predator competition systems, and their respective systems. All the results suggest that the proposed algorithm is feasible and effective for predicting Lotka-Volterra equations. Furthermore, the influence of the optimizer on the algorithm is discussed in detail. These results indicate that the performance of the machine learning technique can be improved by constructing the neural networks appropriately.</p></div>\",\"PeriodicalId\":46902,\"journal\":{\"name\":\"Theoretical and Applied Mechanics Letters\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":3.2000,\"publicationDate\":\"2022-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://www.sciencedirect.com/science/article/pii/S2095034922000642/pdfft?md5=206b18bf31ec90ab00a5aa32543d0d0b&pid=1-s2.0-S2095034922000642-main.pdf\",\"citationCount\":\"6\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Theoretical and Applied Mechanics Letters\",\"FirstCategoryId\":\"5\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S2095034922000642\",\"RegionNum\":3,\"RegionCategory\":\"工程技术\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"MECHANICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Theoretical and Applied Mechanics Letters","FirstCategoryId":"5","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S2095034922000642","RegionNum":3,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"MECHANICS","Score":null,"Total":0}
引用次数: 6

摘要

由于Lotka-Volterra方程的动力学性质,其预测一直是一个复杂的问题。本文提出了一种预测Lotka-Volterra方程的算法,并对原始系统和受噪声驱动的系统进行了预测。这表明深度学习可以应用于人口动态。这是第一个使用深度学习算法来预测Lotka-Volterra方程的研究。本文给出了几个数值例子来说明该算法的性能,包括捕食者非线性繁殖和猎物竞争系统、一个猎物和两个捕食者竞争系统以及它们各自的系统。结果表明,该算法对Lotka-Volterra方程的预测是可行和有效的。此外,还详细讨论了优化器对算法的影响。这些结果表明,通过适当构造神经网络可以提高机器学习技术的性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Predicting solutions of the Lotka‐Volterra equation using hybrid deep network

Prediction of Lotka-Volterra equations has always been a complex problem due to their dynamic properties. In this paper, we present an algorithm for predicting the Lotka-Volterra equation and investigate the prediction for both the original system and the system driven by noise. This demonstrates that deep learning can be applied in dynamics of population. This is the first study that uses deep learning algorithms to predict Lotka-Volterra equations. Several numerical examples are presented to illustrate the performances of the proposed algorithm, including Predator nonlinear breeding and prey competition systems, one prey and two predator competition systems, and their respective systems. All the results suggest that the proposed algorithm is feasible and effective for predicting Lotka-Volterra equations. Furthermore, the influence of the optimizer on the algorithm is discussed in detail. These results indicate that the performance of the machine learning technique can be improved by constructing the neural networks appropriately.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
CiteScore
6.20
自引率
2.90%
发文量
545
审稿时长
12 weeks
期刊介绍: An international journal devoted to rapid communications on novel and original research in the field of mechanics. TAML aims at publishing novel, cutting edge researches in theoretical, computational, and experimental mechanics. The journal provides fast publication of letter-sized articles and invited reviews within 3 months. We emphasize highlighting advances in science, engineering, and technology with originality and rapidity. Contributions include, but are not limited to, a variety of topics such as: • Aerospace and Aeronautical Engineering • Coastal and Ocean Engineering • Environment and Energy Engineering • Material and Structure Engineering • Biomedical Engineering • Mechanical and Transportation Engineering • Civil and Hydraulic Engineering Theoretical and Applied Mechanics Letters (TAML) was launched in 2011 and sponsored by Institute of Mechanics, Chinese Academy of Sciences (IMCAS) and The Chinese Society of Theoretical and Applied Mechanics (CSTAM). It is the official publication the Beijing International Center for Theoretical and Applied Mechanics (BICTAM).
期刊最新文献
A New Cyclic Cohesive Zone Model for Fatigue Damage Analysis of Welded Vessel Numerical Study of Flow and Thermal Characteristics of Pulsed Impinging Jet on a Dimpled Surface Constrained re-calibration of two-equation Reynolds-averaged Navier–Stokes models Magnetically-actuated Intracorporeal Biopsy Robot Based on Kresling Origami A New Strain-Based Pentagonal Membrane Finite Element for Solid Mechanics Problems
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1