Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Computation of the distance from an ellipsoid to a linear surface and a quadric in \(\mathbb R^n\)

From MaRDI portal
Publication:951718
Jump to:navigation, search

DOI10.1134/S1064562408020270zbMath1152.53005MaRDI QIDQ951718

Marina V. Goncharova, Alexei Yu. Uteshev

Publication date: 27 October 2008

Published in: Doklady Mathematics (Search for Journal in Brave)


zbMATH Keywords

pattern recognitionoptimization problemsystem of algebraic equations


Mathematics Subject Classification ID

Higher-dimensional and -codimensional surfaces in Euclidean and related (n)-spaces (53A07) Pattern recognition, speech recognition (68T10) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10)


Related Items

Comparison of methods computing the distance between two ellipsoids ⋮ Comparative study of two fast algorithms for projecting a point to the standard simplex ⋮ Asymptotic stability conditions for a class of hybrid mechanical systems with switched nonlinear positional forces ⋮ Complexity Estimation for an Algorithm of Searching for Zero of a Piecewise Linear Convex Function ⋮ The alternating direction method of multipliers for finding the distance between ellipsoids ⋮ Finding the distance between ellipsoids


Uses Software

  • GTEngine


Cites Work

  • Computational methods of linear algebra
Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:951718&oldid=12927706"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 30 January 2024, at 19:32.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki