Abstract

In this paper, we introduce new max-product Shepard operators combined with Euler polynomial approximants, in both the univariate and bivariate cases. In each setting, we study the main approximation properties, including the degree of exactness and uniform error bounds. The bivariate construction of the Euler approximant is developed over a rectangle. Numerical experiments involving several test functions are performed to compare the approximation performance of the proposed operators with that of existing methods. Applications of the bivariate version of the operator are presented at the end of the paper. The applications consist of digital terrain reconstruction for several regions in Cluj County, Romania, and global approximation of precipitation quantities from 2025 and 2026.

Authors

Andra Malina
Faculty of Mathematics and Computer Science, Babeş-Bolyai University, Cluj-Napoca, Romania
Tiberiu Popoviciu Institute of Numerical Analysis, Romanian Academy, Cluj-Napoca, Romania

Keywords

max-product operator; Shepard operator; Euler polynomials; approximation error

Paper coordinates

A. Malina, Max-product Shepard-Euler operators, J. Comput. Appl. Math. 495 (2027), Art. No. 118327, https://doi.org/10.1016/j.cam.2026.118327

PDF

About this paper

Journal

Journal of Computational and Applied Mathematics

Publisher Name

 Elsevier B.V.

Print ISSN
0377-0427

 

Online ISSN

 1879-1778

Paper (preprint) in HTML form

Max-product Shepard-Euler operators

Max-product Shepard-Euler operators

Abstract

In this paper, we introduce new max-product Shepard operators combined with Euler polynomial approximants, in both the univariate and bivariate cases. In each setting, we study the main approximation properties, including the degree of exactness and uniform error bounds. The bivariate construction of the Euler approximant is developed over a rectangle. Numerical experiments involving several test functions are performed to compare the approximation performance of the proposed operators with that of existing methods. Applications of the bivariate version of the operator are presented at the end of the paper. The applications consist of digital terrain reconstruction for several regions in Cluj County, Romania, and global approximation of precipitation quantities from 2025 and 2026.

keywords
max-product operator; Shepard operator; Euler polynomials; approximation error

1 Introduction

The Shepard operator introduced in [29] is a powerful and widely used tool in approximating large scattered datasets, due to its easy generalization and small storage requirement. Considering a set of given nodes,
𝒳={𝐱0,𝐱1,…,𝐱n}⊆ℝd with available functional values f⁡(𝐱j)∈ℝ for each 𝐱j∈𝒳, the operator is defined as

Sμ⁢[f]⁢(𝐱)=∑j=0n‖𝐱−𝐱j‖2−μ∑i=0n‖𝐱−𝐱i‖2−μ⁢f⁢(𝐱j), (1)

where ∥⋅∥2 denotes the Euclidean norm and μ>0 is a control parameter.

The zero degree of exactness and the small accuracy in this form have led to the study of improved variants. These variants are obtained either by transforming the operator into a local one, thus improving its accuracy (see, e.g., [25]–[28]) or by using instead of the functional values f⁡(𝐱j), the values of another interpolation operator with higher degree of exactness. This approach has been studied in the univariate case, for example for the Shepard-Bernoulli variant [6], the Shepard-Abel-Goncharov operator [8], and the Shepard-Euler operator [31]. It has also been considered in the bivariate setting, including combinations with Lidstone operators [7, 9], Bernoulli-based combinations [10, 11, 17], and radial basis function approaches [12, 13]. More recently, related methods have been developed for spherical settings (see, for example, [2, 14, 15, 32, 33] and the references therein) due to the high applicability in practical problems, such as surface reconstruction, terrain modeling, image reconstruction, measurements for physical phenomena, solutions to partial differential equations and geophysical problems. Extensions to complex cases have also been studied (see, e.g., [18]).

One improvement of the univariate Shepard operator has been discussed in [31] and it regards the combination of the operator (1) with a generalized Taylor polynomial that uses the expansion in the Euler polynomials.

The Euler polynomials En⁢(x) are defined as [5]

