SwePub
Sök i LIBRIS databas

  Extended search

onr:"swepub:oai:DiVA.org:liu-76798"
 

Search: onr:"swepub:oai:DiVA.org:liu-76798" > Monotonicity recove...

  • 1 of 1
  • Previous record
  • Next record
  •    To hitlist

Monotonicity recovering and accuracy preserving optimization methods for postprocessing finite element solutions

Burdakov, Oleg (author)
Linköpings universitet,Optimeringslära,Tekniska högskolan
Kapyrin, Ivan (author)
Russian Academy of Science
Vassilevski, Yuri (author)
Russian Academy of Science
 (creator_code:org_t)
Elsevier, 2012
2012
English.
In: Journal of Computational Physics. - : Elsevier. - 0021-9991 .- 1090-2716. ; 231:8, s. 3126-3142
  • Journal article (peer-reviewed)
Abstract Subject headings
Close  
  • We suggest here a least-change correction to available finite element (FE) solution. This postprocessing procedure is aimed at recovering the monotonicity and some other important properties that may not be exhibited by the FE solution. Although our approach is presented for FEs, it admits natural extension to other numerical schemes, such as finite differences and finite volumes. For the postprocessing, a priori information about the monotonicity is assumed to be available, either for the whole domain or for a subdomain where the lost monotonicity is to be recovered. The obvious requirement is that such information is to be obtained without involving the exact solution, e.g. from expected symmetries of this solution. less thanbrgreater than less thanbrgreater thanThe postprocessing is based on solving a monotonic regression problem with some extra constraints. One of them is a linear equality-type constraint that models the conservativity requirement. The other ones are box-type constraints, and they originate from the discrete maximum principle. The resulting postprocessing problem is a large scale quadratic optimization problem. It is proved that the postprocessed FE solution preserves the accuracy of the discrete FE approximation. less thanbrgreater than less thanbrgreater thanWe introduce an algorithm for solving the postprocessing problem. It can be viewed as a dual ascent method based on the Lagrangian relaxation of the equality constraint. We justify theoretically its correctness. Its efficiency is demonstrated by the presented results of numerical experiments.

Keyword

Finite element solution
Accuracy analysis
Constrained monotonic regression
Large scale quadratic optimization
Lagrangian relaxation
Dual ascent method
MATHEMATICS
MATEMATIK

Publication and Content Type

ref (subject category)
art (subject category)

Find in a library

To the university's database

  • 1 of 1
  • Previous record
  • Next record
  •    To hitlist

Find more in SwePub

By the author/editor
Burdakov, Oleg
Kapyrin, Ivan
Vassilevski, Yur ...
Articles in the publication
Journal of Compu ...
By the university
Linköping University

Search outside SwePub

Kungliga biblioteket hanterar dina personuppgifter i enlighet med EU:s dataskyddsförordning (2018), GDPR. Läs mer om hur det funkar här.
Så här hanterar KB dina uppgifter vid användning av denna tjänst.

 
pil uppåt Close

Copy and save the link in order to return to this view