Applications of a Numerical Version of Terracini’s Lemma for Secants and Joins
نویسندگان
چکیده
This paper illustrates how methods such as homotopy continuation and monodromy, when combined with a numerical version of Terracini’s lemma, can be used to produce a high probability algorithm for computing the dimensions of secant and join varieties. The use of numerical methods allows applications to problems that are difficult to handle by purely symbolic algorithms.
منابع مشابه
A probabilistic numerical algorithm based on Terracini’s lemma for proving nondefectivity of Segre varieties
The CANDECOMP/PARAFAC (CP) tensor decomposition is a crucial data analysis and processing technique in applications and sciences. Tensors admitting a CP decomposition of rank at most s can be considered points of the sth order secant variety of a Segre variety, yet the most basic invariant of this variety—its dimension— is not yet fully understood. A conjecture was nevertheless proposed in [H. ...
متن کاملFuzzy Linear Programming and its Application for a Constructive Proof of a Fuzzy Version of Farkas Lemma
The main aim of this paper is to deal with a fuzzy version of Farkas lemma involving trapezoidal fuzzy numbers. In turns to that the fuzzy linear programming and duality theory on these problems can be used to provide a constructive proof for Farkas lemma. Keywords Farkas Lemma, Fuzzy Linear Programming, Duality, Ranking Functions.
متن کاملPERRON-FROBENIUS THEORY ON THE NUMERICAL RANGE FOR SOME CLASSES OF REAL MATRICES
We give further results for Perron-Frobenius theory on the numericalrange of real matrices and some other results generalized from nonnegative matricesto real matrices. We indicate two techniques for establishing the main theorem ofPerron and Frobenius on the numerical range. In the rst method, we use acorresponding version of Wielandt's lemma. The second technique involves graphtheory.
متن کاملSome results on the block numerical range
The main results of this paper are generalizations of classical results from the numerical range to the block numerical range. A different and simpler proof for the Perron-Frobenius theory on the block numerical range of an irreducible nonnegative matrix is given. In addition, the Wielandt's lemma and the Ky Fan's theorem on the block numerical range are extended.
متن کاملGeneric and Typical Ranks of Multi-Way Arrays
The concept of tensor rank was introduced in the twenties. In the seventies, when methods of Component Analysis on arrays with more than two indices became popular, tensor rank became a much studied topic. The generic rank may be seen as an upper bound to the number of factors that are needed to construct a random tensor. We explain in this paper how to obtain numerically in the complex field t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006