Skip to content
  • Publications
  • Jobs
  • enzuazua
  • Seminars
  • Events Calendar
  • Home
  • About us
    • About the Chair
    • Head of the Chair
    • Team
    • Past Members
  • Research
    • Projects
    • ERC – DyCon
    • DyCon Blog
    • DyCon Toolbox
    • Industrial & Social TransferenceContents related to the industrial and social transference aspects of the work in the Chair of Computational Mathematics.
  • Publications
    • Publications (All)
    • Publications Relased
      • Publications 2022
      • Publications 2021
      • Publications 2020
      • Publications 2019
      • Publications 2018
      • Publications 2017
      • Publications 2016
    • AcceptedAccepted to be released
    • SubmittedSubmitted publications
  • Activities
    • Events calendar
    • Past Events
    • News
    • Seminars
    • Courses
    • enzuazua
    • Gallery
  • Jobs
  • Contact

Analysis and numerics solvability of backward-forward conservation laws

Thibault Liard, Enrique Zuazua. Analysis and numerics solvability of backward-forward conservation laws. (2020)

Abstract. In this paper, we study the problem of initial data identification for the one-dimensional Burgers equation. This problem consists in identifying the set of initial data evolving to a given target at a final time. Due to the time-irreversibility of the Burgers equation, some target functions are unattainable from solutions of this equation, making the inverse problem under consideration ill-posed. To get around this issue, we introduce a non-smooth optimization problem which consists in minimizing the difference between the predictions of the Burgers equation and the observations of the system at a final time in L2(R) norm. The two main contributions of this work are as follows.
• We fully characterize the set of minimizers of the aforementioned non-smooth optimization problem.
• A wave-front tracking method is implemented to construct numerically all of them.
One of minimizers is the backward entropy solution, constructed using a backward-forward method.

Read Full Paper

Tags:
Backward-forward methodConservation LawsIdentification problemsNon-smooth optimization problemWave-front tracking algorithmWeak-entropy solutions
Last updated on March 17, 2022

Post navigation

Previous Post
Turnpike Control and Deep Learning by Enrique Zuazua Turnpike Control and Deep Learning by Enrique Zuazua
Next Post
CCM – How we did it on 2020! CCM – How we did it on 2020!

Last Publications

Greedy search of optimal approximate solutions

Control of reaction-diffusion models in biology and social sciences

The turnpike property and the longtime behavior of the Hamilton-Jacobi-Bellman equation for finite-dimensional LQ control problems

Optimal actuator design via Brunovsky’s normal form

Turnpike in Optimal Control PDES, ResNets, and beyond

  • Greedy search of optimal approximate solutions
  • Control of reaction-diffusion models in biology and social sciences
  • DeustoCCMSeminar: Null controllability of a nonlinear age, space and two-sex structured population dynamics model
  • Optimal actuator design via Brunovsky’s normal form
  • Turnpike in Optimal Control PDES, ResNets, and beyond
  • Greedy search of optimal approximate solutions
  • Control of reaction-diffusion models in biology and social sciences
  • DeustoCCMSeminar: Null controllability of a nonlinear age, space and two-sex structured population dynamics model
  • Optimal actuator design via Brunovsky’s normal form
  • Turnpike in Optimal Control PDES, ResNets, and beyond
Copyright 2016 - 2022 — . All rights reserved. Chair of Computational Mathematics, Deusto Foundation - University of Deusto
Scroll to Top
  • Aviso Legal
  • Política de Privacidad
  • Política de Cookies
  • Configuración de Cookies
WE USE COOKIES ON THIS SITE TO ENHANCE USER EXPERIENCE. We also use analytics. By navigating any page you are giving your consent for us to set cookies.    more information
Privacidad