Abstract.
We study the optimal placement of replicas of data objects in a connected network with the topology of a straight-line segment. This special case of a NP-complete location problem has a remarkably attractive algebraic solution. The minimum cost problem gives rise to tridiagonal matrices that are both persymmetric and symmetric and these are used to prove the symmetry of the optimal solution. The eigenvalues and eigenvectors of these matrices are completely described by Chebyshev polynomials of the second kind to give a complete solution to the replica location problem. We denote the k th Chebyshev polynomials of the second kind by U k . The Chebyshev identity
arises naturally in examining the norms of the eigenvectors that occur.
Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.Author information
Authors and Affiliations
Additional information
Received: January 13, 1999; revised version: November 23, 2002
Keywords: Chebyshev polynomials of the second kind, Replica, Location, Characteristic polynomial.
Rights and permissions
About this article
Cite this article
Pressman, I. The Replica Location Problem and Chebyshev Polynomials of the Second Kind. AAECC 13, 427–436 (2003). https://doi.org/10.1007/s00200-002-0113-1
Issue Date:
DOI: https://doi.org/10.1007/s00200-002-0113-1