Related papers: Accelerating the CM method

A consequent approach is proposed to construct symplectic force-gradient algorithms of arbitrarily high orders in the time step for precise integration of motion in classical and quantum mechanics simulations. Within this approach the basic…

This paper puts forth a coarse grid projection (CGP) multiscale method to accelerate computations of quasigeostrophic (QG) models for large scale ocean circulation. These models require solving an elliptic sub-problem at each time step,…

The long runtime of high-fidelity partial differential equation (PDE) solvers makes them unsuitable for time-critical applications. We propose to accelerate PDE solvers using reduced-order modeling (ROM). Whereas prior ROM approaches reduce…

In a previous paper (J. Comp. Phys. 230 (2011), 3668--3694), the authors proposed a new practical method for computing expected values of functionals of solutions for certain classes of elliptic partial differential equations with random…

Elliptic curve cryptography (ECC) has emerged as the dominant public-key protocol, with NIST standardizing parameters for binary field GF(2^m) ECC systems. This work presents a hardware implementation of a Hybrid Multiplication technique…

We devise a Hybrid High-Order (HHO) method for highly oscillatory elliptic problems that is capable of handling general meshes. The method hinges on discrete unknowns that are polynomials attached to the faces and cells of a coarse mesh;…

In this article, we study the cyclicity problem of elliptic curves $E/\Bbb{Q}$ modulo primes in a given arithmetic progression. We extend the recent work of Akbal and G\"ulo\u{g}lu by proving an unconditional asymptotic for such a cyclicity…

We present an algorithm that computes the Hasse-Witt matrix of given hyperelliptic curve over Q at all primes of good reduction up to a given bound N. It is simpler and faster than the previous algorithm developed by the authors.

In this paper, we intend to study the geometric meaning of the discrete logarithm problem defined over an Elliptic Curve. The key idea is to reduce the Elliptic Curve Discrete Logarithm Problem (EC-DLP) into a system of equations. These…

Complex-variable matrix optimization problems (CMOPs) in Frobenius norm emerge in many areas of applied mathematics and engineering applications. In this letter, we focus on solving CMOPs by iterative methods. For unconstrained CMOPs, we…

Vector set orthogonal normalization and matrix QR decomposition are fundamental problems in matrix analysis with important applications in many fields. We know that Gram-Schmidt process is a widely used method to solve these two problems.…

For positive integers $M \mid N$ and an order of discriminant $\Delta$ in an imaginary quadratic field $K$ with discriminant $\Delta_K < -4$, we determine the fiber of the morphism $X_0(M,N) \rightarrow X(1)$ over the closed point…

The generator coordinate method (GCM) is an important tool of choice for modeling large-amplitude collective motion in atomic nuclei. The computational complexity of the GCM increases rapidly with the number of collective coordinates. It…

One can consider the Hilbert scheme as a natural compactification of the space of smooth projective curves with fixed Hilbert polynomial. Here we consider a different modular compactification, namely the functor CM parameterizing curves…

Resource-efficient and high-precision approximate synthesis of quantum circuits expressed in the Clifford+T gate set is vital for Fault-Tolerant quantum computing. Efficient optimal methods are known for single-qubit RZ unitaries, otherwise…

It is shown that, under some mild technical conditions, representations of prime numbers by binary quadratic forms can be computed in polynomial complexity by exploiting Schoof's algorithm, which counts the number of $\mathbb F_q$-points of…

We provide an efficient algorithm to compile quantum circuits for fault-tolerant execution. We target surface codes, which form a 2D grid of logical qubits with nearest-neighbor logical operations. Embedding an input circuit's qubits in…

The goal of this paper is to develop a numerical algorithm that solves a two-dimensional elliptic partial differential equation in a polygonal domain using tensor methods and ideas from isogeometric analysis. The proposed algorithm is based…

For a quadratic field $\mathcal{K}$ without rationally defined CM, we prove that there exists of a prime $p_{\mathcal{K}}$ depending only on $\mathcal{K}$ such that if $d$ is a positive integer whose minimal prime divisor is greater than…

We analyse and compare the complexity of several algorithms for computing modular polynomials. We show that an algorithm relying on floating point evaluation of modular functions and on interpolation, which has received little attention in…