Determination of Stiffness Coefficients at the Internal Vertices of the Tree Based on a Finite Set of Eigenvalues of an Asymmetric Second-Order Linear Differential Operator

2025

Full text Open access: Gold Metadata (CSL-JSON)
DOI 10.3390/sym17081263
Data confidence 70 medium
How this score is calculated

It is built from checkable properties of the record itself: whether the article has a DOI, how many independent sources confirmed its data, whether the required fields are filled in, and how recent the latest confirmation is. Disagreement between sources and a missing identifier lower it. A value of 80 or above means the record was published without further checking; 60 to 79 means it is published at reduced confidence, with a manual check advisable. A record verified by an editor by hand is never pushed below 90 by a recalculation. This scores our data about the article, not the article itself.

Abstract

A second-order linear differential operator A is defined on a tree of arbitrary topology. Any internal vertex P of the tree divides the tree into mp branches. The restrictions Ai,i=1,…,mp of the operator A on each of these branches, where the vertex P is considered the root of the branch and the Dirichlet boundary condition is specified at the root. These restrictions must be, in a sense, asymmetric (not similar) to each other. Thus, the distinguished class of differential operators A turns out to have only simple eigenvalues. Moreover, the matching conditions at the internal vertices of the graph contain a set of parameters. These parameters are interpreted as stiffness coefficients. This paper proves that a finite set of eigenvalues allows one to uniquely restore the set of stiffness coefficients. The novelty of the work is the fact that it is sufficient to know a finite set of eigenvalues of intermediate Weinstein problems for uniquely restoring the required stiffness coefficients. We not only describe the results of selected studies but also compare them with each other and establish interconnections.