What the study found
The study found optimal order discretization error bounds for a finite element approximation of the corotational harmonic map heat flow problem. The analysis applies to smooth solutions of the continuous problem.
Why the authors say this matters
The authors indicate that the method's key analytical tools help with discrete stability and control of linearization error. They also suggest that the numerical results support the theoretical analysis.
What the researchers tested
The researchers studied the harmonic map heat flow in the corotational case. They used an H^1-conforming finite element method in space together with a semi-implicit Euler time-stepping method, which gives a linear problem at each time step.
What worked and what didn't
For smooth solutions, the discretization method produced optimal order error bounds. The analysis relied on a discrete energy estimate that mimics the energy dissipation of the continuous solution and on a convexity property. The abstract does not describe any failed cases.
What to keep in mind
The analysis is restricted to the regime of smooth solutions of the continuous problem. The abstract does not describe limitations beyond that scope.
Key points
- The paper analyzes a finite element discretization of the corotational harmonic map heat flow problem.
- An H^1-conforming spatial finite element method is combined with semi-implicit Euler time stepping.
- The semi-implicit Euler step leads to a linear problem at each time step.
- The authors report optimal order discretization error bounds for smooth solutions.
- A discrete energy estimate and a convexity property are central to the analysis.
- Numerical results are presented to validate the theoretical results.
Disclosure
- Research title:
- Finite element scheme achieves optimal error bounds for corotational heat flow
- Authors:
- Nam Nguyen, Arnold Reusken
- Publication date:
- 2026-04-22
- OpenAlex record:
- View
Get the weekly research newsletter
Stay current with peer-reviewed research without reading academic papers — one filtered digest, every Friday.
