A fast collocation method for acoustic scattering in shallow oceans

In this paper, we investigate the numerical solution of the integral equation of the second kind reduced by acoustic scattering in shallow oceans with Dirichlet condition. Based on analyzing the singularity of the truncating kernel with a sum of infinite series, using our trigonometric interpolatory wavelets and collocation method, we obtain the numerical solution which possesses a fast convergence rate like o(2^−j). Moreover, the entries of the stiffness matrix can be obtained by FFT, which lead the computational complexity to decrease obviously.     

A fast numerical method for a natural boundary integral equation for the Helmholtz equation

A Neumann boundary value problem of the Helmholtz equation in the exterior circular domain is reduced into an equivalent natural boundary integral equation. Using our trigonometric wavelets and the Galerkin method, the obtained stiffness matrix is symmetrical and circulant, which lead us to a fast numerical method based on fast Fourier transform. Furthermore, we do not need to compute the entries of the stiffness matrix. Especially, our method is also efficient when the wave number k in the Helmholtz equation is very large.     

A multiscale Galerkin method for the hypersingular integral equation reduced by the harmonic equation

The aim of this paper is to investigate the numerical solution of the hypersingular integral equation reduced by the harmonic equation. First, we transform the hypersingular integral equation into 2π-periodic hypersingular integral equation with the map x=cot(θ/2). Second, we initiate the study of the multiscale Galerkin method for the 2π-periodic hypersingular integral equation. The trigonometric wavelets are used as trial functions. Consequently, the 2j+1 × 2j+1 stiffness matrix Kj can be partitioned j×j block matrices. Furthermore, these block matrices are zeros except main diagonal block matrices. These main diagonal block matrices are symmetrical and circulant matrices, and hence the solution of the associated linear algebraic system can be solved with the fast Fourier transform and the inverse fast Fourier transform instead of the inverse matrix. Finally, we provide several numerical examples to demonstrate our method has good accuracy even though the exact solutions are multi-peak and almost singular.     

A wavelets method for plane elasticity problem

A Neumann boundary value problem of plane elasticity problem in the exterior circular domain is reduced into an equivalent natural boundary integral equation and a Poisson integral formula with the DtN method. Using the trigonometric wavelets and Galerkin method, we obtain a fast numerical method for the natural boundary integral equation which has an unique solution in the quotient space. We decompose the stiffness matrix in our numerical method into four circulant and symmetrical or antisymmetrical submatrices, and hence the solution of the associated linear algebraic system can be solved with the fast Fourier transform (FFT) and the inverse fast Fourier transform (IFFT) instead of the inverse matrix. Examples are given for demonstrating our method has good accuracy of our method even though the exact solution is almost singular.     

BCCB preconditioners for systems of BVM‐based numerical integrators

Boundary value methods (BVMs) for ordinary differential equations require the solution of non‐symmetric, large and sparse linear systems. In this paper, these systems are solved by using the generalized minimal residual (GMRES) method. A block‐circulant preconditioner with circulant blocks (BCCB preconditioner) is proposed to speed up the convergence rate of the GMRES method. The BCCB preconditioner is shown to be invertible when the BVM is A_k1,k2‐stable. The spectrum of the preconditioned matrix is clustered and therefore, the preconditioned GMRES method converges fast. Moreover, the operation cost in each iteration of the preconditioned GMRES method by using our BCCB preconditioner is less than that required by using block‐circulant preconditioners proposed earlier. In numerical experiments, we compare the number of iterations of various preconditioners. Copyright © 2003 John Wiley & Sons, Ltd.     

Band plus algebra preconditioners for two-level Toeplitz systems

In this paper we are interested in the fast and efficient solution of nm×nm symmetric positive definite ill-conditioned Block Toeplitz with Toeplitz Blocks (BTTB) systems of the form T _nm (f)x=b, where the generating function f is a priori known. The preconditioner that we propose and analyze is an extension of the one proposed in (D. Noutsos and P. Vassalos, Comput. Math. Appl., 56 (2008), pp. 1255–1270) and it arises as a product of a Block band Toeplitz matrix and matrices that may belong to any trigonometric matrix algebra. The underlying idea of the proposed scheme is to embody the well known advantages characterizing each component of the product when used alone. As a result we obtain spectral equivalence and a weak clustering of the eigenvalues of the preconditioned matrix around unity, ensuring the convergence of the Preconditioned Conjugate Gradient (PCG) method with a number of iterations independent of the partial dimensions. Finally, we compare our method with techniques already employed in the literature. A wide range of numerical experiments confirms the effectiveness of the proposed procedure and the adherence to the theoretical analysis.     

