布图佐夫-涅菲多夫算法的投影器方法,用于寻找一类小步离散问题的渐近解

IF 0.7 4区 数学 Q3 MATHEMATICS, APPLIED
{"title":"布图佐夫-涅菲多夫算法的投影器方法,用于寻找一类小步离散问题的渐近解","authors":"","doi":"10.1134/s096554252401010x","DOIUrl":null,"url":null,"abstract":"<span> <h3>Abstract</h3> <p>V.F. Butuzov and N.N. Nefedov proposed an algorithm for constructing asymptotics with boundary functions of two types for solving a discrete initial value problem with a small step <span> <span>\\({{\\varepsilon }^{2}}\\)</span> </span> and a nonlinear term of order <span> <span>\\(\\varepsilon \\)</span> </span> in the critical case, i.e., when the degenerate equation with <span> <span>\\(\\varepsilon = 0\\)</span> </span> is not solvable uniquely for the unknown variable. In this paper, an asymptotic solution of the same problem is constructed by applying a new approach based on orthogonal projectors onto <span> <span>\\(\\ker (B(t) - I)\\)</span> </span> and <span> <span>\\(\\ker (B(t) - I){\\kern 1pt} '\\)</span> </span>, where <span> <span>\\(B(t)\\)</span> </span> is the matrix premultiplying the unknown variable in the linear part of the equation, <span> <span>\\(I\\)</span> </span> is the identity matrix of suitable size, and the prime denotes transposition. This approach considerably simplifies the understanding of the asymptotics-constructing algorithm and makes it possible to represent the problems of finding asymptotic terms of any order in explicit form, which is convenient for researchers applying asymptotic methods for real-world problems.</p> </span>","PeriodicalId":55230,"journal":{"name":"Computational Mathematics and Mathematical Physics","volume":"133 1","pages":""},"PeriodicalIF":0.7000,"publicationDate":"2024-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Projector Approach to the Butuzov–Nefedov Algorithm for Finding Asymptotic Solutions for a Class of Discrete Problems with a Small Step\",\"authors\":\"\",\"doi\":\"10.1134/s096554252401010x\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<span> <h3>Abstract</h3> <p>V.F. Butuzov and N.N. Nefedov proposed an algorithm for constructing asymptotics with boundary functions of two types for solving a discrete initial value problem with a small step <span> <span>\\\\({{\\\\varepsilon }^{2}}\\\\)</span> </span> and a nonlinear term of order <span> <span>\\\\(\\\\varepsilon \\\\)</span> </span> in the critical case, i.e., when the degenerate equation with <span> <span>\\\\(\\\\varepsilon = 0\\\\)</span> </span> is not solvable uniquely for the unknown variable. In this paper, an asymptotic solution of the same problem is constructed by applying a new approach based on orthogonal projectors onto <span> <span>\\\\(\\\\ker (B(t) - I)\\\\)</span> </span> and <span> <span>\\\\(\\\\ker (B(t) - I){\\\\kern 1pt} '\\\\)</span> </span>, where <span> <span>\\\\(B(t)\\\\)</span> </span> is the matrix premultiplying the unknown variable in the linear part of the equation, <span> <span>\\\\(I\\\\)</span> </span> is the identity matrix of suitable size, and the prime denotes transposition. This approach considerably simplifies the understanding of the asymptotics-constructing algorithm and makes it possible to represent the problems of finding asymptotic terms of any order in explicit form, which is convenient for researchers applying asymptotic methods for real-world problems.</p> </span>\",\"PeriodicalId\":55230,\"journal\":{\"name\":\"Computational Mathematics and Mathematical Physics\",\"volume\":\"133 1\",\"pages\":\"\"},\"PeriodicalIF\":0.7000,\"publicationDate\":\"2024-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Computational Mathematics and Mathematical Physics\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://doi.org/10.1134/s096554252401010x\",\"RegionNum\":4,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"MATHEMATICS, APPLIED\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computational Mathematics and Mathematical Physics","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1134/s096554252401010x","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"MATHEMATICS, APPLIED","Score":null,"Total":0}
引用次数: 0

摘要

摘要 布图佐夫(V.F. Butuzov)和涅费多夫(N.N. Nefedov)提出了一种算法,用于构建两种类型边界函数的渐近线,以求解离散初值问题,该问题在临界情况下具有小步({{\varepsilon }^{2}}\)和非线性阶项(\\varepsilon \)、的退化方程无法唯一求解未知变量时。在本文中,通过应用基于正交投影到 \(\ker (B(t) - I)\) 和 \(\ker (B(t) - I){\kern 1pt} '\) 的新方法,构建了同一问题的渐近解。其中,\(B(t)\)是方程线性部分中未知变量的预乘矩阵,\(I\)是适当大小的同一矩阵,质数表示转置。这种方法大大简化了对渐近构造算法的理解,并使得以显式形式表示寻找任意阶渐近项的问题成为可能,这为研究人员应用渐近方法解决实际问题提供了便利。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Projector Approach to the Butuzov–Nefedov Algorithm for Finding Asymptotic Solutions for a Class of Discrete Problems with a Small Step

Abstract

V.F. Butuzov and N.N. Nefedov proposed an algorithm for constructing asymptotics with boundary functions of two types for solving a discrete initial value problem with a small step \({{\varepsilon }^{2}}\) and a nonlinear term of order \(\varepsilon \) in the critical case, i.e., when the degenerate equation with \(\varepsilon = 0\) is not solvable uniquely for the unknown variable. In this paper, an asymptotic solution of the same problem is constructed by applying a new approach based on orthogonal projectors onto \(\ker (B(t) - I)\) and \(\ker (B(t) - I){\kern 1pt} '\) , where \(B(t)\) is the matrix premultiplying the unknown variable in the linear part of the equation, \(I\) is the identity matrix of suitable size, and the prime denotes transposition. This approach considerably simplifies the understanding of the asymptotics-constructing algorithm and makes it possible to represent the problems of finding asymptotic terms of any order in explicit form, which is convenient for researchers applying asymptotic methods for real-world problems.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Computational Mathematics and Mathematical Physics
Computational Mathematics and Mathematical Physics MATHEMATICS, APPLIED-PHYSICS, MATHEMATICAL
CiteScore
1.50
自引率
14.30%
发文量
125
审稿时长
4-8 weeks
期刊介绍: Computational Mathematics and Mathematical Physics is a monthly journal published in collaboration with the Russian Academy of Sciences. The journal includes reviews and original papers on computational mathematics, computational methods of mathematical physics, informatics, and other mathematical sciences. The journal welcomes reviews and original articles from all countries in the English or Russian language.
×
引用
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学术官方微信