{"title":"寻找紧凑图上给定的扰动自联合算子的特征函数","authors":"S. N. Kakushkin","doi":"10.31040/2222-8349-2023-0-4-5-9","DOIUrl":null,"url":null,"abstract":"The substantiation of a numerical method for finding the eigenfunctions of perturbed self-adjoint operators given in a separable Hilbert space is considered. The method is adapted for problems given on finite connected oriented graphs with an arbitrary number of edges and vertices. The non-iterative numerical method is based on simple formulas using information about the spectral charac-teristics of an unperturbed operator and its perturbing operator. Approximation of the perturbed operator by a matrix is not required. As an example, the developed technique is applied to a perturbed spectral problem given on a three-edge graph of the \"star\" type. The results of a computational experiment conducted using a software package written in the Maple mathematical environment are presented.","PeriodicalId":220280,"journal":{"name":"Izvestia Ufimskogo Nauchnogo Tsentra RAN","volume":"38 32","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2023-12-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"FINDING EIGENFUNCTIONS OF PERTURBED SELF-ADJOINT OPERATORS GIVEN ON A COMPACT GRAPH\",\"authors\":\"S. N. Kakushkin\",\"doi\":\"10.31040/2222-8349-2023-0-4-5-9\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The substantiation of a numerical method for finding the eigenfunctions of perturbed self-adjoint operators given in a separable Hilbert space is considered. The method is adapted for problems given on finite connected oriented graphs with an arbitrary number of edges and vertices. The non-iterative numerical method is based on simple formulas using information about the spectral charac-teristics of an unperturbed operator and its perturbing operator. Approximation of the perturbed operator by a matrix is not required. As an example, the developed technique is applied to a perturbed spectral problem given on a three-edge graph of the \\\"star\\\" type. The results of a computational experiment conducted using a software package written in the Maple mathematical environment are presented.\",\"PeriodicalId\":220280,\"journal\":{\"name\":\"Izvestia Ufimskogo Nauchnogo Tsentra RAN\",\"volume\":\"38 32\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2023-12-07\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Izvestia Ufimskogo Nauchnogo Tsentra RAN\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.31040/2222-8349-2023-0-4-5-9\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Izvestia Ufimskogo Nauchnogo Tsentra RAN","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.31040/2222-8349-2023-0-4-5-9","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
摘要
本论文探讨了一种数值方法的可行性,该方法用于求出可分离的希尔伯特空间中给定的扰动自相关算子的特征函数。该方法适用于在具有任意数量的边和顶点的有限连接定向图上给出的问题。这种非迭代数值方法基于简单的公式,使用了未扰动算子及其扰动算子的谱特征信息。不需要用矩阵来逼近扰动算子。举例来说,我们将所开发的技术应用于在 "星 "型三边图上给出的扰动谱问题。本文介绍了使用 Maple 数学环境编写的软件包进行计算实验的结果。
FINDING EIGENFUNCTIONS OF PERTURBED SELF-ADJOINT OPERATORS GIVEN ON A COMPACT GRAPH
The substantiation of a numerical method for finding the eigenfunctions of perturbed self-adjoint operators given in a separable Hilbert space is considered. The method is adapted for problems given on finite connected oriented graphs with an arbitrary number of edges and vertices. The non-iterative numerical method is based on simple formulas using information about the spectral charac-teristics of an unperturbed operator and its perturbing operator. Approximation of the perturbed operator by a matrix is not required. As an example, the developed technique is applied to a perturbed spectral problem given on a three-edge graph of the "star" type. The results of a computational experiment conducted using a software package written in the Maple mathematical environment are presented.