Matrix decomposition algorithms for the \(C^{0}\)-quadratic finite element Galerkin method

DOI10.1007/s10543-009-0233-0zbMath1176.65132OpenAlexW2035863650MaRDI QIDQ1035793

Que N. Nguyen, Graeme Fairweather, Kui Du, Sun, Weiwei

Publication date: 4 November 2009

Published in: BIT (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10543-009-0233-0

zbMATH Keywords

numerical resultsfast Fourier transformsPoisson's equationfinite element Galerkin methodmatrix decomposition algorithmsfast direct methods

Mathematics Subject Classification ID

Finite element, Rayleigh-Ritz and Galerkin methods for boundary value problems involving PDEs (65N30) Direct numerical methods for linear systems and matrix inversion (65F05) Numerical solution of discretized equations for boundary value problems involving PDEs (65N22)

Related Items (8)

A fast direct algorithm for implementing a high-order finite element method on rectangles as applied to boundary value problems for the Poisson equation ⋮ Matrix decomposition algorithms for elliptic boundary value problems: A survey ⋮ Fast Fourier solvers for the tensor product high-order FEM for a Poisson type equation ⋮ A new preconditioner for the interface system arising in a fast Helmholtz solver ⋮ Matrix decomposition algorithms for arbitrary order \(C^0\) tensor product finite element systems ⋮ A composite preconditioner for the electromagnetic scattering from a large cavity ⋮ GMRES with adaptively deflated restarting and its performance on an electromagnetic cavity problem ⋮ A tensor product finite element method for the diffraction grating problem with transparent boundary conditions

Cites Work

• Matrix decomposition algorithms for the finite element Galerkin method with piecewise Hermite cubics
• Boundary treatments in non-equilibrium Green's function (NEGF) methods for quantum transport in nano-MOSFETs
• A fast algorithm for solving the tensor product collocation equations
• Efficient algorithms for solving tensor product finite element equations
• Fast algorithms for high-order spline collocation systems
• Matrix decomposition algorithms for separable elliptic boundary value problems in two space dimensions
• Fast Fourier transform solvers and preconditioners for quadratic spline collocation
• Essentially compact schemes for unsteady viscous incompressible flows
• High-Order, Fast-Direct Methods for Separable Elliptic Equations
• Fast Direct Solvers for Piecewise Hermite Bicubic Orthogonal Spline Collocation Equations
• Algorithm 685: a program for solving separable elliptic equations
• Matrix Decomposition Algorithms for Modified Spline Collocation for Helmholtz Problems
• A Fast Algorithm for the Electromagnetic Scattering from a Large Cavity
• Optimal Superconvergent One Step Nodal Cubic Spline Collocation Methods

This page was built for publication: Matrix decomposition algorithms for the \(C^{0}\)-quadratic finite element Galerkin method