Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
162 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Convergence analysis of Lawson's iteration for the polynomial and rational minimax approximations (2401.00778v2)

Published 1 Jan 2024 in math.NA and cs.NA

Abstract: Lawson's iteration is a classical and effective method for solving the linear (polynomial) minimax approximation in the complex plane. Extension of Lawson's iteration for the rational minimax approximation with both computationally high efficiency and theoretical guarantee is challenging. A recent work [L.-H. Zhang, L. Yang, W. H. Yang and Y.-N. Zhang, A convex dual programming for the rational minimax approximation and Lawson's iteration, 2023, arXiv:2308.06991v1] reveals that Lawson's iteration can be viewed as a method for solving the dual problem of the original rational minimax approximation, and a new type of Lawson's iteration was proposed. Such a dual problem is guaranteed to obtain the original minimax solution under Ruttan's sufficient condition, and numerically, the proposed Lawson's iteration was observed to converge monotonically with respect to the dual objective function. In this paper, we perform theoretical convergence analysis for Lawson's iteration for both the linear and rational minimax approximations. In particular, we show that (i) for the linear minimax approximation, the near-optimal Lawson exponent $\beta$ in Lawson's iteration is $\beta=1$, and (ii) for the rational minimax approximation, the proposed Lawson's iteration converges monotonically with respect to the dual objective function for any sufficiently small $\beta>0$, and the limit approximant fulfills the complementary slackness: any node associated with positive weight either is an interpolation point or has a constant error.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (43)
  1. R. S. Adve, T. K. Sarkar, S. M. Rao, E. K. Miller and D. R. Pflug, Application of the Cauchy method for extrapolating/interpolating narrow-band system responses, IEEE Trans. Microw. Theory Tech., 45 (1997), 837–845.
  2. A. C. Antoulas, C. A. Beattie and S. Güğercin, Interpolatory Methods for Model Reduction, SIAM, Philadelphia, PA, 2020, URL https://epubs.siam.org/doi/abs/10.1137/1.9781611976083.
  3. I. Barrodale and J. Mason, Two simple algorithms for discrete rational approximation, Math. Comp., 24 (1970), 877–891.
  4. P. D. Brubeck, Y. Nakatsukasa and L. N. Trefethen, Vandermonde with Arnoldi, SIAM Rev., 63 (2021), 405–415.
  5. A. K. Cline, Rate of convergence of Lawson’s algorithm, Math. Comp., 26 (1972), 167–176.
  6. P. Cooper, Rational approximation of discrete data with asymptotic behaviour, PhD thesis, University of Huddersfield, 2007.
  7. L. Davis, W. Johns, L. Monzón and M. Reynolds, Iterative stability enforcement in adaptive Antoulas–Anderson algorithms for ℋ2subscriptℋ2\mathcal{H}_{2}caligraphic_H start_POSTSUBSCRIPT 2 end_POSTSUBSCRIPT model reduction, SIAM J. Sci. Comput., 45 (2023), A1844–A1861, URL https://doi.org/10.1137/21M1467043.
  8. N. Derevianko, G. Plonka and M. Petz, From ESPRIT to ESPIRA: estimation of signal parameters by iterative rational approximation, IMA J. Numer. Anal., 43 (2023), 789–827.
  9. S. Ellacott and J. Williams, Linear Chebyshev approximation in the complex plane using Lawson’s algorithm, Math. Comp., 30 (1976), 35–44.
  10. G. H. Elliott, The construction of Chebyshev approximations in the complex plane, PhD thesis, Facultyof Science (Mathematics), University of London, 1978.
  11. S.-I. Filip, Y. Nakatsukasa, L. N. Trefethen and B. Beckermann, Rational minimax approximation via adaptive barycentric representations, SIAM J. Sci. Comput., 40 (2018), A2427–A2455.
  12. A. García-Lamparez, T. K. Sarkar and M. Salazar-Palma, Robust computation and modelling of wideband system responses using the Cauchy method, in IEEE AP-S Int. Symp. Jun. 16–21, 2002, 2002, 720–723.
  13. A. García-Lampérez, T. K. Sarkar and M. Salazar-Palma, Generation of accurate rational models of lossy systems using the Cauchy method, IEEE Microw. Wireless Compon. Lett., 14 (2004), 490–492.
  14. A. Gopal and L. N. Trefethen, Representation of conformal maps by rational functions, Numer. Math., 142 (2019), 359–382.
  15. I. V. Gosea and S. Güttel, Algorithms for the rational approximation of matrix-valued functions, SIAM J. Sci. Comput., 43 (2021), A3033–A3054, URL https://doi.org/10.1137/20M1324727.
  16. M. H. Gutknecht, On complex rational approximation. Part I: The characterization problem, in Computational Aspects of Complex Analysis (H. Werneret at.,eds.). Dordrecht : Reidel, 1983, 79–101.
  17. A. Hochman, FastAAA: A fast rational-function fitter, in 2017 IEEE 26th Conference on Electrical Performance of Electronic Packaging and Systems (EPEPS), IEEE, 2017, 1–3.
  18. J. M. Hokanson, Multivariate rational approximation using a stabilized Sanathanan-Koerner iteration, 2020, URL arXiv:2009.10803v1.
  19. M.-P. Istace and J.-P. Thiran, On computing best Chebyshev complex rational approximants, Numer. Algorithms, 5 (1993), 299–308.
  20. T. Kato, Perturbation Theory for Linear Operators, Springer-Verlag Inc., New York, 1966.
  21. C. L. Lawson, Contributions to the Theory of Linear Least Maximum Approximations, PhD thesis, UCLA, USA, 1961.
  22. H. L. Loeb, On rational fraction approximations at discrete points, Technical report, Convair Astronautics, 1957, Math. Preprint #9.
  23. Y. Nakatsukasa, O. Sète and L. N. Trefethen, The AAA algorithm for rational approximation, SIAM J. Sci. Comput., 40 (2018), A1494–A1522.
  24. Y. Nakatsukasa and L. N. Trefethen, An algorithm for real and complex rational minimax approximation, SIAM J. Sci. Comput., 42 (2020), A3157–A3179.
  25. Y. Nakatsukasa, O. Sète and L. N. Trefethen, The first five years of the AAA algorithm, URL https://arxiv.org/pdf/2312.03565.
  26. J. R. Rice, The approximation of functions, Addison-Wesley publishing Company, 1969.
  27. J. R. Rice and K. H. Usow, The Lawson algorithm and extensions, Math. Comp., 22 (1968), 118–127.
  28. T. J. Rivlin and H. S. Shapiro, A unified approach to certain problems of approximation and minimization, J. Soc. Indust. Appl. Math., 9 (1961), 670–699.
  29. A. Ruttan, A characterization of best complex rational approximants in a fundamental case, Constr. Approx., 1 (1985), 287–296.
  30. E. B. Saff and R. S. Varga, Nonuniqueness of best approximating complex rational functions, Bull. Amer. Math. Soc., 83 (1977), 375–377.
  31. C. K. Sanathanan and J. Koerner, Transfer function synthesis as a ratio of two complex polynomials, IEEE T. Automat. Contr., 8 (1963), 56–58, URL https://doi.org/10.1109/TAC.1963.1105517.
  32. J.-P. Thiran and M.-P. Istace, Optimality and uniqueness conditions in complex rational Chebyshev approximation with examples, Constr. Approx., 9 (1993), 83–103.
  33. D. Traina, G. Macchiarella and T. K. Sarkar, Robust formulations of the Cauchy method suitable for microwave duplexers modeling, IEEE Trans. Microw. Theory Tech., 55 (2007), 974–982.
  34. L. N. Trefethen, Approximation Theory and Approximation Practice, Extended Edition, SIAM, 2019.
  35. L. N. Trefethen, Numerical conformal mapping with rational functions, Comp. Meth. Funct. Thy., 20 (2020), 369–387.
  36. A. Valera-Rivera and A. E. Engin, AAA algorithm for rational transfer function approximation with stable poles, Lett. Electr. Compatibility Prac. and Applics., 3 (2021), 92–95.
  37. H. Wilber, A. Damle and A. Townsend, Data-driven algorithms for signal processing with trigonometric rational functions, SIAM J. Sci. Comput., 44 (2022), C185–C209, URL https://doi.org/10.1137/21M1420277.
  38. J. Williams, Numerical Chebyshev approximation in the complex plane, SIAM J. Numer. Anal., 9 (1972), 638–649.
  39. J. Williams, Characterization and computation of rational Chebyshev approximations in the complex plane, SIAM J. Numer. Anal., 16 (1979), 819–827.
  40. D. E. Wulbert, On the characterization of complex rational approximations, Illinois J. Math., 24 (1980), 140–155.
  41. L. Yang, L.-H. Zhang and Y. Zhang, The Lq-weighted dual programming of the linear Chebyshev approximation and an interior-point method, 2023, URL https://arxiv.org/abs/2308.07636.
  42. L.-H. Zhang, Y. Su and R.-C. Li, Accurate polynomial fitting and evaluation via Arnoldi, Numerical Algebra, Control and Optimization, to appear, Doi:10.3934/naco.2023002.
  43. L.-H. Zhang, L. Yang, W. H. Yang and Y.-N. Zhang, A convex dual programming for the rational minimax approximation and Lawson’s iteration, 2023, URL https://arxiv.org/pdf/2308.06991v1.

Summary

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

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