World's Best Scientists 2026 revealed!

D-Index & Metrics

Mathematics

D-Index
38
Citations
10413
World Ranking
2280
National Ranking
20

Overview

Vladimir Temlyakov is affiliated with Lomonosov Moscow State University in the Russian Federation. Their research primarily focuses on various areas within mathematics, emphasizing numerical analysis, applied mathematics, and computational mechanics.

Their work spans numerous themes, including mathematical approximation and integration, sparse and compressive sensing techniques, mathematical analysis and transform methods, image and signal denoising methods, mathematical functions and polynomials, approximation theory and sequence spaces, and numerical methods in inverse problems.

Temlyakov has contributed to a substantial number of publications, with a total exceeding 100 in the field of mathematics. Their research findings appear frequently in venues such as arXiv (Cornell University), Journal of Complexity, Journal of Approximation Theory, Математический сборник, and Sbornik Mathematics.

Significant recent papers authored or coauthored by Temlyakov include:

  • On optimal recovery in L2, 2020, Journal of Complexity
  • Sampling discretization and related problems, 2022, Journal of Complexity
  • On sampling discretization in L2, 2022, Journal of Mathematical Analysis and Applications
  • Entropy numbers and Marcinkiewicz-type discretization, 2021, Journal of Functional Analysis
  • Sampling Discretization of Integral Norms, 2021, Constructive Approximation

Throughout their career, Temlyakov has collaborated extensively with several researchers. Frequent coauthors include Feng Dai, Egor D. Kosov, Irina Viktorovna Limonova, Alexei Shadrin, and Sergey Tikhonov.

Best Publications

  • Stable recovery of sparse overcomplete representations in the presence of noise

    D.L. Donoho;M. Elad;V.N. Temlyakov

  • Some remarks on greedy algorithms

    Ronald A. DeVore;Vladimir N. Temlyakov

  • Nonlinear Methods of Approximation

    Vladimir N. Temlyakov

  • Weak greedy algorithms[*]This research was supported by National Science Foundation Grant DMS 9970326 and by ONR Grant N00014‐96‐1‐1003.

    Vladimir N. Temlyakov

  • Greedy Approximation

    Vladimir Temlyakov

  • Hyperbolic Cross Approximation

    Dinh Dũng;Vladimir Temlyakov;Tino Ullrich

  • The Orthogonal Super Greedy Algorithm and Applications in Compressed Sensing

    Entao Liu;V. N. Temlyakov

  • The best m-term approximation and greedy algorithms

    Vladimir N. Temlyakov

  • Hyperbolic wavelet approximation

    R. A. DeVore;S. V. Konyagin;V. N. Temlyakov

  • The Thresholding Greedy Algorithm, Greedy Bases, and Duality

    S.J. Dilworth;N.J. Kalton;Denka Kutzarova;V.N. Temlyakov

  • Greedy Algorithm and m -Term Trigonometric Approximation

    V. N. Temlyakov

  • Nonlinear Approximation by Trigonometric Sums

    R.A. DeVore;V.N. Temlyakov

  • A remark on Compressed Sensing

    B. S. Kashin;V. N. Temlyakov

  • Universal Algorithms for Learning Theory Part I : Piecewise Constant Functions

    Peter Binev;Albert Cohen;Wolfgang Dahmen;Ronald DeVore

  • Greedy Algorithms andM-Term Approximation with Regard to Redundant Dictionaries

    V.N. Temlyakov

  • On Approximate Recovery of Functions with Bounded Mixed Derivative

    V.N. Temlyakov

  • Greedy Algorithms in Banach Spaces

    Vladimir N. Temlyakov

  • Simultaneous approximation by greedy algorithms

    Dany Leviatan;Vladimir N. Temlyakov

  • APPROXIMATE RECOVERY OF PERIODIC FUNCTIONS OF SEVERAL VARIABLES

    V N Temlyakov

  • Approximation Methods for Supervised Learning

    Ronald Devore;Gerard Kerkyacharian;Dominique Picard;Vladimir Temlyakov

Frequent Co-Authors

Ronald A. DeVore
Ronald A. DeVore Texas A&M University
Gerard Kerkyacharian
Gerard Kerkyacharian Université Paris Cité
Michael Elad
Michael Elad Technion – Israel Institute of Technology
Dominique Picard
Dominique Picard Université Paris Cité
David L. Donoho
David L. Donoho Stanford University
Nigel J. Kalton
Nigel J. Kalton University of Missouri
Albert Cohen
Albert Cohen Google (United States)
Wolfgang Dahmen
Wolfgang Dahmen University of South Carolina
Alexandre B. Tsybakov
Alexandre B. Tsybakov École Nationale de la Statistique et de l'Administration Économique
Erich Novak
Erich Novak Friedrich Schiller University Jena

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

For students studying Mathematics in the USA, exploring related online degrees can open diverse career opportunities. A master in data analytics is a natural extension for those interested in applying mathematical skills to big data and decision-making processes in various industries.

For those looking to expand into business leadership roles, pursuing one of the easiest mba specialization options might offer a balanced approach to gaining business acumen without overwhelming time commitments. This can be especially appealing to working professionals transitioning from a technical math background.

Similarly, many prefer to combine flexibility and speed by enrolling in the easiest and fastest online mba programs. These online degrees enable students to enhance their managerial and analytical expertise with minimal disruption to their current careers.

For those aiming for executive roles in academia or industry, pursuing the cheapest dba online can provide an affordable pathway to earning a Doctorate in Business Administration without sacrificing quality or flexibility.

Best Scientists Citing Vladimir Temlyakov

Trending Scientists

Recently Published Articles