Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
167 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
42 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Serendipity discrete complexes with enhanced regularity (2407.12625v1)

Published 17 Jul 2024 in math.NA and cs.NA

Abstract: In this work we address the problem of finding serendipity versions of approximate de Rham complexes with enhanced regularity. The starting point is a new abstract construction of general scope which, given three complexes linked by extension and reduction maps, generates a fourth complex with cohomology isomorphic to the former three. This construction is used to devise new serendipity versions of rot-rot and Stokes complexes derived in the Discrete de Rham spirit.

Summary

We haven't generated a summary for this paper yet.

X Twitter Logo Streamline Icon: https://streamlinehq.com