Grid approximation of a parabolic convection-diffusion equation on a priori adapted grids: ε-uniformly convergent schemes

The boundary value problem for a singularly perturbed parabolic convection-diffusion equation is considered. A finite difference scheme on a priori (sequentially) adapted grids is constructed and its convergence is examined. The construction of the scheme on a priori adapted grids is based on a majorant of the singular component of the grid solution that makes it possible to a priori find a subdomain in which the grid solution should be further refined given the perturbation parameter ε, the size of the uniform mesh in x, the desired accuracy of the grid solution, and the prescribed number of iterations K used to refine the solution. In the subdomains where the solution is refined, the grid problems are solved on uniform grids. The error of the solution thus constructed weakly depends on ε. The scheme converges almost ε-uniformly; namely, it converges under the condition N ^?1 = o(ε^v), where v = v(K) can be chosen arbitrarily small when K is sufficiently large. If a piecewise uniform grid is used instead of a uniform one at the final Kth iteration, the difference scheme converges ε-uniformly. For this piecewise uniform grid, the ratio of the mesh sizes in x on the parts of the mesh with a constant size (outside the boundary layer and inside it) is considerably less than that for the known ε-uniformly convergent schemes on piecewise uniform grids.     

Computer difference scheme for a singularly perturbed elliptic convection–diffusion equation in the presence of perturbations

