24,988 research outputs found
A specialized interior-point algorithm for huge minimum convex cost flows in bipartite networks
Research Report UPC-DEIO DR 2018-01. November 2018The computation of the Newton direction is the most time consuming step of interior-point methods. This direction was efficiently computed by a combination
of Cholesky factorizations and conjugate gradients in a specialized interior-point method for block-angular structured problems. In this work we apply this algorithmic approach to solve very large instances of minimum cost flows problems in bipartite networks, for convex objective functions with diagonal Hessians (i.e., either linear, quadratic or separable nonlinear objectives). After analyzing the theoretical properties of the interior-point method for this kind of problems, we provide extensive computational experiments with linear and quadratic instances of up to one billion arcs and 200 and five million nodes in each subset of the node partition. For linear and quadratic instances our approach is compared with the barriers algorithms of CPLEX (both standard path-following and homogeneous-self-dual); for linear instances it is also compared with the different algorithms of the state-of-the-art network flow solver LEMON (namely: network simplex, capacity scaling, cost scaling and cycle canceling).
The specialized interior-point approach significantly outperformed the other approaches in most of the linear and quadratic transportation instances tested. In particular, it always provided a solution within the time limit and it never exhausted the 192 Gigabytes of memory of the server used for the runs. For assignment problems the network algorithms in LEMON were the most efficient option.Peer ReviewedPreprin
Multifractal Behaviour of n-Simplex Lattice
We study the asymptotic behaviour of resistance scaling and fluctuation of
resistance that give rise to flicker noise in an {\em n}-simplex lattice. We
propose a simple method to calculate the resistance scaling and give a
closed-form formula to calculate the exponent, , associated with
resistance scaling, for any n. Using current cumulant method we calculate the
exact noise exponent for n-simplex lattices.Comment: Latex, 9 pages including one figur
Conforming restricted Delaunay mesh generation for piecewise smooth complexes
A Frontal-Delaunay refinement algorithm for mesh generation in piecewise
smooth domains is described. Built using a restricted Delaunay framework, this
new algorithm combines a number of novel features, including: (i) an
unweighted, conforming restricted Delaunay representation for domains specified
as a (non-manifold) collection of piecewise smooth surface patches and curve
segments, (ii) a protection strategy for domains containing curve segments that
subtend sharply acute angles, and (iii) a new class of off-centre refinement
rules designed to achieve high-quality point-placement along embedded curve
features. Experimental comparisons show that the new Frontal-Delaunay algorithm
outperforms a classical (statically weighted) restricted Delaunay-refinement
technique for a number of three-dimensional benchmark problems.Comment: To appear at the 25th International Meshing Roundtabl
The persistent cosmic web and its filamentary structure I: Theory and implementation
We present DisPerSE, a novel approach to the coherent multi-scale
identification of all types of astrophysical structures, and in particular the
filaments, in the large scale distribution of matter in the Universe. This
method and corresponding piece of software allows a genuinely scale free and
parameter free identification of the voids, walls, filaments, clusters and
their configuration within the cosmic web, directly from the discrete
distribution of particles in N-body simulations or galaxies in sparse
observational catalogues. To achieve that goal, the method works directly over
the Delaunay tessellation of the discrete sample and uses the DTFE density
computed at each tracer particle; no further sampling, smoothing or processing
of the density field is required.
The idea is based on recent advances in distinct sub-domains of computational
topology, which allows a rigorous application of topological principles to
astrophysical data sets, taking into account uncertainties and Poisson noise.
Practically, the user can define a given persistence level in terms of
robustness with respect to noise (defined as a "number of sigmas") and the
algorithm returns the structures with the corresponding significance as sets of
critical points, lines, surfaces and volumes corresponding to the clusters,
filaments, walls and voids; filaments, connected at cluster nodes, crawling
along the edges of walls bounding the voids. The method is also interesting as
it allows for a robust quantification of the topological properties of a
discrete distribution in terms of Betti numbers or Euler characteristics,
without having to resort to smoothing or having to define a particular scale.
In this paper, we introduce the necessary mathematical background and
describe the method and implementation, while we address the application to 3D
simulated and observed data sets to the companion paper.Comment: A higher resolution version is available at
http://www.iap.fr/users/sousbie together with complementary material.
Submitted to MNRA
Restoration of Macroscopic Isotropy on -Simplex Fractal Conductor Networks
Restoration of macroscopic isotropy has been investigated in (d+1)-simplex
fractal conductor networks via exact real space renormalization group
transformations. Using some theorems of fixed point theory, it has been shown
very rigoroursly that the macroscopic conductivity becomes isotropic for large
scales and anisotropy vanishes with a scaling exponent which is computed
exactly for arbitrary values of d and decimation numbers b=2,3,4 and
5.Comment: 27 Pages, 3 Figure
- …