Doorgaan naar hoofdnavigatie Doorgaan naar zoeken Ga verder naar hoofdinhoud

The Euclidean distance degree

  • J. Draisma
  • , E. Horobet
  • , G. Ottaviani
  • , B. Sturmfels
  • , R.R. Thomas

Onderzoeksoutput: Hoofdstuk in Boek/Rapport/CongresprocedureConferentiebijdrageAcademicpeer review

1 Downloads (Pure)

Samenvatting

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 degree of a variety is the number of critical points of the squared distance to a generic point outside the variety. Focusing on varieties seen in applications, we present numerous tools for computation. Keywords: Nearest point map, Euclidean distance, polynomial optimization, computing critical points, dual variety, Chern class
Originele taal-2Engels
Titel2014 Symposium on Symbolic-Numeric Computation (SNC'14, Shanghai, China, July 28-31, 2014)
RedacteurenL. Zhi, M. Watt
Plaats van productieNew York
UitgeverijAssociation for Computing Machinery, Inc.
Pagina's9-16
ISBN van geprinte versie978-1-4503-2963-7
DOI's
StatusGepubliceerd - 2014
Evenementconference; 2014 Symposium on Symbolic-Numeric Computation; 2014-07-28; 2014-07-31 -
Duur: 28 jul. 201431 jul. 2014

Congres

Congresconference; 2014 Symposium on Symbolic-Numeric Computation; 2014-07-28; 2014-07-31
Periode28/07/1431/07/14
Ander2014 Symposium on Symbolic-Numeric Computation

Vingerafdruk

Duik in de onderzoeksthema's van 'The Euclidean distance degree'. Samen vormen ze een unieke vingerafdruk.

Citeer dit