A fast multiscale solver for modified Hammerstein equations
Introduction
In this paper, we study fast multiscale methods for solving the modified Hammerstein integral equationwhere is a compact domain, f, k and ψ are given functions defined on E, E × E and respectively, and u is the unknown to be determined.
The Eq. (1) is equivalent to the original Hammerstein equation (cf. [35])where z and u satisfyand
Hammerstein equations are a class of typical nonlinear integral equations, which are also integral forms of some nonlinear elliptic boundary value problems and portray a lot of mathematical physics problems. A lot of substantial literatures have developed the existence, uniqueness and regularity of the solutions for (1), (2) and some relative nonlinear integral equations (see, for example, [2], [7], [20], [27], [29], [36]). In the past decade, many numerical methods for solving Hammerstein equation (2) have been developed (cf. [3], [4], [5], [14], [21], [22], [23], [24], [25], [26], [27], [28], [29], [30], [31], [32], [33], [34]). Usually, these methods lead to systems of nonlinear equations which should be solved by some kind of iteration methods. It is therefore a marked disadvantage of the numerical methods for (2) that a lot of integrals should be evaluated at each step of the iteration. If we adopt the Newton iteration method, then we have to recalculate Jacobian matrix for each iteration step and the entries of the Jacobian matrix have to be computed by numerical integration. When the size of matrix becomes large, the calculational cost would be staggering. To overcome the problem, [35] proposed the collocation method for solving the modified Hammerstein integral equation (1), which is equivalent to (2). An advantage of the method is that integrals of a similar nature need to be calculated once only. However, if the dimension of approximate space is large, the Jacobian matrix computation is still costly.
In recent years, the numerical methods for solving integral equations were rapidly developed, especially multiscale methods were presented to achieve a breakthrough (see [1], [6], [8], [9], [10], [11], [12], [13], [14], [15], [16], [17], [18], [37], [38]). One of the valuable methods makes use of the multiscale basis, which was originally constructed by Micchelli and Xu in [37] and later further developed by Chen et al. in [9]. The other one of valuable methods is the multilevel augmentation methods for solving the second kind integral equations developed by Chen et al. [13]. This algorithm makes the program for solving the discrete linear equations runs at several or several dozens times, and for the large scale problem it becomes more efficient. Chen et al. [14] applied the multilevel augmentation methods to Hammerstein equation (2) and proposed a nonlinear multilevel augmentation algorithm with the optimal convergence order. This algorithm is only required to solve nonlinear equations in a smaller fixed size, which makes the computational complexity substantially reduced. However, the algorithm has to calculate a lot of numerical integrals at each iteration step. In order to reduce and avoid overmany numerical integrals, in this paper, we apply the wavelet basis which was originally constructed in [9], [37] and the multilevel augmentation method to the modified Hammerstein equation (1), and extended the corresponding algorithm to the case that the nonlinear function ψ(t, v) has the continuious second derivative (see the condition (H3)). We will show that the algorithm has nearly linear computational complexity while preserving optimal order of convergence.
Throughout this paper, we assume that the functions f, k, ψ in Eq. (1) satisfy the following conditions:
- (H1)
f ∈ C(E).
- (H2)
The kernel function k satisfiesand
- (H3)
The function ψ(s, v) and it’s partial derivatives are continuous on . Furthermore, for any .
This paper is organized in five sections. In Section 2, we present the multilevel augmentation method for the modified Hammerstein equation (1). We prove in Section 3 the existence and convergence of the proposed method and establish the optimal convergence estimates. In Section 4 we give the discrete form of the algorithm based on the collocation method and prove that it has a nearly linear computational complexity. Finally, in Section 5 we present several numerical examples to illustrate our theoretical results.
Section snippets
The multilevel augmentation method
In this section we present the multilevel augmentation method for solving the modified Hammerstein integral equation (1).
Let be the Banach space L2(E) or L∞(E). Assume that is a linear operator defined byand that is a nonlinear operator defined byBy using (5), (6), (1) can be rewritten into the operator form
Let be a sequence of finite-dimensional subspaces of satisfyingwhere
Existence and convergence analysis
In this section we discuss the existence of multilevel augmentation solutions and establish their optimal convergence estimates.
For this purpose, we assume that (1) has an isolated solution u∗ ∈ L∞(E). According to the assumption (H1) and (H2), we can define constant M0 byThis allows us to construct a truncated function satisfying (H3) and having properties that for some ϵ > 0, there exists a positive constant Cϵ such thatand
Discrete scheme and its computational complexity
In this section, we will describe a discrete form of the multilevel augmentation method based on multiscale collocation schemes, and then estimate the computational complexity of the algorithm for solving (8), which shows the advantages of the multilevel augmentation method.
To realize the multilevel augmentation method and analyze its computational complexity, we need a discrete form of Algorithm 2.2. We present it by giving appropriate multiscale basis functions and functionals (cf. [9], [12]
Numerical examples
We present two numerical examples in this section to confirm the theoretical estimates for the convergence order. The numerical algorithms is run on a notebook computer with Intel Core2 T5600 1.83 GHz CPU and 2 GB RAM, and the programs with single thread are compiled by Visual C++ 2005. Example 5.1 Consider the following nonlinear integral equationwhere . And it has an isolated solution u∗(t) = sin2(πt).
Let be the space of piecewise linear
Acknowledgement
Supported in part by the Natural Science Foundation of China under grants 10771224, 11071264, 10601070, 11071286, and the Science and Technology Section of SINOPEC. Supported in part by Guangdong Provincial Government of China through the ”Computational Science Innovative Research Team” program.
References (39)
- et al.
A multilevel method for solving operator equations
J. Math. Anal. Appl.
(2001) - et al.
Secant-like methods for solving nonlinear integral equations of the Hammerstein type
J. Comput. Appl. Math.
(2000) - et al.
Wavelet applications to the Petrov–Galerkin method for Hammerstein equations
Appl. Num. Math.
(2003) - et al.
Superconvergence of the iterated collocation methods for Hammerstein equations
J. Comput. Appl. Math.
(1997) - et al.
Existence of solutions to nonlinear Hammerstein integral equations and applications
J. Math. Anal. Appl.
(2006) - et al.
Using the matrix refinement equation for the construction of wavelets on invariant sets
Appl. Comput. Harmon. Anal.
(1994) - et al.
Wavelet Galerkin methods for second kind integral equations
J. Comp. Appl. Math.
(1997) A class of bases in L2 for the sparse representation of integral operators
SIAM J. Math. Anal.
(1993)- et al.
Theoretical Numerical Analysis
(2005) - et al.
Projection and iterated projection methods for nonlinear integral equations
SIAM J. Numer. Anal.
(1987)
A survey of numerical methods for solving nonlinear integral equations
J. Int. Equ. Appl.
The discrete collocation method for nonlinear integral equations
Fast wavelet transforms and numerical algorithms I
Comm. Pure Appl. Math.
Approximate Solutions of Operator Equations
The Petrov–Galerkin methods for second kind integral equations II: multiwavelets scheme
Adv. Comput. Math.
A construction of interpolating wavelets on invariant sets
Math. Comput.
Discrete wavelet Petrov–Galerkin methods
Adv. Comput. Math.
Fast collocation methods for second kind integral equations
SIAM J. Numer. Anal.
Multilevel augmentation methods for solving operator equations
Num. Math. J. China Univ.
Cited by (11)
Convergence analysis for derivative dependent Fredholm-Hammerstein integral equations with Green's kernel
2020, Journal of Computational and Applied MathematicsSuperconvergence results of Legendre spectral projection methods for weakly singular Fredholm–Hammerstein integral equations
2019, Journal of Computational and Applied MathematicsSuperconvergence of Legendre spectral projection methods for Fredholm–Hammerstein integral equations
2017, Journal of Computational and Applied MathematicsSuperconvergence results for the nonlinear Fredholm–Hemmerstein integral equations of second kind
2021, Journal of AnalysisApproximation methods for system of nonlinear Fredholm–Hammerstein integral equations
2021, Computational and Applied MathematicsDiscrete Legendre spectral methods for Hammerstein type weakly singular nonlinear Fredholm integral equations
2021, International Journal of Computer Mathematics