Matrix decomposition algorithms for the C 0-quadratic finite element Galerkin method
- 80 Downloads
Explicit expressions for the eigensystems of one-dimensional finite element Galerkin (FEG) matrices based on C 0 piecewise quadratic polynomials are determined. These eigensystems are then used in the formulation of fast direct methods, matrix decomposition algorithms (MDAs), for the solution of the FEG equations arising from the discretization of Poisson’s equation on the unit square subject to several standard boundary conditions. The MDAs employ fast Fourier transforms and require O(N 2log N) operations on an N×N uniform partition. Numerical results are presented to demonstrate the efficacy of these algorithms.
KeywordsPoisson’s equation Finite element Galerkin method Piecewise quadratic functions Generalized eigenvalue problem Matrix decomposition algorithms
Mathematics Subject Classification (2000)65F05 65N22 65N30
Unable to display preview. Download preview PDF.
- 7.Bialecki, B., Fairweather, G., Knudson, D.B., Lipman, D.A., Nguyen, Q.N., Sun, W., Weinberg, G.M.: Matrix decomposition algorithms for the finite element Galerkin method with piecewise Hermite cubics. Numer. Algorithms (to appear). doi: 10.1007/s11075-008-9255-y
- 9.Constas, A.: Fast Fourier transform solvers for quadratic spline collocation. M.Sc. Thesis, Department of Computer Science, University of Toronto, Toronto, Canada (1996) Google Scholar