Related papers: A Fast Algorithm for Partial Fraction Decompositio…
Distributed computing excels at processing large scale data, but the communication cost for synchronizing the shared parameters may slow down the overall performance. Fortunately, the interactions between parameter and data in many problems…
In a recent work \cite{BG}, given a collection of continuous semimartingales, authors derive a semimartingale decomposition from the corresponding ranked processes in the case that the ranked processes can meet more than two original…
We set new speed records for multiplying long polynomials over finite fields of characteristic two. Our multiplication algorithm is based on an additive FFT (Fast Fourier Transform) by Lin, Chung, and Huang in 2014 comparing to previously…
We present a method for fast resting-state fMRI spatial decomposi-tions of very large datasets, based on the reduction of the temporal dimension before applying dictionary learning on concatenated individual records from groups of subjects.…
We describe a unified approach to calculating the partition functions of a general multi-level system with a free Hamiltonian. Particularly, we present new results for parastatistical systems of any order in the second quantized approach.…
In the present work, an attempted was made to develop a numerical algorithm by the use of new orthogonal hybrid functions formed from hybrid of piecewise constant orthogonal sample-and-hold functions and piecewise linear orthogonal…
Efficient and fast predictor-corrector methods are proposed to deal with nonlinear Caputo-Fabrizio fractional differential equations, where Caputo-Fabrizio operator is a new proposed fractional derivative with a smooth kernel. The proposed…
This paper introduces a novel approach for the construction of bulk--surface splitting schemes for semi-linear parabolic partial differential equations with dynamic boundary conditions. The proposed construction is based on a reformulation…
Tensor decompositions such as the canonical format and the tensor train format have been widely utilized to reduce storage costs and operational complexities for high-dimensional data, achieving linear scaling with the input dimension…
A generalization of exterior calculus is considered by allowing the partial derivatives in the exterior derivative to assume fractional orders. That is, a fractional exterior derivative is defined. This is found to generate new vector…
We derive a stochastic gradient algorithm for semidefinite optimization using randomization techniques. The algorithm uses subsampling to reduce the computational cost of each iteration and the subsampling ratio explicitly controls…
In this paper, we introduce a new method for calculating fractional integrals and differentials. The method involves an equation that we have obtained from infinite applied integration by parts. The equation works for special class of…
We present new algorithms for $M$-estimators of multivariate scatter and location and for symmetrized $M$-estimators of multivariate scatter. The new algorithms are considerably faster than currently used fixed-point and related algorithms.…
By prior work, it is known that any distributed graph algorithm that finds a maximal matching requires $\Omega(\log^* n)$ communication rounds, while it is possible to find a maximal fractional matching in $O(1)$ rounds in bounded-degree…
Graph partitioning is a key fundamental problem in the area of big graph computation. Previous works do not consider the practical requirements when optimizing the big data analysis in real applications. In this paper, motivated by…
The Fast Multipole Method (FMM) reduces the computation of pairwise two-body interactions among $N$-particles to order $N$, whose computation cost should be of order $N^2$ by brute force. However, its implementation is somewhat complicated…
Recently, the numerical schemes of the Fokker-Planck equations describing anomalous diffusion with two internal states have been proposed in [Nie, Sun and Deng, arXiv: 1811.04723], which use convolution quadrature to approximate the…
In this paper, we propose a fast second-order approximation to the variable-order (VO) Caputo fractional derivative, which is developed based on $L2$-$1_\sigma$ formula and the exponential-sum-approximation technique. The fast evaluation…
We study parallel algorithms for the minimization of Deterministic Finite Automata (DFAs). In particular, we implement four different massively parallel algorithms on Graphics Processing Units (GPUs). Our results confirm the expectations…
We describe an algorithm for using a quantum computer to calculate mean values of observables and the partition function of a quantum system. Our algorithm includes two sub-algorithms. The first sub-algorithm is for calculating, with…