Summary
There are currently several highly efficient methods for solving linear systems associated with finite difference approximations of Poisson's equation in rectangular regions. These techniques are employed to develop both direct and iterative methods for solving the linear systems arising from the use ofC 0 quadratic orC 1 cubic tensor product finite elements.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
Bank, R.E., Rose, D.J.: Marching algorithms for elliptic boundary value problems. I. The constant coefficient case. SIAM J. Numer. Anal14, 792–829 (1977)
Bank, R.E.: Marching algorithms for elliptic boundary value problems. II. The variable coefficient case. SIAM J. Numer. Anal.14, 950–970 (1977)
Buzbee, B.L., Golup, G.H., Neilson, C.W.: On direct methods for solving Poisson's equation. SIAM J. Numer. Anal.7, 627–656 (1970)
Concus, P., Golup, G.H.: The use of fact direct methods for the efficient solution of non-separable elliptic equations. SIAM J. Numer. Anal.10, 1103–1120 (1973)
Concus, P., Golup, G.H., O'Leary, D.P.: A generalized conjugate iteration for the numerical solution of elliptic partial differential equations. In: Sparse matrix computations (J.R. Bunch, D.J. Rose, eds.), New York-London: Academic Press 1976
Cooley, J.W., Lewis, P.A.W., Welch, P.D.: The fast Fourier transform algorithm: programming considerations in the calculations of sine, cosine and Laplace transforms. J. Sound Vib.12, 315–337 (1970)
Dorr, F.W.: The direct solution of the discrete Poisson equation on a rectangle. SIAM Rev.12, 248–263 (1970)
Douglas, J. Jr., Dupont, T.: Preconditioned conjugate gradient iteration applied to Galerkin methods for midly nonlinear Dirichlet problem. In: Sparse matrix computations (J.R. Bunch, D.J. Rose, eds.). New York-London: Academic Press 1976
Forsythe, G.E., Moler, C.B.: Computer solution of linear algebraic systems. Prentice Hall 1967
Gunn, J.E.: The solution of difference equations by semi-explicit iterative techniques. SIAM J. Numer. Anal.2, 24–45 (1965)
Schultz, M.H.: Spline analysis. Prentice Hall 1973
Strang, G., Fix, G.: An analysis of the finite element method. Prentice Hall 1973
Swarztrauber, P.N.: The methods of cyclic reduction, Fourier analysis, and cyclic reduction—Fourier analysis in the discrete solution of Poisson's equation on a rectangle. SIAM Rev. (to appear)
Varga, R.S.: Matrix iterative analysis. Prentice Hall 1962
Wilkinson, J.H.: The algebraic eigenvalue problem. The Clarendon Press 1965
Bank, R.E., Dupont, T.: An optimal order process for solving finite element equations. Math. Comput. (submitted)
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Bank, R.E. Efficient algorithms for solving tensor product finite element equations. Numer. Math. 31, 49–61 (1978). https://doi.org/10.1007/BF01396013
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01396013