Sammanfattning
The utility of Dune-ACFem is demonstrated to work well for solving a non-smooth minimization problem over bounded variation functions by implementing a primal-dual algorithm. The implementation is based on the simplification provided by Dune-ACFem. Moreover, the convergence of the discrete minimizer to the continuous one is shown theoretically.
Originalspråk | engelska |
---|---|
Tidskrift | Archive of Numerical Software |
Volym | 5 |
Nummer | 1 |
DOI | |
Status | Published - 2017 apr. 3 |
Externt publicerad | Ja |
Ämnesklassifikation (UKÄ)
- Beräkningsmatematik