Matrix decomposition algorithms for the C0-quadratic finite element Galerkin method

BIT Numerical Mathematics

Volumn 49, Issue 3, 2009, Pages 509-526

  Du, Kui ^a   Fairweather, Graeme ^b,c   Nguyen, Que N ^d   Sun, Weiwei ^a  

^a CITY UNIVERSITY OF HONG KONG   (Hong Kong)

^b Department of Metallurgical and Materials Engineering   (United States)

^c Mathematical Reviews   (United States)

^d Avanade Inc   (United States)

Author keywords

Finite element Galerkin method; Generalized eigenvalue problem; Matrix decomposition algorithms; Piecewise quadratic functions; Poisson's equation

Indexed keywords

EID: 70350780572     PISSN: 00063835     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10543-009-0233-0     Document Type: Article

References (15)

1. Bank, R.E.: Efficient algorithms for solving tensor product finite element equations. Numer. Math. 31, 49-61 (1978).
2. Bao, G., Sun, W.: A fast algorithm for the electromagnetic scattering from a large cavity. SIAM J. Sci. Comput. 27, 553-574 (2005).
3. Bialecki, B., Fairweather, G.: Matrix decomposition methods for separable elliptic boundary value problems in two dimensions. J. Comput. Appl. Math. 46, 369-386 (1993).
4. Bialecki, B., Fairweather, G., Bennett, K.R.: Fast direct solvers for piecewise Hermite bicubic orthogonal spline collocation equations. SIAM J. Numer. Anal. 29, 156-173 (1992).
5. Bialecki, B., Fairweather, G., Karageorghis, A.: Matrix decomposition algorithms for modified spline collocation for Helmholtz problems. SIAM J. Sci. Comput. 24, 1733-1753 (2003).
6. Bialecki, B., Fairweather, G., Karageorghis, A.: Optimal superconvergent one step nodal cubic spline collocation methods. SIAM J. Sci. Comput. 27, 575-598 (2005).
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.
8. Christara, C.C., Ng, K.S.: Fast Fourier transform solvers and preconditioners for quadratic spline collocation. BIT 42, 702-739 (2002).
9. Constas, A.: Fast Fourier transform solvers for quadratic spline collocation. M.Sc. Thesis, Department of Computer Science, University of Toronto, Toronto, Canada (1996).
10. E, W., Liu, J.G.: Essentially compact schemes for unsteady viscous incompressible flows. J. Comput. Phys. 126, 122-138 (1996).
11. Jiang, H., Shao, S., Cai, W., Zhang, P.: Boundary treatments in non-equilibrium Green's function (NEGF) methods for quantum transport in nano-MOSFETs. J. Comput. Phys. 227, 6553-6573 (2008).
12. Kaufman, L., Warner, D.: High-order, fast-direct methods for separable elliptic equations. SIAM J. Numer. Anal. 21, 672-694 (1984).
13. Kaufman, L., Warner, D.: Algorithm 685: a program for solving separable elliptic equations. ACM Trans. Math. Softw. 16, 325-351 (1990).
14. Sun, W.: Fast algorithms for high-order spline collocation systems. Numer. Math. 81, 143-160 (1998).
15. Sun, W., Zamani, N.G.: A fast algorithm for solving the tensor product collocation equations. J. Franklin Inst. 326, 295-307 (1989).