{E0⁢(x)=1,En′⁢(x)=n⁢En−1⁢(x),n≥1En⁢(x+1)+En⁢(x)=2⁢xn,n≥1. (2)

The polynomial approximant for f∈Cm⁢([a,b]), a,b∈ℝ,a<b, using the Euler polynomials (2) is given as [31]

PmE⁢[f;a,b]⁢(x)=∑k=0mΔh⁢f(k)⁢(a)k!⁢hk⁢Ek⁢(x−ah), (3)

where h=b−a and

Δh⁢f(k)⁢(a)=f(k)⁢(a)+f(k)⁢(b)2.
Lemma 1.1.

[31] The approximation formula for a function f∈Cm+1⁢([a~,b~]), with a~≤a<b≤b~, and x∈[a~,b~] is

f⁡(x)=PmE⁢[f;a,b]⁢(x)+RmE⁢[f;a,b]⁢(x),

with the remainder term given by

RmE⁢[f;a,b]⁢(x)=1m!⁢∫a~b~f(m+1)⁢(s)⁢𝒦a,bE⁢(x,s)⁢𝑑s, (4)

where 𝒦a,bE is the Peano kernel, i.e.,

𝒦a,bE⁢(x,s)=(x−s)+m−12⁢∑k=0m(mk)⁢hk⁢Ek⁢(x−ah)⁢[(a−s)+m−k+(b−s)+m−k]. (5)
Lemma 1.2.

[31] The degree of exactness of the operator PmE given in (3) is m, i.e., PmE⁢[p]=p, for any polynomial p of degree at most m, m≥0.

Remark 1.3.

[31] We have that limh→0PmE⁢[f;a,b]⁢(x)=Tm⁢[f;a]⁢(x), with Tm⁢[f;a]⁢(x) denoting the Taylor polynomial of degree m around a.

Remark 1.4.

Since En⁢(1−x)=(−1)n⁢En⁢(x), it follows that PmE⁢[f;a,b]⁢(x)=PmE⁢[f;b,a]⁢(x), for any x∈ℝ.

Consider 𝒳={x0,x1,…,xn} a set of given nodes in ℝ with x0<x1<…<xn and the fictive node xn+1=xn−1. Wu defined the Shepard-Euler operator in [31] as

S⁢Emμ⁢[f]⁢(x)=∑j=0n|x−xj|−μ∑i=0n|x−xi|−μ⁢PmE⁢[f;xj,xj+1]⁢(x), (6)

with x∈[x0,xn]⊂ℝ and μ>0.

According to [31], the degree of exactness for this operator is m.

Another class of Shepard-type operators is obtained by replacing the sum operator in (1) with the maximum operator, denoted by ⋁. Operators of this type were first introduced by Bede et al. in [3] and subsequently studied in [4]. To define the operator, let us consider the class C+⁢([a,b]) of continuous nonnegative functions f:[a,b]→[0,∞) and x0,x1,…,xn∈[a,b] some given sampling points. The max-product Shepard operator is given as [3]

S~μ⁢[f]⁢(x)=⋁j=0nKj,μ⁢(x)⁢f⁢(xj),μ≥1, (7)

with the maxitive Shepard kernel Kj,μ defined by

Kj,μ⁢(x)={|x−xj|−μ⋁i=0n|x−xi|−μ,if x≠xi,i=0,…,n,δi⁢j,otherwise, (8)

where δi⁢j denotes the Kronecker symbol

δi⁢j={1,i=j0,i≠j.
Remark 1.5.

The kernel functions Kj,μ satisfy the following property

⋁j=0nKj,μ⁢(x)=1. (9)
Remark 1.6.

[4] The operator S~μ⁢[f] given in (7) interpolates the function f at the nodes x0,x1,…,xn, and has the degree of exactness 0.

In contrast to the original Shepard interpolant, this operator is nonlinear. However, despite this drawback, operators of this type can provide better approximation properties when applied to nonnegative functions, as demonstrated in works such as [19], [22], and [23]. These studies focus on combinations of max-product Shepard operators with local interpolants based on Taylor, Bernoulli, and Lidstone polynomials. More generally, linear and nonlinear extensions of Shepard-type operators, together with accelerated convergence strategies and their applications are surveyed in [20]. In addition, the hybrid Shepard-Lagrange operators introduced in [21] provide a further example of improving the approximation properties of Shepard operators through the incorporation of local polynomial information.

Motivated by the fact that, as far as we are aware, the Shepard-Euler operator has been studied only in the linear univariate setting, we investigate its nonlinear version in the univariate case, develop its bivariate extension over a rectangle, and study its approximation properties, such as the degree of exactness and error estimates, in both settings. The paper is organized as follows. In Section 2, we study the max-product Shepard-Euler operator in the univariate case. In Section 3, we further examine this operator by providing numerical examples for several test functions. In Section 4, after extending the Euler approximant to the two-dimensional setting, we study the new bivariate Shepard operator obtained, and in Section 5, we investigate its practical behavior through numerical examples. Further, in Sections 6 and 7, we present two practical applications of the two-dimensional max-product Shepard-Euler operator. The first one consists of a digital terrain reconstruction problem of different regions from Cluj County, in Romania. The second one regards precipitation approximations around various regions of the globe in different months of 2025 and 2026. Section 8 concludes the paper.

2 The univariate max-product Shepard-Euler operator

In this section, we consider C+m⁢([a,b]) the class of nonnegative functions f:[a,b]→[0,∞) that have continuous m-th order derivatives.

Definition 2.1.

Let f∈C+m⁢([0,1]) and consider the given sample points xj=jn∈[0,1], j=0,1,…,n, with the fictive node xn+1=xn−1. We define the max-product Shepard-Euler operator of order m as

S~⁢Emμ⁢[f]⁢(x)=⋁j=0nKj,μ⁢(x)⁢PmE⁢[f;xj,xj+1]⁢(x)⁢ , ⁢μ≥1, (10)

with the kernel function Kj,μ given in (8), for any x∈[0,1].

Proposition 2.2.

The operator S~⁢Emμ given in (10) reproduces all nonnegative polynomials of degree at most m.

Proof.

Consider p a polynomial of degree at most m and x∈[0,1], with p⁡(x)≥0. Using the result stated in Lemma 1.2 and the property (9) of the kernel Kj,μ we have that

S~⁢Emμ⁢[p]⁢(x) =⋁j=0nKj,μ⁢(x)⁢PmE⁢[p;xj,xj+1]⁢(x)=⋁j=0nKj,μ⁢(x)⁢p⁢(x)=p⁡(x)⁢⋁j=0nKj,μ⁢(x)=p⁡(x).

∎

Theorem 2.3.

Let f∈C+m+1⁢([0,1]), consider the given sample points xj=jn∈[0,1], j=0,1,…,n, with the fictive node xn+1=xn−1, and μ≥1. For the max-product Shepard-Euler operator given in (10), we have the following estimation of the error

‖S~⁢Emμ⁢[f]−f‖∞≤C⁢n−min⁡{m+1,[μ]}, (11)

where ∥⋅∥∞ is the sup-norm, [⋅] represents the integer part and C is a constant depending on m and f(m+1).

Proof.

Let x∈[0,1]. Using the result stated in (9) and [3, Lemma 3], we have that

|S~⁢Emμ⁢[f]⁢(x)−f⁡(x)| =|⋁j=0nKj,μ⁢(x)⁢PmE⁢[f;xj,xj+1]⁢(x)−f⁡(x)|=|⋁j=0nKj,μ⁢(x)⁢PmE⁢[f;xj,xj+1]⁢(x)−⋁j=0nKj,μ⁢(x)⁢f⁢(x)|
≤⋁j=0nKj,μ⁢(x)⁢|PmE⁢[f;xj,xj+1]⁢(x)−f⁡(x)|.

Since f−PmE⁢[f] represents the remainder term, denoted by RmE⁢[f], we have that

|S~⁢Emμ⁢[f]⁢(x)−f⁡(x)|≤⋁j=0nKj,μ⁢(x)⁢|RmE⁢[f;xj,xj+1]⁢(x)|.

From [31, Theorem 3], we know that

|RmE⁢[f;xj,xj+1]⁢(x)|≤{C⁡(m+1)⁢‖f(m+1)‖∞⁢(xj+1−x)m+1,0<x<xj,C⁡(m+1)⁢‖f(m+1)‖∞⁢(xj+1−xj)m+1,xj<x<xj+1,C⁡(m+1)⁢‖f(m+1)‖∞⁢(x−xj)m+1,xj+1<x<1,

with the constant C⁡(m+1) given by

C⁡(m+1)=1(m+1)!⁢∑k=0m∑l=0k(m+1k)⁢(kl)⁢|El⁢(12)|. (12)

Let us define the distance from the interval [xj,xj+1] as

δ~⁢[xj,xj+1]⁢(x)={xj+1−x,0≤x<xj,xj+1−xj,xj≤x≤xj+1,x−xj,xj+1<x≤1. (13)

From [22, Lemma 2], we have that

δ~m+1⁢[xj,xj+1]⁢(x)≤2m+1⁢(n−(m+1)∨|x−xj|m+1),

which gives us the following estimate

|S~⁢Emμ⁢[f]⁢(x)−f⁡(x)|≤2m+1⁢C⁢(m+1)⁢‖f(m+1)‖∞⁢⋁j=0nKj,μ⁢(x)⁢(n−(m+1)∨|x−xj|m+1).

Denote by C:=2m+1⁢C⁢(m+1)⁢‖f(m+1)‖∞. We obtain

|S~⁢Emμ⁢[f]⁢(x)−f⁡(x)| ≤C⁡(⋁j=0nKj,μ⁢(x)⁢n−(m+1))⁢⋁C⁡(⋁j=0nKj,μ⁢(x)⁢|x−xj|m+1)
=C⁡(n−(m+1)∨S~μ⁢[gxm+1]⁢(x)),

with gx⁢(y)=|x−y|,y∈[0,1].

Following the ideas in [19], [22], we distinguish two cases:

  1. Case 1.

    μ≥m+1. We know from [22, Lemma 3] that S~μ⁢[gxα]⁢(x)≤n−α⁢ , for ⁢μ≥α. Hence,

    |S~⁢Emμ⁢[f]⁢(x)−f⁡(x)|≤C⁢n−(m+1).
  2. Case 2.

    μ∈[1,m+1). We have that gx≤1 on [0,1], so, gxm+1≤gxi for some i∈{1,2,…,m} such that μ∈[i,i+1). This implies that S~μ⁢[gxm+1]⁢(x)≤S~μ⁢[gxi]⁢(x), so

|S~⁢Emμ⁢[f]⁢(x)−f⁡(x)|≤C⁡(n−(m+1)∨S~μ⁢[gxi]⁢(x))≤C⁡(n−(m+1)∨n−i).

If we choose i:=[μ] and combine the two cases above, the conclusion follows.

∎

3 Numerical examples in the univariate case

To illustrate the approximation properties of the max-product Shepard–Euler operator introduced in (10), we consider the following test functions fi:[0,1]→[0,∞CLOSE), i=1,…,6 (see, e.g., [22]):

f1⁢(x) =ex2,
f2⁢(x) =1+sin2⁡(8⁢x),
f3⁢(x) =0.2+sin2⁡(12⁢π⁢x)+0.3⁢e−3⁢x⁢sin2⁡(80⁢π⁢x),
f4⁢(x) =e3⁢x+0.2⁢ln⁡(1+5⁢x)+0.1⁢x2,
f5⁢(x) =0.5⁢ex⁢(2+cos⁡(9⁢(x−0.5)2)),
f6⁢(x) =(1+x2)⁢sin2⁡(5⁢x).

For each function fi,i=1,…,6, we construct the max-product Shepard-Euler operator S~⁢Emμ⁢[fi] given in (10) by using sets of n+1 equidistant nodes in [0,1], for n=50, 100, 200, and evaluate it on 1000 points in [0,1]. We choose the parameters μ=3 and m=2. For a better visualization of the results, we compare the operator S~⁢E23⁢[fi] with the classical Shepard-Euler operator S⁢E23⁢[fi] given in (6), the max-product Shepard operator S~3⁢[fi] defined in (7) and with the classical Shepard operator S3⁢[fi] given in (1). The maximum approximation errors (em⁢a⁢x) and the mean approximation errors (em⁢e⁢a⁢n) are displayed in Table 1 for n=50, in Table 2 for n=100, and in Table 3 in the case of n=200. It can be observed that the new operator introduced in this paper outperforms the other operators in the majority of the cases.

Table 1: Maximum and mean approximation errors for fi, i=1,…,6, n=50.
S~⁢E23⁢[fi] S⁢E23⁢[fi] S~3⁢[fi] S3⁢[fi]
em⁢a⁢x em⁢e⁢a⁢n em⁢a⁢x em⁢e⁢a⁢n em⁢a⁢x em⁢e⁢a⁢n em⁢a⁢x em⁢e⁢a⁢n
f1 1.74⁢e−5 3.04⁢e−6 5.87⁢e−5 1.37⁢e−5 4.83⁢e−2 8.50⁢e−3 2.56⁢e−2 4.90⁢e−3
f2 6.79⁢e−4 2.71⁢e−4 2.20⁢e−3 5.41⁢e−4 7.91⁢e−2 2.49⁢e−2 3.72⁢e−2 1.51⁢e−2
f3 1.36⁢e+0 1.34⁢e−1 7.82⁢e−1 1.34⁢e−1 5.28⁢e−1 1.21⁢e−1 4.07⁢e−1 9.53⁢e−2
f4 1.76⁢e−4 3.72⁢e−5 7.03⁢e−4 1.60⁢e−4 5.39⁢e−1 9.63⁢e−2 2.85⁢e−1 5.58⁢e−2
f5 4.03⁢e−4 4.16⁢e−5 6.91⁢e−4 9.43⁢e−5 8.05⁢e−2 1.74⁢e−2 4.02⁢e−2 1.00⁢e−2
f6 2.80⁢e−4 8.44⁢e−5 1.30⁢e−3 2.47⁢e−4 8.28⁢e−2 2.02⁢e−2 4.17⁢e−2 1.23⁢e−2
Table 2: Maximum and mean approximation errors for fi, i=1,…,6, n=100.
S~⁢E23⁢[fi] S⁢E23⁢[fi] S~3⁢[fi] S3⁢[fi]
em⁢a⁢x em⁢e⁢a⁢n em⁢a⁢x em⁢e⁢a⁢n em⁢a⁢x em⁢e⁢a⁢n em⁢a⁢x em⁢e⁢a⁢n
f1 2.22⁢e−6 3.67⁢e−7 1.66⁢e−5 2.99⁢e−6 2.49⁢e−2 4.30⁢e−3 1.32⁢e−2 2.40⁢e−3
f2 8.52⁢e−5 3.37⁢e−5 5.22⁢e−4 1.13⁢e−4 3.92⁢e−2 1.25⁢e−2 1.85⁢e−2 7.30⁢e−3
f3 9.07⁢e−1 1.10⁢e−1 5.13⁢e−1 8.96⁢e−2 4.11⁢e−1 6.72⁢e−2 2.74⁢e−1 5.18⁢e−2
f4 2.23⁢e−5 4.53⁢e−6 1.96⁢e−4 3.51⁢e−5 2.78⁢e−1 4.84⁢e−2 1.47⁢e−1 2.78⁢e−2
f5 5.25⁢e−5 5.03⁢e−6 1.55⁢e−4 1.95⁢e−5 4.03⁢e−2 8.70⁢e−3 1.98⁢e−2 5.00⁢e−3
f6 3.51⁢e−5 1.05⁢e−5 3.09⁢e−4 5.43⁢e−5 4.35⁢e−2 1.04⁢e−2 2.07⁢e−2 6.00⁢e−3
Table 3: Maximum and mean approximation errors for fi, i=1,…,6, n=200.
S~⁢E23⁢[fi] S⁢E23⁢[fi] S~3⁢[fi] S3⁢[fi]
em⁢a⁢x em⁢e⁢a⁢n em⁢a⁢x em⁢e⁢a⁢n em⁢a⁢x em⁢e⁢a⁢n em⁢a⁢x em⁢e⁢a⁢n
f1 2.80⁢e−7 4.89⁢e−8 3.58⁢e−6 7.01⁢e−7 1.09⁢e−2 2.10⁢e−3 5.80⁢e−3 1.20⁢e−3
f2 1.06⁢e−5 4.18⁢e−6 1.16⁢e−4 2.53⁢e−5 1.98⁢e−2 6.30⁢e−3 9.20⁢e−3 3.60⁢e−3
f3 7.58⁢e−2 1.47⁢e−2 7.64⁢e−2 1.50⁢e−2 2.06⁢e−1 3.47⁢e−2 1.34⁢e−1 2.42⁢e−2
f4 2.80⁢e−6 5.98⁢e−7 4.20⁢e−5 8.28⁢e−6 1.21⁢e−1 2.42⁢e−2 6.43⁢e−2 1.40⁢e−2
f5 6.69⁢e−6 6.37⁢e−7 3.11⁢e−5 4.35⁢e−6 1.64⁢e−2 4.30⁢e−3 8.50⁢e−3 2.50⁢e−3
f6 4.36⁢e−6 1.33⁢e−6 7.40⁢e−5 1.27⁢e−5 1.99⁢e−2 5.20⁢e−3 9.60⁢e−3 3.00⁢e−3

In what follows, we present in Figure 1 a log-log plot of the maximum error em⁢a⁢x versus n, for n=50⋅2k, k=0,…,6, and the six test functions above, all of class C∞. In addition, we also consider two functions that are only of class C2,

f7⁢(x) =|x−0.5|3+1,
f8⁢(x) =|cos⁡(π⁢x)|3+1.

For all eight functions, we consider μ=3,m=1, i.e., the operator S~⁢E13 such that the hypothesis of Theorem 2.3 is satisfied. As a reference, the red dotted line indicates a perfect quadratic trend. We can observe that the rate n−2 guaranteed by the theorem is obtained by all functions.

Refer to caption
Figure 1: Log-log plot of the approximation error em⁢a⁢x of the max-product Shepard-Euler operator S~⁢E13⁢[fi].

4 Bivariate max-product Shepard-Euler operator

Consider the rectangle D=[a,b]×[c,d]⊆ℝ2 and let C(m,n)⁢(D) be the space of functions f:D→ℝ that have continuous partial derivatives

f(i,j)⁢(x,y)=∂(i+j)∂xi⁢∂yj⁢f⁢(x,y),(x,y)∈D,

for all (i,j) with i=0,1,…,m, and j=0,1,…,n.

For h=b−a, k=d−c and (x,y)∈D, we introduce the notations:

Δ(h,0)⁢f⁢(x,y) =12⁢[f⁡(x,y)+f⁡(x+h,y)],
Δ(0,k)⁢f⁢(x,y) =12⁢[f⁡(x,y)+f⁡(x,y+k)],
Δ(h,k)⁢f⁢(x,y) =Δ(h,0)⁢Δ(0,k)⁢f⁢(x,y)=Δ(0,k)⁢Δ(h,0)⁢f⁢(x,y)
=14⁢[f⁡(x,y)+f⁡(x+h,y)+f⁡(x,y+k)+f⁡(x+h,y+k)].

For x,s∈[a,b], t,y∈[c,d], we define the following functions:

Gm⁢(x,s) =1m!⁢𝒦a,bE⁢(x,s),
Hn⁢(t,y) =1n!⁢𝒦~c,dE⁢(t,y),

with 𝒦a,bE⁢(x,s) defined in (5) and

𝒦~c,dE⁢(t,y)=(y−t)+n−12⁢∑j=0n(nj)⁢kj⁢Ej⁢(y−ck)⁢[(c−t)+n−j+(d−t)+n−j].

Using some ideas from [16], where the authors derive an expansion of a function over a rectangle in terms of Bernoulli polynomials, we obtain the following result.

Theorem 4.1.

For D=[a,b]×[c,d], f∈C(m+1,n+1)⁢(D), and (x,y)∈D, we have that

f⁡(x,y)=Pm,nE⁢[f;(a,c),(h,k)]⁢(x,y)+Rm,nE⁢[f;(a,c),(h,k)]⁢(x,y), (14)

where

Pm,nE⁢[f;(a,c),(h,k)]⁢(x,y)=∑i=0m∑j=0nhi⁢kji!⁢j!⁢Ei⁢(x−ah)⁢Ej⁢(y−ck)⁢Δ(h,k)⁢f(i,j)⁢(a,c), (15)

and

Rm,nE⁢[f;(a,c),(h,k)]⁢(x,y) =∫ab∑j=0nΔ(0,k)⁢f(m+1,j)⁢(s,c)⁢kjj!⁢Ej⁢(y−ck)⁢Gm⁢(x,s)⁢𝑑s
+∫cd∑i=0mΔ(h,0)f(i,n+1)(a,t)hii!Ei(x−ah)Hn(t,y)dt (16)
+∫ab∫cdf(m+1,n+1)(s,t)Gm(x,s)Hn(t,y)dsdt.
Proof.

We follow some ideas presented in [16] to prove the result above. We first consider the particular case a=c=0, b=d=1, h=k=1, so D=[0,1]2.

Applying (3) and (4) to the Cm+1 function x↦f⁡(x,y) of variable x we get

f⁡(x,y)=∑i=0mEi⁢(x)i!⁢Δ(1,0)⁢f(i,0)⁢(0,y)+∫01f(m+1,0)⁢(s,y)⁢Gm⁢(x,s)⁢𝑑s.

Using now the univariate expansion to each Cn+1 function of variable y that appears in the right-hand side term, we obtain for each i=0,…,m:

Ei⁢(x)i!⁢Δ(1,0)⁢f(i,0)⁢(0,y) =∑j=0nEi⁢(x)⁢Ej⁢(y)i!⁢j!⁢Δ(1,1)⁢f(i,j)⁢(0,0)+∫01Δ(1,0)⁢f(i,n+1)⁢(0,t)⁢Ei⁢(x)i!⁢Hn⁢(t,y)⁢𝑑t,

and

∫01f(m+1,0)⁢(s,y)⁢Gm⁢(x,s)⁢𝑑s =∑j=0n∫01Δ(0,1)⁢f(m+1,j)⁢(s,0)⁢Ej⁢(y)j!⁢Gm⁢(x,s)⁢𝑑s
+∫01∫01f(m+1,n+1)(s,t)Gm(x,s)Hn(t,y)dsdt.

So, we get that:

f⁡(x,y)=Pm,nE⁢[f;(0,0),(1,1)]⁢(x,y)+Rm,nE⁢[f;(0,0),(1,1)]⁢(x,y), (17)

with

Pm,nE⁢[f;(0,0),(1,1)]⁢(x,y)=∑i=0m∑j=0nΔ(1,1)⁢f(i,j)⁢(0,0)⁢Ei⁢(x)⁢Ej⁢(y)i!⁢j!

and

Rm,nE⁢[f;(0,0),(1,1)]⁢(x,y) =∫01∑j=0nΔ(0,1)⁢f(m+1,j)⁢(s,0)⁢Ej⁢(y)j!⁢Gm⁢(x,s)⁢𝑑s
+∫01∑i=0mΔ(1,0)f(i,n+1)(0,t)Ei⁢(x)i!Hn(t,y)dt
+∫01∫01f(m+1,n+1)(s,t)Gm(x,s)Hn(t,y)dsdt.

To map the unit square (s′,t′)∈[0,1]2 to a rectangle defined by s∈[a,b], t∈[c,d], where h=b−a and k=d−c, we use the linear transformation [16]

φ:{s=a+h⁢s′,t=c+k⁢t′.

The final Euler approximant over the rectangle [a,b]×[c,d] given in (14) is obtained from the development (17) of the function f∘φ at the point φ−1⁢(x,y), after a suitable change of variables. ∎

Remark 4.2.

Similar to the univariate property stated in Remark 1.4, we have that Pm,nE⁢[f;(a,c),(h,k)]⁢(x,y)=Pm,nE⁢[f;(b,d),(−h,−k)]⁢(x,y), for any (x,y)∈ℝ2, with h=b−a and k=d−c.

Proposition 4.3.

Let Πm,n be the space of polynomials ep⁢q⁢(x,y) of degree (p,q) such that 0≤p≤m, 0≤q≤n. The operator Pm,nE given in (15) has the degree of exactness (m,n), i.e., Pm,nE⁢[ep⁢q]=ep⁢q, for any ep⁢q∈Πm,n.

Proof.

Using the remainder formula given in (16), one can easily see that Rm,nE⁢[ep⁢q;(a,c),(h,k)]⁢(x,y)=0, for any ep⁢q∈Πm,n. ∎

The expansion obtained in Theorem 4.1 provides the local approximation tool that will subsequently be used in the definition of the bivariate max-product Shepard-Euler operator. In line with the strategy and ideas proposed in [30] for bivariate Bernoulli-type multiquadric quasi-interpolation operators, we next derive an explicit estimate for the corresponding local Euler remainder. This estimate will then be combined with the properties of the max-product Shepard kernel to obtain a uniform approximation bound for the global operator.

To study the remainder estimate even for points outside the rectangle D, we consider the extended rectangle D~=[a~,b~]×[c~,d~], with a~≤a<b≤b~, c~≤c<d≤d~ (see, e.g., [30]). We first introduce the following notations from [31]. For f∈C(m,n)⁢(D~), let

F⁡(m,n):=max⁡{maxj=0,…,n⁡‖f(m,j)‖∞,maxi=0,…,m⁡‖f(i,n)‖∞}. (18)

We consider ∥⋅∥∞ the sup-norm of the function over its domain of definition, so, for f:D~→ℝ, ‖f‖∞=sup(x,y)∈D~|f⁡(x,y)| and for g:[a~,b~]→ℝ, ‖g‖∞=supx∈[a~,b~]|g⁡(x)|.

Moreover, we introduce the general form of the distance δ~ given in (13), i.e., the distance of x from the interval [a,b], plus b−a, which is [31]

d⁢[a,b]⁢(x)={b−x,x<a,b−a,a≤x≤b,x−a,b<x. (19)
Theorem 4.4.

Let a~≤a<b≤b~, c~≤c<d≤d~, D~=[a~,b~]×[c~,d~], f∈C(m+1,n+1)⁢(D~), and h=b−a, k=d−c. Then, for every (x,y)∈D~, the remainder term Rm,nE⁢[f]=f−Pm,nE⁢[f] satisfies

|Rm,nE⁢[f;(a,c),(h,k)]⁢(x,y)| ≤F(m+1,n+1)[C(m+1)dm+1[a,b](x)+C(n+1)dn+1[c,d](y)
+3C(m+1)C(n+1)dm+1[a,b](x)dn+1[c,d](y)],

with F⁡(m+1,n+1) given in (18), the constants C⁡(m+1) and C⁡(n+1) in (12), and the distances d⁢[a,b]⁢(x) and d⁢[c,d]⁢(y) in (19).

Proof.

Let (x,y)∈D~. Here, we extend the definitions on D of Gm and Hn to the rectangle D~, so, for x,s∈[a~,b~] and t,y∈[c~,d~],

Gm⁢(x,s)=1m!⁢𝒦a,bE⁢(x,s), and ⁢Hn⁢(t,y)=1n!⁢𝒦~c,dE⁢(t,y),

with the kernels given by (5) and its analogue.

Using Lemma 5 to expand the representation of the remainder term Rm,nE⁢[f]=f−Pm,nE from Theorem 4.1 to the rectangle D~, we have that Rm,nE⁢[f;(a,c),(h,k)]⁢(x,y)=f⁡(x,y)−Pm,nE⁢[f;(a,c),(h,k)]⁢(x,y)=R1+R2+R3, where

R1=∫a~b~ϕ1⁢(s)⁢Gm⁢(x,s)⁢𝑑s,ϕ1⁢(s):=∑j=0nΔ(0,k)⁢f(m+1,j)⁢(s,c)⁢kjj!⁢Ej⁢(y−ck),
R2=∫c~d~ϕ2⁢(t)⁢Hn⁢(t,y)⁢𝑑t,ϕ2⁢(t):=∑i=0mΔ(h,0)⁢f(i,n+1)⁢(a,t)⁢hii!⁢Ei⁢(x−ah),
R3=∫a~b~∫c~d~f(m+1,n+1)⁢(s,t)⁢Gm⁢(x,s)⁢Hn⁢(t,y)⁢𝑑s⁢𝑑t.

Based on the results stated in [31, Theorem 3] and the proof of [31, Theorem 2], it can be shown that for ϕ1∈C⁡([a~,b~]) and x∈[a~,b~],

|R1|=|∫a~b~ϕ1⁢(s)⁢Gm⁢(x,s)⁢𝑑s|≤sups∈[a~,b~]|ϕ1⁢(s)|⁢C⁢(m+1)⁢dm+1⁢[a,b]⁢(x),

and, similarly, for ϕ2∈C⁡([c~,d~]) and y∈[c~,d~],

|R2|=|∫c~d~ϕ2⁢(t)⁢Hn⁢(t,y)⁢𝑑t|≤supt∈[c~,d~]|ϕ2⁢(t)|⁢C⁢(n+1)⁢dn+1⁢[c,d]⁢(y).

Let us fix s∈[a~,b~] and set gs⁢(t):=f(m+1,0)⁢(s,t), for t∈[c~,d~]. Then, since gs(j)⁢(c)=f(m+1,j)⁢(s,c) and Δ(0,k)⁢f(m+1,j)⁢(s,c)=Δk⁢gs(j)⁢(c), we can observe that ϕ1⁢(s)=PnE⁢[gs;c,d]⁢(y), i.e., exactly the univariate Euler operator given in (3) corresponding to the function gs on [c~,d~]. By similar reasoning, for a fixed t∈[c~,d~] and ht⁢(s):=f(0,n+1)⁢(s,t), for s∈[a~,b~], we obtain that ϕ2⁢(t)=PmE⁢[ht;a,b]⁢(x).

Since ϕ1⁢(s)=gs⁢(y)−RnE⁢[gs;c,d]⁢(y)=f(m+1,0)⁢(s,y)−RnE⁢[gs;c,d]⁢(y), it follows that

sups∈[a~,b~]|ϕ1⁢(s)|≤‖f(m+1,0)‖∞+C⁡(n+1)⁢‖f(m+1,n+1)‖∞⁢dn+1⁢[c,d]⁢(y)≤F⁡(m+1,n+1)⁢[1+C⁡(n+1)⁢dn+1⁢[c,d]⁢(y)].

Using analogous arguments, we have

supt∈[c~,d~]|ϕ2⁢(t)|≤‖f(0,n+1)‖∞+C⁡(m+1)⁢‖f(m+1,n+1)‖∞⁢dm+1⁢[a,b]⁢(x)≤F⁡(m+1,n+1)⁢[1+C⁡(m+1)⁢dm+1⁢[a,b]⁢(x)].

Combining the relations above, we obtain

|R1|≤C⁡(m+1)⁢F⁢(m+1,n+1)⁢dm+1⁢[a,b]⁢(x)⁢[1+C⁡(n+1)⁢dn+1⁢[c,d]⁢(y)], (20)

and, respectively,

|R2|≤C⁡(n+1)⁢F⁢(m+1,n+1)⁢dn+1⁢[c,d]⁢(y)⁢[1+C⁡(m+1)⁢dm+1⁢[a,b]⁢(x)]. (21)

For R3, straightforward computations show that

|R3|≤C⁡(m+1)⁢C⁢(n+1)⁢F⁢(m+1,n+1)⁢dm+1⁢[a,b]⁢(x)⁢dn+1⁢[c,d]⁢(y). (22)

Adding the three bounds given in (20)–(22), we obtain that

|Rm,nE⁢[f;(a,c),(h,k)]⁢(x,y)| ≤|R1|+|R2|+|R3|
≤F(m+1,n+1)[C(m+1)dm+1[a,b](x)+C(n+1)dn+1[c,d](y)
+3C(m+1)C(n+1)dm+1[a,b](x)dn+1[c,d](y)],

which concludes the proof. ∎

We now introduce the bivariate Euler-type max-product Shepard operator. To this end, for a rectangle D=[a,b]×[c,d]⊆ℝ2, let C+(m,n)⁢(D) denote the class of all functions f∈C(m,n)⁢(D) such that f⁡(x,y)≥0, for any (x,y)∈D.

Definition 4.5.

Let f∈C+(m,n)⁢([0,1]2) and consider the sample points 𝐱i,j=(xi,yj) with xi=iN,yj=jN, i,j=0,1,…,N. For 𝐱=(x,y)∈[0,1]2, we define the bivariate max-product Shepard-Euler operator of order (m,n) as

𝕊⁢𝔼~m,nμ⁢[f]⁢(𝐱)=⋁i,j=0NKi,jμ⁢(𝐱)⁢Pm,nE⁢[f;(xi,yj),(hi,kj)]⁢(𝐱)⁢ , ⁢μ≥1, (23)

where ⋁i,j=0N=⋁i=0N⋁j=0N, hi=xi+1−xi,kj=yj+1−yj, considering the fictive points xN+1=xN−1, yN+1=yN−1, and the kernel function Ki,jμ⁢(𝐱) given by

Ki,jμ⁢(𝐱)={‖𝐱−𝐱i,j‖2−μ⋁p,q=0N‖𝐱−𝐱p,q‖2−μ,if ⁢𝐱≠𝐱p,q, for all ⁢p,q,δi⁢p⁢δj⁢q,otherwise , (24)

with ∥⋅∥2 denoting the Euclidean norm.

Proposition 4.6.

The operator 𝕊⁢𝔼~m,nμ given in (23) has the degree of exactness (m,n), i.e., 𝕊⁢𝔼~m,nμ⁢[ep⁢q]=ep⁢q, for any polynomial ep⁢q∈Πm,n+, where Πm,n+ is the set of polynomials ep⁢q⁢(x,y) of degree (p,q) such that 0≤p≤m, 0≤q≤n, and ep⁢q⁢(x,y)≥0.

Proof.

The proof is similar to the one in the univariate case, since the degree of exactness of Pm,nE is (m,n) (see Proposition 4.3) and the maxitive Shepard kernel Ki,jμ satisfies the property ⋁i,j=0NKi,jμ⁢(𝐱)=1. ∎

Theorem 4.7.

Let f∈C+(m+1,n+1)⁢([0,1]2), consider the sample points 𝐱i,j=(xi,yj) with xi=iN, yj=jN, i,j=0,1,…,N, with the fictive nodes xN+1=xN−1, yN+1=yN−1, and μ≥1. For the max-product Shepard-Euler operator 𝕊⁢𝔼~m,nμ given in (23), we have the following estimation of the error

‖𝕊⁢𝔼~m,nμ⁢[f]−f‖∞≤C⁢N−min⁡{m+1,n+1,[μ]},

where ∥⋅∥∞ denotes the sup-norm and C is a constant depending on m,n and F⁡(m+1,n+1), introduced in (18).

Proof.

Let 𝐱=(x,y)∈[0,1]2. Based on the property ⋁i,j=0NKi,jμ⁢(𝐱)=1 of the kernel Ki,jμ and using similar reasoning as in the proof of Theorem 2.3, one can show that

|𝕊⁢𝔼~m,nμ⁢[f]⁢(𝐱)−f⁡(𝐱)|≤⋁i,j=0NKi,jμ⁢(𝐱)⁢|Rm,nE⁢[f;(xi,yj),(hi,kj)]⁢(𝐱)|. (25)

At boundary nodes, where hi<0 or kj<0, we reorder the endpoints independently in each affected coordinate. By the symmetry of the Euler polynomials (Remark 4.2), this leaves the local Euler approximant unchanged. Theorem 4.4 therefore applies with the ordered intervals [min⁡(xi,xi+1),max⁡(xi,xi+1)] and [min⁡(yj,yj+1),max⁡(yj,yj+1)]. The interval-distance terms in the subsequent estimates are understood with these ordered endpoints. Thus, by Theorem 4.4,

|Rm,nE⁢[f;(xi,yj),(hi,kj)]⁢(𝐱)|≤ F(m+1,n+1)[C(m+1)dm+1[xi,xi+1](x)+C(n+1)dn+1[yj,yj+1](y)
+3C(m+1)C(n+1)dm+1[xi,xi+1](x)dn+1[yj,yj+1](y)],

with F⁡(m+1,n+1) defined in (18) and the constants C⁡(m+1) and C⁡(n+1) given in (12).

Let φ𝐱⁢(𝐱i,j)=‖𝐱−𝐱i,j‖2. Since |x−xi|≤φ𝐱⁢(𝐱i,j) and |y−yj|≤φ𝐱⁢(𝐱i,j), from [22, Lemma 2] applied to each coordinate, we get that dm+1⁢[xi,xi+1]⁢(x)≤2m+1⁢(N−(m+1)∨φ𝐱m+1⁢(𝐱i,j)) and dn+1⁢[yj,yj+1]⁢(y)≤2n+1⁢(N−(n+1)∨φ𝐱n+1⁢(𝐱i,j)). Moreover, since (N−(m+1)∨φ𝐱m+1⁢(𝐱i,j))⁢(N−(n+1)∨φ𝐱n+1⁢(𝐱i,j))=(N−(m+n+2)∨φ𝐱m+n+2⁢(𝐱i,j)), we have that dm+1⁢[xi,xi+1]⁢(x)⁢dn+1⁢[yj,yj+1]⁢(y)≤2m+n+2⁢(N−(m+n+2)∨φ𝐱m+n+2⁢(𝐱i,j)).

Combining these bounds, we get

|Rm,nE⁢[f;(xi,yj),(hi,kj)]⁢(𝐱)|≤C1⁢(N−(m+1)∨φ𝐱m+1⁢(𝐱i,j))+C2⁢(N−(n+1)∨φ𝐱n+1⁢(𝐱i,j))+C3⁢(N−(m+n+2)∨φ𝐱m+n+2⁢(𝐱i,j)),

where C1,C2,C3 are defined as C1:=2m+1⁢C⁢(m+1)⁢F⁢(m+1,n+1), C2:=2n+1⁢C⁢(n+1)⁢F⁢(m+1,n+1), and C3:=3⋅2m+n+2⁢C⁢(m+1)⁢C⁢(n+1)⁢F⁢(m+1,n+1).

Returning to (25) and letting 𝕊~μ denote the natural extension of the operator S~μ given in (7) to the bivariate case, we easily obtain that

|𝕊⁢𝔼~m,nμ⁢[f]⁢(𝐱)−f⁡(𝐱)| ≤C1⁢⋁i,j=0NKi,jμ⁢(𝐱)⁢(N−(m+1)∨φ𝐱m+1⁢(𝐱i,j))+C2⁢⋁i,j=0NKi,jμ⁢(𝐱)⁢(N−(n+1)∨φ𝐱n+1⁢(𝐱i,j))
+C3⋁i,j=0NKi,jμ(𝐱)(N−(n+m+2)∨φ𝐱n+m+2(𝐱i,j))
≤C1⁢(N−(m+1)∨𝕊~μ⁢[φ𝐱m+1]⁢(𝐱))+C2⁢(N−(n+1)∨𝕊~μ⁢[φ𝐱n+1]⁢(𝐱))
+C3⁢(N−(m+n+2)∨𝕊~μ⁢[φ𝐱m+n+2]⁢(𝐱)).

We study the general term N−M∨𝕊~μ⁢[φ𝐱M]⁢(𝐱). As in the univariate case, we distinguish two cases:

  1. Case 1.

    μ≥M. We know from [19, Theorem 2.1] that 𝕊~μ⁢[φ𝐱M]⁢(𝐱)≤2M/2⁢N−M. Hence,

    N−M∨𝕊~μ⁢[φ𝐱M]⁢(𝐱)≤2M/2⁢N−M.
  2. Case 2.

    μ∈[1,M). Since φ𝐱≤2 on [0,1]2, we have φ𝐱M≤(2)M−p⁢φ𝐱p for some p∈{1,2,…,M−1} with μ∈[p,p+1). It follows that 𝕊~μ⁢[φ𝐱M]⁢(𝐱)≤(2)M−p⁢𝕊~μ⁢[φ𝐱p]⁢(𝐱). Using again [19, Theorem 2.1], we obtain 𝕊~μ⁢[φ𝐱M]⁢(𝐱)≤(2)M−p⁢2p/2⁢N−p=2M/2⁢N−p. If we choose p:=[μ], we get

    N−M∨𝕊~μ⁢[φ𝐱M]⁢(𝐱)≤2M/2⁢N−[μ].

Combining both cases, we obtain N−M∨𝕊~μ⁢[φ𝐱M]⁢(𝐱)≤2M/2⁢N−min⁡{M,[μ]}.

Since min⁡{m+1,n+1,[μ]} is less than or equal to each of min⁡{m+1,[μ]},min⁡{n+1,[μ]},min⁡{m+n+2,[μ]}, we have that

|𝕊⁢𝔼~m,nμ⁢[f]⁢(𝐱)−f⁡(𝐱)|≤(C1⁢2(m+1)/2+C2⁢2(n+1)/2+C3⁢2(m+n+2)/2)⁢N−min⁡{m+1,n+1,[μ]}.

Denoting C:=C1⁢2(m+1)/2+C2⁢2(n+1)/2+C3⁢2(m+n+2)/2, the conclusion follows. ∎

5 Numerical examples in the bivariate case

To validate the bivariate operator introduced in (23), we consider the following test functions fi:[0,1]2→[0,∞CLOSE), i=1,…,4 (see, e.g., [19]):

f1⁢(x,y) =ex⁢y,
f2⁢(x,y) =2+sin⁡(9⁢x⁢y),
f3⁢(x,y) =2−sin2⁡(−8⁢(x−0.5)2−8⁢(y−0.5)2),
f4⁢(x,y) =1+e−x+sin⁡(12⁢x)⁢cos⁡(3⁢y).

For each function fi, i=1,…,4, we construct the bivariate max-product Shepard-Euler operator 𝕊⁢𝔼~m,nμ defined in (23) over a uniform grid of (N+1)2 nodes 𝐱i,j=(xi,yj)=(iN,jN), i,j=0,1,…,N. We choose μ=3 and test the operators of degree (m,n)=(1,1) and (m,n)=(2,2) on two sets of sampling points, for N=20 and N=50. The results are compared with those obtained using the classical bivariate Shepard-Euler operators 𝕊⁢𝔼1,13 and 𝕊⁢𝔼2,23, as well as the bivariate max-product and classical Shepard operators, 𝕊~3 and 𝕊3, respectively. The first two types of operators are obtained by naturally extending, respectively, the univariate classical Shepard-Euler operator (6) and the univariate max-product Shepard operator (7) to the bivariate setting, while the classical Shepard operator is defined in (1). The maximum (em⁢a⁢x) and mean (em⁢e⁢a⁢n) approximation errors are presented in Tables 4 and 5.

It can be seen that the choice of higher approximation order (m,n)=(2,2) significantly reduces the error with respect to (m,n)=(1,1). Moreover, increasing N from 20 to 50 uniformly improves all operators, and, in this case, the max-product Shepard-Euler operator outperforms its classical version. Table 6 reports the CPU times for each operator across the four bivariate test functions, for N=20. As expected, increasing the degree of the operator from (1,1) to (2,2) increases the runtime, since more terms of the Euler expansion must be evaluated at each node. Moreover, the computational cost of the classical and max-product versions of each operator are comparable, confirming that the max-product structure does not introduce significant overhead over its linear counterpart.

Table 4: Maximum and mean approximation errors for fi, i=1,…,4, N=20.
𝕊⁢𝔼~1,13⁢[fi] 𝕊⁢𝔼~2,23⁢[fi] 𝕊⁢𝔼1,13⁢[fi] 𝕊⁢𝔼2,23⁢[fi] 𝕊~3⁢[fi] 𝕊3⁢[fi]
em⁢a⁢x em⁢e⁢a⁢n em⁢a⁢x em⁢e⁢a⁢n em⁢a⁢x em⁢e⁢a⁢n em⁢a⁢x em⁢e⁢a⁢n em⁢a⁢x em⁢e⁢a⁢n em⁢a⁢x em⁢e⁢a⁢n
f1 3.80⁢e−3 2.54⁢e−4 2.76⁢e−5 2.28⁢e−6 5.50⁢e−3 1.20⁢e−3 7.00⁢e−4 6.58⁢e−5 1.26⁢e−1 1.30⁢e−2 6.28⁢e−2 6.10⁢e−3
f2 1.24⁢e−1 9.00⁢e−3 6.00⁢e−3 6.83⁢e−4 8.02⁢e−2 2.04⁢e−2 7.67⁢e−2 1.87⁢e−2 3.65⁢e−1 5.33⁢e−2 1.58⁢e−1 3.80⁢e−2
f3 2.09⁢e−1 1.50⁢e−2 1.48⁢e−2 3.10⁢e−3 9.86⁢e−2 1.93⁢e−2 2.27⁢e−1 5.23⁢e−2 3.32⁢e−1 4.63⁢e−2 1.27⁢e−1 3.75⁢e−2
f4 1.34⁢e−1 1.80⁢e−2 8.90⁢e−3 2.20⁢e−3 1.18⁢e−1 1.98⁢e−2 7.48⁢e−2 1.15⁢e−2 3.12⁢e−1 6.31⁢e−2 1.71⁢e−1 4.67⁢e−2
Table 5: Maximum and mean approximation errors for fi, i=1,…,4, N=50.
𝕊⁢𝔼~1,13⁢[fi] 𝕊⁢𝔼~2,23⁢[fi] 𝕊⁢𝔼1,13⁢[fi] 𝕊⁢𝔼2,23⁢[fi] 𝕊~3⁢[fi] 𝕊3⁢[fi]
em⁢a⁢x em⁢e⁢a⁢n em⁢a⁢x em⁢e⁢a⁢n em⁢a⁢x em⁢e⁢a⁢n em⁢a⁢x em⁢e⁢a⁢n em⁢a⁢x em⁢e⁢a⁢n em⁢a⁢x em⁢e⁢a⁢n
f1 5.58⁢e−4 4.00⁢e−5 1.79⁢e−6 1.49⁢e−7 2.30⁢e−3 4.46⁢e−4 3.10⁢e−4 2.31⁢e−5 4.57⁢e−2 5.20⁢e−3 3.27⁢e−2 2.50⁢e−3
f2 1.61⁢e−2 1.40⁢e−3 4.23⁢e−4 4.52⁢e−5 3.31⁢e−2 8.20⁢e−3 2.91⁢e−2 6.40⁢e−3 1.46⁢e−1 2.13⁢e−2 6.72⁢e−2 1.51⁢e−2
f3 3.03⁢e−2 2.50⁢e−3 1.30⁢e−3 1.34⁢e−4 3.56⁢e−2 7.60⁢e−3 7.73⁢e−2 1.79⁢e−2 1.46⁢e−1 1.83⁢e−2 5.36⁢e−2 1.46⁢e−2
f4 2.20⁢e−2 2.90⁢e−3 5.73⁢e−4 1.40⁢e−4 3.51⁢e−2 6.00⁢e−3 2.24⁢e−2 4.20⁢e−3 1.21⁢e−1 2.56⁢e−2 6.79⁢e−2 1.83⁢e−2
Table 6: CPU times (in seconds) for each operator, fi, i=1,…,4, N=20.
𝕊⁢𝔼~1,13⁢[fi] 𝕊⁢𝔼~2,23⁢[fi] 𝕊⁢𝔼1,13⁢[fi] 𝕊⁢𝔼2,23⁢[fi] 𝕊~3⁢[fi] 𝕊3⁢[fi]
f1 6.83 11.01 7.40 10.00 4.99 4.92
f2 6.81 9.35 6.76 9.18 4.91 4.80
f3 6.88 10.56 7.50 10.95 4.99 5.07
f4 6.81 9.30 7.79 9.06 4.71 4.64

The graphical representations of the functions fi,i=2,3,4, and the corresponding max-product Shepard-Euler approximants 𝕊⁢𝔼~1,13⁢[fi], 𝕊⁢𝔼~2,23⁢[fi], respectively, are displayed in Figures 2–4, in the case N=50.

Refer to caption
(a) f2⁢(x,y)
Refer to caption
(b) 𝕊⁢𝔼~1,13⁢[f2]⁢(x,y)
Refer to caption
(c) 𝕊⁢𝔼~2,23⁢[f2]⁢(x,y)
Figure 2: f2⁢(x,y) and the max-product Shepard-Euler operators, N=50.
Refer to caption
(a) f3⁢(x,y)
Refer to caption
(b) 𝕊⁢𝔼~1,13⁢[f3]⁢(x,y)
Refer to caption
(c) 𝕊⁢𝔼~2,23⁢[f3]⁢(x,y)
Figure 3: f3⁢(x,y) and the max-product Shepard-Euler operators, N=50.
Refer to caption
(a) f4⁢(x,y)
Refer to caption
(b) 𝕊⁢𝔼~1,13⁢[f4]⁢(x,y)
Refer to caption
(c) 𝕊⁢𝔼~2,23⁢[f4]⁢(x,y)
Figure 4: f4⁢(x,y) and the max-product Shepard-Euler operators, N=50.

We next present, in Figure 5, log-log plots of the maximum error em⁢a⁢x versus N+1, for N+1=10⋅2k, k=0,…,4. Subfigure 5(a) displays the results for the operator 𝕊⁢𝔼~1,13, applied to the four test functions f1,…,f4 introduced above (all of class C∞), and to a fifth function

f5⁢(x,y)=|x−0.9|2.04+|y−0.9|2.04+1,

which is only of class C(2,2). For all five functions, the observed rates are close to N−2 (black dotted line), consistent with the rate guaranteed by Theorem 4.7. Subfigure 5(b) presents the analogous results for 𝕊⁢𝔼~2,23, applied to f1,…,f4 and to the function

f6⁢(x,y)=|x−0.25|3.04+|y−0.25|3.04+1,

only of class C(3,3). Here, Theorem 4.7 guarantees an error bound of order at least N−3, represented by the cubic trend given by the black dotted line.

Refer to caption
(a) 𝕊⁢𝔼~1,13⁢[fi]
Refer to caption
(b) 𝕊⁢𝔼~2,23⁢[fi]
Figure 5: Log-log plot of the approximation error em⁢a⁢x of the max-product Shepard-Euler operators 𝕊⁢𝔼~1,13⁢[fi] and 𝕊⁢𝔼~2,23⁢[fi].

Finally, to verify the degree of exactness, we test the operator on the polynomial functions

g1⁢(x,y) =x+2⁢y,
g2⁢(x,y) =x2+y2,
g3⁢(x,y) =3⁢x2+4⁢x⁢y+5⁢y2+4⁢x+y+2,

and display the mean approximation errors in Table 7. The results confirm Proposition 4.6: for g1, which is of degree (1,1), both 𝕊⁢𝔼~1,13 and 𝕊⁢𝔼~2,23 reproduce it to machine precision (errors of order 10−16). For g2 and g3, which are of degree (2,2), only 𝕊⁢𝔼~2,23 reproduces them exactly (errors of order 10−17 and 10−16, respectively). These results confirm that the degree of exactness of the operator is (m,n).

Table 7: Mean approximation errors for gi, i=1,…,3.
𝕊⁢𝔼~1,13⁢[gi] 𝕊⁢𝔼~2,23⁢[gi]
g1 1.1786⁢e−16 1.1786⁢e−16
g2 0.0034 6.8397⁢e−17
g3 0.0142 9.4337⁢e−16

6 Application in a digital terrain reconstruction problem

To evaluate the practical performance of the bivariate max-product Shepard–Euler operator introduced in this paper, we consider a digital terrain reconstruction problem across four different regions in Cluj County, in Romania. The data are extracted from the SRTM 1 Arc-Second Global dataset, tile N46E023 (46∘N–47∘N, 23∘E–24∘E), provided by NASA and freely available via the NASA Earthdata portal at https://www.earthdata.nasa.gov/, or at https://download.mapsforge.org/maps/dem/dem3/N46/. We use two different sets of (N+1)2 nodes, first considering N=50, and then considering N=75, and compute the approximation values on 40401 evaluation points.

The first dataset D1 has altitudes between 292m and 656m. For the second dataset D2, the minimum value is 296m, and the maximum one is 790m. For dataset D3, the values are between 318m and 840m, while for the last one, D4, they are between 347m and 683m.

We apply the max-product Shepard-Euler operator 𝕊⁢𝔼~1,13 given in (23), using MATLAB’s built-in gradient function to approximate the partial derivatives required in the construction of the operator. The substitution of exact partial derivatives with numerical estimates has also been considered in other interpolation studies. For example, Renka and Cline [27] proposed local derivative estimates obtained from quadratic weighted least-squares fits for a triangle-based C1 interpolant. Dell’Accio and Di Tommaso [17] considered the case in which only function values are available and replaced derivative data by coefficients of locally fitted quadratic and cubic least-squares polynomials, obtaining comparable accuracy for the bivariate Shepard-Bernoulli operator. In our theoretical analysis from Section 4, however, the required partial derivatives are assumed to be known exactly, whereas in this application they are estimated from the available elevation data. Since SRTM-type elevation data are known to contain measurement errors, as mentioned in [24], the data approximations contain both operator and numerical differentiation errors. The latter cannot be assessed separately, since the exact terrain derivatives are unavailable. However, a more detailed investigation of the relation between numerical differentiation and data noise in this type of application represents a possible direction for future research.

To compare the results obtained, we also apply the classical Shepard-Euler operator 𝕊⁢𝔼1,13, the max-product Shepard operator 𝕊~3, and the classical Shepard operator 𝕊3 on each dataset. The maximum and mean approximation errors are displayed in Table 8 for N=50 and in Table 9 for N=75. It can be observed that combining the Shepard operator with the Euler polynomial approximant yields better results than the simple version of the Shepard operator, in both classical and max-product versions, in the majority of cases. Moreover, when using N=75, the max-product Shepard-Euler operator 𝕊⁢𝔼~1,13 has the smallest mean approximation errors across all datasets. The relative errors for this operator when applied to the dataset Di,i=1,…,4, are 1.5%, 1.4%, 1.8%, 2.0%, when N=50, and 0.8%, 0.8%, 1.0%, 1.1%, when N=75.

The reconstructed surfaces obtained with 𝕊⁢𝔼~1,13 are displayed in Figures 6–9.

Table 8: Maximum and mean approximation errors for each dataset Di,i=1,…,4, N=50.
Di 𝕊⁢𝔼~1,13⁢[fi] 𝕊⁢𝔼1,13⁢[fi] 𝕊~3⁢[fi] 𝕊3⁢[fi]
em⁢a⁢x em⁢e⁢a⁢n em⁢a⁢x em⁢e⁢a⁢n em⁢a⁢x em⁢e⁢a⁢n em⁢a⁢x em⁢e⁢a⁢n
D1 56.75m 6.15m 51.59m 5.84m 78m 8.72m 41m 6.66m
D2 76.50m 6.65m 49.83m 6.28m 75m 8.74m 47m 6.60m
D3 238.25m 9.26m 211.68m 8.59m 253m 10.93m 156.52m 8.64m
D4 85.75m 9.62m 57m 8.90m 73m 10.81m 53.67m 8.39m
Table 9: Maximum and mean approximation errors for each dataset Di,i=1,…,4, N=75.
Di 𝕊⁢𝔼~1,13⁢[fi] 𝕊⁢𝔼1,13⁢[fi] 𝕊~3⁢[fi] 𝕊3⁢[fi]
em⁢a⁢x em⁢e⁢a⁢n em⁢a⁢x em⁢e⁢a⁢n em⁢a⁢x em⁢e⁢a⁢n em⁢a⁢x em⁢e⁢a⁢n
D1 30.68m 3.32 m 28.92m 3.47m 40m 5.56m 36.38m 4.66m
D2 31.87m 3.73 m 32.86m 3.84m 46m 5.64m 35.25m 4.68m
D3 147.68m 5.24 m 161.63m 5.35m 186m 7.12m 147.39m 6.20m
D4 42.68m 5.39 m 37.77m 5.47m 49m 7.02m 40.55m 5.98m
Refer to caption
(a) Real values
Refer to caption
(b) N=50
Refer to caption
(c) N=75
Figure 6: Real and approximated topographic values for the first dataset.
Refer to caption
(a) Real values
Refer to caption
(b) N=50
Refer to caption
(c) N=75
Figure 7: Real and approximated topographic values for the second dataset.
Refer to caption
(a) Real values
Refer to caption
(b) N=50
Refer to caption
(c) N=75
Figure 8: Real and approximated topographic values for the third dataset.
Refer to caption
(a) Real values
Refer to caption
(b) N=50
Refer to caption
(c) N=75
Figure 9: Real and approximated topographic values for the fourth dataset.

7 Application in precipitation quantities approximation

We end this paper by investigating another practical application of the bivariate operator introduced in this paper. We consider here the case (m,n)=(0,0) to illustrate the operator’s behavior in this simplified setting which does not involve the partial derivatives of the function and compute the mean absolute errors in the approximation of some rainfall quantities over different months in 2025 and 2026. The data set is available at https://psl.noaa.gov/data/gridded/data.gpcp.html and it is taken from the Global Precipitation Climatology Project (GPCP) Monthly Analysis product, distributed by the NOAA Physical Sciences Laboratory [1]. The dataset contains global monthly mean precipitation rates (mm/day) on a regular 2.5∘×2.5∘ latitude–longitude global grid (144×72 grid points) from January 1979 to present. We use (N+1)2 nodes with N=75 to reconstruct 10368 values. The mean approximation errors (em⁢e⁢a⁢n) obtained with the bivariate max-product Shepard operator 𝕊⁢𝔼~0,03 are displayed in Table 10. For each month, we display the minimum precipitation quantity (pm⁢i⁢n) and the maximum one (pm⁢a⁢x). The graphical representations for the true and the approximated values in July 2025 and February 2026 are displayed in Figure 10 and Figure 11, respectively.

Table 10: Mean approximation errors for precipitation values.
2025 2026
Jan Mar May Jul Sep Nov Jan Feb
pm⁢i⁢n(mm/day) 0 0 0 0 0 0 0 0
pm⁢a⁢x (mm/day) 25.24 20.19 21.54 31.89 22.81 23.37 28.41 27.20
em⁢e⁢a⁢n(mm/day) 0.53 0.52 0.57 0.61 0.60 0.55 0.60 0.58
Refer to caption
(a) Real values
Refer to caption
(b) Approximated values
Figure 10: Real and approximated precipitation values in July 2025.
Refer to caption
(a) Real values
Refer to caption
(b) Approximated values
Figure 11: Real and approximated precipitation values in February 2026.

8 Conclusion

In this paper, we introduced a novel max-product Shepard-type operator. The main contribution is the combination of the max-product Shepard framework with a local approximation operator based on Euler polynomials, with the aim of improving the performance of the classical Shepard operator for the approximation of nonnegative functions. We studied the approximation errors and the degree of exactness in both the univariate and bivariate settings. In addition to numerical examples involving several test functions, we considered practical applications, including terrain reconstruction and the approximation of precipitation data. Future work may address extensions to higher-dimensional settings and alternative local approximants.

Acknowledgments

The author would like to thank the anonymous referees for their careful reading of the manuscript and for their helpful suggestions, which have substantially improved this work.

References

  • [1] Adler, R.F., Huffman, G.J., Chang, A., Ferraro, R., Xie, P., Janowiak, J., Rudolf, B., Schneider, U., Curtis, S., Bolvin, D., Gruber, A., Susskind, J., Arkin, P.: The Version 2 Global Precipitation Climatology Project (GPCP) Monthly Precipitation Analysis (1979-Present). J. Hydrometeor. 4, 1147–1167 (2003)
  • [2] Allasia, G., Cavoretto, R., De Rossi, A.: Hermite-Birkhoff interpolation on scattered data on the sphere and other manifolds. Appl. Math. Comput. 318, 35–50 (2018)
  • [3] Bede, B., Nobuhara, H., Fodor, J., Hirota, K.: Max-Product Shepard approximation operators. J. Adv. Comput. Intell. Intell. Inform. 10(4), 494–497 (2006)
  • [4] Bede, B., Nobuhara, H., Daňková, M., Di Nola, A.: Approximation by pseudo-linear operators. Fuzzy Sets Syst. 159(7), 804–820 (2008)
  • [5] Bretti, G., Ricci, P. E.: Euler polynomials and the related quadrature rule. Georgian Math. J. 8(3), 447–453 (2001)
  • [6] Caira, R., Dell’Accio, F.: Shepard-Bernoulli operators. Math. Comp. 76, 299–321 (2007)
  • [7] Caira, R., Dell’Accio, F., Di Tommaso, F.: On the bivariate Shepard–Lidstone operators. J. Comput. Appl. Math. 236, 1691–1707 (2012)
  • [8] Cătinaş, T.: The combined Shepard-Abel-Goncharov univariate operator. J. Numer. Anal. Approx. Theory 32, 11–20 (2003)
  • [9] Cătinaş, T.: The combined Shepard-Lidstone bivariate operator. In: Trends and Applications in Constructive Approximation. International Series of Numerical Mathematics (de Bruin, M.G. et al. (eds.)), 151, 77–89, Springer Group-Birkhäuser Verlag (2005)
  • [10] Cătinaş, T.: The bivariate Shepard operator of Bernoulli type. Calcolo 44, 189–202 (2007)
  • [11] Cătinaş, T.: An iterative modification of Shepard–Bernoulli operator. Results Math. 69, 387-395 (2016)
  • [12] Cătinaş, T., Malina, A.: Shepard operator of least squares thin-plate spline type. Stud. Univ. Babeş-Bolyai Math. 66(2), 257–265 (2021)
  • [13] Cătinaş, T., Malina, A.: The combined Shepard operator of inverse quadratic and inverse multiquadric type. Stud. Univ. Babeş-Bolyai Math. 67, 579–589 (2022)
  • [14] Cătinaş, T., Malina, A.: Spherical interpolation of scattered data using least squares thin-plate spline and inverse multiquadric functions. Numer. Algor. 97, 1397–1414 (2024)
  • [15] Cătinaş, T., Malina, A.: Spherical Shepard-Bernoulli operator. J. Appl. Math. Comput. 71, 1267–1283 (2025)
  • [16] Costabile, F.A., Dell’Accio, F.: Expansion over a rectangle of real functions in Bernoulli polynomials and applications. BIT 41, 451–464 (2001)
  • [17] Dell’Accio, F., Di Tommaso, F.: Bivariate Shepard–Bernoulli operators. Math. Comput. Simulation 141, 65–82 (2017)
  • [18] Duman, O., Della Vecchia, B.: Complex Shepard operators and their summability. Results Math. 76, Art. No. 214 (2021)
  • [19] Duman, O.: Max-product Shepard operators based on multivariable Taylor polynomials. J. Comput. Appl. Math. 437, Art. No. 115456 (2024)
  • [20] Duman, O.: Shepard operators revisited: Linear and nonlinear approaches, accelerated convergence, and applications. Approx. Theory Spec. Funct. 1(1), 93–105 (2025)
  • [21] Duman, O.: Improved approximation via hybrid Shepard–Lagrange operators: Linear and nonlinear perspectives. J. Comput. Appl. Math. 473, Art. No. 116864 (2026)
  • [22] Ellidokuz, T. Y. G.: Approximation with max-product Shepard-Bernoulli operators. J. Comput. Appl. Math. 482, Art. No. 117313 (2026)
  • [23] Ellidokuz, T. Y. G.: Approximation with Shepard-Lidstone and max-product Shepard-Lidstone operators. J. Comput. Appl. Math. 489, Art. No. 117922 (2027)
  • [24] Falorni, G., Teles, V., Vivoni, E. R., Bras, R. L., Amaratunga, K. S.: Analysis and characterization of the vertical accuracy of digital elevation models from the Shuttle Radar Topography Mission. J. Geophys. Res. 110, Art. No. F02005 (2005)
  • [25] Franke, R.: Scattered data interpolation: tests of some methods. Math. Comp. 38, 181–200 (1982)
  • [26] Franke, R., Nielson, G.: Smooth interpolation of large sets of scattered data. Int. J. Numer. Meths. Engrg. 15, 1691–1704 (1980)
  • [27] Renka, R.J., Cline, A.K.: A triangle-based C1 interpolation method. Rocky Mountain J. Math. 14, 223–237 (1984)
  • [28] Renka, R.J.: Multivariate interpolation of large sets of scattered data. ACM Trans. Math. Software 14, 139–148 (1988)
  • [29] Shepard, D.: A two dimensional interpolation function for irregularly spaced data. In: Proceedings of the 1968 23rd ACM National Conference, 517–523. ACM (1968)
  • [30] Wu, R.: A kind of bivariate Bernoulli-type multiquadric quasi-interpolation operator with higher approximation order. J. Inequal. Appl. 2023, Art. No. 88 (2023)
  • [31] Wu, R.: A kind of univariate improved Shepard-Euler operators. Open Mathematics 23(1), Art. No. 20250209 (2025)
  • [32] Zerroudi, B., Tayeq, H., El Harrak, A.: Effective interpolation of scattered data on a sphere through a Shepard-like method. Math. Model. Comput., 10(4), 1174–1186 (2023)
  • [33] Zerroudi, B., Tayeq, H., El Harrak, A.: Scattered data interpolation on the 2-dimensional surface through Shepard-like technique. Math. Model. Comput. 11(1), 277–289 (2024)

[1] D. Shepard, A two dimensional interpolation function for irregularly spaced data, in: Proceedings of the 1968 23rd ACM National Conference, ACM, 1968, pp. 517–523.

[2] R. Franke, Scattered data interpolation: tests of some methods, Math. Comp. 38 (1982) 181–200.

[3] R. Franke, G. Nielson, Smooth interpolation of large sets of scattered data, Int. J. Numer. Meths. Engrg. 15 (1980) 1691–1704.

[4] R.J. Renka, A.K. Cline, A triangle-based 1 interpolation method, Rocky Mountain J. Math. 14 (1984) 223–237.

[5] R.J. Renka, Multivariate interpolation of large sets of scattered data, ACM Trans. Math. Software 14 (1988) 139–148.

[6] R. Caira, F. Dell’Accio, Shepard-Bernoulli operators, Math. Comp. 76 (2007) 299–321.

[7] T. Cătinaș, The combined Shepard-Abel-Goncharov univariate operator, J. Numer. Anal. Approx. Theory 32 (2003) 11–20.

[8] R. Wu, A kind of univariate improved Shepard-Euler operators, Open Math. 23 (1) (2025) Art. No 20250209.

[9] R. Caira, F. Dell’Accio, F. Di Tommaso, On the bivariate Shepard-Lidstone operators, J. Comput. Appl. Math. 236 (2012) 1691–1707.

[10] T. Cătinaș, The combined Shepard-Lidstone bivariate operator, in: M.G. de Bruin et al., (Eds.), Trends and Applications in Constructive Approximation, 151 of International Series of Numerical Mathematics, Springer Group-Birkhäuser Verlag, 2005, pp. 77–89.

[11] T. Cătinaș, The bivariate Shepard operator of Bernoulli type, Calcolo 44 2007 189–202.

[12] T. Cătinaș, An iterative modification of Shepard-Bernoulli operator, Results Math. 69 (2016) 387–395.

[13] F. Dell’Accio, F. Di Tommaso, Bivariate Shepard-Bernoulli operators, Math. Comput. Simulation 141 (2017) 65–82.

[14] T. Cătinaș, A. Malina, Shepard operator of least squares thin-plate spline type, Stud. Univ. Babeș-Bolyai Math. 66 (2) (2021) 257–265.

[15] T. Cătinaș, A. Malina, The combined Shepard operator of inverse quadratic and inverse multiquadric type, Stud. Univ. Babeș-Bolyai Math. 67 (2022) 579–589.

[16] G. Allasia, R. Cavoretto, A. De Rossi, Hermite-Birkhoff interpolation on scattered data on the sphere and other manifolds, Appl. Math. Comput. 318 (2018) 35–50.

[17] T. Cătinaș, A. Malina, Spherical interpolation of scattered data using least squares thin-plate spline and inverse multiquadric functions, Numer. Algor. 97 (2024) 1397–1414.

[18] T. Cătinaș, A. Malina, Spherical Shepard-Bernoulli operator, J. Appl. Math. Comput. 71 (2025) 1267–1283.

[19] B. Zerroudi, H. Tayeq, A. El Harrak, Effective interpolation of scattered data on a sphere through a Shepard-like method, Math. Model. Comput. 10 (4) (2023) 1174–1186.

[20] B. Zerroudi, H. Tayeq, A. El Harrak, Scattered data interpolation on the 2-dimensional surface through Shepard-like technique, Math. Model. Comput. 11 (1) (2024) 277–289.

[21] O. Duman, B. Della Vecchia, Complex Shepard operators and their summability, Results Math. 76 () (2021).

[22] G. Bretti, P.E. Ricci, Euler polynomials and the related quadrature rule, Georgian Math. J. 8 (3) (2001) 447–453.

[23] B. Bede, H. Nobuhara, J. Fodor, K. Hirota, Max-Product Shepard approximation operators, J. Adv. Comput. Intell. Intell. Inform. 10 (4) (2006) 494–497.

[24] B. Bede, H. Nobuhara, M. Danková, A. Di Nola, Approximation by pseudo-linear operators, Fuzzy Sets Syst. 159 (7) (2008) 804–820.

[25] O. Duman, Max-product Shepard operators based on multivariable Taylor polynomials, J. Comput. Appl. Math. 437, (2024), Art. No.115456

[26] T.Y.G. Ellidokuz, Approximation with max-product Shepard-Bernoulli operators, J. Comput. Appl. Math. 482 (2026).

[27] T.Y.G. Ellidokuz, Approximation with Shepard-Lidstone and max-product Shepard-Lidstone operators, J. Comput. Appl. Math. 489 (2027).

[28] O. Duman, Shepard operators revisited: linear and nonlinear approaches, accelerated convergence, and applications, Approx. Theory Spec. Funct. 1 (1) (2025) 93–105.

[29] O. Duman, Improved approximation via hybrid Shepard–Lagrange operators: linear and nonlinear perspectives, J. Comput. Appl. Math. 473 (2026)

[30] F.A. Costabile, F. Dell’Accio, Expansion over a rectangle of real functions in Bernoulli polynomials and applications, BIT 41 (2001) 451–464.

[31] R. Wu, A kind of bivariate Bernoulli-type multiquadric quasi-interpolation operator with higher approximation order, J. Inequal. Appl. 2023 (2023).

[32] G. Falorni, V. Teles, E.R. Vivoni, R.L. Bras, K.S. Amaratunga, Analysis and characterization of the vertical accuracy of digital elevation models from the Shuttle Radar Topography Mission, J. Geophys. Res. 110 (2005) Art. No. F02005.

[33] R.F. Adler, G.J. Huffman, A. Chang, R. Ferraro, P. Xie, J. Janowiak, B. Rudolf, U. Schneider, S. Curtis, D. Bolvin, A. Gruber, J. Susskind, P. Arkin, The Version 2 Global Precipitation Climatology Project (GPCP) Monthly Precipitation Analysis (1979-Present), J. Hydrometeor. 4 (2003) 1147–1167.

Related Posts

No results found.