Next Article in Journal
An Improved Intuitionistic Fuzzy Decision-Theoretic Rough Set Model and Its Application
Next Article in Special Issue
Approximation of Functions of the Classes CβψHα by Linear Methods Summation of Their Fourier Series
Previous Article in Journal
Optimality Conditions for Approximate Solutions of Set Optimization Problems with the Minkowski Difference
Previous Article in Special Issue
A New Extension of Optimal Auxiliary Function Method to Fractional Non-Linear Coupled ITO System and Time Fractional Non-Linear KDV System
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Nonlinear 2D C1 Quadratic Spline Quasi-Interpolants on Triangulations for the Approximation of Piecewise Smooth Functions

1
Departament of Mathematics, Universitat de València, Av. Vicent Andrés Estellés, E-46100 Burjassot, Spain
2
Department of Mathematics, University of Torino, Via Carlo Alberto 10, 10123 Torino, Italy
*
Author to whom correspondence should be addressed.
Axioms 2023, 12(10), 1002; https://doi.org/10.3390/axioms12101002
Submission received: 20 September 2023 / Revised: 19 October 2023 / Accepted: 20 October 2023 / Published: 23 October 2023
(This article belongs to the Special Issue Advanced Approximation Techniques and Their Applications)

Abstract

:
The aim of this paper is to present and study nonlinear bivariate C 1 quadratic spline quasi-interpolants on uniform criss-cross triangulations for the approximation of piecewise smooth functions. Indeed, by using classical spline quasi-interpolants, the Gibbs phenomenon appears when approximating near discontinuities. Here, we use weighted essentially non-oscillatory techniques to modify classical quasi-interpolants in order to avoid oscillations near discontinuities and maintain high-order accuracy in smooth regions. We study the convergence properties of the proposed quasi-interpolants and we provide some numerical and graphical tests confirming the theoretical results.
MSC:
65D05; 65D07; 65D15; 65D17; 41A15; 41A81

1. Introduction

In the context of function and data approximation (an important problem in many mathematical and scientific applications), quasi-interpolation is well known to be a powerful and useful tool (as evidenced in [1] and references [2,3,4,5] for applications of spline quasi-interpolation). In particular, a nice property of quasi-interpolation, if compared to interpolation, is that it does not require the solution of any system of equations. This property is particularly attractive in the two-dimensional case, where the data volume can be huge, in practice. Moreover, interpolation requires that the approximant exactly matches the data at certain points; this requirement could be a problem if we are dealing with noisy data.
If the function to be approximated is smooth, a spline quasi-interpolant (QI) is able to well reconstruct it, but if the function has jump discontinuities, the approximating spline presents oscillations of magnitude proportional to the jump. Therefore, the aim of this paper is to apply weighted essentially non-oscillatory (WENO) techniques in the definition of the spline QI to avoid such oscillations. Using such a nonlinear modification, we are able to avoid the Gibbs phenomenon near discontinuities and, at the same time, maintain high-order accuracy in smooth regions. This problem has been faced in the univariate case in [6], applying the technique to quadratic and cubic spline QIs (as evidenced in reference [7]). Here, we move toward the bivariate setting. In particular, we consider C 1 quadratic spline QIs on uniform criss-cross triangulations of a rectangular domain, which can be expressed by means of the scaled/translates of the Zwart–Powell quadratic box spline (ZP element) (see, e.g., [8] (Chapter 1) and [9] (Chapter 2)). We should note that C 1 quadratic spline spaces on criss-cross triangulations have been widely studied in the literature (see, e.g., [10,11,12,13,14,15,16,17] and references therein, and more recent papers, [18,19,20]), with reference to the dimension, local basis, approximation power, etc.; they have been used in many applications. We are aware that the use of non-uniform knot partitions and multiple knots in the spline space definition can sometimes mimic function discontinuities of the approximating function (see, e.g., [21]), but such a possibility requires knowledge of discontinuity locations. In contrast, using the technique presented in this paper, we are able to deal with discontinuities without knowing where they are; it can also be applied to general cases. Moreover, the use of box splines on uniform partitions represents an advantage—from a computational point of view—with respect to the use of non-uniform ones.
The paper is organized as follows. In Section 2, we define the spline space, and recall definitions and properties of spline quasi-interpolant operators. Then, in Section 3, we recall the WENO techniques. In Section 4, we apply the techniques of the previous section for constructing nonlinear spline quasi-interpolants and study their properties. In Section 5, we provide numerical and graphical tests, confirming the theoretical results of Section 4. Finally, in Section 6, we present some conclusions.

2. The Spline Space

Let Ω = [ 0 , h m ] × [ 0 , h n ] be a rectangular domain divided into m n equal squares, each of them being subdivided into four triangles by its diagonals. We denote by S 2 1 ( Ω , T ) the space of C 1 quadratic splines on the triangulation T of Ω obtained in this way. This space is generated by the ( m + 2 ) ( n + 2 ) spline functions { B α , α A } , where A = { α = ( i , j ) , 0 i m + 1 , 0 j n + 1 } , obtained by the dilation/translation of the Zwart–Powell quadratic box spline (ZP element) ([8] (Chapter 1) and [22] (Chapter 3)).
The ZP element is the bivariate C 1 quadratic box spline supported on the octagon with the center at the origin and vertices at ( 3 2 , 1 2 ) , ( 1 2 , 3 2 ) , ( 1 2 , 3 2 ) , ( 3 2 , 1 2 ) , ( 3 2 , 1 2 ) , ( 1 2 , 3 2 ) , ( 1 2 , 3 2 ) , ( 3 2 , 1 2 ) . It is strictly positive inside its support, which is partitioned into 28 triangular cells. On every cell, the ZP element is a polynomial of total degree 2, and in [11], the polynomials are given. The ZP element can also be expressed in BB form, i.e., specifying the Bernstein–Bézier (abbr. BB) coefficients on every triangular cell [23] (Chapter 6). We denote by Σ α the support of the dilated/translated box spline B α , and its center by C α .
In the space S 2 1 ( Ω , T ) , we consider linear quasi-interpolants (QIs) with the following form:
Q f : = α A λ α ( f ) B α ,
where λ α , α A is a set of continuous linear forms, called coefficient functionals. They can be of different types, chosen according to the provided information about the function f to be approximated. Usually, they are point, derivative, or integral linear functionals. In the first case, λ α ( f ) is a finite linear combination of values of f at some points in a neighborhood of Σ α . In the second case, λ α ( f ) is a finite linear combination of values of f and some of its partial derivatives at some points in a neighborhood of Σ α . Finally, in the third case, λ α ( f ) is a finite linear combination of weighted mean values of f.
In this paper, we focus on point QIs, that is, given a set of quasi-interpolation nodes P α , α D , for a suitable set of indices D, the coefficient functionals have the form
λ α ( f ) : = β F α σ α ( β ) f ( P β ) ,
where the finite set of points P β , β F α , F α D lies in some neighborhood of Σ α Ω . Here, Q f f when f belongs to P 2 , the space of quadratic polynomials.
Points P α , α D , used in evaluating f, are as follows (see Figure 1):
-
The vertices A i , j = ( x i , y j ) , i = 0 , , m , j = 0 , , n of squares;
-
The centers M i , j = ( s i , t j ) , i = 1 , , m , j = 1 , , n of squares;
-
The midpoints of boundary segments M i , 0 = ( s i , y 0 ) , M i , n + 1 = ( s i , y n ) , i = 1 , , m , M 0 , j = ( x 0 , t j ) , M m + 1 , j = ( x m , t j ) j = 1 , , n ,
where
x i = i h , i = 0 , , m , y j = j h , j = 0 , , n , s 0 = 0 , s i = x i 1 + x i 2 = i 1 2 h , i = 1 , , m , s m + 1 = m h , t 0 = 0 , t j = y j 1 + y j 2 = j 1 2 h , j = 1 , , n , t n + 1 = n h .
Moreover, we introduce the following notations: f i , j = f ( M i , j ) and f ¯ i , j = f ( A i , j ) .
Different point QIs that are exact on P 2 can be constructed using the QI nodes shown in Figure 1 (or a subset). For example, considering the following differential QI, exact on P 2 ([23] (Chapter 6)):
Q ^ f : = α A λ ^ α ( f ) B α with λ ^ α ( f ) = f ( C α ) h 2 8 Δ f ( C α )
and by using the five-point discretization of the Laplacian Δ , from (1), the following coefficient functionals λ i , j are defined [16] (see Figure 2a)
λ i , j 1 ( f ) = 3 2 f i , j 1 8 f i 1 , j + f i + 1 , j + f i , j 1 + f i , j + 1 .
This is not the unique choice for having a point QI that is exact on P 2 . In Figure 2, other possibilities are shown; they were obtained considering other kinds of approximations for λ ^ i , j ( f ) . We note that these coefficient functionals are suitable for box splines having support inside the domain, “far” from the boundary. For boundary generators, it is necessary to construct specific functionals using QI nodes inside the domain (for details, see [24], where this problem is encountered) and impose the reproduction of quadratic polynomials.
Regarding the approximation properties of such operators (see, e.g., [1,8,22]), we note that a QI has approximation order k, if
f Q f C h k , f C k ( Ω ) ,
i.e., the maximum error is O ( h k ) for h 0 , with an h-independent constant C. The maximum value of k that we can obtain, which provides optimal approximation, is related to the polynomial reproduction properties of Q. Since the above-mentioned QIs reproduce P 2 , they have the optimal approximation order 3. Also, the differential operator Q ^ has the approximation order 3, i.e.,
f Q ^ f = O ( h 3 ) .
If the function f has a jump inside Ω , then we expect
f Q f = O ( h 0 ) .

