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.

Original languageEnglish
Title of host publicationNumerical Computations: Theory and Algorithms
Subtitle of host publicationConference proceedings NUMTA 2019
EditorsYaroslav D. Sergeyev, Dmitri E. Kvasov, Yaroslav D. Sergeyev, Dmitri E. Kvasov
Place of PublicationCham
PublisherSpringer Nature
Pages503-510
Number of pages8
ISBN (Print)9783030406158
DOIs
StatePublished - 2020
Event3rd Triennial International Conference and Summer School on Numerical Computations: Theory and Algorithms, NUMTA 2019 - Crotone, Italy
Duration: 15 Jun 201921 Jun 2019

Publication series

NameLecture Notes in Computer Science
Volume11974
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference3rd Triennial International Conference and Summer School on Numerical Computations: Theory and Algorithms, NUMTA 2019
Country/TerritoryItaly
CityCrotone
Period15/06/1921/06/19

    Research areas

  • Coulomb potential, Stationary points, Weber problem

    Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

ID: 52360564