Fast Discrete Galerkin Methods for Cauchy Integral Singular Equations with Constant Coe?cients
带常系数的Cauchy型奇异积分方程的快速方法

The Petrov-Galerkin method based on Jacobi polynomials is the conventional and standard numerical method for solving the Cauchy singular integral equations with constant coeffcients. This conventional numerical method leads to a linear system with a full coeffcient matrix. When the order of the linear system is large, the computational cost for obtaining and then solving the fully discrete linear system is huge. So in this paper the author develops a fast fully discrete Petrov-Galerkinmethod for solving this kind of integral equations. First compress this full coe?cient matrix into a sparse matrix. Then apply the numerical integration scheme to obtain the fully discrete truncated linear system with a nearly linear computational cost. At last, the fully discrete truncated linear system is solved. It is established that the optimal convergence order of the approximation solution remains optimal.