Show simple item record

dc.contributor.authorHannukainen A.
dc.contributor.authorKorotov S.
dc.contributor.authorKřížek M.
dc.date.accessioned2017-02-21T08:19:29Z
dc.date.available2017-02-21T08:19:29Z
dc.date.issued2010-12-31
dc.identifier.issn0377-0427
dc.identifier.urihttp://hdl.handle.net/20.500.11824/636
dc.description.abstractWe examine a generalized conforming bisection (GCB-)algorithm which allows both global and local nested refinements of the triangulations without generating hanging nodes. It is based on the notion of a mesh density function which prescribes where and how much to refine the mesh. Some regularity properties of generated sequences of refined triangulations are proved. Several numerical tests demonstrate the efficiency of the proposed bisection algorithm. It is also shown how to modify the GCB-algorithm in order to generate anisotropic meshes with high aspect ratios. © 2010 Elsevier B.V. All rights reserved.
dc.formatapplication/pdf
dc.languageeng
dc.publisherJournal of Computational and Applied Mathematics
dc.rightsinfo:eu-repo/semantics/openAccess
dc.rights.urihttp://creativecommons.org/licenses/by-nc-sa/3.0/es/
dc.subjectConforming longest-edge bisection algorithm
dc.subjectFinite element method
dc.subjectHigh aspect ratio elements
dc.subjectNested triangulations
dc.subjectZlmal's minimum angle condition
dc.titleOn global and local mesh refinements by a generalized conforming bisection algorithm
dc.typeinfo:eu-repo/semantics/conferenceObject
dc.typeinfo:eu-repo/semantics/publishedVersion
dc.identifier.doi10.1016/j.cam.2010.05.046
dc.relation.publisherversionhttps://www.scopus.com/inward/record.uri?eid=2-s2.0-77955708656&doi=10.1016%2fj.cam.2010.05.046&partnerID=40&md5=26c8d4eafc2b5ea1d4f0bdbaf3412a84


Files in this item

FilesSizeFormatView

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record

info:eu-repo/semantics/openAccess
Except where otherwise noted, this item's license is described as info:eu-repo/semantics/openAccess