A fast realization of preconditioned Conjugate Gradients for Wiener-Hopf integral equations

We present an efficient implementation of the Conjugate Gradients algorithm for Wiener-Hopf integral equations based on finite rank approximations of the integral operator and the corresponding preconditioner. The resulting algorithm is of linear complexity. Numerical experiments with this implementation of the preconditioned Conjugate Gradients algorithm show significant speed-up in the ill-conditioned case. This algorithm acts on ill-conditioned equations as a regularization algorithm.     

Preconditioners for block Toeplitz systems based on circulant preconditioners

We study the numerical solution of a block system T _m,n x=b by preconditioned conjugate gradient methods where T _m,n is an m×m block Toeplitz matrix with n×n Toeplitz blocks. These systems occur in a variety of applications, such as two-dimensional image processing and the discretization of two-dimensional partial differential equations. In this paper, we propose new preconditioners for block systems based on circulant preconditioners. From level-1 circulant preconditioner we construct our first preconditioner q ₁(T _m,n ) which is the sum of a block Toeplitz matrix with Toeplitz blocks and a sparse matrix with Toeplitz blocks. By setting selected entries of the inverse of level-2 circulant preconditioner to zero, we get our preconditioner q ₂(T _m,n ) which is a (band) block Toeplitz matrix with (band) Toeplitz blocks. Numerical results show that our preconditioners are more efficient than circulant preconditioners.     

Parallel Algorithms for Orthotropic Problems

Finite element meshes and node-numberings suitable for parallel solution with equally loaded processors are presented for linear orthotropic elliptic partial differential equations. These problems are of great importance, for instance in the oil and airfoil industries. The linear systems of equations are solved by the conjugate gradient method preconditioned by modified incomplete factorization, MIC. The basic method presented, is based on fronts of uncoupled nodes and unlike earlier methods it has the advantage of no requirement of a specific orientation of the mesh. This method is however, in general, restricted to small degree of anisotropy in the differential equation. Another method, which does not suffer from this limitation, uses rotation of the differential equation and spectral equivalence. The rotation is made in such a way that in the new co-ordinate system, the basic method is applicable. The spectral equivalence property is used for estimation of the condition number of the preconditioned system. Both methods are suitable for implementation on parallel computers. The computer architecture could be single instruction multiple data (SIMD) as well as multiple instruction multiple data (MIMD) with shared or distributed memory. Implementation of the basic method on a shared memory parallel computer shows a significant improvement by use of the MIC method compared with the diagonal scaling preconditioning method.     

The construction of an algebraically reduced system for the acceleration of preconditioned conjugate gradients

In this paper we show how an algebraically reduced system can be constructed, for which the preconditioned conjugate gradient method converges faster than for the original system. For this method it is necessary that the original matrix is symmetric positive-definite. Our approach is based on an efficient projection on a well-chosen subspace and we show an application in which a cyclically reduced system is one step further reduced by this novel technique.     

Sine transform based preconditioners for elliptic problems

We consider applying the preconditioned conjugate gradient (PCG) method to solving linear systems Ax = b where the matrix A comes from the discretization of second-order elliptic operators with Dirichlet boundary conditions. Let (L + Σ)Σ⁻¹(L^t + Σ) denote the block Cholesky factorization of A with lower block triangular matrix L and diagonal block matrix Σ. We propose a preconditioner M = (Lˆ + Σˆ)Σˆ⁻¹(Lˆ^t + Σˆ) with block diagonal matrix Σˆ and lower block triangular matrix Lˆ. The diagonal blocks of Σˆ and the subdiagonal blocks of Lˆ are respectively the optimal sine transform approximations to the diagonal blocks of Σ and the subdiagonal blocks of L. We show that for two-dimensional domains, the construction cost of M and the cost for each iteration of the PCG algorithm are of order O(n² log n). Furthermore, for rectangular regions, we show that the condition number of the preconditioned system M⁻¹A is of order O(1). In contrast, the system preconditioned by the MILU and MINV methods are of order O(n). We will also show that M can be obtained from A by taking the optimal sine transform approximations of each sub-block of A. Thus, the construction of M is similar to that of Level-1 circulant preconditioners. Our numerical results on two-dimensional square and L-shaped domains show that our method converges faster than the MILU and MINV methods. Extension to higher-dimensional domains will also be discussed. © 1997 John Wiley & Sons, Ltd.     

