Abstract
By closely following a construction by Ganelius, we use Faber rational functions to derive tight explicit bounds on Zolotarev numbers. We use our results to bound the singular values of matrices, including complex-valued Cauchy matrices and Vandermonde matrices with nodes inside the unit disk. We construct Faber rational functions using doubly connected conformal maps and use their zeros and poles to supply shift parameters in the alternating direction implicit method.
Similar content being viewed by others
Notes
The requirement that \(\delta >0\) is a technical necessity as \(R_n(z)\) is defined for \(z\in {\mathbb {C}}{\setminus }F\). Later, we take \(\delta \rightarrow 0\) so conceptually one may prefer to think of \(\eta \) as a parameterization of the boundary of F.
We avoid sampling directly on \(\partial F\) in our applications, and so omit discussion on the numerical computation of principle value integrals.
References
Akhiezer, N.I.: Elements of the Theory of Elliptic Functions, Translations of Mathematical Monographs, vol. 79. AMS, Providence (1990)
Anderson, J.M.: The Faber Operator, Rational Approximation and Interpolation, pp. 1–10. Springer, Berlin (1984)
Bagby, T.: On interpolation by rational functions. Duke Math. J. 36(1), 95–104 (1969)
Batenkov, D., Diederichs, B., Goldman, G., Yomdin, Y.: The spectral properties of Vandermonde matrices with clustered nodes, arXiv preprint, arXiv:1909.01927
Bazán, F.S.V.: Conditioning of rectangular Vandermonde matrices with nodes in the unit disk. SIAM J. Mat. Anal. Appl. 21(2), 679–693 (2000)
Beckermann, B., Townsend, A.: On the singular values of matrices with displacement structure. SIAM Rev. 61, 319–344 (2019)
Berrut, J.P., Trefethen, L.N.: Barycentric Lagrange interpolation. SIAM Rev. 46(3), 501–517 (2004)
Beylkin, G., Monzón, L.: On approximation of functions by exponential sums. Appl. Comput. Harm. Anal. 19, 17–48 (2005)
Courant, R.: Dirichlet’s Principle, Conformal Mapping, and Minimal Surfaces. Springer, New York (1977)
Faber, G.: Über polynomische entwickelungen. Math. Ann. 57(3), 389–408 (1903)
Gaier, D.: Lectures on Complex Approximation, vol. 188. Birkhäuser, Boston (1987)
Ganelius, T.: Rational functions, capacities and approximation. Aspects of contemporary complex analysis. In: Proceedings of the NATO Advanced Study Institute, University, Durham, Durham, 1979, pp. 409–414. Academic Press, London (1980)
Ganelius, T.: Some extremal functions and approximation, Fourier analysis and approximation theory. In: Proceedings of a Colloquium (Budapest), pp. 371–381 (1976)
T. Ganelius, Rational approximation in the complex plane and on the line, Chalmers Tekniska Högskola/Göteborgs Universitet. Dept. Math. (1975)
Gončar, A.A.: Zolotarev problems connected with rational functions. Math. USSR Sbornik 7(4) 623–635 (1969)
Goodman, A.W.: A note on the zeros of Faber polynomials. Proc. Am. Math. Soc. 49, 2 (1975)
Gopal, A., Trefethen, L.N.: Solving Laplace problems with corner singularities via rational functions. SIAM J. Number. Anal. 57(5), 2074–2094 (2019)
Greene, R.E., Krantz, S.G.: Function Theory of One Complex Variable, 3rd edition, Graduate Studies in Mathematics, vol. 40. AMS Providence, Rhode Island (2006)
Güttel, S., Polizzi, E., Tang, P.T.P., Viaud, G.: Zolotarev quadrature rules and load balancing for the FEAST eigensolver. SIAM J. Sci. Comput. 37, A2100–A2122 (2015)
Henrici, P.: Applied and Computational Complex Analysis, vol. 3. Wiley, New York (1986)
Hu, C.: Algorithm 785: a software package for computing Schwarz–Christoffel conformal transformation for doubly connected polygonal regions. ACM Trans. Math. Soft. 24(3), 317–333 (1998)
Kövari, T., Pommerenke, C.: On Faber polynomials and Faber expansions. Math. Zeitschr. 99, 193–206 (1967)
Lebedev, V.I.: On a Zolotarev problem in the method of alternating directions. USSR Comput. Math. Math. Phys. 17(2), 58–76 (1977)
Moitra, A.: Super-resolution, extremal functions and the condition number of Vandermonde matrices. In: Proceedings of 47th Annual ACM Symposium on Theory of Computing, pp. 821–830 (2015)
Nakatsukasa, Y., Freund, R.W.: Computing fundamental matrix decompositions accurately via the matrix sign function in two iterations: the power of Zolotarev’s functions. SIAM Rev. 58, 461–493 (2016)
Nakatsukasa, Y., Sète, O., Trefethen, L.N.: The AAA algorithm for rational approximation. SIAM J. Sci. Comput. 40(3), A1494–A1522 (2018)
Potts, D., Tasche, M.: Parameter estimation for exponential sums by approximate Prony method. Signal Process. 90(5), 1631–1642 (2010)
Radon, J.: Über Randwertaufgaben beim logarithmischen Potential. Sitzber. Akad. Wiss. Wien 128, 1123–1167 (1919)
Saff, E.B., Totik, V.: Logarithmic Potentials with External Fields. Springer, New York (2013)
Schiffer, M.: Some Recent Developments in the Theory of Conformal Mapping, Appendix to R. Dirichlet’s Principle, Conformal Mapping and Minimal Surfaces. Interscience, Courant Dover Publications, Mineola, New York (1950)
Simoncini, V.: Computational methods for linear matrix equations. SIAM Rev. 58(3), 377–441 (2016)
Starke, G.: Near-circularity for the rational Zolotarev problem in the complex plane. J. Approx. Theory 70, 115–130 (1992)
Trefethen, L.N.: Numerical conformal mapping with rational functions. In: Computational Methods and Function Theory (2020) to appear
Walsh, J.L.: Hyperbolic capacity and interpolating rational functions. Duke Math. J. 32(3), 369–379 (1965)
Zolotarev, E.I.: Application of elliptic functions to questions of functions deviating least and most from zero. Zap. Imp. Akad. Nauk. St. Petersburg 30, 1–59 (1877)
Acknowledgements
We are extremely grateful to the two anonymous referees for their thoughtful suggestions and careful attention to detail.
Funding
This work was partly supported by National Science Foundation Grant No. DMS-1818757, No. DMS-1952757, No. DMS-2045646, and no. DGE-1650441.
Author information
Authors and Affiliations
Corresponding author
Additional information
Communicated by Edward B. Saff.
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Appendix A: Ensuring \({\mathbf {n}}\) is Large Enough for a Valid Bound
Appendix A: Ensuring \({\mathbf {n}}\) is Large Enough for a Valid Bound
For the bound in (1.4) to be effective, n must be taken large enough so that both \(h^n > C_n\), and the lower bound in (4.8) must also be greater than 0, or
so that the denominator in (1.4) is positive. This latter condition subsumes the first, and so a minimal effective value of n may be given as follows.
Lemma A.1
For any integer \(n>\log (x_1)/\log (h)\), we have that the expression in (4.8) is greater than 0, where \(x_1\) is the largest positive real root of the seventh-degree polynomial
where we have abbreviated \(\mathrm{Rot}(E)\) and \(\mathrm{Rot}(F)\) as e and f, respectively.
In the case where E and F are convex, the polynomial above reduces to
whose rightmost root satisfies \(29.9< x_1 < 29.901\).
Rights and permissions
About this article
Cite this article
Rubin, D., Townsend, A. & Wilber, H. Bounding Zolotarev Numbers Using Faber Rational Functions. Constr Approx 56, 207–232 (2022). https://doi.org/10.1007/s00365-022-09585-2
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00365-022-09585-2