929 research outputs found
Distances on the tropical line determined by two points
Let . Write if is a multiple of
. Two different points and in uniquely
determine a tropical line , passing through them, and stable under
small perturbations. This line is a balanced unrooted semi--labeled tree on
leaves. It is also a metric graph.
If some representatives and of and are the first and second
columns of some real normal idempotent order matrix , we prove that the
tree is described by a matrix , easily obtained from . We also
prove that is caterpillar. We prove that every vertex in
belongs to the tropical linear segment joining and . A vertex, denoted
, closest (w.r.t tropical distance) to exists in . Same for
. The distances between pairs of adjacent vertices in and the
distances \dd(p,pq), \dd(qp,q) and \dd(p,q) are certain entries of the
matrix . In addition, if and are generic, then the tree
is trivalent. The entries of are differences (i.e., sum of principal
diagonal minus sum of secondary diagonal) of order 2 minors of the first two
columns of .Comment: New corrected version. 31 pages and 9 figures. The main result is
theorem 13. This is a generalization of theorem 7 to arbitrary n. Theorem 7
was obtained with A. Jim\'enez; see Arxiv 1205.416
Tropical conics for the layman
We present a simple and elementary procedure to sketch the tropical conic
given by a degree--two homogeneous tropical polynomial. These conics are trees
of a very particular kind. Given such a tree, we explain how to compute a
defining polynomial.
Finally, we characterize those degree--two tropical polynomials which are
reducible and factorize them. We show that there exist irreducible degree--two
tropical polynomials giving rise to pairs of tropical lines.Comment: 19 pages, 4 figures. Major rewriting of formerly entitled paper
"Metric invariants of tropical conics and factorization of degree--two
homogeneous tropical polynomials in three variables". To appear in Idempotent
and tropical mathematics and problems of mathematical physics (vol. II), G.
Litvinov, V. Maslov, S. Sergeev (eds.), Proceedings Workshop, Moscow, 200
Improving edge finite element assembly for geophysical electromagnetic modelling on shared-memory architectures
This work presents a set of node-level optimizations to perform the assembly of edge finite element matrices that arise in 3D geophysical electromagnetic modelling on shared-memory architectures. Firstly, we describe the traditional and sequential assembly approach. Secondly, we depict our vectorized and shared-memory strategy which does not require any low level instructions because it is based on an interpreted programming language, namely, Python. As a result, we obtained a simple parallel-vectorized algorithm whose runtime performance is considerably better than sequential version. The set of optimizations have been included to the work-flow of the Parallel Edge-based Tool for Geophysical Electromagnetic Modelling (PETGEM) which is developed as open-source at the Barcelona Supercomputing Center. Finally, we present numerical results for a set of tests in order to illustrate the performance of our strategy.This project has received funding from the European Union's Horizon 2020 research and innovation programme under the Marie Sklodowska-Curie grant agreement No. 644202.
The research leading to these results has received funding from the European Union's Horizon 2020 Programme (2014-2020) and from Brazilian Ministry of Science, Technology
and Innovation through Rede Nacional de Pesquisa (RNP) under the HPC4E Project (www.hpc4e.eu), grant agreement No. 689772.
Authors gratefully acknowledge the support from the Mexican National Council for Science and Technology (CONACYT).
All numerical tests were performed on the MareNostrum supercomputer of the Barcelona Supercomputing Center - Centro Nacional de Supercomputación (www.bsc.es).Peer ReviewedPostprint (author's final draft
- …