3. WENO Techniques

In this section, we recall some definitions and properties of the WENO techniques. For more details, the reader can refer to references [25,26,27,28]. Taking into account the purposes of the paper, we assume to have different approximations (for example, five) of λ ^ i , j ( f ) of this kind:
μ ( f ) = λ ^ i , j ( f ) + O ( h p ) , μ ( f ) = λ ^ i , j ( f ) + O ( h q ) , = 1 , 2 , 3 , 4 ,
where p > q , p, q N , and
μ ( f ) = γ 1 μ 1 ( f ) + γ 2 μ 2 ( f ) + γ 3 μ 3 ( f ) + γ 4 μ 4 ( f ) ,
for suitable values γ , = 1 , 2 , 3 , 4 . In general, the requirement is that μ ( f ) can be written as the linear combination of N coefficient functionals μ ( f ) and suitable values γ , N N .
In the case of functions f with jump discontinuity, oscillations in the approximation may occur; here, we want to apply the WENO technique to obtain a modified μ ( f ) , which (essentially) does not produce oscillations.
If the values γ are positive for = 1 , , N , we define the nonlinear coefficient functional
μ ω ( f ) = = 1 N ω ( f ) μ ( f ) ,
where
ω ( f ) = α ( f ) = 1 N α ( f ) , α ( f ) = γ ( ϵ + I ( f ) ) 2 , = 1 , , N , ϵ = 10 7
and I ( f ) 0 is an indicator of the smoothness of the region that contains the values involved in the calculation of μ l ( f ) , meaning that the smoother the function f, the closer it is to zero. In particular, if f is smooth, then μ ω ( f ) is as accurate as μ ( f ) , i.e.,
μ ω ( f ) = λ ^ i , j ( f ) + O ( h p ) .
Instead, if f has a discontinuity in the region where the data used by μ ( f ) lie, but it is smooth in at least one of the regions used to calculate the μ ( f ) , then μ ω ( f ) is as accurate as μ ( f ) , i.e.,
μ ω ( f ) = λ ^ i , j ( f ) + O ( h q ) .
In the case of negative values γ in (3), the WENO procedure cannot be applied directly to obtain stable schemes, and it is necessary to modify the procedure; here, we propose the technique presented in [28]. So, suppose we have μ ( f ) = = 1 N γ ( f ) μ ( f ) , where some γ < 0 . In this case, the nonlinear coefficient functionals are defined as
μ ω ( f ) = σ + = 1 N ω + ( f ) μ ( f ) σ = 1 N ω ( f ) μ ( f ) ,
where
α ± ( f ) : = γ ± ( ϵ + I ( f ) ) 2 , ω ± ( f ) : = α ± ( f ) = 1 N α ± ( f ) , = 1 , , N
and
γ ¯ + : = 1 2 γ + 3 γ , γ ¯ : = γ ¯ + γ , σ ± : = = 1 N γ ¯ ± , γ ± : = γ ¯ ± σ ± , = 1 , , N .
Also, in this case, (5) and (6) hold.

4. Nonlinear Spline Quasi-Interpolants

In this section, we construct nonlinear spline quasi-interpolants by applying the WENO techniques of Section 3 to the linear quasi-interpolants Q k with coefficient functionals λ i , j k ( f ) , k = 1, 2, 3, and 4, as shown in Figure 2.
Therefore, we consider the differential QI Q ^ with coefficient functional λ ^ i , j ( f ) given in (1), and the four linear QIs Q k , k = 1, 2, 3, and 4, defined in this way:
Q k f = α A λ α k ( f ) B α ,
with the inner functionals, as in Figure 2, and the boundary ones defined in a specific way, ensuring the reproduction of P 2 and the optimal approximation order 3. In [24], several strategies for the construction of boundary functionals are proposed and the obtained functionals can be used for defining the QIs ( Q 1 , Q 2 , and Q 4 ). For the Q 3 operators, we constructed ad hoc boundary functionals satisfying the above requirements.
We apply the WENO technique only to obtain nonlinear inner functionals; for the boundary ones, we adopt a strategy that is able to avoid the Gibbs phenomenon, as explained in Section 5.
Moreover, we define the following domains
Ω μ , ν + : = [ x μ , x m ] × [ y ν , y n ] , Ω μ , ν : = [ x 0 , x μ ] × [ y 0 , y ν ] ,
used in the subsequent subsections.

4.1. The Nonlinear Quasi-Interpolant Q ˜ 1

