Results 31 to 40 of about 319,625 (266)
A fast algorithm for matrix balancing [PDF]
As long as a square nonnegative matrix A contains sufficient nonzero elements, then the matrix can be balanced, that is we can find a diagonal scaling of A that is doubly stochastic. A number of algorithms have been proposed to achieve the balancing, the most well known of these being the Sinkhorn-Knopp algorithm. In this paper we derive new algorithms
Knight, Philip, Ruiz, Daniel
openaire +7 more sources
Fast mutation in crossover-based algorithms [PDF]
The heavy-tailed mutation operator proposed in Doerr, Le, Makhmara, and Nguyen (GECCO 2017), called \emph{fast mutation} to agree with the previously used language, so far was proven to be advantageous only in mutation-based algorithms. There, it can relieve the algorithm designer from finding the optimal mutation rate and nevertheless obtain a ...
Denis Antipov +2 more
openaire +4 more sources
Fast commutative matrix algorithms
We show that the product of an nx3 matrix and a 3x3 matrix over a commutative ring can be computed using 6n+3 multiplications. For two 3x3 matrices this gives us an algorithm using 21 multiplications. This is an improvement with respect to Makarov's algorithm using 22 multiplications[13]. We generalize our result for nx3 and 3x3 matrices and present an
openaire +2 more sources
Maximally fast coarsening algorithms [PDF]
We present maximally-fast numerical algorithms for conserved coarsening systems that are stable and accurate with a growing natural time-step $Δt=A t_s^{2/3}$. For non-conserved systems, only effectively finite timesteps are accessible for similar unconditionally stable algorithms.
Cheng, Mowei, Rutenberg, Andrew
openaire +3 more sources
Robust and fast algorithm for extracting the periodic feature from jet engine modulation signals
Jet engine modulation (JEM), a modulation phenomenon induced by the rotating structure of jet engines, is a representative feature extracted from the radar returns for aircraft target recognition.
Jingming Sun, Junpeng Yu
doaj +1 more source
Design of the Fast Algorithm for Discrete Orthogonal Transforms and Their Unified Architectures
Discrete orthogonal transform ( DOT ) is widely used in digital image processing and video compression,and it is of great practical significance to study its fast algorithm and design of general architecture.
HUANG Hai +4 more
doaj +1 more source
In this paper, in order to improve the calculation accuracy and efficiency of α-order Caputo fractional derivative (0 < α ≤ 1), we developed a compact scheme combining the fast time stepping method for solving 2D fractional nonlinear subdiffusion ...
Yibin Xu +4 more
doaj +1 more source
A Fast Algorithm for Backbones [PDF]
A matching algorithm for the identification of backbones in percolation problems is introduced. Using this procedure, percolation backbones are studied in two- to five-dimensional systems containing 1.7×107 sites, two orders of magnitude larger than was previously possible using burning algorithms.
openaire +2 more sources
Generating Fast Indulgent Algorithms [PDF]
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Dan Alistarh +3 more
openaire +4 more sources
A Fast DOA Estimation Algorithm Based on Polarization MUSIC [PDF]
A fast DOA estimation algorithm developed from MUSIC, which also benefits from the processing of the signals' polarization information, is presented. Besides performance enhancement in precision and resolution, the proposed algorithm can be exerted on ...
R. Guo, X. Mao, S. Li, Y. Wang, X. Wang
doaj

