Algorithms for Calculating Eigenvalues of Initial Boundary Value Problems Defined on Connected Graphs with Changing Edges

Authors

  • Sergey Ivanovic Kadchenko Nosov Magnitogorsk State Technical University, Magnitogorsk

DOI:

https://doi.org/10.14529/mmph250401

Keywords:

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

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.

Author Biography

Sergey Ivanovic Kadchenko, Nosov Magnitogorsk State Technical University, Magnitogorsk

Dr. Sc. (Physics and Mathematics), Professor, Applied Mathematics and Informatics Department

Published

2025-11-16

Issue

Section

Mathematics