耦合振子的代数度

IF 1.5 1区 数学 Q1 MATHEMATICS
Paul Breiding , Mateusz Michałek , Leonid Monin , Simon Telen
{"title":"耦合振子的代数度","authors":"Paul Breiding ,&nbsp;Mateusz Michałek ,&nbsp;Leonid Monin ,&nbsp;Simon Telen","doi":"10.1016/j.aim.2025.110492","DOIUrl":null,"url":null,"abstract":"<div><div>Approximating periodic solutions to the coupled Duffing equations amounts to solving a system of polynomial equations. The number of complex solutions measures the algebraic complexity of this approximation problem. Using the theory of Khovanskii bases, we show that this number is given by the volume of a polytope. We also show how to compute all solutions using numerical nonlinear algebra.</div></div>","PeriodicalId":50860,"journal":{"name":"Advances in Mathematics","volume":"480 ","pages":"Article 110492"},"PeriodicalIF":1.5000,"publicationDate":"2025-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"The algebraic degree of coupled oscillators\",\"authors\":\"Paul Breiding ,&nbsp;Mateusz Michałek ,&nbsp;Leonid Monin ,&nbsp;Simon Telen\",\"doi\":\"10.1016/j.aim.2025.110492\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>Approximating periodic solutions to the coupled Duffing equations amounts to solving a system of polynomial equations. The number of complex solutions measures the algebraic complexity of this approximation problem. Using the theory of Khovanskii bases, we show that this number is given by the volume of a polytope. We also show how to compute all solutions using numerical nonlinear algebra.</div></div>\",\"PeriodicalId\":50860,\"journal\":{\"name\":\"Advances in Mathematics\",\"volume\":\"480 \",\"pages\":\"Article 110492\"},\"PeriodicalIF\":1.5000,\"publicationDate\":\"2025-08-22\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Advances in Mathematics\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0001870825003901\",\"RegionNum\":1,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"MATHEMATICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Advances in Mathematics","FirstCategoryId":"100","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0001870825003901","RegionNum":1,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 0

摘要

近似耦合Duffing方程的周期解相当于求解一个多项式方程组。复数解的数量衡量了这个近似问题的代数复杂性。利用Khovanskii基理论,我们证明了这个数是由多面体的体积给出的。我们还展示了如何使用数值非线性代数计算所有解。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
The algebraic degree of coupled oscillators
Approximating periodic solutions to the coupled Duffing equations amounts to solving a system of polynomial equations. The number of complex solutions measures the algebraic complexity of this approximation problem. Using the theory of Khovanskii bases, we show that this number is given by the volume of a polytope. We also show how to compute all solutions using numerical nonlinear algebra.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Advances in Mathematics
Advances in Mathematics 数学-数学
CiteScore
2.80
自引率
5.90%
发文量
497
审稿时长
7.5 months
期刊介绍: Emphasizing contributions that represent significant advances in all areas of pure mathematics, Advances in Mathematics provides research mathematicians with an effective medium for communicating important recent developments in their areas of specialization to colleagues and to scientists in related disciplines.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信