We want to apply the WENO technique to the operator Q 1 to obtain the nonlinear analog Q ˜ 1 . Thus, we decompose λ i , j 1 ( f ) (see Figure 2a), as
λ i , j 1 ( f ) = 3 2 f i , j 1 8 f i 1 , j + f i + 1 , j + f i , j 1 + f i , j + 1 = f i , j + 1 8 ( f i , j f i 1 , j ) ( f i + 1 , j f i , j ) + 1 8 ( f i , j f i , j 1 ) ( f i , j + 1 f i , j ) ,
and we recall that
λ i , j 1 ( f ) = λ ^ i , j ( f ) + O ( h 4 ) .
Since the differential coefficient λ ^ i , j ( f ) is defined by means of Δ f ( C i , j ) = 2 f x 2 ( C i , j ) + 2 f y 2 ( C i , j ) , we apply the WENO strategies separately in both directions x and y. Therefore, we define γ 1 = 1 , γ 2 = 1 ,
μ i + k , j 1 = f i + k , j f i + k 1 , j , μ ¯ i , j + k 1 = f i , j + k f i , j + k 1 , k = 0 , 1
and we have
λ i , j 1 ( f ) = f i , j + 1 8 γ 1 μ i , j 1 + γ 2 μ i + 1 , j 1 + 1 8 γ 1 μ ¯ i , j 1 + γ 2 μ ¯ i , j + 1 1 .
Taking into account the results reported in Section 3, we compute the quantities γ 1 ± , γ 2 ± , σ ± , we consider the smooth indicators I i + k , j = ( μ i + k , j 1 ) 2 , I ¯ i , j + k = ( μ ¯ i , j + k 1 ) 2 , k = 0 , 1 , and we obtain the values α i + k , j ± , α ¯ i , j + k ± , k = 0 , 1 and, consequently, the weights ω i + k , j ± , ω ¯ i , j + k ± , k = 0 , 1 . Now, we are able to define the nonlinear coefficient functional
λ ˜ i , j 1 ( f ) = f i , j + 1 8 σ + ( ω i , j + μ i , j 1 + ω i + 1 , j + μ i + 1 , j 1 ) σ ( ω i , j μ i , j 1 + ω i + 1 , j μ i + 1 , j 1 ) + 1 8 σ + ( ω ¯ i , j + μ ¯ i , j 1 + ω ¯ i , j + 1 + μ ¯ i , j + 1 1 ) σ ( ω ¯ i , j μ ¯ i , j 1 + ω ¯ i , j + 1 μ ¯ i , j + 1 1 ) ,
and the corresponding quasi-interpolant Q ˜ 1 f : = α A λ ˜ α 1 ( f ) B α .
Theorem 1.
The following results hold:
1. 
Q ˜ 1 is exact on the space P 1 span { x y } ;
2. 
if f is smooth, then f Q ˜ 1 f = O ( h 3 ) ;
3. 
if f has a discontinuity across the square ( s μ , s μ + 1 ) × ( t ν , t ν + 1 ) , and it is smooth on Ω μ + 1 , ν + 1 + and Ω μ 1 , ν 1 , then
f Q ˜ 1 f Ω μ + 1 , ν + 1 + , = O ( h 2 ) , f Q ˜ 1 f Ω μ 1 , ν 1 , = O ( h 2 ) ,
f Q ˜ 1 f Ω μ + 2 , ν + 2 + , = O ( h 3 ) , f Q ˜ 1 f Ω μ 2 , ν 2 , = O ( h 3 ) .
Proof. 
If f is smooth, statement 2 follows by (2), (5), and (8). However, this fact does not guarantee the reproduction of P 2 . Indeed, each of the parts into which λ i , j 1 ( f ) and λ ˜ i , j 1 ( f ) have been subdivided, guarantee Q ˜ 1 p = p , p P 1 span { x y } .
Now, taking into account the definition of λ i , j 1 ( f ) (see Figure 2a), if f has a discontinuity across the square ( s μ , s μ + 1 ) × ( t ν , t ν + 1 ) , then
λ μ + i , ν + j 1 ( f ) λ ˜ μ + i , ν + j 1 ( f ) = O ( h 2 ) , i , j = 1 , 0 , 1 λ μ + 1 + i , ν + 1 + j 1 ( f ) λ ˜ μ + 1 + i , ν + 1 + j 1 ( f ) = O ( h 3 ) , i + j 1 λ μ 1 i , ν 1 j 1 ( f ) λ ˜ μ 1 i , ν 1 j 1 ( f ) = O ( h 3 ) , i + j 1 .
Within the square, ( s μ , s μ + 1 ) × ( t ν , t ν + 1 ) , the 16 spanning functions B i , j , where i = μ 1 , μ , μ + 1 , μ + 2 and j = ν 1 , ν , ν + 1 , ν + 2 are involved, i.e., Σ i , j ( s μ , s μ + 1 ) × ( t ν , t ν + 1 ) . To construct the spline Q ˜ 1 f within the square [ x μ , x μ + 1 ] × [ y ν , y ν + 1 ] , we use the information on both sides of the discontinuity. However, when constructing Q ˜ 1 f in [ x μ + 1 , x μ + 2 ] × [ y ν + 1 , y ν + 2 ] (and similarly in Ω μ + 1 , ν + 1 + ), we only use the information on one side of the discontinuity, obtaining an approximation O ( h 2 ) as a consequence of (9). The same logical scheme can be used to prove the results in Ω μ 1 , ν 1 .
Moreover, if the discontinuity is across the square ( s μ , s μ + 1 ) × ( t ν , t ν + 1 ) , the region affected by the discontinuity and involved in the construction of Q ˜ 1 f is only [ x μ 2 , x μ + 2 ] × [ y ν 2 , y ν + 2 ] and, therefore,
f Q ˜ 1 f Ω μ + 2 , ν + 2 + , = O ( h 3 ) , f Q ˜ 1 f Ω μ 2 , ν 2 , = O ( h 3 ) .
Remark 1.
If the discontinuity runs across the square ( s μ , s μ + 1 ) × ( t ν , t ν + 1 ) , the region affected by the discontinuity in Q 1 f spans [ x μ 2 , x μ + 2 ] × [ y ν 2 , y ν + 2 ] . It follows from the definition of λ i , j 1 ( f ) , as seen in Figure 2a, and because the support of B i , j is in the square [ x i 2 , x i + 1 ] × [ y j 2 , y j + 1 ] . Elsewhere in the domain, the approximation retains an order of 3.

4.2. The Nonlinear Quasi-Interpolant Q ˜ 2

The construction of the nonlinear quasi-interpolant Q ˜ 2 is similar to the construction of Q ˜ 1 , but in this case, we have the following (see Figure 2b):
λ i , j 2 ( f ) = 13 8 f i , j 1 6 f i 1 , j + f i + 1 , j + f i , j 1 + f i , j + 1 + 1 96 f i 2 , j + f i + 2 , j + f i , j 2 + f i , j + 2 = f i , j 1 8 1 12 ( f i , j 2 f i , j + f i , j ) + 14 12 ( f i 1 , j 2 f i , j + f i + 1 , j ) 1 12 ( f i , j 2 f i + 1 , j + f i + 2 , j ) 1 8 1 12 ( f i , j 2 2 f i , j 1 + f i , j ) + 14 12 ( f i , j 1 2 f i , j + f i , j + 1 ) 1 12 ( f i , j 2 f i , j + 1 + f i , j + 2 )
and we recall that
λ i , j 2 ( f ) = λ ^ i , j ( f ) + O ( h 4 ) .
Defining γ 1 = γ 3 = 1 12 , γ 2 = 7 6 , and
μ i + k , j 2 = f i + k 1 , j 2 f i + k , j + f i + k + 1 , j , μ ¯ i , j + k 2 = f i , j + k 1 2 f i , j + k + f i , j + k + 1 , k = 1 , 0 , 1
we have
λ i , j 2 ( f ) = f i , j 1 8 γ 1 μ i 1 , j 2 + γ 2 μ i , j 2 + γ 3 μ i + 1 , j 2 1 8 γ 1 μ ¯ i , j 1 2 + γ 2 μ ¯ i , j 2 + γ 3 μ ¯ i , j + 1 2 .
Applying the WENO technique with negative weights, considered as smooth indicators I i + k , j = ( μ i + k , j 2 ) 2 , I ¯ i , j + k = ( μ ¯ i , j + k 2 ) 2 , k = 1 , 0 , 1 , we obtain
λ ˜ i , j 2 ( f ) = f i , j 1 8 σ + ( ω i 1 , j + μ i 1 , j 2 + ω i , j + μ i , j 2 + ω i + 1 , j + μ i + 1 , j 2 ) σ ( ω i 1 , j μ i 1 , j 2 + ω i , j μ i , j 2 + ω i + 1 , j μ i + 1 , j 2 ) 1 8 σ + ( ω ¯ i , j 1 + μ ¯ i , j 1 2 + ω ¯ i , j + μ ¯ i , j 2 + ω ¯ i , j + 1 + μ ¯ i , j + 1 2 ) σ ( ω ¯ i , j 1 μ ¯ i , j 1 2 ω ¯ i , j μ ¯ i , j 2 + ω ¯ i , j + 1 μ ¯ i , j + 1 2 )
and Q ˜ 2 f : = α A λ ˜ α 2 ( f ) B α .
Theorem 2.
The following results hold:
1. 
Q ˜ 2 is exact on the space P 2 ;
2. 
if f is smooth, then f Q ˜ 2 f = O ( h 3 ) ;
3. 
if f has a discontinuity across the square ( s μ , s μ + 1 ) × ( t ν , t ν + 1 ) , and it is smooth on Ω μ + 1 , ν + 1 + and Ω μ 1 , ν 1 , then f Q ˜ 2 f Ω μ + 1 , ν + 1 + , = O ( h 3 ) , f Q ˜ 2 f Ω μ 1 , ν 1 , = O ( h 3 ) .
Proof. 
If f is smooth, statement 2 follows by (2), (5), and (11). With respect to what happens for Q ˜ 1 , here, the parts into which λ i , j 2 ( f ) and λ ˜ i , j 2 ( f ) have been subdivided guarantee Q ˜ 2 p = p , p P 2 .
Now, taking into account the definition of λ i , j 2 ( f ) (see Figure 2b), if f has a discontinuity across the square ( s μ , s μ + 1 ) × ( t ν , t ν + 1 ) , then
λ i , j 2 ( f ) λ ˜ i , j 2 ( f ) = O ( h 3 ) , i = μ 1 , μ , μ + 1 , μ + 2 , j = ν 1 , ν , ν + 1 , ν + 2 λ i , j 2 ( f ) λ ˜ i , j 2 ( f ) = O ( h 4 ) , otherwise .
The reasoning, as laid out in the proof of Theorem 1, is as follows: within the square ( s μ , s μ + 1 ) × ( t ν , t ν + 1 ) , 16 spanning functions B i , j are involved, with i = μ 1 , μ , μ + 1 , μ + 2 and j = ν 1 , ν , ν + 1 , ν + 2 . When constructing Q ˜ 2 f in [ x μ + 1 , x μ + 2 ] × [ y ν + 1 , y ν + 2 ] (and similarly in Ω μ + 1 , ν + 1 + ), we are able to use the information only on one side of the discontinuity, obtaining an approximation O ( h 3 ) as a consequence of (12). The same logical scheme can be used to prove the results in Ω μ 1 , ν 1 . □
Remark 2.
If the discontinuity is across the square ( s μ , s μ + 1 ) × ( t ν , t ν + 1 ) , the region affected by the discontinuity in Q 2 f is [ x μ 3 , x μ + 3 ] × [ y ν 3 , y ν + 3 ] . It follows from the definition of λ i , j 2 ( f ) , as seen in Figure 2b, and because the support of B i , j is in the square [ x i 2 , x i + 1 ] × [ y j 2 , y j + 1 ] . Elsewhere in the domain, the approximation retains an order of 3.