A grid approximation of a boundary value problem for a singularly perturbed elliptic convection–diffusion equation with a perturbation parameter ε, ε ∈ (0,1], multiplying the highest order derivatives is considered on a rectangle. The stability of a standard difference scheme based on monotone approximations of the problem on a uniform grid is analyzed, and the behavior of discrete solutions in the presence of perturbations is examined. With an increase in the number of grid nodes, this scheme does not converge -uniformly in the maximum norm, but only conditional convergence takes place. When the solution of the difference scheme converges, which occurs if N ₁ ^-1 N ₂ ^-1 ? ε, where N ₁ and N ₂ are the numbers of grid intervals in x and y, respectively, the scheme is not -uniformly well-conditioned or ε-uniformly stable to data perturbations in the grid problem and to computer perturbations. For the standard difference scheme in the presence of data perturbations in the grid problem and/or computer perturbations, conditions imposed on the “parameters” of the difference scheme and of the computer (namely, on ε, N ₁,N ₂, admissible data perturbations in the grid problem, and admissible computer perturbations) are obtained that ensure the convergence of the perturbed solutions as N ₁,N ₂ → ∞, ε ∈ (0,1]. The difference schemes constructed in the presence of the indicated perturbations that converges as N ₁,N ₂ → ∞ for fixed ε, ε ∈ (0,1, is called a computer difference scheme. Schemes converging ε-uniformly and conditionally converging computer schemes are referred to as reliable schemes. Conditions on the data perturbations in the standard difference scheme and on computer perturbations are also obtained under which the convergence rate of the solution to the computer difference scheme has the same order as the solution of the standard difference scheme in the absence of perturbations. Due to this property of its solutions, the computer difference scheme can be effectively used in practical computations.     

A method of asymptotic constructions with improved accuracy for a quasilinear singularly perturbed parabolic convection-diffusion equation

The Dirichlet problem on an interval for quasilinear singularly perturbed parabolic convection-diffusion equation is considered. The higher order derivative of the equation is multiplied by a parameter ε that takes any values from the half-open interval (0, 1]. For this type of linear problems, the order of the ε-uniform convergence (with respect to x and t) for the well-known schemes is not higher than unity (in the maximum norm). For the boundary value problem under consideration, grid approximations are constructed that converge ε-uniformly at the rate of O(N ^?2ln² N + N ^?2 ₀), where N + 1 and N ₀ + 1 are the numbers of the mesh points with respect to x and t, respectively. On the x axis, piecewise uniform meshes that condense in the boundary layer are used. If the parameter value is small compared to the effective step of the spatial grid, the domain decomposition method is used, which is motivated by “asymptotic constructions.” Monotone approximations of “auxiliary” subproblems describing the main terms of the asymptotic expansion of the solution outside a neighborhood of the boundary layer neighborhood are used. In the neighborhood of the boundary layer (of the width O(ε ln N)) the first derivative with respect to x is approximated by the central difference derivative. These subproblems are successively solved in the subdomains on uniform grids. If the parameter values are not sufficiently small (compared to the effective step of the mesh with respect to x), the classical implicit difference schemes approximating the first derivative with respect to x by the central difference derivative are applied. To improve the accuracy in t, the defect correction technique is used. Notice that the calculation of the solution of the constructed difference scheme (the scheme based on the method of asymptotic constructions) can be considerably simplified for sufficiently small values of the parameter ε.     

Conditioning of finite difference schemes for a singularly perturbed convection-diffusion parabolic equation

In the case of the boundary value problem for a singularly perturbed convection-diffusion parabolic equation, conditioning of an ε-uniformly convergent finite difference scheme on a piecewise uniform grid is examined. Conditioning of a finite difference scheme on a uniform grid is also examined provided that this scheme is convergent. For the condition number of the scheme on a piecewise uniform grid, an ε-uniform bound O(δ ₁ ^?2 lnδ ₁ ^?1 + δ ₀ ^?1 ) is obtained, where δ₁ and δ₀ are the error components due to the approximation of the derivatives with respect to x and t, respectively. Thus, this scheme is ε-uniformly well-conditioned. For the condition number of the scheme on a uniform grid, we have the estimate O(ε^?1δ ₁ ^?2 + δ ₀ ^?1 ); this scheme is not ε-uniformly well-conditioned. In the case of the difference scheme on a uniform grid, there is an additional error due to perturbations of the grid solution; this error grows unboundedly as ε → 0, which reduces the accuracy of the grid solution (the number of correct significant digits in the grid solution is reduced). The condition numbers of the matrices of the schemes under examination are the same; both have an order of O(ε^?1δ ₁ ^?2 + δ ₀ ^?1 ). Neither the matrix of the ε-uniformly convergent scheme nor the matrix of the scheme on a uniform grid is ε-uniformly well-conditioned.     

Improved approximations of the solution and derivatives to a singularly perturbed reaction-diffusion equation based on the solution decomposition method

In the case of the Dirichlet problem for a singularly perturbed ordinary differential reaction-diffusion equation, a new approach is used to the construction of finite difference schemes such that their solutions and their normalized first- and second-order derivatives converge in the maximum norm uniformly with respect to a perturbation parameter ɛ ∈(0, 1]; the normalized derivatives are ɛ-uniformly bounded. The key idea of this approach to the construction of ɛ-uniformly convergent finite difference schemes is the use of uniform grids for solving grid subproblems for the regular and singular components of the grid solution. Based on the asymptotic construction technique, a scheme of the solution decomposition method is constructed such that its solution and its normalized first- and second-order derivatives converge ɛ-uniformly at the rate of O(N ⁻²ln² N), where N + 1 is the number of points in the uniform grids. Using the Richardson technique, an improved scheme of the solution decomposition method is constructed such that its solution and its normalized first and second derivatives converge ɛ-uniformly in the maximum norm at the same rate of O(N ⁻⁴ln⁴ N).     

The use of solutions on embedded grids for the approximation of singularly perturbed parabolic convection-diffusion equations on adapted grids

The Dirichlet problem on a closed interval for a parabolic convection-diffusion equation is considered. The higher order derivative is multiplied by a parameter ? taking arbitrary values in the semi-open interval (0, 1]. For the boundary value problem, a finite difference scheme on a posteriori adapted grids is constructed. The classical approximations of the equation on uniform grids in the main domain are used; in some subdomains, these grids are subjected to refinement to improve the grid solution. The subdomains in which the grid should be refined are determined using the difference of the grid solutions of intermediate problems solved on embedded grids. Special schemes on a posteriori piecewise uniform grids are constructed that make it possible to obtain approximate solutions that converge almost ?-uniformly, i.e., with an error that weakly depends on the parameter ?: |u(x, t) ? z(x, t)| ≤ M[N ₁ ^?1 ln² N ₁ + N ₀ ^?1 lnN ₀ + ?^?1 N ₁ ^?K ln ^K?1 N ₁], (x, t) ε ? _h , where N ₁ + 1 and N ₀ + 1 are the numbers of grid points in x and t, respectively; K is the number of refinement iterations (with respect to x) in the adapted grid; and M = M(K). Outside the σ-neighborhood of the outflow part of the boundary (in a neighborhood of the boundary layer), the scheme converges ?-uniformly at a rate O(N ₁ ^?1 ln² N ₁ + N ₀ ^?1 lnN ₀), where σ ≤ MN ₁ ^{?K + 1} ln ^K?1 N ₁ for K ≥ 2.     

A Finite Difference Scheme on a Priori Adapted Meshes for a Singularly Perturbed Parabolic Convection-Diffusion Equation

A boundary value problem is considered for a singularly perturbed parabolic convection-diffusion equation;we construct a finite difference scheme on a priori (se-quentially) adapted meshes and study its convergence.The scheme on a priori adapted meshes is constructed using a majorant function for the singular component of the discrete solution,which allows us to find a priori a subdomain where the computed solution requires a further improvement.This subdomain is defined by the perturbation parameterε,the step-size of a uniform mesh in x,and also by the required accuracy of the discrete solution and the prescribed number of refinement iterations K for im- proving the solution.To solve the discrete problems aimed at the improvement of the solution,we use uniform meshes on the subdomains.The error of the numerical so- lution depends weakly on the parameterε.The scheme converges almostε-uniformly, precisely,under the condition N~(-1)=o(ε~v),where N denotes the number of nodes in the spatial mesh,and the value v=v(K) can be chosen arbitrarily small for suitable K.     

Improved difference scheme of the solution decomposition method for a singularly perturbed reaction-diffusion equation

A Dirichlet problem is considered for a singularly perturbed ordinary differential reaction-diffusion equation. For this problem, a new approach is developed in order to construct difference schemes that converge uniformly with respect to the perturbation parameter ?, ? ∈ (0, 1]. The approach is based on the decomposition of a discrete solution into regular and singular components, which are solutions of discrete subproblems on uniform grids. Using the asymptotic construction technique, a difference scheme of the solution decomposition method is constructed that converges ?-uniformly in the maximum norm at the rate O (N ^?2 ln² N), where N + 1 is the number of nodes in the grid used; for fixed values of the parameter ?, the scheme converges at the rate O(N ^?2). Using the Richardson technique, an improved scheme of the solution decomposition method is constructed, which converges ?-uniformly in the maximum norm at the rate O(N ^?4 ln⁴ N).     

Strong stability of a scheme on locally uniform meshes for a singularly perturbed ordinary differential convection-diffusion equation

The Dirichlet problem for a singularly perturbed ordinary differential convection-diffusion equation with a small parameter ? (? ?? (0, 1]) multiplying the higher order derivative is considered. For the problem, a difference scheme on locally uniform meshes is constructed that converges in the maximum norm conditionally, i.e., depending on the relation between the parameter ? and the value N defining the number of nodes in the mesh used; in particular, the scheme converges almost ?-uniformly (i.e., its accuracy depends weakly on ?). The stability of the scheme with respect to perturbations in the data and its conditioning are analyzed. The scheme is constructed using classical monotone approximations of the boundary value problem on a priori adapted grids, which are uniform on subdomains where the solution is improved. The boundaries of these subdomains are determined by a majorant of the singular component of the discrete solution. On locally uniform meshes, the difference scheme converges at a rate of O(min[?^?1 N ^?K lnN, 1] + N ^?1lnN), where K is a prescribed number of iterations for refining the discrete solution. The scheme converges almost ?-uniformly at a rate of O(N ^?1lnN) if N ^?1 ?? ?^??, where ?? (the defect of ?-uniform convergence) determines the required number K of iterations (K = K(??) ?? ??^?1) and can be chosen arbitrarily small from the half-open interval (0, 1]. The condition number of the difference scheme satisfies the bound ?? _P = O(?^?1/K ln^1/K ?^?1??^{?(K + 1)/K} ), where ?? is the accuracy of the solution of the scheme in the maximum norm in the absence of perturbations. For sufficiently large K, the scheme is almost ?-uniformly strongly stable.     

Difference scheme for an initial–boundary value problem for a singularly perturbed transport equation

An initial–boundary value problem for a singularly perturbed transport equation with a perturbation parameter ε multiplying the spatial derivative is considered on the set ? = G ∪ S, where ? = D? × [0 ≤ t ≤ T], D? = {0 ≤ x ≤ d}, S = S ^l ∪ S, and S ^l and S₀ are the lateral and lower boundaries. The parameter ε takes arbitrary values from the half-open interval (0,1]. In contrast to the well-known problem for the regular transport equation, for small values of ε, this problem involves a boundary layer of width O(ε) appearing in the neighborhood of S ^l ; in the layer, the solution of the problem varies by a finite value. For this singularly perturbed problem, the solution of a standard difference scheme on a uniform grid does not converge ε-uniformly in the maximum norm. Convergence occurs only if h=dN^-1 ? ε and N₀^-1 ? 1, where N and N₀ are the numbers of grid intervals in x and t, respectively, and h is the mesh size in x. The solution of the considered problem is decomposed into the sum of regular and singular components. With the behavior of the singular component taken into account, a special difference scheme is constructed on a Shishkin mesh, i.e., on a mesh that is piecewise uniform in x and uniform in t. On such a grid, a monotone difference scheme for the initial–boundary value problem for the singularly perturbed transport equation converges ε-uniformly in the maximum norm at an ?(N^?1 + N₀^?1) rate.     

Approximation of singularly perturbed parabolic equations in unbounded domains subject to piecewise smooth boundary conditions in the case of solutions that grow at infinity

The initial-boundary value problem in a domain on a straight line that is unbounded in x is considered for a singularly perturbed reaction-diffusion parabolic equation. The higher order derivative in the equation is multiplied by a parameter ɛ², where ɛ ∈ (0, 1]. The right-hand side of the equation and the initial function grow unboundedly as x → ∞ at a rate of O(x ²). This causes the unbounded growth of the solution at infinity at a rate of O(Ψ(x)), where Ψ(x) = x ² + 1. The initialboundary function is piecewise smooth. When ɛ is small, a boundary and interior layers appear, respectively, in a neighborhood of the lateral part of the boundary and in a neighborhood of the characteristics of the reduced equation passing through the discontinuity points of the initial function. In the problem under examination, the error of the grid solution grows unboundedly in the maximum norm as x → ∞ even for smooth solutions when ɛ is fixed. In this paper, the proximity of solutions of the initial-boundary value problem and its grid approximations is considered in the weighted maximum norm ∥·∥ ^w with the weighting function Ψ⁻¹(x); in this norm, the solution of the initial-boundary value problem is ɛ-uniformly bounded. Using the method of special grids that condense in a neighborhood of the boundary layer or in neighborhoods of the boundary and interior layers, special finite difference schemes are constructed and studied that converge ɛ-uniformly in the weighted norm. It is shown that the convergence rate considerably depends on the type of nonsmoothness in the initial-boundary conditions. Grid approximations of the Cauchy problem with the right-hand side and the initial function growing as O(Ψ(x)) that converge ɛ-uniformly in the weighted norm are also considered.     

A higher order richardson scheme for a singularly perturbed semilinear elliptic convection-diffusion equation

The Dirichlet problem on a vertical strip is examined for a singularly perturbed semilinear elliptic convection-diffusion equation. For this problem, the basic nonlinear difference scheme based on the classical approximations on piecewise uniform grids condensing in the vicinity of boundary layers converges ɛ-uniformly with an order at most almost one. The Richardson technique is used to construct a nonlinear scheme that converges ɛ-uniformly with an improved order, namely, at the rate O(N ₁⁻²ln² N ₁ + N ₂⁻²), where N ₁ + 1 and N ₂ + 1 are the number of grid nodes along the x ₁-axis and per unit interval of the x ₂-axis, respectively. This nonlinear basic scheme underlies the linearized iterative scheme, in which the nonlinear term is calculated using the values of the sought function found at the preceding iteration step. The latter scheme is used to construct a linearized iterative Richardson scheme converging ɛ-uniformly with an improved order. Both the basic and improved iterative schemes converge ɛ-uniformly at the rate of a geometric progression as the number of iteration steps grows. The upper and lower solutions to the iterative Richardson schemes are used as indicators, which makes it possible to determine the iteration step at which the same ɛ-uniform accuracy is attained as that of the non-iterative nonlinear Richardson scheme. It is shown that no Richardson schemes exist for the convection-diffusion boundary value problem converging ɛ-uniformly with an order greater than two. Principles are discussed on which the construction of schemes of order greater than two can be based.     

Uniform grid approximation of nonsmooth solutions with improved convergence for a singularly perturbed convection-diffusion equation with characteristic layers

A mixed boundary value problem for a singularly perturbed elliptic convection-diffusion equation with constant coefficients in a square domain is considered. Dirichlet conditions are specified on two sides orthogonal to the flow, and Neumann conditions are set on the other two sides. The right-hand side and the boundary functions are assumed to be sufficiently smooth, which ensures the required smoothness of the desired solution in the domain, except for neighborhoods of the corner points. Only zero-order compatibility conditions are assumed to hold at the corner points. The problem is solved numerically by applying an inhomogeneous monotone difference scheme on a rectangular piecewise uniform Shishkin mesh. The inhomogeneity of the scheme lies in that the approximating difference equations are not identical at different grid nodes but depend on the perturbation parameter. Under the assumptions made, the numerical solution is proved to converge ?-uniformly to the exact solution in a discrete uniform metric at an O(N ^?3/2ln² N) rate, where N is the number of grid nodes in each coordinate direction.     

Grid approximation of singularly perturbed parabolic equations with piecewise continuous initial-boundary conditions

The Dirichlet problem is considered for a singularly perturbed parabolic reaction-diffusion equation with piecewise continuous initial-boundary conditions in a rectangular domain. The highest derivative in the equation is multiplied by a parameter ? ², ? ε (0, 1]. For small values of the parameter ?, in a neighborhood of the lateral part of the boundary and in a neighborhood of the characteristic of the limit equation passing through the point of discontinuity of the initial function, there arise a boundary layer and an interior layer (of characteristic width ?), respectively, which have bounded smoothness for fixed values of the parameter ?. Using the method of additive splitting of singularities (generated by discontinuities of the boundary function and its low-order derivatives), as well as the method of condensing grids (piecewise uniform grids condensing in a neighborhood of boundary layers), we construct and investigate special difference schemes that converge ?-uniformly with the second order of accuracy in x and the first order of accuracy in t, up to logarithmic factors.     

Necessary conditions for ɛ-uniform convergence of finite difference schemes for parabolic equations with moving boundary layers

A grid approximation of the boundary value problem for a singularly perturbed parabolic reaction-diffusion equation is considered in a domain with the boundaries moving along the axis x in the positive direction. For small values of the parameter ? (this is the coefficient of the higher order derivatives of the equation, ? ∈ (0, 1]), a moving boundary layer appears in a neighborhood of the left lateral boundary S ₁ ^L . In the case of stationary boundary layers, the classical finite difference schemes on piece-wise uniform grids condensing in the layers converge ?-uniformly at a rate of O(N ^?1lnN + N ₀), where N and N ₀ define the number of mesh points in x and t. For the problem examined in this paper, the classical finite difference schemes based on uniform grids converge only under the condition N ^?1 + N ₀ ^?1 ? ?. It turns out that, in the class of difference schemes on rectangular grids that are condensed in a neighborhood of S ₁ ^L with respect to x and t, the convergence under the condition N ^?1 + N ₀ ^?1 ≤ ?^1/2 cannot be achieved. Examination of widths that are similar to Kolmogorov’s widths makes it possible to establish necessary and sufficient conditions for the ?-uniform convergence of approximations of the solution to the boundary value problem. These conditions are used to design a scheme that converges ?-uniformly at a rate of O(N ^?1lnN + N ₀).     

Conditioning and stability of finite difference schemes on uniform meshes for a singularly perturbed parabolic convection-diffusion equation

For a singularly perturbed parabolic convection-diffusion equation, the conditioning and stability of finite difference schemes on uniform meshes are analyzed. It is shown that a convergent standard monotone finite difference scheme on a uniform mesh is not ?-uniformly well conditioned or ?-uniformly stable to perturbations of the data of the grid problem (here, ? is a perturbation parameter, ? ∈ (0, 1]). An alternative finite difference scheme is proposed, namely, a scheme in which the discrete solution is decomposed into regular and singular components that solve grid subproblems considered on uniform meshes. It is shown that this solution decomposition scheme converges ?-uniformly in the maximum norm at an O(N ^?1lnN + N ₀ ^?1 ) rate, where N + 1 and N ₀ + 1 are the numbers of grid nodes in x and t, respectively. This scheme is ?-uniformly well conditioned and ?-uniformly stable to perturbations of the data of the grid problem. The condition number of the solution decomposition scheme is of order O(δ^?2lnδ^?1 + δ ₀ ^?1 ); i.e., up to a logarithmic factor, it is the same as that of a classical scheme on uniform meshes in the case of a regular problem. Here, δ = N ^?1lnN and δ₀ = N ₀ ^?1 are the accuracies of the discrete solution in x and t, respectively.     

Finite difference schemes for the singularly perturbed reaction-diffusion equation in the case of spherical symmetry

The boundary value problem for the singularly perturbed reaction-diffusion parabolic equation in a ball in the case of spherical symmetry is considered. The derivatives with respect to the radial variable appearing in the equation are written in divergent form. The third kind boundary condition, which admits the Dirichlet and Neumann conditions, is specified on the boundary of the domain. The Laplace operator in the differential equation involves a perturbation parameter ?², where ? takes arbitrary values in the half-open interval (0, 1]. When ? → 0, the solution of such a problem has a parabolic boundary layer in a neighborhood of the boundary. Using the integro-interpolational method and the condensing grid technique, conservative finite difference schemes on flux grids are constructed that converge ?-uniformly at a rate of O(N ^?2ln² N + N ₀ ^?1 ), where N + 1 and N ₀ + 1 are the numbers of the mesh points in the radial and time variables, respectively.     

Standard finite difference scheme for a singularly perturbed elliptic convection–diffusion equation on a rectangle under computer perturbations

A singularly perturbed elliptic convection–diffusion equation with a perturbation parameter ε (ε ∈ (0, 1]) is considered on a rectangle. As applied to this equation, a standard finite difference scheme on a uniform grid is studied under computer perturbations. This scheme is not ε-uniformly stable with respect to perturbations. The conditions imposed on a “computing system” are established under which a converging standard scheme (referred to as a computer difference scheme) remains stable.     

On the continuum limit of a discrete inverse spectral problem on optimal finite difference grids

We consider finite difference approximations of solutions of inverse Sturm‐Liouville problems in bounded intervals. Using three‐point finite difference schemes, we discretize the equations on so‐called optimal grids constructed as follows: For a staggered grid with 2 k points, we ask that the finite difference operator (a k × k Jacobi matrix) and the Sturm‐Liouville differential operator share the k lowest eigenvalues and the values of the orthonormal eigenfunctions at one end of the interval. This requirement determines uniquely the entries in the Jacobi matrix, which are grid cell averages of the coefficients in the continuum problem. If these coefficients are known, we can find the grid, which we call optimal because it gives, by design, a finite difference operator with a prescribed spectral measure. We focus attention on the inverse problem, where neither the coefficients nor the grid are known. A key question in inversion is how to parametrize the coefficients, i.e., how to choose the grid. It is clear that, to be successful, this grid must be close to the optimal one, which is unknown. Fortunately, as we show here, the grid dependence on the unknown coefficients is weak, so the inversion can be done on a precomputed grid for an a priori guess of the unknown coefficients. This observation leads to a simple yet efficient inversion algorithm, which gives coefficients that converge pointwise to the true solution as the number k of data points tends to infinity. The cornerstone of our convergence proof is showing that optimal grids provide an implicit, natural regularization of the inverse problem, by giving reconstructions with uniformly bounded total variation. The analysis is based on a novel, explicit perturbation analysis of Lanczos recursions and on a discrete Gel'fand‐Levitan formulation. © 2005 Wiley Periodicals, Inc.     

Conservative finite difference scheme for a singularly perturbed elliptic reaction-diffusion equation: Approximation of solutions and derivatives

A boundary value problem for a singularly perturbed elliptic reaction-diffusion equation in a vertical strip is considered. The derivatives are written in divergent form. The derivatives in the differential equation are multiplied by a perturbation parameter ɛ², where ɛ takes arbitrary values in the interval (0, 1]. As ɛ → 0, a boundary layer appears in the solution of this problem. Using the integrointerpolational method and the condensing grid technique, conservative finite difference schemes on flux grids are constructed that converge ɛ-uniformly at a rate of O(N ₁⁻²ln² N ₁ + N ₂⁻²), where N ₁ + 1 and N ₂ + 1 are the number of mesh points on the x ₁-axis and the minimal number of mesh points on a unit interval of the x ₂-axis respectively. The normalized difference derivatives ɛ ^k (∂ ^k /∂x ₁ ^k )u(x) (k = 1, 2), which are ɛ-uniformly bounded and approximate the normalized derivatives in the direction across the boundary layer, and the derivatives along the boundary layer (∂ ^k /∂ x ₂ ^k )u(x) (k = 1, 2) converge ɛ-uniformly at the same rate.