论文信息 - Cyclic reduction algorithm for solving collocation systems - 字舞流文

Cyclic reduction algorithm for solving collocation systems

In this paper, we present cyclic reducation and FARC algorithms for solving spline collocation system. The costs of these algorithms are 0(N 2logN) and O(N 2log logN) respectively, for an N x N grid.

[1] C. D. Boor,et al. Collocation at Gaussian Points , 1973 .

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

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

[4] Weiwei Sun,et al. A fast algorithm for solving the tensor product collocation equations , 1989 .

[5] 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 .

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

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

[8] Graeme Fairweather,et al. Fast direct solvers for piecewise Hermite bicubic orthogonal spline collocation equations , 1992 .

[9] Robert D. Russell,et al. Finite Difference Preconditioning for Solving Orthogonal Collocation Equations for Boundary Value Problems , 1996 .

[10] Weiwei Sun,et al. A high order direct method for solving Poisson's equation in a disc , 1995 .