{"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}
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 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.