Papers
Topics
Authors
Recent
2000 character limit reached

Landweber-Kaczmarz for parameter identification in time-dependent inverse problems: All-at-once versus Reduced version (1901.10715v1)

Published 30 Jan 2019 in math.AP and math.DS

Abstract: In this study, we consider a general time-space system, whose model operator and observation operator are locally Lipschitz continuous, over a finite time horizon and parameter identification by using Landweber-Kaczmarz regularization. The problem is investigated in two different modeling settings: An All-at-once and a Reduced version, together with two observation scenarios: continuous and discrete observations. Segmenting the time line into several subintervals leads to the idea of applying the Kaczmarz method. A loping strategy is incorporated into the method to yield the loping Landweber-Kaczmarz iteration.

Summary

We haven't generated a summary for this paper yet.

Whiteboard

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

Collections

Sign up for free to add this paper to one or more collections.