4.3. The Nonlinear Quasi-Interpolant Q ˜ 3

Now we construct the nonlinear quasi-interpolant Q ˜ 3 . In this case, we have (see Figure 2c).
λ i , j 3 ( f ) = 99 256 f ¯ i , j + f ¯ i 1 , j + f ¯ i , j 1 + f ¯ i 1 , j 1 + 3 256 f ¯ i 2 , j 2 + f ¯ i 2 , j + 1 + f ¯ i + 1 , j 2 + f ¯ i + 1 , j + 1 19 256 f ¯ i 2 , j 1 + f ¯ i 2 , j + f ¯ i 1 , j 2 + f ¯ i 1 , j + 1 + f ¯ i , j 2 + f ¯ i , j + 1 + f ¯ i + 1 , j 1 + f ¯ i + 1 , j = 1 4 60 64 f ¯ i 1 , j 5 64 ( f ¯ i , j + 1 + f ¯ i 2 , j 1 ) 14 64 ( f ¯ i 1 , j + 1 + f ¯ i 2 , j ) + 18 64 ( f ¯ i 1 , j 1 + f ¯ i , j ) + 3 64 ( f ¯ i , j 1 + f ¯ i 2 , j + 1 ) + 1 4 60 64 f ¯ i 1 , j 1 5 64 ( f ¯ i + 1 , j 1 + f ¯ i 1 , j + 1 ) 14 64 ( f ¯ i 1 , j 2 + f ¯ i 2 , j 1 ) + 18 64 ( f ¯ i 1 , j + f ¯ i , j 1 ) + 3 64 ( f ¯ i , j + f ¯ i 2 , j 2 ) + 1 4 60 64 f ¯ i , j 5 64 ( f ¯ i 1 , j + 1 + f ¯ i + 1 , j 1 ) 14 64 ( f ¯ i , j + 1 + f ¯ i + 1 , j ) + 18 64 ( f ¯ i 1 , j + f ¯ i , j 1 ) + 3 64 ( f ¯ i 1 , j 1 + f ¯ i + 1 , j + 1 ) + 1 4 60 64 f ¯ i , j 1 5 64 ( f ¯ i + 1 , j + f ¯ i 1 , j 2 ) 14 64 ( f ¯ i + 1 , j 1 + f ¯ i , j 2 ) + 18 64 ( f ¯ i 1 , j 1 + f ¯ i , j ) + 3 64 ( f ¯ i 1 , j + f ¯ i + 1 , j 2 ) = 1 4 λ i , j 3 l t ( f ) + 1 4 λ i , j 3 l b ( f ) + 1 4 λ i , j 3 r t ( f ) + 1 4 λ i , j 3 r b ( f ) ,
where
λ i , j 3 ( f ) = λ ^ i , j ( f ) + O ( h 4 ) , λ i , j 3 l b ( f ) = λ ^ i , j ( f ) + O ( h 3 ) , λ i , j 3 l t ( f ) = λ ^ i , j ( f ) + O ( h 3 ) λ i , j 3 r b ( f ) = λ ^ i , j ( f ) + O ( h 3 ) , λ i , j 3 r t ( f ) = λ ^ i , j ( f ) + O ( h 3 ) .
Defining γ 1 = γ 2 = γ 3 = γ 4 = 1 4 , we apply the WENO technique with positive weights and, from (4), we obtain
λ ˜ i , j 3 ( f ) = ω i , j 3 l t ( f ) λ i , j 3 l t ( f ) + ω i , j 3 l b ( f ) λ i , j 3 l b ( f ) + ω i , j 3 r t ( f ) λ i , j 3 r t ( f ) + ω i , j 3 r b ( f ) λ i , j 3 r b ( f )
and Q ˜ 3 f : = α A λ ˜ α 3 ( f ) B α .
In this case, as the smooth indicator, we considered the average of the six second-order forward differences involved in the definitions of λ i , j 3 l b ( f ) , λ i , j 3 l t ( f ) , λ i , j 3 r b ( f ) , λ i , j 3 r t ( f ) .
Theorem 3.
The following results hold:
1. 
Q ˜ 3 is exact on the space P 2 ;
2. 
if f is smooth, then f Q ˜ 3 f = O ( h 3 ) ;
3. 
if f has a discontinuity across the square ( x μ 1 , x μ ) × ( y ν 1 , y ν ) , and it is smooth on Ω μ , ν + and Ω μ 1 , ν 1 , then f Q ˜ 3 f Ω μ + 1 , ν + 1 + , = O ( h 3 ) , f Q ˜ 3 f Ω μ 2 , ν 2 , = O ( h 3 ) .
Proof. 
We can prove the theorem analogously to Theorems 1 and 2. However, in this case, thanks to (14), if f has a discontinuity across the square ( x μ 1 , x μ ) × ( y ν 1 , y ν ) , then
λ i , j 3 ( f ) λ ˜ i , j 3 ( f ) = O ( h 3 ) , i = μ 1 , μ , μ + 1 , j = ν 1 , ν , ν + 1 , a n d ( i , j ) ( μ , ν ) λ i , j 3 ( f ) λ ˜ i , j 3 ( f ) = O ( h 4 ) , i μ 1 , μ , μ + 1 , j ν 1 , ν , ν + 1 , λ μ , ν 3 ( f ) λ ˜ μ , ν 3 ( f ) = O ( h 0 ) .
In the square ( x μ 1 , x μ ) × ( y ν 1 , y ν ) , the 9 spanning functions B i , j with i = μ 1 , μ , μ + 1 and j = ν 1 , ν , ν + 1 are involved, i.e., Σ i , j ( x μ 1 , x μ ) × ( y ν 1 , y ν ) ; to construct the spline Q ˜ 3 f within the square [ x μ , x μ + 1 ] × [ y ν , y ν + 1 ] , we use the information from both sides of the discontinuity. However, when constructing Q ˜ 3 f in [ x μ + 1 , x μ + 2 ] × [ y ν + 1 , y ν + 2 ] (and similarly in Ω μ + 1 , ν + 1 + ), we only use the information on one side of the discontinuity, obtaining an approximation O ( h 3 ) as a consequence of (15). The same logical scheme can be used to prove the results in Ω μ 2 , ν 2 . □
Remark 3.
If the discontinuity is across the square ( x μ 1 , x μ ) × ( y ν 1 , y ν ) , the region affected by the discontinuity in Q 3 f is [ x μ 3 , x μ + 2 ] × [ y ν 3 , y ν + 2 ] . It follows from the definitions of λ i , j 3 ( f ) , as seen in Figure 2c, and because the support of B i , j is in the square [ x i 2 , x i + 1 ] × [ y j 2 , y j + 1 ] . Elsewhere in the domain, the approximation retains an order of 3.

