一类Dirichlet边值问题的分岔曲线

Huizeng Qin, Youmin Lu
{"title":"一类Dirichlet边值问题的分岔曲线","authors":"Huizeng Qin, Youmin Lu","doi":"10.1155/2022/2941463","DOIUrl":null,"url":null,"abstract":"<jats:p>We study the Dirichlet boundary value problem <jats:inline-formula>\n <math xmlns=\"http://www.w3.org/1998/Math/MathML\" id=\"M1\">\n <mfenced open=\"{\" close=\"\" separators=\"|\">\n <mtable class=\"cases\">\n <mtr>\n <mtd>\n <msup>\n <mrow>\n <mi>u</mi>\n </mrow>\n <mrow>\n <mo>″</mo>\n </mrow>\n </msup>\n <mfenced open=\"(\" close=\")\" separators=\"|\">\n <mrow>\n <mi>t</mi>\n </mrow>\n </mfenced>\n <mo>+</mo>\n <mi>λ</mi>\n <mi>f</mi>\n <mfenced open=\"(\" close=\")\" separators=\"|\">\n <mrow>\n <mi>u</mi>\n <mrow>\n <mfenced open=\"(\" close=\")\" separators=\"|\">\n <mrow>\n <mi>t</mi>\n </mrow>\n </mfenced>\n </mrow>\n </mrow>\n </mfenced>\n <mo>=</mo>\n <mn>0</mn>\n <mo>,</mo>\n <mo>−</mo>\n <mn>1</mn>\n <mo><</mo>\n <mi>t</mi>\n <mo><</mo>\n <mn>1</mn>\n <mo>,</mo>\n </mtd>\n </mtr>\n <mtr>\n <mtd>\n <mi>u</mi>\n <mfenced open=\"(\" close=\")\" separators=\"|\">\n <mrow>\n <mo>−</mo>\n <mn>1</mn>\n </mrow>\n </mfenced>\n <mo>=</mo>\n <mi>u</mi>\n <mfenced open=\"(\" close=\")\" separators=\"|\">\n <mrow>\n <mn>1</mn>\n </mrow>\n </mfenced>\n <mo>=</mo>\n <mn>0</mn>\n <mo>,</mo>\n </mtd>\n </mtr>\n </mtable>\n </mfenced>\n </math>\n </jats:inline-formula> generally and develop a schema for determining the relationship between the values of its parameters and the number of positive solutions. Then, we focus our attention on the special cases when <jats:inline-formula>\n <math xmlns=\"http://www.w3.org/1998/Math/MathML\" id=\"M2\">\n <mi>f</mi>\n <mfenced open=\"(\" close=\")\" separators=\"|\">\n <mrow>\n <mi>u</mi>\n </mrow>\n </mfenced>\n <mo>=</mo>\n <mfenced open=\"(\" close=\")\" separators=\"|\">\n <mrow>\n <mi>σ</mi>\n <mo>−</mo>\n <mi>u</mi>\n </mrow>\n </mfenced>\n <mi mathvariant=\"normal\">exp</mi>\n <mfenced open=\"(\" close=\")\" separators=\"|\">\n <mrow>\n <mrow>\n <mrow>\n <mo>−</mo>\n <mi>K</mi>\n </mrow>\n <mo>/</mo>\n <mrow>\n <mfenced open=\"(\" close=\")\" separators=\"|\">\n <mrow>\n <mn>1</mn>\n <mo>+</mo>\n <mi>u</mi>\n </mrow>\n </mfenced>\n </mrow>\n </mrow>\n </mrow>\n </mfenced>\n </math>\n </jats:inline-formula> and <jats:inline-formula>\n <math xmlns=\"http://www.w3.org/1998/Math/MathML\" id=\"M3\">\n <mi>f</mi>\n <mfenced open=\"(\" close=\")\" separators=\"|\">\n <mrow>\n <mi>u</mi>\n </mrow>\n </mfenced>\n <mo>=</mo>\n <mstyle displaystyle=\"true\">\n <msubsup>\n <mo stretchy=\"false\">∏</mo>\n <mrow>\n <mi>i</mi>\n <mo>=</mo>\n <mn>1</mn>\n </mrow>\n <mi>m</mi>\n </msubsup>\n <mrow>\n <mfenced open=\"(\" close=\")\" separators=\"|\">\n <mrow>\n <msub>\n <mrow>\n <mi>a</mi>\n </mrow>\n <mrow>\n <mi>i</mi>\n </mrow>\n </msub>\n <mo>—</mo>\n <mi>u</mi>\n </mrow>\n </mfenced>\n </mrow>\n </mstyle>\n </math>\n </jats:inline-formula>, respectively. We prove first that all positive solutions of the first problem are less than or equal to <jats:inline-formula>\n <math xmlns=\"http://www.w3.org/1998/Math/MathML\" id=\"M4\">\n <mi>σ</mi>\n </math>\n </jats:inline-formula>, obtain more specific lower and upper bounds for these solutions, and compute a curve in the <jats:inline-formula>\n <math xmlns=\"http://www.w3.org/1998/Math/MathML\" id=\"M5\">\n <mi>σ</mi>\n <mi>K</mi>\n </math>\n </jats:inline-formula> -plane with accuracy up to <jats:inline-formula>\n <math xmlns=\"http://www.w3.org/1998/Math/MathML\" id=\"M6\">\n <msup>\n <mrow>\n <mn>10</mn>\n </mrow>\n <mrow>\n <mo>−</mo>\n <mn>6</mn>\n </mrow>\n </msup>\n </math>\n </jats:inline-formula>, below which the first problem has a unique positive solution and above which it has exactly three positive solutions. For the second problem, we determine its number of positive solutions and find a formula for the value of <jats:inline-formula>\n <math xmlns=\"http://www.w3.org/1998/Math/MathML\" id=\"M7\">\n <mi>λ</mi>\n </math>\n </jats:inline-formula> that separates the regions of <jats:inline-formula>\n <math xmlns=\"http://www.w3.org/1998/Math/MathML\" id=\"M8\">\n <mi>λ</mi>\n </math>\n </jats:inline-formula>, in which the problem has different numbers of solutions. We also computed the graphs for some special cases of the second problem, and the results are consistent with the existing results. Our code in Mathematica is available upon request.</jats:p>","PeriodicalId":301406,"journal":{"name":"Int. J. Math. Math. Sci.","volume":"83 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-10-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"The Bifurcation Curves of a Category of Dirichlet Boundary Value Problems\",\"authors\":\"Huizeng Qin, Youmin Lu\",\"doi\":\"10.1155/2022/2941463\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<jats:p>We study the Dirichlet boundary value problem <jats:inline-formula>\\n <math xmlns=\\\"http://www.w3.org/1998/Math/MathML\\\" id=\\\"M1\\\">\\n <mfenced open=\\\"{\\\" close=\\\"\\\" separators=\\\"|\\\">\\n <mtable class=\\\"cases\\\">\\n <mtr>\\n <mtd>\\n <msup>\\n <mrow>\\n <mi>u</mi>\\n </mrow>\\n <mrow>\\n <mo>″</mo>\\n </mrow>\\n </msup>\\n <mfenced open=\\\"(\\\" close=\\\")\\\" separators=\\\"|\\\">\\n <mrow>\\n <mi>t</mi>\\n </mrow>\\n </mfenced>\\n <mo>+</mo>\\n <mi>λ</mi>\\n <mi>f</mi>\\n <mfenced open=\\\"(\\\" close=\\\")\\\" separators=\\\"|\\\">\\n <mrow>\\n <mi>u</mi>\\n <mrow>\\n <mfenced open=\\\"(\\\" close=\\\")\\\" separators=\\\"|\\\">\\n <mrow>\\n <mi>t</mi>\\n </mrow>\\n </mfenced>\\n </mrow>\\n </mrow>\\n </mfenced>\\n <mo>=</mo>\\n <mn>0</mn>\\n <mo>,</mo>\\n <mo>−</mo>\\n <mn>1</mn>\\n <mo><</mo>\\n <mi>t</mi>\\n <mo><</mo>\\n <mn>1</mn>\\n <mo>,</mo>\\n </mtd>\\n </mtr>\\n <mtr>\\n <mtd>\\n <mi>u</mi>\\n <mfenced open=\\\"(\\\" close=\\\")\\\" separators=\\\"|\\\">\\n <mrow>\\n <mo>−</mo>\\n <mn>1</mn>\\n </mrow>\\n </mfenced>\\n <mo>=</mo>\\n <mi>u</mi>\\n <mfenced open=\\\"(\\\" close=\\\")\\\" separators=\\\"|\\\">\\n <mrow>\\n <mn>1</mn>\\n </mrow>\\n </mfenced>\\n <mo>=</mo>\\n <mn>0</mn>\\n <mo>,</mo>\\n </mtd>\\n </mtr>\\n </mtable>\\n </mfenced>\\n </math>\\n </jats:inline-formula> generally and develop a schema for determining the relationship between the values of its parameters and the number of positive solutions. Then, we focus our attention on the special cases when <jats:inline-formula>\\n <math xmlns=\\\"http://www.w3.org/1998/Math/MathML\\\" id=\\\"M2\\\">\\n <mi>f</mi>\\n <mfenced open=\\\"(\\\" close=\\\")\\\" separators=\\\"|\\\">\\n <mrow>\\n <mi>u</mi>\\n </mrow>\\n </mfenced>\\n <mo>=</mo>\\n <mfenced open=\\\"(\\\" close=\\\")\\\" separators=\\\"|\\\">\\n <mrow>\\n <mi>σ</mi>\\n <mo>−</mo>\\n <mi>u</mi>\\n </mrow>\\n </mfenced>\\n <mi mathvariant=\\\"normal\\\">exp</mi>\\n <mfenced open=\\\"(\\\" close=\\\")\\\" separators=\\\"|\\\">\\n <mrow>\\n <mrow>\\n <mrow>\\n <mo>−</mo>\\n <mi>K</mi>\\n </mrow>\\n <mo>/</mo>\\n <mrow>\\n <mfenced open=\\\"(\\\" close=\\\")\\\" separators=\\\"|\\\">\\n <mrow>\\n <mn>1</mn>\\n <mo>+</mo>\\n <mi>u</mi>\\n </mrow>\\n </mfenced>\\n </mrow>\\n </mrow>\\n </mrow>\\n </mfenced>\\n </math>\\n </jats:inline-formula> and <jats:inline-formula>\\n <math xmlns=\\\"http://www.w3.org/1998/Math/MathML\\\" id=\\\"M3\\\">\\n <mi>f</mi>\\n <mfenced open=\\\"(\\\" close=\\\")\\\" separators=\\\"|\\\">\\n <mrow>\\n <mi>u</mi>\\n </mrow>\\n </mfenced>\\n <mo>=</mo>\\n <mstyle displaystyle=\\\"true\\\">\\n <msubsup>\\n <mo stretchy=\\\"false\\\">∏</mo>\\n <mrow>\\n <mi>i</mi>\\n <mo>=</mo>\\n <mn>1</mn>\\n </mrow>\\n <mi>m</mi>\\n </msubsup>\\n <mrow>\\n <mfenced open=\\\"(\\\" close=\\\")\\\" separators=\\\"|\\\">\\n <mrow>\\n <msub>\\n <mrow>\\n <mi>a</mi>\\n </mrow>\\n <mrow>\\n <mi>i</mi>\\n </mrow>\\n </msub>\\n <mo>—</mo>\\n <mi>u</mi>\\n </mrow>\\n </mfenced>\\n </mrow>\\n </mstyle>\\n </math>\\n </jats:inline-formula>, respectively. We prove first that all positive solutions of the first problem are less than or equal to <jats:inline-formula>\\n <math xmlns=\\\"http://www.w3.org/1998/Math/MathML\\\" id=\\\"M4\\\">\\n <mi>σ</mi>\\n </math>\\n </jats:inline-formula>, obtain more specific lower and upper bounds for these solutions, and compute a curve in the <jats:inline-formula>\\n <math xmlns=\\\"http://www.w3.org/1998/Math/MathML\\\" id=\\\"M5\\\">\\n <mi>σ</mi>\\n <mi>K</mi>\\n </math>\\n </jats:inline-formula> -plane with accuracy up to <jats:inline-formula>\\n <math xmlns=\\\"http://www.w3.org/1998/Math/MathML\\\" id=\\\"M6\\\">\\n <msup>\\n <mrow>\\n <mn>10</mn>\\n </mrow>\\n <mrow>\\n <mo>−</mo>\\n <mn>6</mn>\\n </mrow>\\n </msup>\\n </math>\\n </jats:inline-formula>, below which the first problem has a unique positive solution and above which it has exactly three positive solutions. For the second problem, we determine its number of positive solutions and find a formula for the value of <jats:inline-formula>\\n <math xmlns=\\\"http://www.w3.org/1998/Math/MathML\\\" id=\\\"M7\\\">\\n <mi>λ</mi>\\n </math>\\n </jats:inline-formula> that separates the regions of <jats:inline-formula>\\n <math xmlns=\\\"http://www.w3.org/1998/Math/MathML\\\" id=\\\"M8\\\">\\n <mi>λ</mi>\\n </math>\\n </jats:inline-formula>, in which the problem has different numbers of solutions. We also computed the graphs for some special cases of the second problem, and the results are consistent with the existing results. Our code in Mathematica is available upon request.</jats:p>\",\"PeriodicalId\":301406,\"journal\":{\"name\":\"Int. J. Math. Math. Sci.\",\"volume\":\"83 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-10-06\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Int. J. Math. Math. Sci.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1155/2022/2941463\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Int. J. Math. Math. Sci.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1155/2022/2941463","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

然后,我们把注意力集中在f = σ - u exp的特殊情况上−K / 1 + uf =∏I = 1m a分别是I - u。首先证明了第一个问题的所有正解都小于等于σ,得到了这些解的更具体的下界和上界;在σ K -平面上计算曲线,精度可达10−6;在它下面,第一个问题有一个唯一的正解在它上面,正好有三个正解。对于第二个问题,我们确定其正解的个数,并找到λ值的公式,该公式将λ区域分开,其中问题具有不同数量的解。我们还计算了第二个问题的一些特殊情况的图,结果与已有的结果一致。我们在Mathematica中的代码可根据要求提供。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
The Bifurcation Curves of a Category of Dirichlet Boundary Value Problems
We study the Dirichlet boundary value problem u t + λ f u t = 0 , 1 < t < 1 , u 1 = u 1 = 0 , generally and develop a schema for determining the relationship between the values of its parameters and the number of positive solutions. Then, we focus our attention on the special cases when f u = σ u exp K / 1 + u and f u = i = 1 m a i u , respectively. We prove first that all positive solutions of the first problem are less than or equal to σ , obtain more specific lower and upper bounds for these solutions, and compute a curve in the σ K -plane with accuracy up to 10 6 , below which the first problem has a unique positive solution and above which it has exactly three positive solutions. For the second problem, we determine its number of positive solutions and find a formula for the value of λ that separates the regions of λ , in which the problem has different numbers of solutions. We also computed the graphs for some special cases of the second problem, and the results are consistent with the existing results. Our code in Mathematica is available upon request.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
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学术文献互助群
群 号:481959085
Book学术官方微信