Structure-preserving discretization of fractional vector calculus using discrete exterior calculus
- Award ID(s):
- 2208267
- PAR ID:
- 10531802
- Publisher / Repository:
- Elsevier
- Date Published:
- Journal Name:
- Computers & Mathematics with Applications
- Volume:
- 153
- Issue:
- C
- ISSN:
- 0898-1221
- Page Range / eLocation ID:
- 186 to 196
- Format(s):
- Medium: X
- Sponsoring Org:
- National Science Foundation
More Like this
-
Cook, Samuel; Katz, Brian P; Melhuish, Kathleen (Ed.)
-
We construct counterexamples to classical calculus facts such as the inverse and implicit function theorems in scale calculus—a generalization of multivariable calculus to infinite-dimensional vector spaces, in which the reparameterization maps relevant to symplectic geometry are smooth. Scale calculus is a corner stone of polyfold theory, which was introduced by Hofer, Wysocki, and Zehnder as a broadly applicable tool for regularizing moduli spaces of pseudoholomorphic curves. We show how the novel nonlinear scale-Fredholm notion in polyfold theory overcomes the lack of implicit function theorems, by formally establishing an often implicitly used fact: The differentials of basic germs—the local models for scale-Fredholm maps—vary continuously in the space of bounded operators when the base point changes. We moreover demonstrate that this continuity holds only in specific coordinates, by constructing an example of a scale-diffeomorphism and scale-Fredholm map with discontinuous differentials. This justifies the high technical complexity in the foundations of polyfold theory.more » « less
-
Over twenty years ago, Abadi et al. established the Dependency Core Calculus (DCC) as a general purpose framework for analyzing dependency in typed programming languages. Since then, dependency analysis has shown many practical benefits to language design: its results can help users and compilers enforce security constraints, eliminate dead code, among other applications. In this work, we present a Dependent Dependency Calculus (DDC), which extends this general idea to the setting of a dependently-typed language. We use this calculus to track both run-time and compile-time irrelevance, enabling faster typechecking and program execution.more » « less
An official website of the United States government

