Sammanfattning
Domain decomposition is one of the most efficient techniques to derive efficient methods for large-scale problems. In this chapter such decomposition methods for the minimization of the total variation are discussed. We differ between approaches which directly tackle the (primal) total variation minimization and approaches which deal with their predual formulation. Thereby we mainly concentrate on the presentation of domain decomposition methods which guarantee to converge to a solution of the global problem.
Originalspråk | engelska |
---|---|
Titel på värdpublikation | Handbook of Mathematical Models and Algorithms in Computer Vision and Imaging |
Redaktörer | Ke Chen, Carola-Bibiane Schönlieb, Xue-Cheng Tai, Laurent Younces |
Förlag | Springer |
ISBN (elektroniskt) | 978-3-030-03009-4 |
DOI | |
Status | Published - 2021 |
Ämnesklassifikation (UKÄ)
- Beräkningsmatematik