Abstract
This article is devoted to the numerical computation of distributed null controls for the 1D heat equation. The goal is to compute a control that drives (a numerical approximation of) the solution from a prescribed initial state exactly to zero. We extend the earlier contribution of Carthel, Glowinski, and Lions, which is devoted to the computation of controls of minimal square-integrable norm. We start from some constrained extremal problems (involving unbounded weights in time), introduced by Fursikov and Imanuvilov, and we apply appropriate duality techniques. Then, we provide numerical approximations of the associated dual problems, and apply conjugate gradient algorithms. Finally, several experiments are presented, and we highlight the influence of the weights and analyze this approach in terms of robustness and efficiency. Also, the results are compared with others in a previous article of the authors, where primal methods were considered.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
