RUS  ENG
Full version
JOURNALS // Vestnik Yuzhno-Ural'skogo Gosudarstvennogo Universiteta. Seriya "Matematika. Mekhanika. Fizika" // Archive

Vestn. Yuzhno-Ural. Gos. Un-ta. Ser. Matem. Mekh. Fiz., 2025 Volume 17, Issue 4, Pages 5–9 (Mi vyurm652)

Mathematics

Algorithms for calculating eigenvalues of initial boundary value problems defined on connected graphs with changing edges

S. I. Kadchenko

Nosov Magnitogorsk State Technical University, Magnitogorsk, Russian Federation

Abstract: The development of new technologies in science and engineering has led to a need for mathematical methods to efficiently calculate the eigenvalues of partial differential operators on graphs with time-varying geometric parameters. The paper presents algorithms developed using the example of canonical parabolic partial differential equations to compute their eigenvalues. The analytical formulas obtained from these algorithms can approximate the eigenvalues at specific time points.

Keywords: initial-boundary value problems, connected graphs, eigenvalues and eigenfunctions of operators, discrete and semi-bounded operators, Galerkin method, regularized trace method.

UDC: 517.642.8

Received: 09.10.2025

DOI: 10.14529/mmph250401



© Steklov Math. Inst. of RAS, 2026