Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
97 tokens/sec
GPT-4o
53 tokens/sec
Gemini 2.5 Pro Pro
43 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
47 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

A Riemann--Hilbert approach to computing the inverse spectral map for measures supported on disjoint intervals (2302.12930v4)

Published 24 Feb 2023 in math.NA, cs.NA, and math.CV

Abstract: We develop a numerical method for computing with orthogonal polynomials that are orthogonal on multiple, disjoint intervals for which analytical formulae are currently unknown. Our approach exploits the Fokas--Its--Kitaev Riemann--Hilbert representation of the orthogonal polynomials to produce an $\mathrm{O}(N)$ method to compute the first $N$ recurrence coefficients. The method can also be used for pointwise evaluation of the polynomials and their Cauchy transforms throughout the complex plane. The method encodes the singularity behavior of weight functions using weighted Cauchy integrals of Chebyshev polynomials. This greatly improves the efficiency of the method, outperforming other available techniques. We demonstrate the fast convergence of our method and present applications to integrable systems and approximation theory.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (40)
  1. Complex Variables: Introduction and Applications. Cambridge Texts in Applied Mathematics. Cambridge University Press, 2 edition, 2003.
  2. A. I. Aptekarev. Asymptotic properties of polynomials orthogonal on a system of contours, and periodic motions of Toda lattices. Mathematics of the USSR-Sbornik, 53(1):233–260, February 1986.
  3. C. Ballew and T. Trogdon. https://github.com/cade-b/RecurrenceCoefficients.jl, 2023.
  4. Computation of Large-Genus Solutions of the Korteweg-de Vries Equation. arXiv preprint 2205.00153, 2022.
  5. I. Bogaert. Iteration-Free Computation of Gauss–Legendre Quadrature Nodes and Weights. SIAM Journal on Scientific Computing, 36(3):A1008–A1026, 2014.
  6. Randomized matrix-free quadrature for spectrum and spectral sum approximation. arXiv preprint 2204.01941, 2022.
  7. C. de Boor and J. R. Rice. Extremal Polynomials with Application to Richardson Iteration for Indefinite Linear Systems. SIAM Journal on Scientific and Statistical Computing, 3(1):47–57, 1982.
  8. Computing Riemann Theta Functions. Mathematics of Computation, 73(247):1417–1442, 2004.
  9. P. Deift. Orthogonal polynomials and random matrices: A Riemann-Hilbert approach. American Math. Soc., 2000.
  10. Toda flows with infinitely many variables. Journal of Functional Analysis, 64(3):358–402, 1985.
  11. P. Deift and X. Zhou. A Steepest Descent Method for Oscillatory Riemann–Hilbert Problems. Asymptotics for the MKdV Equation. Annals of Mathematics, 137(2):295–368, 1993.
  12. X. Ding and T. Trogdon. A Riemann–Hilbert approach to the perturbation theory for orthogonal polynomials: Applications to numerical linear algebra and random matrix theory. arXiv preprint 2112.12354, 2021.
  13. NIST Digital Library of Mathematical Functions. http://dlmf.nist.gov/, Release 1.1.8 of 2022-12-15. F. W. J. Olver, A. B. Olde Daalhuis, D. W. Lozier, B. I. Schneider, R. F. Boisvert, C. W. Clark, B. R. Miller, B. V. Saunders, H. S. Cohl, and M. A. McClain, eds.
  14. The isomonodromy approach to matric models in 2D quantum gravity. Communications in Mathematical Physics, 147(2):395–430, 1992.
  15. W. Gautschi. Orthogonal Polynomials: Computation and Approximation. Oxford University Press, 2004.
  16. J. S. Geronimo. Scattering Theory, Orthogonal Polynomials, and q-Series. SIAM Journal on Mathematical Analysis, 25(2):392–419, 1994.
  17. Orthogonal polynomials on several intervals via a polynomial mapping. Transactions of the American Mathematical Society, 308(2):559–581, 1988.
  18. Calculation of Gauss quadrature rules. Mathematics of Computation, 23(106):221–221, 1969.
  19. The numerically stable reconstruction of Jacobi matrices from spectral data. Numerische Mathematik, 44(3):317–335, 1984.
  20. Polynomial and rational measure modifications of orthogonal polynomials via infinite-dimensional banded matrix factorizations. arXiv preprint 2302.08448, 2023.
  21. N. Hale and A. Townsend. Fast and Accurate Computation of Gauss-Legendre and Gauss-Jacobi Quadrature Nodes and Weights. SIAM J. Sci. Comput., 35(2):A652–A674, 2013.
  22. A. S. Householder. Unitary Triangularization of a Nonsymmetric Matrix. J. ACM, 5(4):339–342, 1958.
  23. D. Huybrechs and P. Opsomer. Construction and implementation of asymptotic expansions for Laguerre-type orthogonal polynomials. IMA Journal of Numerical Analysis, 38(3):1085–1118, 2018.
  24. A. B. J. Kuijlaars. Riemann-Hilbert Analysis for Orthogonal Polynomials, pages 167–210. Springer Berlin Heidelberg, Berlin, Heidelberg, 2003.
  25. The Riemann-Hilbert approach to strong asymptotics for orthogonal polynomials on [–1,1]. Advances in Mathematics, 188(2):337–398, 2004.
  26. C. Lanczos. An iteration method for the solution of the eigenvalue problem of linear differential and integral operators. Journal of Research of the National Bureau of Standards, 45(4):255, 1950.
  27. Chebyshev Polynomials. Chapman and Hall/CRC, 2002.
  28. J. Moser. Three integrable Hamiltonian systems connected with isospectral deformations. Advances in Mathematics, 16(2):197–220, 1975.
  29. N. I. Muskhelishvili. Singular Integral Equations. Springer Netherlands, 1977.
  30. S. Olver. A general framework for solving Riemann–Hilbert problems numerically. Numerische Mathematik, 122(2):305–340, 2012.
  31. Fast algorithms using orthogonal polynomials. Acta Numerica, 29:573–699, 2020.
  32. S. Olver and A. Townsend. A Fast and Well-Conditioned Spectral Method. SIAM Review, 55(3):462–489, 2013.
  33. F. Peherstorfer. Orthogonal polynomials on several intervals: Accumulation points of recurrence coefficients and of zeros. Journal of Approximation Theory, 163(7):814–837, 2011. 10th International Symposium on “Orthogonal Polynomials, Special Functions and Applications”.
  34. Y. Saad. Iterative Solution of Indefinite Symmetric Linear Systems by Methods Using Orthogonal Polynomials over Two Disjoint Intervals. SIAM Journal on Numerical Analysis, 20(4):784–811, 1983.
  35. K. Sogo. Time-Dependent Orthogonal Polynomials and Theory of Soliton Applications to Matrix Model, Vertex Model and Level Statistics. Journal of The Physical Society of Japan - J PHYS SOC JPN, 62:1887–1894, 1993.
  36. G. Szegő. Orthogonal Polynomials. American Mathematical Society, 1939.
  37. Fast computation of Gauss quadrature nodes and weights on the whole real line. IMA Journal of Numerical Analysis, 36(1):337–358, 2014.
  38. T. Trogdon and S. Olver. A Riemann–Hilbert approach to Jacobi operators and Gaussian quadrature. IMA Journal of Numerical Analysis, 36(1):174–196, 2015.
  39. T. Trogdon and S. Olver. Riemann–Hilbert Problems, Their Numerical Solution, and the Computation of Nonlinear Special Functions. Society for Industrial and Applied Mathematics, Philadelphia, PA, 2015.
  40. M. L. Yattselev. Nuttall’s theorem with analytic weights on algebraic S-contours. Journal of Approximation Theory, 190:73–90, 2015. Special Issue Dedicated to the memory of Andrei Aleksandrovich Gonchar and Herbert Stahl.
User Edit Pencil Streamline Icon: https://streamlinehq.com
Authors (2)
  1. Cade Ballew (4 papers)
  2. Thomas Trogdon (52 papers)
Citations (4)
View on Semantic Scholar

Summary

We haven't generated a summary for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Summarize Now