Related papers: On moduli of rings and quadrilaterals: algorithms …
Partial differential equations (PDEs) involving high contrast and oscillating coefficients are common in scientific and industrial applications. Numerical approximation of these PDEs is a challenging task that can be addressed, for example,…
In this paper, we present a construction toward a new type of TQFTs at the crossroads of low-dimensional topology, algebraic geometry, physics, and homotopy theory. It assigns TMF-modules to closed 3-manifolds and maps of TMF-modules to…
This thesis studies modular forms from a classical and adelic viewpoint. We use this interplay to obtain results about the arithmetic of the Fourier coefficients of modular forms and their generalisations. In Chapter 2, we compute lower…
This paper gives a geometric description of functional spaces related to Domain Decomposition techniques for computing solutions of Laplace and Helmholtz equations. Understanding the geometric structure of these spaces leads to algorithms…
We present a new probabilistic algorithm to compute modular polynomials modulo a prime. Modular polynomials parameterize pairs of isogenous elliptic curves and are useful in many aspects of computational number theory and cryptography. Our…
We study a new approach to the problem of transparent boundary conditions for the Helmholtz equation in unbounded domains. Our approach is based on the minimization of an integral functional arising from a volume integral formulation of the…
This work has been submitted to the IEEE for possible publication. Copyright may be transferred without notice, after which this version may no longer be accessible. In many applications, the spatial distribution of a field needs to be…
We explain how to use smooth bivariate splines of arbitrary degree to solve the exterior Helmholtz equation based on a Perfectly Matched Layer (PML) technique. In a previous study (cf. [26]), it was shown that bivariate spline functions of…
In finite element methods (FEMs), the accuracy of the solution cannot increase indefinitely because the round-off error increases when the number of degrees of freedom (DoFs) is large enough. This means that the accuracy that can be reached…
Inspired by the paper of Groenewald, Kaashoek and Ran (Wiener-Hopf indices of unitary functions on the unit circle in terms of realizations and related results on Toeplitz operators. \emph{Indag. Math.} 28, (2017), 649-710), we present an…
A fast algorithm (linear in the degrees of freedom) for the solution of linear variable-coefficient rational-order fractional integral and differential equations is described. The approach is related to the ultraspherical method for…
We study the question of approximability for the inverse of the FEM stiffness matrix for (scalar) second order elliptic boundary value problems by blockwise low rank matrices such as those given by the H-matrix format. We show that…
We present a variant of the Peskine--Szpiro Acyclicity Lemma, and hence a way to certify exactness of a complex of finite modules over a large class of (possibly) noncommutative rings. Specifically, over the class of Auslander regular…
We give an elementary introduction to some recent polyhedral techniques for understanding and solving systems of multivariate polynomial equations. We provide numerous concrete examples and illustrations, and assume no background in…
We study numerical computation of several conformal invariants of simply connected domains in the complex plane including, the hyperbolic distance, the reduced modulus, the harmonic measure, and the modulus of a quadrilateral. The method we…
By interpreting planar polynomial curves as complex-valued functions of a real parameter, an inner product, norm, metric function, and the notion of orthogonality may be defined for such curves. This approach is applied to the complex…
We describe algorithms for computing various functors for algebraic D-modules, i.e. systems of linear partial differential equations with polynomial coefficients. We will give algorithms for restriction, tensor product, localization, and…
New numerical algorithms based on rational functions are introduced that can solve certain Laplace and Helmholtz problems on two-dimensional domains with corners faster and more accurately than the standard methods of finite elements and…
We give an algorithm to compute the following cohomology groups on $U = \C^n \setminus V(f)$ for any non-zero polynomial $f \in \Q[x_1, ..., x_n]$; 1. $H^k(U, \C_U)$, $\C_U$ is the constant sheaf on $U$ with stalk $\C$. 2. $H^k(U, \Vsc)$,…
A simple MATLAB implementation of hierarchical shape functions on 2D rectangles is explained and available for download. Global shape functions are ordered for a given polynomial degree according to the indices of the nodes, edges, or…