53 research outputs found
Symmetric tensor decomposition
We present an algorithm for decomposing a symmetric tensor, of dimension n
and order d as a sum of rank-1 symmetric tensors, extending the algorithm of
Sylvester devised in 1886 for binary forms. We recall the correspondence
between the decomposition of a homogeneous polynomial in n variables of total
degree d as a sum of powers of linear forms (Waring's problem), incidence
properties on secant varieties of the Veronese Variety and the representation
of linear forms as a linear combination of evaluations at distinct points. Then
we reformulate Sylvester's approach from the dual point of view. Exploiting
this duality, we propose necessary and sufficient conditions for the existence
of such a decomposition of a given rank, using the properties of Hankel (and
quasi-Hankel) matrices, derived from multivariate polynomials and normal form
computations. This leads to the resolution of polynomial equations of small
degree in non-generic cases. We propose a new algorithm for symmetric tensor
decomposition, based on this characterization and on linear algebra
computations with these Hankel matrices. The impact of this contribution is
two-fold. First it permits an efficient computation of the decomposition of any
tensor of sub-generic rank, as opposed to widely used iterative algorithms with
unproved global convergence (e.g. Alternate Least Squares or gradient
descents). Second, it gives tools for understanding uniqueness conditions, and
for detecting the rank
An Algorithm for the Real Interval Eigenvalue Problem
In this paper we present an algorithm for approximating the range of the real eigenvalues of interval matrices. Such matrices could be used to model real-life problems, where data sets suffer from bounded variations such as uncertainties (e.g. tolerances on parameters, measurement errors), or to study problems for given states. The algorithm that we propose is a subdivision algorithm that exploits so- phisticated techniques from interval analysis. The quality of the computed approximation, as well as the running time of the algorithm depend on a given input accuracy. We also present an efficient C++ implementation and illustrate its efficiency on various data sets. In most of the cases we manage to compute efficiently the exact boundary points (limited by floating point representation)
A filtering method for the interval eigenvalue problem
We consider the general problem of computing intervals that contain the real eigenvalues of interval matrices. Given an outer estimation of the real eigenvalue set of an interval matrix, we propose a filtering method that improves the estimation. Even though our method is based on an sufficient regularity condition, it is very efficient in practice, and our experimental results suggest that, in general, improves significantly the input estimation. The proposed method works for general, as well as for symmetric matrices
A note on the complexity of univariate root isolation
This paper presents the average-case bit complexity of subdivision-based univariate solvers, namely those named after Sturm, Descartes, and Bernstein. By real solving we mean real root isolation. We prove bounds of \sOB(N^5) for all methods, where bounds the polynomial degree and the coefficient bitsize, whereas their worst-case complexity is in \sOB(N^6). In the case of the Sturm solver, our bound depends on the number of real roots. Our work is a step towards understanding the practical complexity of real root isolation. This enables a better juxtaposition against numerical solvers, the latter having worst-case complexity in \sOB(N^4). % Our approach extends to complex root isolation, where we offer a simple proof leading to bounds % for the number of steps that the subdivision algorithm performs on the worst and average-case complexities of \sOB(N^7 ) and \sOB(N^6) respectively, where the latter is output-sensitive
On the complexity of real root isolation using Continued Fractions
We present algorithmic, complexity and implementation results concerning real root isolation of integer univariate polynomials using the continued fraction expansion of real algebraic numbers. One motivation is to explain the method's good performance in practice. We improve the previously known bound by a factor of , where is the polynomial degree and bounds the coefficient bit size, thus matching the current record complexity for real root isolation by exact methods (Sturm, Descartes and Bernstein subdivision). Namely our complexity bound is \sOB(d^4 \tau^2) using a standard bound on the expected bit size of the integers in the continued fraction expansion. Moreover, using a homothetic transformation we improve the expected complexity bound to \sOB( d^3 \tau) under the assumption that d = \OO( \tau). We compute the multiplicities within the same complexity and extend the algorithm to non square-free polynomials. Finally, we present an efficient open-source \texttt{C++} implementation and illustrate its completeness and efficiency as compared to other available software. For this we use polynomials with coefficient bit size up to 8000 bits and degree up to 1000
A Polynomial Based Approach to Extract Fiber Directions from the ODF and its Experimental Validation
International audienceIn Diffusion MRI, spherical functions are commonly employed to represent the diffusion information. The ODF is an intuitive spherical function since its maxima are aligned with the dominant fiber directions. Therefore, it is important to correctly determine these maximal directions, as they are the key to tracing fiber tracts. A tractography algorithm will suffer from cumulative error when the maximal directions are incorrectly estimated locally. The goal of this work is to present a polynomial based approach for estimating the maximal directions correctly. The paper will also present a measure of the correctness of the estimation. This approach will be tested on synthetic, phantom, and real data, and will be compared to an existing discrete “mesh-search” approach [2]. It will be shown how this approach naturally overcomes the inherent shortcomings of the discrete search. Finally, although, the approach is demonstrated on the ODF, it can be equally applied to any spherical function
- …