论文信息 - A fast algorithm for solving the tensor product collocation equations

A fast algorithm for solving the tensor product collocation equations

Abstract A fast algorithm is presented for solving the tensor product collocation equations (Ax ⊗ By + Bx ⊗ Ay)u =b, obtained from the discretization of the Poisson equation in a rectangular region by the collocation method. The Fast Fourier Transformation (FFT) algorithm is employed to achieve the above objective. The operation count is shown to be 0(N2log2N) which makes the overall calculations very economical.

Weiwei Sun | Nader G. Zamani

[1] A finite element based collocation method for eigenvalue calculations , 1987 .

[2] Roger W. Hockney,et al. A Fast Direct Solution of Poisson's Equation Using Fourier Analysis , 1965, JACM.

[3] P. Swarztrauber. THE METHODS OF CYCLIC REDUCTION, FOURIER ANALYSIS AND THE FACR ALGORITHM FOR THE DISCRETE SOLUTION OF POISSON'S EQUATION ON A RECTANGLE* , 1977 .

[4] F. Dorr. The Direct Solution of the Discrete Poisson Equation on a Rectangle , 1970 .

[5] R. D. Russell,et al. Orthogonal Collocation for Elliptic Partial Differential Equations , 1976 .

[6] Wayne R. Dyksen. Tensor product generalized ADI methods for separable elliptic problems , 1987 .

[7] John R. Rice,et al. A New Ordering Scheme for the Hermite Bicubic Collocation Equations , 1981 .

[8] P. Halmos. Finite-Dimensional Vector Spaces , 1960 .

[9] John R. Rice,et al. The Performance of the Collocation and Galerkin Methods with Hermite Bi-Cubics , 1984 .