Remote Access Mathematics of Computation
Green Open Access

Mathematics of Computation

ISSN 1088-6842(online) ISSN 0025-5718(print)

 
 

 

Flux identification for 1- $ {\mathbf d}$ scalar conservation laws in the presence of shocks


Authors: Carlos Castro and Enrique Zuazua
Journal: Math. Comp. 80 (2011), 2025-2070
MSC (2010): Primary 49J20; Secondary 90C31, 65K10
DOI: https://doi.org/10.1090/S0025-5718-2011-02465-8
Published electronically: March 22, 2011
MathSciNet review: 2813348
Full-text PDF

Abstract | References | Similar Articles | Additional Information

Abstract: We consider the problem of flux identification for 1-d scalar conservation laws formulating it as an optimal control problem. We introduce a new optimization strategy to compute numerical approximations of minimizing fluxes.

We first prove the existence of minimizers. We also prove the convergence of discrete minima obtained by means of monotone numerical approximation schemes, by a $ \Gamma$-convergence argument. Then we address the problem of developing efficient descent algorithms. We first consider and compare the existing two possible approaches. The first one, the so-called discrete approach, based on a direct computation of gradients in the discrete problem and the so-called continuous one, where the discrete descent direction is obtained as a discrete copy of the continuous one. When optimal solutions have shock discontinuities, both approaches produce highly oscillating minimizing sequences and the effective descent rate is very weak. As a remedy we adapt the method of alternating descent directions that uses the recent developments of generalized tangent vectors and the linearization around discontinuous solutions, introduced by the authors, in collaboration with F. Palacios, in the case where the control is the initial datum. This method distinguishes descent directions that move the shock and those that perturb the profile of the solution away from it. As we shall see, a suitable alternating combination of these two classes of descent directions allows building more efficient and faster descent algorithms.


References [Enhancements On Off] (What's this?)


Similar Articles

Retrieve articles in Mathematics of Computation with MSC (2010): 49J20, 90C31, 65K10

Retrieve articles in all journals with MSC (2010): 49J20, 90C31, 65K10


Additional Information

Carlos Castro
Affiliation: Departamento de Matemática e Informática, ETSI Caminos, Canales y Puertos, Universidad Politécnica de Madrid, 28040 Madrid, Spain.
Email: carlos.castro@upm.es

Enrique Zuazua
Affiliation: Basque Center for Applied Mathematics (BCAM), Bizkaia Technology Park, Building 500, E-48160 Derio, Basque Country, Spain – and – Ikerbasque, Basque Foundation for Science, E-48011 Bilbao, Basque Country, Spain
Email: zuazua@bcamath.org

DOI: https://doi.org/10.1090/S0025-5718-2011-02465-8
Keywords: Flux identification, 1-d scalar conservation laws, optimal control, numberical approximation, alternating descent method.
Received by editor(s): June 10, 2009
Received by editor(s) in revised form: July 12, 2010
Published electronically: March 22, 2011
Additional Notes: This work was supported by the Grant MTM2008-03541 of the MICINN (Spain).
Article copyright: © Copyright 2011 American Mathematical Society

American Mathematical Society