Modified nodal cubic spline collocation for biharmonic equations

We formulate a modified nodal cubic spline collocation scheme for the solution of the biharmonic Dirichlet problem on the unit square. We prove existence and uniqueness of a solution of the scheme and show how the scheme can be solved on an N × N uniform partition of the square at a cost O(N ² log₂ N + mN ²) using fast Fourier transforms and m iterations of the preconditioned conjugate gradient method. We demonstrate numerically that m proportional to log₂ N guarantees the desired convergence rates. Numerical results indicate the fourth order accuracy of the approximations in the global maximum norm and the fourth order accuracy of the approximations to the first order partial derivatives at the partition nodes.      

Application of Wiener-Hopf technique to linear nonhomogeneous integral equations for a new representation of Chandrasekhar's H-function in radiative transfer, its existence and uniqueness

In this paper, the linear nonhomogeneous integral equation of H-functions is considered to find a new form of H-function as its solution. The Wiener-Hopf technique is used to express a known function into two functions with different zones of analyticity. The linear nonhomogeneous integral equation is thereafter expressed into two different sets of functions having the different zones of regularity. The modified form of Liouville's theorem is thereafter used, Cauchy's integral formulae are used to determine functional representation over the cut region in a complex plane. The new form of H-function is derived both for conservative and nonconservative cases. The existence of solution of linear nonhomogeneous integral equations and its uniqueness are shown. For numerical calculation of this new H-function, a set of useful formulae are derived both for conservative and nonconservative cases.     

四阶微分方程Hermite有限元的预处理共轭梯度法

对一类四阶微分方程两点边值问题的Hermite有限元方法进行了研究.首先讨论了该方程通常意义下的Galerkin有限元离散,考虑到有限元离散得到的线性方程组的对称正定性,文中采用了预处理最速下降法和共轭梯度方法求解线性方程组,通过选择不同的预处理器,使得求解该方程组的迭代次数有了很大的改观.     

On the stability of Volterra integral equations with a lagging argument

Stability properties of numerical methods for Volterra integral equations with lagging argument are considered. Some suitable definitions for the stability of the numerical methods are included, and plots of the stability regions for particular cases are included.     

DOMAIN DECOMPOSITION PRECONDITIONERS FOR SECOND-ORDER HYPERBOLIC EQUATIONS ON L-SHAPED REGIONS

Linear systems arising from implicit time discretizations and finite difference space discretizations of second-order hyperbolic equations on L-shaped region are considered. We analyse the use of domain deocmposilion preconditioner.s for the solution of linear systems via the preconditioned conjugate gradient method. For the constant-coefficient second-order hyperbolic equaions with initial and Dirichlet boundary conditions,we prove that the conditionnumber of the preconditioned interface system is bounded by 2+x2 2+0.46x2 where x is the quo-tient between the lime and space steps. Such condition number produces a convergence rale that is independent of gridsize and aspect ratios. The results could be extended to parabolic equations.     

SINE TRANSFORM PRECONDITIONERS FOR SECOND-ORDER PARTIAL DIFFERENTIAL EQUATIONS

In this paper, we are concerned with the numerical solution of second-order partial differential equations. We analyse the use of the Sine Transform precondilioners for the solution of linear systems arising from the discretization of p.d.e. via the preconditioned conjugate gradient method. For the second-order partial differential equations with Dirichlel boundary conditions, we prove that the condition number of the preconditioned system is O(1) while the condition number of the original system is O(m 2) Here m is the number of interior gridpoints in each direction. Such condition number produces a linear convergence rale.     

A random integral quadrature method for numerical analysis of the second kind of Volterra integral equations

