Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userComputing Theta Functions with Julia
71
0
0.0
(
0
)
Added by
Daniele Agostini
Publication date
2019
fields
Informatics Engineering
and research's language is
English
Ask ChatGPT about the research
No Arabic abstract
We present a new package Theta.jl for computing with the Riemann theta function. It is implemented in Julia and offers accurate numerical evaluation of theta functions with characteristics and their derivatives of arbitrary order. Our package is optimized for multiple evaluations of theta functions for the same Riemann matrix, in small dimensions. As an application, we report on experimental approaches to the Schottky problem in genus five.
rate research
Read More
We generalize Warnaars elliptic extension of a Macdonald multiparameter summation formula to Riemann surfaces of arbitrary genus.
This paper is a survey on relations between secant identities and soliton equations and applications of soliton equations to problems of algebraic geometry, i.e., the Riemann-Schottky problem and its analogues. A short introduction into the analytic theory of theta functions is also given.
We introduce two new packages, Nemo and Hecke, written in the Julia programming language for computer algebra and number theory. We demonstrate that high performance generic algorithms can be implemented in Julia, without the need to resort to a low-level C implementation. For specialised algorithms, we use Julias efficient native C interface to wrap existing C/C++ libraries such as Flint, Arb, Antic and Singular. We give examples of how to use Hecke and Nemo and discuss some algorithms that we have implemented to provide high performance basic arithmetic.
We give an explicit description of the stable reduction of superelliptic curves of the form $y^n=f(x)$ at primes $p$ whose residue characteristic is prime to the exponent $n$. We then use this description to compute the local $L$-factor of the curve and the exponent of conductor at $p$.
We present Gridap, a new scientific software library for the numerical approximation of partial differential equations (PDEs) using grid-based approximations. Gridap is an open-source software project exclusively written in the Julia programming language. The main motivation behind the development of this library is to provide an easy-to-use framework for the development of complex PDE solvers in a dynamically typed style without sacrificing the performance of statically typed languages. This work is a tutorial-driven user guide to the library. It covers some popular linear and nonlinear PDE systems for scalar and vector fields, single and multi-field problems, conforming and nonconforming finite element discretizations, on structured and unstructured meshes of simplices and hexahedra.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