4.4. The Nonlinear Quasi-Interpolant Q ˜ 4

Now we construct the nonlinear quasi-interpolant Q ˜ 4 . In this case, we have (see Figure 2d)
λ i , j 4 ( f ) = 1 96 ( 96 f i , j 16 ( f i + 1 , j f i , j + 1 f i , j 1 f i 1 , j ) + 18 ( f ¯ i , j + f ¯ i , j 1 + f ¯ i 1 , j + f ¯ i 1 , j 1 ) f ¯ i 2 , j f ¯ i 2 , j 1 f ¯ i + 1 , j f ¯ i + 1 , j 1 f ¯ i , j 2 f ¯ i , j + 1 f ¯ i 1 , j 2 f ¯ i 1 , j + 1 ) = 1 4 ( 1 48 ( 48 f i , j 16 f i , j 1 16 f i 1 , j + 36 f ¯ i 1 , j 1 6 f ¯ i , j + 3 f ¯ i , j 1 + 3 f ¯ i 1 , j + f ¯ i 2 , j 3 f ¯ i 2 , j 1 + f ¯ i , j 2 3 f ¯ i 1 , j 2 ) ) + 1 4 ( 1 48 ( 48 f i , j 16 f i , j + 1 16 f i 1 , j + 36 f ¯ i 1 , j + 3 f ¯ i 1 , j 1 + 3 f ¯ i , j 6 f ¯ i , j 1 3 f ¯ i 2 , j + f ¯ i 2 , j 1 + f ¯ i , j + 1 3 f ¯ i 1 , j + 1 ) ) + 1 4 ( 1 48 ( 48 f i , j 16 f i + 1 , j 16 f i , j 1 + 3 f ¯ i , j + 36 f ¯ i , j 1 6 f ¯ i 1 , j + 3 f ¯ i 1 , j 1 + f ¯ i + 1 , j 3 f ¯ i + 1 , j 1 3 f ¯ i , j 2 + f ¯ i 1 , j 2 ) ) + 1 4 ( 1 48 ( 48 f i , j 16 f i + 1 , j 16 f i , j + 1 + 3 f ¯ i 1 , j 6 f ¯ i 1 , j 1 + 36 f ¯ i , j + 3 f ¯ i , j 1 3 f ¯ i + 1 , j + f ¯ i + 1 , j 1 3 f ¯ i , j + 1 + f ¯ i 1 , j + 1 ) ) = 1 4 λ i , j 4 l b ( f ) + 1 4 λ i , j 4 l t ( f ) + 1 4 λ i , j 4 r b ( f ) + 1 4 λ i , j 4 r t ( f ) .
where
λ i , j 4 ( f ) = λ ^ i , j ( f ) + O ( h 4 ) , λ i , j 4 l b ( f ) = λ ^ i , j ( f ) + O ( h 3 ) , λ i , j 4 l t ( f ) = λ ^ i , j ( f ) + O ( h 3 ) λ i , j 4 r b ( f ) = λ ^ i , j ( f ) + O ( h 3 ) , λ i , j 4 r t ( f ) = λ ^ i , j ( f ) + O ( h 3 ) .
Defining γ 1 = γ 2 = γ 3 = γ 4 = 1 4 , we apply the WENO technique, obtaining
λ ˜ α 4 ( f ) = ω i , j 4 l t ( f ) λ i , j 4 l t ( f ) + ω i , j 4 l b ( f ) λ i , j 4 l b ( f ) + ω i , j 4 r t ( f ) λ i , j 4 r t ( f ) + ω i , j 4 r b ( f ) λ i , j 4 r b ( f )
and Q ˜ 4 f : = α A λ ˜ α 4 ( f ) B α .
In this case, as the smooth indicator, we considered the average of the four second-order forward differences constructed from the A i , j points involved in the definitions of λ i , j 4 l b ( f ) , λ i , j 4 l t ( f ) , λ i , j 4 r b ( f ) , λ i , j 4 r t ( f ) .
Theorem 4.
The following results hold:
1. 
Q ˜ 4 is exact on the space P 2 ;
2. 
if f is smooth, then f Q ˜ 4 f = O ( h 3 ) ;
3. 
if f has a discontinuity across the square ( x μ 1 , x μ ) × ( y ν 1 , y ν ) , and it is smooth on Ω μ , ν + and Ω μ 1 , ν 1 , then f Q ˜ 4 f Ω μ + 1 , ν + 1 + , = O ( h 3 ) , f Q ˜ 4 f Ω μ 2 , ν 2 , = O ( h 3 ) .
Proof. 
We can prove the theorem analogously to the previous cases. Thanks to (17), if f has a discontinuity across the square ( x μ 1 , x μ ) × ( y ν 1 , y ν ) , then
λ i , j 4 ( f ) λ ˜ i , j 4 ( f ) = O ( h 3 ) , i = μ 1 , μ , μ + 1 , j = ν 1 , ν , ν + 1 , a n d ( i , j ) ( μ , ν ) λ i , j 4 ( f ) λ ˜ i , j 4 ( f ) = O ( h 4 ) , i μ 1 , μ , μ + 1 , j ν 1 , ν , ν + 1 , λ μ , ν 4 ( f ) λ ˜ μ , ν 4 ( f ) = O ( h 0 ) .
In the square ( x μ 1 , x μ ) × ( y ν 1 , y ν ) , the 9 spanning functions B i , j , with i = μ 1 , μ , μ + 1 and j = ν 1 , ν , ν + 1 are involved, i.e., Σ i , j ( x μ 1 , x μ ) × ( y ν 1 , y ν ) ; to construct the spline Q ˜ 4 f within the square [ x μ , x μ + 1 ] × [ y ν , y ν + 1 ] , we use the information on both sides of the discontinuity. However, when constructing Q ˜ 4 f in [ x μ + 1 , x μ + 2 ] × [ y ν + 1 , y ν + 2 ] (and similarly in Ω μ + 1 , ν + 1 + ), we only use the information on one side of the discontinuity, obtaining an approximation O ( h 3 ) as a consequence of (18). The same logical scheme can be used to prove the results in Ω μ 2 , ν 2 . □
Remark 4.
If the discontinuity is across the square ( x μ 1 , x μ ) × ( y ν 1 , y ν ) , the region affected by the discontinuity in Q 4 f is [ x μ 3 , x μ + 2 ] × [ y ν 3 , y ν + 2 ] . Elsewhere in the domain, the approximation retains an order of 3. It follows from the same arguments of Remark 3.

5. Numerical Results

In this section, we propose numerical tests confirming the theoretical results of Section 4. For each test function, we compute the maximum absolute errors
E k f : = max ( u , v ) G | f ( u , v ) Q k f ( u , v ) | , E ˜ k f : = max ( u , v ) G | f ( u , v ) Q ˜ k f ( u , v ) | ,
k = 1 , 2 , 3 , 4 , for increasing values of m and n, using a 1500 × 1500 uniform rectangular grid G of evaluation points in the domain. We also compute the corresponding numerical convergence orders ( N C O k , N C O ˜ k , k = 1 , 2 , 3 , 4 ), obtained by applying the base 2 logarithm to the ratio between the two consecutive errors.
Moreover, in order to only test the nonlinear modification of the quasi-interpolants, we compute the errors in a subdomain where the boundary functionals are not involved.
Finally, we provide some graphical results to confirm the reduction of the Gibbs phenomenon using the WENO technique.
Regarding the choice of the boundary functionals:
  • In Tests 1 and 2, we consider ad hoc boundary functionals, ensuring the reproduction of P 2 . The boundary functionals are the same for Q k and Q ˜ k , for k = 1 , 2, 3, and 4, respectively;
  • In Tests 3 and 4, we consider ad hoc boundary functionals, ensuring the reproduction of P 2 for Q k , k = 1 , 2, 3, and 4. For the operators Q ˜ k , k = 1 , 2, 3, and 4, in order to eliminate the Gibbs phenomenon near the boundary of the domain, the boundary functionals are chosen so that the evaluation points used for their definition are located only in one sub-square of the box spline support, but ensuring an error O ( h 2 ) similar to the well-known Schoenberg operator [29,30].
