75,608 research outputs found
PyDEC: Software and Algorithms for Discretization of Exterior Calculus
This paper describes the algorithms, features and implementation of PyDEC, a
Python library for computations related to the discretization of exterior
calculus. PyDEC facilitates inquiry into both physical problems on manifolds as
well as purely topological problems on abstract complexes. We describe
efficient algorithms for constructing the operators and objects that arise in
discrete exterior calculus, lowest order finite element exterior calculus and
in related topological problems. Our algorithms are formulated in terms of
high-level matrix operations which extend to arbitrary dimension. As a result,
our implementations map well to the facilities of numerical libraries such as
NumPy and SciPy. The availability of such libraries makes Python suitable for
prototyping numerical methods. We demonstrate how PyDEC is used to solve
physical and topological problems through several concise examples.Comment: Revised as per referee reports. Added information on scalability,
removed redundant text, emphasized the role of matrix based algorithms,
shortened length of pape
Thomas Decomposition of Algebraic and Differential Systems
In this paper we consider disjoint decomposition of algebraic and non-linear
partial differential systems of equations and inequations into so-called simple
subsystems. We exploit Thomas decomposition ideas and develop them into a new
algorithm. For algebraic systems simplicity means triangularity, squarefreeness
and non-vanishing initials. For differential systems the algorithm provides not
only algebraic simplicity but also involutivity. The algorithm has been
implemented in Maple
A Reduced Form for Linear Differential Systems and its Application to Integrability of Hamiltonian Systems
Let with be a differential linear
system. We say that a matrix is a {\em reduced
form} of if and there exists such that . Such a form is
often the sparsest possible attainable through gauge transformations without
introducing new transcendants. In this article, we discuss how to compute
reduced forms of some symplectic differential systems, arising as variational
equations of hamiltonian systems. We use this to give an effective form of the
Morales-Ramis theorem on (non)-integrability of Hamiltonian systems.Comment: 28 page
Discrete Lie Advection of Differential Forms
In this paper, we present a numerical technique for performing Lie advection
of arbitrary differential forms. Leveraging advances in high-resolution finite
volume methods for scalar hyperbolic conservation laws, we first discretize the
interior product (also called contraction) through integrals over Eulerian
approximations of extrusions. This, along with Cartan's homotopy formula and a
discrete exterior derivative, can then be used to derive a discrete Lie
derivative. The usefulness of this operator is demonstrated through the
numerical advection of scalar fields and 1-forms on regular grids.Comment: Accepted version; to be published in J. FoC
On computing Belyi maps
We survey methods to compute three-point branched covers of the projective
line, also known as Belyi maps. These methods include a direct approach,
involving the solution of a system of polynomial equations, as well as complex
analytic methods, modular forms methods, and p-adic methods. Along the way, we
pose several questions and provide numerous examples.Comment: 57 pages, 3 figures, extensive bibliography; English and French
abstract; revised according to referee's suggestion
- …