Related papers: Parallel Telescoping and Parameterized Picard--Ves…
Determining the degree of inherent parallelism in classical sequential algorithms and leveraging it for fast parallel execution is a key topic in parallel computing, and detailed analyses are known for a wide range of classical algorithms.…
Transcendental Liouvillian extensions are differential fields, in which one can model poly-logarithmic, hyperexponential, and trigonometric functions, logarithmic integrals, and their (nested) rational expressions. For such an extension…
Consider an elliptic self-adjoint pseudodifferential operator $A$ acting on $m$-columns of half-densities on a closed manifold $M$, whose principal symbol is assumed to have simple eigenvalues. Relying on a basis of pseudodifferential…
The constant increase in parallelism available on large-scale distributed computers poses major scalability challenges to many scientific applications. A common strategy to improve scalability is to express the algorithm in terms of…
We consider the problem of parallelizing electronic structure computations in plane-wave Density Functional Theory. Because of the limited scalability of Fourier transforms, parallelism has to be found at the eigensolver level. We show how…
The Dantzig selector (Candes and Tao, 2007) is a popular l1-regularization method for variable selection and estimation in linear regression. We present a very weak geometric condition on the observed predictors which is related to…
A point $P$ in projective space is said to be Galois with respect to a hypersurface if the function field extension induced by the projection from $P$ is Galois. We present a hyperplane section theorem for Galois points. Precisely, if $P$…
Nonparametric extension of tensor regression is proposed. Nonlinearity in a high-dimensional tensor space is broken into simple local functions by incorporating low-rank tensor decomposition. Compared to naive nonparametric approaches, our…
A compiler's intermediate representation (IR) defines a program's execution plan by encoding its instructions and their relative order. Compiler optimizations aim to replace a given execution plan with a semantically-equivalent one that…
Parallelization techniques have become ubiquitous for accelerating inference and training of deep neural networks. Despite this, several operations are still performed in a sequential manner. For instance, the forward and backward passes…
Dense and sparse tensors allow the representation of most bulk data structures in computational science applications. We show that sparse tensor algebra can also be used to express many of the transformations on these datasets, especially…
This paper addresses the problem of parallelizing computations to study non-linear dynamics in large networks of non-locally coupled oscillators using heterogeneous computing resources. The proposed approach can be applied to a variety of…
In this paper, we enumerate parallelogram polycubes according to several parameters. After establishing a relation between Multiple Zeta Function and the Dirichlet generating function of parallelogram polyominoes, we generalize it to the…
A pseudoline is a homeomorphic image of the real line in the plane so that its complement is disconnected. An arrangement of pseudolines is a set of pseudolines in which every two cross exactly once. A drawing of a graph is pseudolinear if…
A parallelohedron is called reducible, if it can be represented as a direct product of two parallelohedra of lower dimension. In his Ph.D. thesis (2005) the first author proved a criterion of reducibility of a parallelohedron in terms of…
Generalized trigonometric functions (GTFs) are simple generalization of the classical trigonometric functions. GTFs are deeply related to the $p$-Laplacian, which is known as a typical nonlinear differential operator. Compared to GTFs with…
We adapt the theory of normal and special polynomials from symbolic integration to the summation setting, and then built up a general framework embracing both the usual shift case and the $q$-shift case. In the context of this general…
We present a general framework in the setting of difference ring extensions that enables one to find improved representations of indefinite nested sums such that the arising denominators within the summands have reduced degrees. The…
In this work, the Parareal algorithm is applied to evolution problems that admit good low-rank approximations and for which the dynamical low-rank approximation (DLRA) can be used as time stepper. Many discrete integrators for DLRA have…
Pseudo-differential operator equations with parameter are studied. Uniform separability properties and resolvent estimates are obtained in terms of fractional derivatives. Moreover, maximal regularity properties of the pseudo-differential…