Control problems for the wave and telegrapher's equations on metric graphs
Chair
Avdonin, Sergei A.Committee
Rhodes, John A.Rybkin, Alexei
Avdonina, Nina
Keyword
Differential equationsInverse problems
Wave equation
Linear differential equations
Partial differential equations
Quantum graphs
Metadata
Show full item recordAbstract
The dissertation focuses on control problems for the wave and telegrapher's equations on metric graphs. In the first part, an algorithm is constructed to solve the exact control problems on finite intervals. The algorithm is implemented numerically to solve the exact control problems on finite intervals. Moreover, we developed numerical algorithms for the solution of control problems on metric graphs based on the recent boundary controllability results of wave equations on metric graphs. We presented numerical solutions to shape control problems on quantum graphs. Specifically, we presented the results of numerical experiments involving a three-star graph. Our second part deals with the forward and control problems for the telegrapher's equations on metric graphs. We consider the forward problem on general graphs and develop an algorithm that solves equations with variable resistance, conductance, constant inductance, and constant capacitance. An algorithm is developed to solve the voltage and current control problems on a finite interval for constant inductance and capacitance, and variable resistance and conductance. Numerical results are also presented for this case. Finally, we consider the control problems for the telegrapher's equations on metric graphs. The control problem is considered on tree graphs, i.e. graphs without cycles, with some restrictions on the coefficients. Specifically, we consider equations with constant coefficients that do not depend on the edge. We obtained the necessary and sufficient conditions of the exact controllability and indicate the minimal control time.Description
Dissertation (Ph.D.) University of Alaska Fairbanks, 2022Table of Contents
Chapter 1: General introduction -- Chapter 2: Control problems for the wave equation on metric graphs -- Chapter 3: Forward problems for the telegrapher's equations on metric graphs -- Chapter 4: Control problems for the telegrapher's equations on metric graphs -- Chapter 5: Conclusions -- References.Date
2022-05Type
DissertationCollections
Related items
Showing items related by title, author, creator and subject.
-
Aboveground Biomass Equations for the Trees of Interior AlaskaCalculation of forest biomass requires the use of equations that relate the mass of a tree or it's components to physical measurements that are relatively easy to obtain. In the literature individual tree relationships have been reported that estimate aboveground biomass on individual sites (e.g. Barney and Van Cleve 1973)and over large landscape areas where many data sets are combined (Jenkins et al. 2003). The equations presented in this report represent a compilation of aboveground biomass data collected within interior Alaska over the past 40 years.
-
Linear partial differential equations and real analytic approximations of rough functionsMany common approximation methods exist such as linear or polynomial interpolation, splines, Taylor series, or generalized Fourier series. Unfortunately, many of these approximations are not analytic functions on the entire real line, and those that are diverge at infinity and therefore are only valid on a closed interval or for compactly supported functions. Our method takes advantage of the smoothing properties of certain linear partial differential equations to obtain an approximation which is real analytic, converges to the function on the entire real line, and yields particular conservation laws. This approximation method applies to any L₂ function on the real line which may have some rough behavior such as discontinuities or points of nondifferentiability. For comparison, we consider the well-known Fourier-Hermite series approximation. Finally, for some example functions the approximations are found and plotted numerically.
-
Magnus' expansion as an approximation tool for ordinary differential equationsMagnus' expansion approximates the solution of a linear, nonconstant-coefficient system of ordinary differential equations (ODEs) as the exponential of an infinite series of integrals of commutators of the matrix-valued coefficient function. It generalizes a standard technique for solving first-order, scalar, linear ODEs. However, much about the convergence of Magnus' expansion and its efficient computation is not known. This thesis describes in detail the derivation of Magnus' expansion and reviews Iserles' ordering for efficient calculation. Convergence of the expansion is explored and known convergence estimates are applied. Finally, Magnus' expansion is applied to several numerical examples, keeping track of convergence as it depends on parameters. These examples demonstrate the failure of current convergence estimates to correctly account for the degree of commutativity of the matrix-valued coefficient function.