We tested the reproduction properties of all quasi-interpolants; we can state that all the quasi-interpolants are exact on P 2 , except Q ˜ 1 , which is exact on bilinear polynomials, according to statement 1 in Theorems 1–4.

5.1. Test 1: Smooth Functions

We consider the following smooth function (see Figure 3a)
f ( x , y ) = exp ( 1 + x 2 + y 2 ) , ( x , y ) [ 0 , 1 ] × [ 0 , 1 ]
and we compute the maximum absolute error in [ 0 , 1 ] × [ 0 , 1 ] (see Table 1) and in 3 8 , 5 8 × 3 8 , 5 8 (see Table 2), where the boundary functionals have no influence.
We noticed that approximation order 3 was achieved by all operators, as expected from statement 2, in Theorems 1, 2, 3, and 4, respectively.

5.2. Test 2: Piecewise Smooth Function

We consider the following piecewise smooth function (see Figure 3b)
( x , y ) = exp ( x + y ) if y < 0.5 exp ( x 2 + y 2 ) + 10 elsewhere , ( x , y ) [ 0 , 1 ] × [ 0 , 1 ]
and we compare the four quasi-interpolants: Q ˜ 1 , Q ˜ 2 , Q ˜ 3 , and Q ˜ 4 , according to statement 3 in Theorems 1, 2, 3, and 4, respectively. In Table 3, we report the maximum absolute error in 3 16 , 13 16 , × ( n 2 + 1 ) h , 13 16 . We also considered the linear operators Q k , k = 1 , , 4 , for which we expect an error O ( h 0 ) .
We noticed that the expected behaviour of statement 3 in Theorems 1–4, was achieved.

5.3. Test 3: Graphical Examples

We consider the step function (see Figure 4a)
g ( x , y ) = 0 if y < 1 2 1 elsewhere , ( x , y ) [ 0 , 1 ] × [ 0 , 1 ]
and the following piecewise smooth function (see Figure 4b)
h ( x , y ) = exp ( x + y ) + 10 if x 2 + y 2 < 0.025 exp ( x 2 + y 2 ) elsewhere , ( x , y ) [ 0 , 1 ] × [ 0 , 1 ]
and we compare all eight quasi-interpolants proposed in the paper from the graphical point of view.
We noticed that when using the nonlinear quasi-interpolants Q ˜ k , where k = 1 , 2, 3, and 4 (see Figure 5 (1(b)–4(b)) and Figure 6 (1(b)–4(b))), the Gibbs phenomenon is not present, with respect to the graphs obtained with the standard quasi-interpolants Q k for k = 1 , 2, 3, and 4 (see Figure 5(1(a)–4(a)) and Figure 6(1(a)–4(a))).

6. Conclusions

In the paper, we proposed a method based on bivariate C 1 quadratic spline QIs on criss-cross triangulations for the approximation of piecewise smooth functions, obtained by modifying the coefficient functionals of the QIs by means of WENO techniques. The modified approximants are able to avoid oscillations near discontinuity and maintain high-order accuracy in smooth regions, without knowing where the discontinuity is. We also studied their convergence properties and provided several numerical and graphical tests that confirmed the theoretical results.

Author Contributions

Conceptualization, F.A. and S.R.; methodology, F.A. and S.R.; software, S.R.; validation, F.A. and S.R.; formal analysis, F.A. and S.R.; investigation, F.A. and S.R.; resources, F.A. and S.R.; data curation, F.A. and S.R.; writing—original draft preparation, F.A. and S.R.; writing—review and editing, F.A. and S.R.; visualization, F.A. and S.R.; supervision, F.A.; project administration, F.A. and S.R.; funding acquisition, F.A. All authors have read and agreed to the published version of the manuscript.

Funding

The research of the first author was supported by the Spanish MINECO project PID2020-117211GB-I00 and the GVA project CIAICO/2021/227.

Data Availability Statement

The data presented in this study are available on request to the authors.

Acknowledgments

The second author is a member of the INdAM Research group, GNCS, of Italy.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Buhmann, M.; Jäger, J. Quasi-Interpolation; Cambridge University Press: Cambridge, UK, 2022. [Google Scholar]
  2. Ariza-López, F.J.; Barrera, D.; Eddargani, S.; Ibañez, M.J.; Reinoso, J.F. Spline quasi-interpolation in the Bernstein basis and its application to digital elevation models. Math. Methods Appl. Sci. 2023, 46, 1687–1698. [Google Scholar] [CrossRef]
  3. Gao, W.; Wang, J.; Zhang, R. Quasi-interpolation for multivariate density estimation on bounded domain. Math. Comput. Simul. 2023, 203, 592–608. [Google Scholar] [CrossRef]
  4. Rahimi, M.; Adibi, H.H.; Amirfakhrian, M. Numerical study of nonlinear generalized Burgers-Huxley equation by multiquadric quasi-interpolation and pseudospectral method. Math. Sci. 2023, 17, 431–444. [Google Scholar] [CrossRef]
  5. Sun, Z.; Gao, W.; Yang, R. A Convergent Iterated Quasi-interpolation for Periodic Domain and Its Applications to Surface PDEs. J. Sci. Comput. 2022, 93, 37. [Google Scholar] [CrossRef]
  6. Aràndiga, F.; Donat, R.; López-Ureña, S. Nonlinear improvements of quasi-interpolant splines to approximate piecewise smooth functions. Appl. Math. Comp. 2023, 448, 127946. [Google Scholar] [CrossRef]
  7. Amat, S.; Levin, D.; Ruiz-Álvarez, J.; Trillo, J.C.; Yáñez, D.F. A class of C2 quasi-interpolating splines free of Gibbs phenomenon. Num. Algor. 2022, 91, 51–79. [Google Scholar] [CrossRef]
  8. de Boor, C.; Höllig, K.; Riemenschneider, S. Box Splines; Springer: New York, NY, USA, 1993. [Google Scholar]
  9. Wang, R.H. Multivariate Spline Functions and Their Application; Science Press: Beijing, China; New York, NY, USA; Kluwer Academic Publishers: Dordrecht, Germany; Boston, MA, USA; London, UK, 2001. [Google Scholar]
  10. Barrera, D.; Ibañez, M.J.; Sablonnière, P.; Sbibih, D. On near-best discrete quasi-interpolation on a four-directional mesh. J. Comput. Appl. Math. 2010, 233, 1470–1477. [Google Scholar] [CrossRef]
  11. Chui, C.K.; Wang, R.H. On a bivariate B-splines basis. Sci. Sin. (Ser. A) 1984, XXVI, 1129–1142. [Google Scholar]
  12. Dagnino, C.; Lamberti, P. On the approximation power of bivariate quadratic C1 splines. J. Comput. Appl. Math. 2001, 131, 321–332. [Google Scholar] [CrossRef]
  13. Dagnino, C.; Lamberti, P. On the construction of local quadratic spline quasi-interpolants on bounded rectangular domains. J. Comput. Appl. Math. 2008, 221, 367–375. [Google Scholar] [CrossRef]
  14. Dagnino, C.; Remogna, S.; Sablonnière, P. Error bounds on the approximation of functions and partial derivatives by quadratic spline quasi-interpolants on non-uniform criss-cross triangulations of a rectangular domain. BIT Numer. Math. 2013, 53, 87–109. [Google Scholar] [CrossRef]
  15. Sablonnière, P. Bernstein-Bézier methods for the construction of bivariate spline approximants. Comput. Aided Geom. Des. 1985, 2, 29–36. [Google Scholar] [CrossRef]
  16. Sablonnière, P. On some multivariate quadratic spline quasi-interpolants on bounded domains. In Proceedings of the Modern Developments in Multivariate Approximation: 5th International Conference, Witten-Bommerholz, Germany, 22–27 September 2002; Birkhäuser: Basel, Switzerland, 2003; pp. 263–278. [Google Scholar]
  17. Wang, R.H.; Li, C.J. A kind of multivariate NURBS surfaces. J. Comp. Math. 2004, 22, 137–144. [Google Scholar]
  18. Conchin-Gubernati, A.; Lamberti, P. Multilevel quadratic spline integration. J. Comput. Appl. Math. 2022, 407, 114057. [Google Scholar] [CrossRef]
  19. Lamberti, P.; Saponaro, A. Multilevel quadratic spline quasi-interpolation. Appl. Math. Comp. 2020, 373, 125047. [Google Scholar] [CrossRef]
  20. Qian, J.; Shi, X.; Wu, J.; Gong, D. Construction of cubature formulas via bivariate quadratic spline spaces over non-uniform type-2 triangulation. J. Comput. Appl. Math. 2022, 40, 206–231. [Google Scholar] [CrossRef]
  21. Dagnino, C.; Lamberti, P.; Remogna, S. B-spline bases for unequally smooth quadratic spline spaces on non-uniform criss-cross triangulations. Num. Algor. 2012, 61, 209–222. [Google Scholar] [CrossRef]
  22. Chui, C.K. Multivariate Splines; CBMS-NSF Regional Conference Series in Applied Mathematics; SIAM: Philadelphia, PA, USA, 1988; Volume 54. [Google Scholar]
  23. Sablonnière, P. Bases de Bernstein et Approximants Splines. Ph.D. Thesis, Université de Lille, Lille, France, 1982. [Google Scholar]
  24. Remogna, S. Constructing Good Coefficient Functionals for Bivariate C1 Quadratic Spline Quasi-Interpolants. In Proceedings of the Mathematical Methods for Curves and Surfaces: 7th International Conference, MMCS 2008, Tønsberg, Norway, 26 June–1 July 2008; Revised Selected Papers 7; Springer: Berlin/Heidelberg, Germany, 2010; pp. 329–346. [Google Scholar]
  25. Aràndiga, F.; Baeza, A.; Belda, A.M.; Mulet, P. Analysis of WENO schemes for full and global accuracy. SIAM J. Numer. Anal. 2011, 49, 893–915. [Google Scholar] [CrossRef]
  26. Aràndiga, F.; Belda, A.M.; Mulet, P. Point-value WENO multiresolution applications to stable image compression. J. Sci. Comp. 2010, 43, 158–182. [Google Scholar] [CrossRef]
  27. Jiang, G.S.; Shu, C.W. Efficient implementation of weighted ENO schemes. J. Comput. Phys. 1996, 126, 202–228. [Google Scholar] [CrossRef]
  28. Shi, J.; Hu, C.; Shu, C.W. A technique of treating negative weights in WENO schemes. J. Comput. Phys. 2002, 175, 108–127. [Google Scholar] [CrossRef]
  29. Schoenberg, I.J. Contributions to the problem of approximation of equidistant data by analytic functions. Part A. On the problem of smoothing or graduation. A first class of analytic approximation formulae. Quart. Appl. Math. 1946, 4, 45–99. [Google Scholar] [CrossRef]
  30. Schoenberg, I.J. Contributions to the problem of approximation of equidistant data by analytic functions. Part B. On the problem of osculatory interpolation, a second class of analytic approximation formulae. Quart. Appl. Math. 1946, 4, 112–141. [Google Scholar] [CrossRef]
