Euclidean Distance Degree of the Multiview Variety

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Euclidean Distance Degree of an Algebraic Variety

The nearest point map of a real algebraic variety with respect to Euclidean distance is an algebraic function. For instance, for varieties of low rank matrices, the Eckart-Young Theorem states that this map is given by the singular value decomposition. This article develops a theory of such nearest point maps from the perspective of computational algebraic geometry. The Euclidean distance degre...

متن کامل

Euclidean Distance Degree for Chemical Reaction Networks

In this paper we investigate the complexity of model selection and model testing in chemical reaction networks by formulating them as Euclidean distance problems. We determine closed form expressions for the Euclidean distance degree of the steady state varieties associated to several different families of toric chemical reaction networks with arbitrarily many reaction sites. We show how our re...

متن کامل

The Euclidean Distance Degree of Smooth Complex Projective Varieties

We obtain several formulas for the Euclidean distance degree (ED degree) of an arbitrary nonsingular variety in projective space: in terms of Chern and Segre classes, Milnor classes, Chern-Schwartz-MacPherson classes, and an extremely simple formula equating the Euclidean distance degree of X with the Euler characteristic of an open subset of X.

متن کامل

The Euclidean Distance Degree of Orthogonally Invariant Matrix Varieties

We show that the Euclidean distance degree of a real orthogonally invariant matrix variety equals the Euclidean distance degree of its restriction to diagonal matrices. We illustrate how this result can greatly simplify calculations in concrete circumstances.

متن کامل

Degree distance index of the Mycielskian and its complement

In this paper, we determine the degree distance of the complement of arbitrary Mycielskian graphs. It is well known that almost all graphs have diameter two. We determine this graphical invariant for the Mycielskian of graphs with diameter two.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: SIAM Journal on Applied Algebra and Geometry

سال: 2020

ISSN: 2470-6566

DOI: 10.1137/18m1233406