Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Research › peer-review
On Stationary Points of Distance Depending Potentials. / Uteshev, Alexei; Goncharova, Marina.
Numerical Computations: Theory and Algorithms: Conference proceedings NUMTA 2019. ed. / Yaroslav D. Sergeyev; Dmitri E. Kvasov; Yaroslav D. Sergeyev; Dmitri E. Kvasov. Cham : Springer Nature, 2020. p. 503-510 (Lecture Notes in Computer Science ; Vol. 11974 ).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Research › peer-review
}
TY - GEN
T1 - On Stationary Points of Distance Depending Potentials
AU - Uteshev, Alexei
AU - Goncharova, Marina
N1 - Uteshev A., Goncharova M. (2020) On Stationary Points of Distance Depending Potentials. In: Sergeyev Y., Kvasov D. (eds) Numerical Computations: Theory and Algorithms. NUMTA 2019. Lecture Notes in Computer Science, vol 11974. Springer, Cham Publisher Copyright: © 2020, Springer Nature Switzerland AG. Copyright: Copyright 2020 Elsevier B.V., All rights reserved.
PY - 2020
Y1 - 2020
N2 - We continue investigations started in the previous publications by the authors (LNCS, volumes 8136 (2013) and 9570 (2016)). The structure of stationary point sets is established for the family of functions given as linear combinations of an exponent L of Euclidean distances from a variable point to the fixed points in 2D and 3D spaces. We compare the structure of the stationary point sets for several values of the exponent L, focusing ourselves mainly onto the cases of Coulomb potential and Weber facility location problem. We develop the analytical approach to the problem aiming at finding the exact number of stationary points and their location in relation to the parameters involved.
AB - We continue investigations started in the previous publications by the authors (LNCS, volumes 8136 (2013) and 9570 (2016)). The structure of stationary point sets is established for the family of functions given as linear combinations of an exponent L of Euclidean distances from a variable point to the fixed points in 2D and 3D spaces. We compare the structure of the stationary point sets for several values of the exponent L, focusing ourselves mainly onto the cases of Coulomb potential and Weber facility location problem. We develop the analytical approach to the problem aiming at finding the exact number of stationary points and their location in relation to the parameters involved.
KW - Coulomb potential
KW - Stationary points
KW - Weber problem
UR - http://www.scopus.com/inward/record.url?scp=85080921829&partnerID=8YFLogxK
UR - https://www.mendeley.com/catalogue/e18a690f-741d-3d73-a1d7-672986d69149/
U2 - 10.1007/978-3-030-40616-5_49
DO - 10.1007/978-3-030-40616-5_49
M3 - Conference contribution
AN - SCOPUS:85080921829
SN - 9783030406158
T3 - Lecture Notes in Computer Science
SP - 503
EP - 510
BT - Numerical Computations: Theory and Algorithms
A2 - Sergeyev, Yaroslav D.
A2 - Kvasov, Dmitri E.
A2 - Sergeyev, Yaroslav D.
A2 - Kvasov, Dmitri E.
PB - Springer Nature
CY - Cham
T2 - 3rd Triennial International Conference and Summer School on Numerical Computations: Theory and Algorithms, NUMTA 2019
Y2 - 15 June 2019 through 21 June 2019
ER -
ID: 52360564