Using successive approximations for improving the convergence of GMRES method

In this paper, our attention is concentrated on the GMRES method for the solution of the system (I–T)x=b of linear algebraic equations with a nonsymmetric matrix. We perform m pre-iterations y _l+1 =T _yl +b before starting GMRES and put y _m for the initial approximation in GMRES. We derive an upper estimate for the norm of the error vector in dependence on the mth powers of eigenvalues of the matrix T Further we study under what eigenvalues lay-out this upper estimate is the best one. The estimate shows and numerical experiments verify that it is advisable to perform pre-iterations before starting GMRES as they require fewer arithmetic operations than GMRES. Towards the end of the paper we present a numerical experiment for a system obtained by the finite difference approximation of convection-diffusion equations.     

An efficient algorithm for the generalized centro-symmetric solution of matrix equation <Emphasis Type="Italic">A X B</Emphasis> = <Emphasis Type="Italic">C</Emphasis>

In this paper, an iterative algorithm is constructed for solving linear matrix equation AXB = C over generalized centro-symmetric matrix X. We show that, by this algorithm, a solution or the least-norm solution of the matrix equation AXB = C can be obtained within finite iteration steps in the absence of roundoff errors; we also obtain the optimal approximation solution to a given matrix X ₀ in the solution set of which. In addition, given numerical examples show that the iterative method is efficient.     

A fast method to block-diagonalize a Hankel matrix

In this paper, we consider an approximate block diagonalization algorithm of an n×n real Hankel matrix in which the successive transformation matrices are upper triangular Toeplitz matrices, and propose a new fast approach to compute the factorization in O(n ²) operations. This method consists on using the revised Bini method (Lin et al., Theor Comp Sci 315: 511–523, 2004). To motivate our approach, we also propose an approximate factorization variant of the customary fast method based on Schur complementation adapted to the n×n real Hankel matrix. All algorithms have been implemented in Matlab and numerical results are included to illustrate the effectiveness of our approach.     

A continuation method for linear complementarity problems with P 0 matrix

In this article, we propose a new continuation method for solving the linear complementarity problem (LCP). The method solves one system of linear equations and carries out only a one-line search at each iteration. The continuation method is based on a modified smoothing function. The existence and continuity of a smooth path for solving the LCP with a P ₀ matrix are discussed. We investigate the boundedness of the iteration sequence generated by our continuation method under the assumption that the solution set of the LCP is nonempty and bounded. It is shown to converge to an LCP solution globally linearly and locally superlinearly without the assumption of strict complementarity at the solution under suitable assumption. In addition, some numerical results are also reported in this article.     

Numerical solution of two-dimensional time fractional cable equation with Mittag-Leffler kernel

The main motive of this article is to study the recently developed Atangana-Baleanu Caputo (ABC) fractional operator that is obtained by replacing the classical singular kernel by Mittag-Leffler kernel in the definition of the fractional differential operator. We investigate a novel numerical method for the nonlinear two-dimensional cable equation in which time-fractional derivative is of Mittag-Leffler kernel type. First, we derive an approximation formula of the fractional-order ABC derivative of a function t^k using a numerical integration scheme. Using this approximation formula and some properties of shifted Legendre polynomials, we derived the operational matrix of ABC derivative. In the author of knowledge, this operational matrix of ABC derivative is derived the first time. We have shown the efficiency of this newly derived operational matrix by taking one example. Then we solved a new class of fractional partial differential equations (FPDEs) by the implementation of this ABC operational matrix. The two-dimensional model of the time-fractional model of the cable equation is solved and investigated by this method. We have shown the effectiveness and validity of our proposed method by giving the solution of some numerical examples of the two-dimensional fractional cable equation. We compare our obtained numerical results with the analytical results, and we conclude that our proposed numerical method is feasible and the accuracy can be seen by error tables. We see that the accuracy is so good. This method will be very useful to investigate a different type of model that have Mittag-Leffler fractional derivative.     

On approximation in the fictitious domain method for a bidimensional transport equation

In this article a numerical method for solving a two‐dimensional transport equation in the stationary case is presented. Using the techniques of the variational calculus, we find the approximate solution for a homogeneous boundary‐value problem that corresponds to a square domain D₂. Then, using the method of the fictitious domain, we extend our algorithm to a boundary value problem for a set D that has an arbitrary shape. In this approach, the initial computation domain D (called physical domain) is immersed in a square domain D₂. We prove that the solution obtained by this method is a good approximation of the exact solution. The theoretical results are verified with the help of a numerical example. © 2009 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 2010     

Fast numerical solution of fredholm integral equations with stationary kernels

