Related papers: Fast Power Spectrum Estimation
Orthogonal systems in $\mathrm{L}_2(\mathbb{R})$, once implemented in spectral methods, enjoy a number of important advantages if their differentiation matrix is skew-symmetric and highly structured. Such systems, where the differentiation…
We propose a hyperpower iteration for numerical computation of the outer generalized inverse of a matrix which achieves the 18th order of convergence by using only seven matrix multiplication per iteration loop. This is the record high…
The study of third-order statistics in large-scale structure analyses has been hampered by the increased complexity of bispectrum estimators (compared to power spectra), the large dimensionality of the data vector, and the difficulty in…
We give an explicit algorithm and source code for computing optimal weights for combining a large number N of alphas. This algorithm does not cost O(N^3) or even O(N^2) operations but is much cheaper, in fact, the number of required…
A novel code for the approximate computation of long-range forces between N mutually interacting bodies is presented. The code is based on a hierarchical tree of cubic cells and features mutual cell-cell interactions which are calculated…
Many real-world problems rely on finding eigenvalues and eigenvectors of a matrix. The power iteration algorithm is a simple method for determining the largest eigenvalue and associated eigenvector of a general matrix. This algorithm relies…
Power flow calculation in EMS is required to accommodate a large and complex power system. To achieve a faster than real-time calculation, a graph based power flow calculation is proposed in this paper. Graph database and graph computing…
Tensor analysis has been a widely studied in physics applications including circuit theory and electric machines. This paper reviews some of the main features of this type of representation for unbalanced power distribution systems and…
The $N$th power of a polynomial matrix of fixed size and degree can be computed by binary powering as fast as multiplying two polynomials of linear degree in~$N$. When Fast Fourier Transform (FFT) is available, the resulting complexity is…
Measurements of the galaxy power spectrum contain a wealth of information about the Universe. Its optimal extraction is vital if we are to truly understand the micro-physical nature of dark matter and dark energy. In Smith & Marian (2015)…
We propose a new method to accelerate the convergence of optimization algorithms. This method simply adds a power coefficient $\gamma\in[0,1)$ to the gradient during optimization. We call this the Powerball method and analyze the…
We present a new method for computing the Near-To-Far-Field (NTFF) transformation in FDTD simulations which has an overall scaling of $O(N^3)$ instead of the standard $O(N^4)$. By mapping the far field with a cartesian coordinate system the…
We study in detail how neutrino perturbations can be followed in linear theory by using only terms up to $l=2$ in the Boltzmann hierarchy. We provide a new approximation to the third moment and demonstrate that the neutrino power spectrum…
We describe here an iterative method for jointly estimating the noise power spectrum from a scanning experiment's time-ordered data, together with the maximum-likelihood map. We test the robustness of this method on simulated datasets with…
We propose an efficient algorithm for the evaluation of the potential and its gradient of gravitational/electrostatic $N$-body systems, which we call particle mesh multipole method (PMMM or PM$^3$). PMMM can be understood both as an…
We introduce a new iterative method for computing solutions of elliptic equations with random rapidly oscillating coefficients. Similarly to a multigrid method, each step of the iteration involves different computations meant to address…
We employ neural networks to improve and speed up optical force calculations for dielectric particles. The network is first trained on a limited set of data obtained through accurate light scattering calculations, based on the Transition…
Statistical power is a measure of the replicability of a categorical hypothesis test. Formally, it is the probability of detecting an effect, if there is a true effect present in the population. Hence, optimizing statistical power as a…
We present an amelioration of current known algorithms for optimal spectral partitioning problems. The idea is to use the advantage of a representation using density functions while decreasing the computational time. This is done by…
An algorithm for fast calculation of the Coulombic forces and energies of point particles with free boundary conditions is proposed. Its calculation time scales as N log N for N particles. This novel method has lower crossover point with…