Related papers: Time- and space-efficient evaluation of the comple…
Multipoint evaluation is the computational task of evaluating a polynomial given as a list of coefficients at a given set of inputs. And while \emph{nearly linear time} algorithms have been known for the univariate instance of multipoint…
We consider the problem of optimizing a multivariate quadratic function where each decision variable is constrained to be a complex $m$'th root of unity. Such problems have applications in signal processing, MIMO detection, and the…
We review the method of the differential equations for the evaluation of multi-loop Feynman integrals. In particular, we focus on the series expansion approach for solving the system of differential equation and we discuss how to perform…
In recent decades, a number of profound theorems concerning approximation of hard counting problems have appeared. These include estimation of the permanent, estimating the volume of a convex polyhedron, and counting (approximately) the…
Fully robust versions of the elastic net estimator are introduced for linear and logistic regression. The algorithms to compute the estimators are based on the idea of repeatedly applying the non-robust classical estimators to data subsets…
We obtain long series (28 terms or more) for the coverage (occupation fraction) $\theta$, in powers of time $t$ for two models of random sequential adsorption with diffusional relaxation using an efficient algorithm developed by the…
SMT solvers use sophisticated techniques for polynomial (linear or non-linear) integer arithmetic. In contrast, non-polynomial integer arithmetic has mostly been neglected so far. However, in the context of program verification, polynomials…
In this paper, a novel architecture of electro-optical neural networks based on the time-stretch method is proposed and numerically simulated. By stretching time-domain ultrashort pulses, multiplications of large scale weight matrices and…
We propose a novel iterative algorithm for solving a large sparse linear system. The method is based on the EM algorithm. If the system has a unique solution, the algorithm guarantees convergence with a geometric rate. Otherwise,…
An algorithm is given for determining an optimal $b$-step approximation of weighted data, where the error is measured with respect to the $L_\infty$ norm. For data presorted by the independent variable the algorithm takes $\Theta(n + \log n…
We change a previous time-stepping algorithm for solving a multi-scale Vlasov-Poisson system within a Particle-In-Cell method, in order to do accurate long time simulations. As an exponential integrator, the new scheme allows to use large…
We compute the nonlinearity of Boolean functions with Groebner basis techniques, providing two algorithms: one over the binary field and the other over the rationals. We also estimate their complexity. Then we show how to improve our…
We propose an iterative estimating equations procedure for analysis of longitudinal data. We show that, under very mild conditions, the probability that the procedure converges at an exponential rate tends to one as the sample size…
Solving linear systems is at the foundation of many algorithms. Recently, quantum linear system algorithms (QLSAs) have attracted great attention since they converge to a solution exponentially faster than classical algorithms in terms of…
This paper introduces a new data analysis method for big data using a newly defined regression model named multiple model linear regression(MMLR), which separates input datasets into subsets and construct local linear regression models of…
We give an algorithm to compute $N$ steps of a convolution quadrature approximation to a continuous temporal convolution using only $O(N \log N)$ multiplications and $O(\log N)$ active memory. The method does not require evaluations of the…
A linear scale method for calculating electronic properties of large and complex systems is introduced within a local density approximation. The method is based on the Chebyshev polynomial expansion and the time-dependent method, which is…
We present a practical algorithm based on symplectic splitting methods to integrate numerically in time the Schr\"odinger equation. When discretized in space, the Schr\"odinger equation can be recast as a classical Hamiltonian system…
Computationally efficient numerical methods for high-order approximations of convolution integrals involving weakly singular kernels find many practical applications including those in the development of fast quadrature methods for…
We present a real-space formulation for coarse-graining Kohn-Sham Density Functional Theory that significantly speeds up the analysis of material defects without appreciable loss of accuracy. The approximation scheme consists of two steps.…