A fast recursive matrix method for the numerical solution of Fredholm integral equations with stationary kernels is derived. IfN denotes the number of nodal points, the complexity of the algorithm isO(N ²), which should be compared toO(N ³) for conventional algorithms for solving such problems. The method is related to fast algorithms for inverting Toeplitz matrices.Applications to equations of the first and second kind as well as miscellaneous problems are discussed and illustrated with numerical examples. These show that the theoretical improvement in efficiency is indeed obtained, and that no problems with numerical stability or accuracy are encountered.     

A Smoothing Newton Method for General Nonlinear Complementarity Problems

Smoothing Newton methods for nonlinear complementarity problems NCP(F) often require F to be at least a P ₀-function in order to guarantee that the underlying Newton equation is solvable. Based on a special equation reformulation of NCP(F), we propose a new smoothing Newton method for general nonlinear complementarity problems. The introduction of Kanzow and Pieper's gradient step makes our algorithm to be globally convergent. Under certain conditions, our method achieves fast local convergence rate. Extensive numerical results are also reported for all complementarity problems in MCPLIB and GAMSLIB libraries with all available starting points.     

An efficient iterative method for solving the matrix equation AXB + CYD = E

This paper presents an iterative method for solving the matrix equation AXB + CYD = E with real matrices X and Y. By this iterative method, the solvability of the matrix equation can be determined automatically. And when the matrix equation is consistent, then, for any initial matrix pair [X₀, Y₀], a solution pair can be obtained within finite iteration steps in the absence of round‐off errors, and the least norm solution pair can be obtained by choosing a special kind of initial matrix pair. Furthermore, the optimal approximation solution pair to a given matrix pair [X?, ?] in a Frobenius norm can be obtained by finding the least norm solution pair of a new matrix equation AX?B + C?D = ?, where ? = E ? AX?B ? C?D. The given numerical examples show that the iterative method is efficient. Copyright © 2005 John Wiley & Sons, Ltd.     

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.     

Wavelet Solution of Plane Elasticity Problem in the Upper Half-plane

The plane elasticity problem includes plane strain problem and plane stress problem which are widely applied in mechanics and engineering. In this article, we first reduce the plane elasticity problem in the upper half-plane into natural boundary integral equation and then apply wavelet-Galerkin method to deal with the numerical solution of the natural boundary integral equation. The test and trial functions used are the scaling basis functions of Shannon wavelet. In our fast algorithm, the computational formulae of entries of the stiffness matrix yield simple close-form and only 3 K entries need to be computed for one 4 K ‐ 4 K stiffness matrix.     

Prewavelet analysis of the heat equation

Summary. We consider the heat equation in a smooth domain of R with Dirichlet and Neumann boundary conditions. It is solved by using its integral formulation with double-layer potentials, where the unknown , the jump of the solution through the boundary, belongs to an anisotropic Sobolev space. We approximate by the Galerkin method and use a prewavelet basis on , which characterizes the anisotropic space. The use of prewavelets allows to compress the stiffness matrix from to when N is the size of the matrix, and the condition number of the compressed matrix is uniformly bounded as the initial one in the prewavelet basis. Finally we show that the compressed scheme converges as fast as the Galerkin one, even for the Dirichlet problem which does not admit a coercive variational formulation. Received April 16, 1999 / Published online August 2, 2000     

矩阵方程AXB+CX~TD=E自反最佳逼近解的迭代算法

本文研究了Sylvester矩阵方程AXB+CXTD=E自反(或反自反)最佳逼近解.利用所提出的共轭方向法的迭代算法,获得了一个结果:不论矩阵方程AXB+CXTD=E是否相容,对于任给初始自反(或反自反)矩阵X1,在有限迭代步内,该算法都能够计算出该矩阵方程的自反(或反自反)最佳逼近解.最后,三个数值例子验证了该算法是有效性的.     

Least‐squares solutions of matrix inverse problem for bi‐symmetric matrices with a submatrix constraint

An n × n real matrix A = (a_ij)_{n × n} is called bi‐symmetric matrix if A is both symmetric and per‐symmetric, that is, a_ij = a_ji and a_ij = a_n+1?1,n+1?i (i, j = 1, 2,..., n). This paper is mainly concerned with finding the least‐squares bi‐symmetric solutions of matrix inverse problem AX = B with a submatrix constraint, where X and B are given matrices of suitable sizes. Moreover, in the corresponding solution set, the analytical expression of the optimal approximation solution to a given matrix A^* is derived. A direct method for finding the optimal approximation solution is described in detail, and three numerical examples are provided to show the validity of our algorithm. Copyright © 2007 John Wiley & Sons, Ltd.