Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDany Leviatan
Person information
- affiliation: Tel Aviv University, School of Mathematical Sciences, Israel
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2021
[j30]Kirill A. Kopotun, Dany Leviatan, Igor A. Shevchuk
:
Exact order of pointwise estimates for polynomial approximation with Hermite interpolation. J. Approx. Theory 264: 105538 (2021)- 2019
- [j29]Albert Cohen, Mark A. Davenport, Dany Leviatan:
Correction to: On the Stability and Accuracy of Least Squares Approximations. Found. Comput. Math. 19(1): 239 (2019) - [j28]Kirill A. Kopotun, Dany Leviatan, Igor A. Shevchuk:
On weighted approximation with Jacobi weights. J. Approx. Theory 237: 96-112 (2019) - [j27]Dany Leviatan, I. L. Petrova:
Interpolatory estimates in monotone piecewise polynomial approximation. J. Approx. Theory 238: 103-110 (2019) - 2018
- [j26]Dany Leviatan, I. L. Petrova:
Corrigendum to "Interpolatory estimates in monotone piecewise polynomial approximation" [J. Approx. Theory 223 (2017) 1-8]. J. Approx. Theory 228: 79-80 (2018) - 2017
- [j25]Dany Leviatan, I. L. Petrova:
Interpolatory estimates in monotone piecewise polynomial approximation. J. Approx. Theory 223: 1-8 (2017) - 2016
- [j24]Kirill A. Kopotun, Dany Leviatan, Andriy Prymak, Igor A. Shevchuk:
Yet another look at positive linear operators, q-monotonicity and applications. J. Approx. Theory 210: 1-22 (2016) - [j23]Dany Leviatan, Igor A. Shevchuk:
Comparing the degrees of unconstrained and shape preserving approximation by polynomials. J. Approx. Theory 211: 16-28 (2016) - 2014
- [j22]Dany Leviatan, Igor A. Shevchuk, O. V. Vlasiuk:
Positive results and counterexamples in comonotone approximation II. J. Approx. Theory 179: 1-23 (2014) - 2013
- [j21]Albert Cohen, Mark A. Davenport, Dany Leviatan:
On the Stability and Accuracy of Least Squares Approximations. Found. Comput. Math. 13(5): 819-834 (2013) - 2012
- [j20]Dany Leviatan, Doron S. Lubinsky:
The degree of shape preserving weighted polynomial approximation. J. Approx. Theory 164(2): 218-228 (2012) - [j19]Andriy V. Bondarenko, Dany Leviatan, Andriy Prymak:
Pointwise estimates for 3-monotone approximation. J. Approx. Theory 164(9): 1205-1232 (2012) - 2009
- [j18]Viktor N. Konovalov, Dany Leviatan, V. E. Maiorov:
Approximation of Sobolev classes by polynomials and ridge functions. J. Approx. Theory 159(1): 97-108 (2009) - [j17]Kirill A. Kopotun, Dany Leviatan, A. V. Prymak:
Nearly monotone and nearly convex approximation by smooth splines in Lp, p>0. J. Approx. Theory 160(1-2): 103-112 (2009) - 2008
- [j16]Viktor N. Konovalov, Dany Leviatan, V. E. Maiorov:
Approximation by polynomials and ridge functions of classes of s-monotone radial functions. J. Approx. Theory 152(1): 20-51 (2008) - [j15]Kirill A. Kopotun, Dany Leviatan, A. V. Prymak:
Constrained Spline Smoothing. SIAM J. Numer. Anal. 46(4): 1985-1997 (2008) - 2007
- [j14]Viktor N. Konovalov, Dany Leviatan:
Freeknot splines approximation of Sobolev-type classes of s -monotone functions. Adv. Comput. Math. 27(2): 211-236 (2007) - 2006
- [j13]Dany Leviatan, Vladimir N. Temlyakov:
Simultaneous approximation by greedy algorithms. Adv. Comput. Math. 25(1-3): 73-90 (2006) - [j12]Jacek Gilewicz, Viktor N. Konovalov, Dany Leviatan:
Widths and shape-preserving widths of Sobolev-type classes of s-monotone functions. J. Approx. Theory 140(2): 101-126 (2006) - 2005
- [j11]Dany Leviatan, A. V. Prymak:
On 3-monotone approximation by piecewise polynomials. J. Approx. Theory 133(2): 147-172 (2005) - [j10]Dany Leviatan, Vladimir N. Temlyakov:
Simultaneous greedy approximation in Banach spaces. J. Complex. 21(3): 275-293 (2005) - [j9]Shai Dekel, Dany Leviatan:
Adaptive Multivariate Approximation Using Binary Space Partitions and Geometric Wavelets. SIAM J. Numer. Anal. 43(2): 707-732 (2005) - 2004
- [j8]Shai Dekel, Dany Leviatan:
On Measuring the Efficiency of Kernel Operators in Lp(Rd). Adv. Comput. Math. 20(1-3): 53-65 (2004) - [j7]Viktor N. Konovalov, Dany Leviatan:
Free-knot Splines Approximation of s-monotone Functions. Adv. Comput. Math. 20(4): 347-366 (2004) - [j6]Shai Dekel, Dany Leviatan:
Whitney Estimates for Convex Domains with Applications to Multivariate Piecewise Polynomial Approximation. Found. Comput. Math. 4(4): 345-368 (2004) - [j5]Shai Dekel, Dany Leviatan:
The Bramble-Hilbert Lemma for Convex Domains. SIAM J. Math. Anal. 35(5): 1203-1212 (2004) - 2003
- [j4]Dany Leviatan, Igor A. Shevchuk:
Coconvex polynomial approximation. J. Approx. Theory 121(1): 100-118 (2003) - 2002
- [j3]Dany Leviatan, Igor A. Shevchuk:
Coconvex Approximation. J. Approx. Theory 118(1): 20-65 (2002) - 2001
- [j2]Viktor N. Konovalov, Dany Leviatan:
Kolmogorov and Linear Widths of Weighted Sobolev-Type Classes on a Finite Interval, II. J. Approx. Theory 113(2): 266-297 (2001) - 1993
- [j1]Ronald A. DeVore, George Kyriazis, Dany Leviatan, Vladimir M. Tikhomirov:
Wavelet compression and nonlinear n-widths. Adv. Comput. Math. 1(2): 197-214 (1993)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2023-09-27 22:43 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
