• Login
    View Item 
    •   Home
    • University of Alaska Fairbanks
    • UAF Graduate School
    • Mathematics and Statistics
    • View Item
    •   Home
    • University of Alaska Fairbanks
    • UAF Graduate School
    • Mathematics and Statistics
    • View Item
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    Browse

    All of Scholarworks@UACommunitiesPublication DateAuthorsTitlesSubjectsTypeThis CollectionPublication DateAuthorsTitlesSubjectsType

    My Account

    Login

    First Time Submitters, Register Here

    Register

    Statistics

    Display statistics

    Optimal control and inverse problems for partial differential equations and variational inequalities

    • CSV
    • RefMan
    • EndNote
    • BibTex
    • RefWorks
    Thumbnail
    Name:
    Sus_O_2025.pdf
    Size:
    2.383Mb
    Format:
    PDF
    Download
    Author
    Sus, Olha
    Chair
    Avdonin, Sergei
    Committee
    Berman, Leah
    Rhodes, John
    Rybkin, Alexei
    Keyword
    Inverse problems (Differential equations)
    Variational inequalities (Mathematics)
    Volterra operators
    Dirac equation
    Metadata
    Show full item record
    URI
    http://hdl.handle.net/11122/16274
    Abstract
    This dissertation addresses optimal control problems for nonlinear evolutionary variational inequalities involving Volterra-type operators and inverse problems for the Dirac system on finite metric graphs. The first part presents the historical background, novelty, and motivation behind the research studies. In the second part, we focus on solving the initial value problem for nonlinear evolutionary variational inequalities with Volterra-type operators, proving the existence of a unique solution using the Banach fixed-point theorem. The third part explores an optimal control problem for these inequalities, establishing the existence of a solution under specific assumptions on the given data. In the last part of the dissertation, we examine the inverse dynamic problem for the Dirac system on finite metric tree graphs, as well as a graph with a single cycle (a ring with two attached edges). First, we solve the forward problem for this system on general graphs using a novel dynamic algorithm and then address the inverse problem for the same system on finite metric tree graphs. We recover unknown data such as the topology (connectivity) of a tree, edge lengths, and matrix potential functions associated with each edge. This is achieved using the dynamic response operator as the inverse data and the leaf peeling method. We also determine the minimum time required to uniquely identify the unknown data. Finally, we demonstrate the solution to the inverse problem for the Dirac system on a ring with two attached edges, establishing the minimum time needed to uniquely determine the unknown parameters for this graph.
    Description
    Dissertation (Ph.D.) University of Alaska Fairbanks, 2025
    Table of Contents
    Chapter 1: General introduction -- Chapter 2: Evolutionary variational inequalities with volterra-type operators -- Chapter 3: Optimal control problems for evolutionary variational inequalities with volterra-type operators -- Chapter 4: Inverse dynamic problem for the Dirac system of finite metric graphs and the leaf peeling method -- Chapter 5: General conclusions.
    Date
    2025-08
    Type
    Dissertation
    Collections
    Mathematics and Statistics

    entitlement

     
    ABOUT US|HELP|BROWSE|ADVANCED SEARCH

    The University of Alaska is an affirmative action/equal opportunity employer, educational institution and provider and prohibits illegal discrimination against any individual.

    Learn more about UA’s notice of nondiscrimination.

    Open Repository is a service operated by 
    Atmire NV
     

    Export search results

    The export option will allow you to export the current search results of the entered query to a file. Different formats are available for download. To export the items, click on the button corresponding with the preferred download format.

    By default, clicking on the export buttons will result in a download of the allowed maximum amount of items.

    To select a subset of the search results, click "Selective Export" button and make a selection of the items you want to export. The amount of items that can be exported at once is similarly restricted as the full export.

    After making a selection, click one of the export format buttons. The amount of items that will be exported is indicated in the bubble next to export format.