Mathematics > Numerical Analysis
[Submitted on 30 Sep 2023 (v1), last revised 1 May 2024 (this version, v2)]
Title:Quadratic constraint consistency in the projection-free approximation of harmonic maps and bending isometries
View PDF HTML (experimental)Abstract:We devise a projection-free iterative scheme for the approximation of harmonic maps that provides a second-order accuracy of the constraint violation and is unconditionally energy stable. A corresponding error estimate is valid under a mild but necessary discrete regularity condition. The method is based on the application of a BDF2 scheme and the considered problem serves as a model for partial differential equations with holonomic constraint. The performance of the method is illustrated via the computation of stationary harmonic maps and bending isometries.
Submission history
From: Sören Bartels [view email][v1] Sat, 30 Sep 2023 13:57:47 UTC (2,289 KB)
[v2] Wed, 1 May 2024 12:05:12 UTC (2,939 KB)
Current browse context:
math.NA
References & Citations
Bibliographic and Citation Tools
Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)
Code, Data and Media Associated with this Article
alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)
Demos
Recommenders and Search Tools
Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
arXivLabs: experimental projects with community collaborators
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.