In this paper, a novel meshless technique termed the random integral quadrature (RIQ) method is developed for the numerical solution of the second kind of the Volterra integral equations. The RIQ method is based on the generalized integral quadrature (GIQ) technique, and associated with the Kriging interpolation function, such that it is regarded as an extension of the GIQ technique. In the GIQ method, the regular computational domain is required, in which the field nodes are scattered along straight lines. In the RIQ method however, the field nodes can be distributed either uniformly or randomly. This is achieved by discretizing the governing integral equation with the GIQ method over a set of virtual nodes that lies along straight lines, and then interpolating the function values at the virtual nodes over all the field nodes which are scattered either randomly or uniformly. In such a way, the governing integral equation is converted approximately into a system of linear algebraic equations, which can be easily solved.     

A new constructive method for solving singular integral equations

In this paper, a new method for the approximate solution of linear singular integral equations defined on smooth closed curves is proposed and justified.     

Numerical solution of Hammerstein integral equations by using combination of spline-collocation method and Lagrange interpolation

The numerical solutions to the nonlinear integral equations of the Hammerstein-type:

with using B-splines functions are investigated. An interpolation method based on B-splines functions combined with a new collocation method is presented. Finally, for showing efficiency of the method we give some numerical examples.     

On Taylor-series expansion methods for the second kind integral equations

In this paper, we comment on the recent papers by Yuhe Ren et al. (1999) [1] and Maleknejad et al. (2006) [7] concerning the use of the Taylor series to approximate a solution of the Fredholm integral equation of the second kind as well as a solution of a system of Fredholm equations. The technique presented in Yuhe Ren et al. (1999) [1] takes advantage of a rapidly decaying convolution kernel k(|s−t|) as |s−t| increases. However, it does not apply to equations having other types of kernels. We present in this paper a more general Taylor expansion method which can be applied to approximate a solution of the Fredholm equation having a smooth kernel. Also, it is shown that when the new method is applied to the Fredholm equation with a rapidly decaying kernel, it provides more accurate results than the method in Yuhe Ren et al. (1999) [1]. We also discuss an application of the new Taylor-series method to a system of Fredholm integral equations of the second kind.     

Mechanical quadrature methods and their splitting extrapolations for boundary integral equations of first kind on open arcs

This paper presents the mechanical quadrature methods (MQMs) for solving boundary integral equations (BIEs) of the first kind on open arcs. The spectral condition number of MQMs is only O(h⁻¹), where h is the maximal mesh width. The errors of MQMs have multivariate asymptotic expansions, accompanied with for all mesh widths h_i. Hence, once discrete equations with coarse meshes are solved in parallel, the accuracy order of numerical approximations can be greatly improved by splitting extrapolation algorithms (SEAs). Moreover, a posteriori asymptotic error estimates are derived, which can be used to formulate self-adaptive algorithms. Numerical examples are also provided to support our algorithms and analysis. Furthermore, compared with the existing algorithms, such as Galerkin and collocation methods, the accuracy order of the MQMs is higher, and the discrete matrix entries are explicit, to prove that the MQMs in this paper are more promising and beneficial to practical applications.     

A multigrid-based preconditioned Krylov subspace method for the Helmholtz equation with PML

In this paper, we generalize the complex shifted Laplacian preconditioner to the complex shifted Laplacian-PML preconditioner for the Helmholtz equation with perfectly matched layer (Helmholtz-PML equation). The Helmholtz-PML equation is discretized by an optimal 9-point difference scheme, and the preconditioned linear system is solved by the Krylov subspace method, especially by the biconjugate gradient stabilized method (Bi-CGSTAB). The spectral analysis of the linear system is given, and a new matrix-based interpolation operator is proposed for the multigrid method, which is used to approximately invert the preconditioner. The numerical experiments are presented to illustrate the efficiency of the preconditioned Bi-CGSTAB method with the multigrid based on the new interpolation operator, also, numerical results are given for comparing the performance of the new interpolation operator with that of classic bilinear interpolation operator and the one suggested in Erlangga et al. (2006) [10].     

A note on an SOR-like method for augmented systems

Golub et al. (2001, BIT, 41, 71–85) gave a generalizedsuccessive over-relaxation method for the augmented systems.In this paper, the connection between the SOR-like method andthe preconditioned conjugate gradient (PCG) method for the augmentedsystems is investigated. It is shown that the PCG method isat least as accurate (fast) as the SOR-like method. Numericalexamples demonstrate that the PCG method is much faster thanthe SOR-like method.