|
![]() Brisbane, 16-18 July 2001 | ||||||||||||||||||||||||||||||||
|
| |||||||||||||||||||||||||||||||||
|
Invited Lecture - AbstractMatrix Decomposition Algorithms in Finite Element Methods for Poisson's EquationGraeme Fairweathergfairwea@glenclova.mines.edu Department of Mathematical and Computer Sciences, Colorado School of Mines, USA
In recent years, several matrix decomposition algorithms have been developed for the efficient solution of the linear algebraic systems arising when finite difference, finite element Galerkin (FEG), orthogonal spline collocation and spectral methods are applied to Poisson problems in the unit square. These algorithms depend on knowledge of the eigensystems of discrete second derivative operators subject to certain boundary conditions. When such an eigensystem is known for a particular method, fast Fourier transforms can be employed to solve the corresponding linear system in O(N2 log N) operations on an N x N uniform partition of the unit square. | ||||||||||||||||||||||||||||||||
Update: 19/Nov/2001 | |||||||||||||||||||||||||||||||||
| ------ ------ ------ ------ ------ ------ ------ ------ ------ ------ ------ ------ ------ ------ ------ ------ ------ ------ ------ ------ ------ | |||||||||||||||||||||||||||||||||