Figure 1. Uniform criss-cross triangulation and data points.
Figure 1. Uniform criss-cross triangulation and data points.
Axioms 12 01002 g001
Figure 2. Coefficient functionals λ i , j ( f ) for different point QIs: (a) λ i , j 1 ( f ) in (7); (b) λ i , j 2 ( f ) in (10); (c) λ i , j 3 ( f ) in (13) and (d) λ i , j 4 ( f ) in (16).
Figure 2. Coefficient functionals λ i , j ( f ) for different point QIs: (a) λ i , j 1 ( f ) in (7); (b) λ i , j 2 ( f ) in (10); (c) λ i , j 3 ( f ) in (13) and (d) λ i , j 4 ( f ) in (16).
Axioms 12 01002 g002
Figure 3. The graphs of (a) f ( x , y ) and (b) ( x , y ) .
Figure 3. The graphs of (a) f ( x , y ) and (b) ( x , y ) .
Axioms 12 01002 g003
Figure 4. The graphs of (a) g ( x , y ) and (b) h ( x , y ) .
Figure 4. The graphs of (a) g ( x , y ) and (b) h ( x , y ) .
Axioms 12 01002 g004
Figure 5. The graphs of 1(a) Q 1 g ( x , y ) , 1(b) Q ˜ 1 g ( x , y ) , 2(a) Q 2 g ( x , y ) , 2(b) Q ˜ 2 g ( x , y ) , 3(a) Q 3 g ( x , y ) , 3(b) Q ˜ 3 g ( x , y ) and 4(a) Q 4 g ( x , y ) , 4(b) Q ˜ 4 g ( x , y ) , with m = n = 8 .
Figure 5. The graphs of 1(a) Q 1 g ( x , y ) , 1(b) Q ˜ 1 g ( x , y ) , 2(a) Q 2 g ( x , y ) , 2(b) Q ˜ 2 g ( x , y ) , 3(a) Q 3 g ( x , y ) , 3(b) Q ˜ 3 g ( x , y ) and 4(a) Q 4 g ( x , y ) , 4(b) Q ˜ 4 g ( x , y ) , with m = n = 8 .
Axioms 12 01002 g005aAxioms 12 01002 g005b
Figure 6. The graphs of 1(a) Q 1 h ( x , y ) , 1(b) Q ˜ 1 h ( x , y ) , 2(a) Q 2 h ( x , y ) , 2(b) Q ˜ 2 h ( x , y ) , 3(a) Q 3 h ( x , y ) , 3(b) Q ˜ 3 h ( x , y ) and 4(a) Q 4 h ( x , y ) , 4(b) Q ˜ 4 h ( x , y ) , with m = n = 128 .
Figure 6. The graphs of 1(a) Q 1 h ( x , y ) , 1(b) Q ˜ 1 h ( x , y ) , 2(a) Q 2 h ( x , y ) , 2(b) Q ˜ 2 h ( x , y ) , 3(a) Q 3 h ( x , y ) , 3(b) Q ˜ 3 h ( x , y ) and 4(a) Q 4 h ( x , y ) , 4(b) Q ˜ 4 h ( x , y ) , with m = n = 128 .
Axioms 12 01002 g006aAxioms 12 01002 g006b
Table 1. Test 1—maximum absolute errors and numerical convergence order in [ 0 , 1 ] × [ 0 , 1 ] .
Table 1. Test 1—maximum absolute errors and numerical convergence order in [ 0 , 1 ] × [ 0 , 1 ] .
n E 1 f N C O 1 E 2 f N C O 2 E 3 f N C O 3 E 4 f N C O 4
8 9.65 ( 02 ) 9.65 ( 02 ) 1.41 ( 01 ) 9.65 ( 02 )
16 1.65 ( 02 ) 2.6 1.65 ( 02 ) 2.6 2.65 ( 02 ) 2.4 1.65 ( 02 ) 2.6
32 2.44 ( 03 ) 2.8 2.44 ( 03 ) 2.8 4.25 ( 03 ) 2.6 2.44 ( 03 ) 2.8
64 3.34 ( 04 ) 2.9 3.34 ( 04 ) 2.9 6.09 ( 04 ) 2.8 3.36 ( 04 ) 2.9
128 4.35 ( 05 ) 2.9 4.35 ( 05 ) 2.9 8.16 ( 05 ) 2.9 4.35 ( 05 ) 2.9
256 5.55 ( 06 ) 3.0 5.55 ( 06 ) 3.0 1.06 ( 05 ) 2.9 5.55 ( 06 ) 3.0
512 6.80 ( 07 ) 3.0 6.80 ( 07 ) 3.0 1.33 ( 06 ) 3.0 6.80 ( 07 ) 3.0
1024 8.55 ( 08 ) 3.0 8.55 ( 08 ) 3.0 1.68 ( 07 ) 3.0 8.55 ( 08 ) 3.0
n E ˜ 1 f N C O ˜ 1 E ˜ 2 f N C O ˜ 2 E ˜ 3 f N C O ˜ 3 E ˜ 4 f N C O ˜ 4
8 9.65 ( 02 ) 9.65 ( 02 ) 1.41 ( 01 ) 9.65 ( 02 )
16 1.65 ( 02 ) 2.6 1.65 ( 02 ) 2.6 2.65 ( 02 ) 2.4 1.65 ( 02 ) 2.6
32 2.44 ( 03 ) 2.8 2.44 ( 03 ) 2.8 4.25 ( 03 ) 2.6 2.44 ( 03 ) 2.8
64 3.34 ( 04 ) 2.9 3.34 ( 04 ) 2.9 6.09 ( 04 ) 2.8 3.36 ( 04 ) 2.9
128 6.74 ( 05 ) 2.3 4.35 ( 05 ) 2.9 8.16 ( 05 ) 2.9 4.35 ( 05 ) 2.9
256 8.49 ( 06 ) 3.0 5.55 ( 06 ) 3.0 1.06 ( 05 ) 2.9 5.55 ( 06 ) 3.0
512 6.80 ( 07 ) 3.6 6.80 ( 07 ) 3.0 1.33 ( 06 ) 3.0 6.80 ( 07 ) 3.0
1024 8.55 ( 08 ) 3.0 8.55 ( 08 ) 3.0 1.68 ( 07 ) 3.0 8.55 ( 08 ) 3.0
Table 2. Test 1—maximum absolute errors and numerical convergence order in 3 8 , 5 8 × 3 8 , 5 8 .
Table 2. Test 1—maximum absolute errors and numerical convergence order in 3 8 , 5 8 × 3 8 , 5 8 .
n E 1 f N C O 1 E 2 f N C O 2 E 3 f N C O 3 E 4 f N C O 4
8 2.60 ( 03 ) 1.71 ( 03 ) 6.56 ( 03 ) 3.66 ( 03 )
16 2.34 ( 04 ) 3.5 1.84 ( 04 ) 3.2 4.38 ( 04 ) 3.9 2.83 ( 04 ) 3.7
32 2.50 ( 05 ) 3.2 2.15 ( 05 ) 3.1 3.79 ( 05 ) 3.5 2.84 ( 05 ) 3.3
64 2.78 ( 06 ) 3.2 2.55 ( 06 ) 3.1 3.64 ( 06 ) 3.4 3.01 ( 06 ) 3.2
128 3.24 ( 07 ) 3.1 3.09 ( 07 ) 3.0 3.80 ( 07 ) 3.3 3.39 ( 07 ) 3.2
256 3.89 ( 08 ) 3.1 3.80 ( 08 ) 3.0 4.25 ( 08 ) 3.2 3.99 ( 08 ) 3.1
512 4.76 ( 09 ) 3.0 4.70 ( 09 ) 3.0 4.98 ( 09 ) 3.1 4.82 ( 09 ) 3.0
1024 5.86 ( 10 ) 3.0 5.82 ( 10 ) 3.0 6.00 ( 10 ) 3.1 5.90 ( 10 ) 3.0
n E ˜ 1 f N C O ˜ 1 E ˜ 2 f N C O ˜ 2 E ˜ 3 f N C O ˜ 3 E ˜ 4 f N C O ˜ 4
8 2.76 ( 02 ) 7.04 ( 03 ) 7.43 ( 03 ) 2.22 ( 03 )
16 2.14 ( 03 ) 3.7 4.93 ( 04 ) 3.8 5.71 ( 04 ) 3.7 2.18 ( 04 ) 3.9
32 1.51 ( 04 ) 3.8 4.18 ( 05 ) 3.6 4.62 ( 05 ) 3.6 2.33 ( 05 ) 3.5
64 1.08 ( 05 ) 3.8 3.92 ( 06 ) 3.4 4.10 ( 06 ) 3.5 2.65 ( 06 ) 3.3
128 8.28 ( 07 ) 3.7 3.93 ( 07 ) 3.3 3.96 ( 07 ) 3.4 3.12 ( 07 ) 3.2
256 7.02 ( 08 ) 3.6 4.08 ( 08 ) 3.3 3.77 ( 08 ) 3.4 3.77 ( 08 ) 3.2
512 6.66 ( 09 ) 3.4 4.72 ( 09 ) 3.1 4.93 ( 09 ) 3.0 4.80 ( 09 ) 3.0
1024 7.00 ( 10 ) 3.3 5.82 ( 10 ) 3.0 6.00 ( 10 ) 3.0 5.90 ( 10 ) 3.0
Table 3. Test 2—maximum absolute errors and numerical convergence order in 3 16 , 13 16 , × ( n 2 + 1 ) h , 13 16 .
Table 3. Test 2—maximum absolute errors and numerical convergence order in 3 16 , 13 16 , × ( n 2 + 1 ) h , 13 16 .
n E 1 N C O 1 E 2 N C O 2 E 3 N C O 3 E 4 N C O 4
16 5.85 ( 01 ) 6.82 ( 01 ) 5.87 ( 01 ) 8.78 ( 01 )
32 5.84 ( 01 ) - 6.82 ( 01 ) - 5.85 ( 01 ) - 8.77 ( 01 ) -
64 5.84 ( 01 ) - 6.81 ( 01 ) - 5.84 ( 01 ) - 8.76 ( 01 ) -
128 5.84 ( 01 ) - 6.81 ( 01 ) - 5.84 ( 01 ) - 8.76 ( 01 ) -
256 5.84 ( 01 ) - 6.81 ( 01 ) - 5.84 ( 01 ) - 8.76 ( 01 ) -
512 5.84 ( 01 ) - 5.81 ( 01 ) - 5.84 ( 01 ) - 8.76 ( 01 ) -
1024 5.84 ( 01 ) - 5.81 ( 01 ) - 5.84 ( 01 ) - 8.76 ( 01 ) -
n E ˜ 1 N C O ˜ 1 E ˜ 2 N C O ˜ 2 E ˜ 3 N C O ˜ 3 E ˜ 4 N C O ˜ 4
16 2.80 ( 03 ) 5.13 ( 04 ) 6.54 ( 04 ) 2.26 ( 04 )
32 5.27 ( 04 ) 2.4 5.15 ( 05 ) 3.3 5.08 ( 05 ) 3.7 2.29 ( 05 ) 3.3
64 1.20 ( 04 ) 2.1 5.61 ( 06 ) 3.2 4.49 ( 06 ) 3.5 2.30 ( 06 ) 2.9
128 2.90 ( 05 ) 2.0 6.45 ( 07 ) 3.1 6.25 ( 07 ) 2.8 3.90 ( 07 ) 2.9
256 7.16 ( 06 ) 2.0 7.60 ( 08 ) 3.1 8.28 ( 08 ) 2.9 4.97 ( 08 ) 3.0
512 1.78 ( 06 ) 2.0 9.35 ( 09 ) 3.0 1.03 ( 08 ) 3.0 6.16 ( 09 ) 3.0
1024 4.45 ( 07 ) 2.0 1.15 ( 09 ) 3.0 1.26 ( 09 ) 3.0 7.49 ( 10 ) 3.0
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Share and Cite

MDPI and ACS Style

Aràndiga, F.; Remogna, S. Nonlinear 2D C1 Quadratic Spline Quasi-Interpolants on Triangulations for the Approximation of Piecewise Smooth Functions. Axioms 2023, 12, 1002. https://doi.org/10.3390/axioms12101002

AMA Style

Aràndiga F, Remogna S. Nonlinear 2D C1 Quadratic Spline Quasi-Interpolants on Triangulations for the Approximation of Piecewise Smooth Functions. Axioms. 2023; 12(10):1002. https://doi.org/10.3390/axioms12101002

Chicago/Turabian Style

Aràndiga, Francesc, and Sara Remogna. 2023. "Nonlinear 2D C1 Quadratic Spline Quasi-Interpolants on Triangulations for the Approximation of Piecewise Smooth Functions" Axioms 12, no. 10: 1002. https://doi.org/10.3390/axioms12101002

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop