Skip to main content
Log in

Subperiodic Dubiner distance, norming meshes and trigonometric polynomial optimization

  • Original Paper
  • Published:
Optimization Letters Aims and scope Submit manuscript

Abstract

We extend the notion of Dubiner distance from algebraic to trigonometric polynomials on subintervals of the period, and we obtain its explicit form by the Szegő variant of Videnskii inequality. This allows to improve previous estimates for Chebyshev-like trigonometric norming meshes, and suggests a possible use of such meshes in the framework of multivariate polynomial optimization on regions defined by circular arcs.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1

Similar content being viewed by others

References

  1. Bos, L.: A simple recipe for modelling a d-cube by Lissajous curves. Dolomites Res. Notes Approx. (DRNA) 10, 1–4 (2017)

    MathSciNet  MATH  Google Scholar 

  2. Bos, L., Calvi, J.P., Levenberg, N., Sommariva, A., Vianello, M.: Geometric weakly admissible meshes, discrete least squares approximations and approximate Fekete points. Math. Comput. 80, 1601–1621 (2011)

    Article  MathSciNet  Google Scholar 

  3. Bos, L., Levenberg, N., Waldron, S.: Pseudometrics, distances and multivariate polynomial inequalities. J. Approx. Theory 153, 80–96 (2008)

    Article  MathSciNet  Google Scholar 

  4. Bos, L., Vianello, M.: Low cardinality admissible meshes on quadrangles, triangles and disks. Math. Inequal. Appl. 15, 229–235 (2012)

    MathSciNet  MATH  Google Scholar 

  5. Caliari, M., De Marchi, S., Vianello, M.: Bivariate polynomial interpolation on the square at new nodal sets. Appl. Math. Comput. 165(2), 261–274 (2005)

    MathSciNet  MATH  Google Scholar 

  6. Calvi, J.P., Levenberg, N.: Uniform approximation by discrete least squares polynomials. J. Approx. Theory 152, 82–100 (2008)

    Article  MathSciNet  Google Scholar 

  7. Da Fies, G., Vianello, M.: Trigonometric Gaussian quadrature on subintervals of the period. Electron. Trans. Numer. Anal. 39, 102–112 (2012)

    MathSciNet  MATH  Google Scholar 

  8. de Klerk, E.: The complexity of optimizing over a simplex, hypercube or sphere: a short survey. Cent. Eur. J. Oper. Res. (CEJOR) 16, 111–125 (2008)

    Article  MathSciNet  Google Scholar 

  9. Dubiner, M.: The theory of multidimensional polynomial approximation. J. Anal. Math. 67, 39–116 (1995)

    Article  MathSciNet  Google Scholar 

  10. Ehlich, H., Zeller, K.: Schwankung von Polynomen zwischen Gitter punkten. Math. Z. 86, 41–44 (1964)

    Article  MathSciNet  Google Scholar 

  11. Gentile, M., Sommariva, A., Vianello, M.: Polynomial approximation and quadrature on geographic rectangles. Appl. Math. Comput. 297, 159–179 (2017)

    MathSciNet  Google Scholar 

  12. Kroó, A.: On optimal polynomial meshes. J. Approx. Theory 163, 1107–1124 (2011)

    Article  MathSciNet  Google Scholar 

  13. Piazzon, F.: Optimal polynomial admissible meshes on some classes of compact subsets of \(\mathbb{R}^d\). J. Approx. Theory 207, 241–264 (2016)

    Article  MathSciNet  Google Scholar 

  14. Piazzon, F., Vianello, M.: Jacobi norming meshes. Math. Inequal. Appl. 19, 1089–1095 (2016)

    MathSciNet  MATH  Google Scholar 

  15. Piazzon, F., Vianello, M.: A note on total degree polynomial optimization by Chebyshev grids. Optim. Lett. 12, 63–71 (2018)

    Article  MathSciNet  Google Scholar 

  16. Sommariva, A., Vianello, M.: Polynomial fitting and interpolation on circular sections. Appl. Math. Comput. 258, 410–424 (2015)

    MathSciNet  MATH  Google Scholar 

  17. Totik, V.: Bernstein-type inequalities. J. Approx. Theory 164, 1390–1401 (2012)

    Article  MathSciNet  Google Scholar 

  18. Vianello, M.: Norming meshes by Bernstein-like inequalities. Math. Inequal. Appl. 17, 929–936 (2014)

    MathSciNet  MATH  Google Scholar 

  19. Videnskii, V.S.: Extremal estimates for the derivative of a trigonometric polynomial on an interval shorter than its period. Sov. Math. Dokl. 1, 5–8 (1960)

    MathSciNet  Google Scholar 

  20. Zhang, J.F., Kwong, C.P.: Some applications of a polynomial inequality to global optimization. J. Optim. Theory Appl. 127, 193–205 (2005)

    Article  MathSciNet  Google Scholar 

Download references

Acknowledgements

Work partially supported by the Horizon 2020 ERA-PLANET European project “GEOEssential”, by the DOR funds and the biennial Project BIRD163015 of the University of Padova, and by the GNCS-INdAM. This research has been accomplished within the RITA “Research ITalian network on Approximation’.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Marco Vianello.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Vianello, M. Subperiodic Dubiner distance, norming meshes and trigonometric polynomial optimization. Optim Lett 12, 1659–1667 (2018). https://doi.org/10.1007/s11590-018-1250-1

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11590-018-1250-1

Keywords

Navigation