Matrix decomposition algorithms for arbitrary order \(C^0\) tensor product finite element systems

DOI10.1016/J.CAM.2014.08.015zbMath1297.65029OpenAlexW1984188273MaRDI QIDQ457717

Kui Du, Graeme Fairweather, Sun, Weiwei

Publication date: 29 September 2014

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cam.2014.08.015

zbMATH Keywords

Poisson's equationfinite element Galerkin method\(C^0\) piecewise polynomialsmatrix decomposition algorithms

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 (3)

Arbitrary high-order \(C^0\) tensor product Galerkin finite element methods for the electromagnetic scattering from a large cavity ⋮ Fast Fourier solvers for the tensor product high-order FEM for a Poisson type equation ⋮ A tensor product finite element method for the diffraction grating problem with transparent boundary conditions

Uses Software

• Unnamed Item

Cites Work

• Unnamed Item
• Matrix decomposition algorithms for elliptic boundary value problems: A survey
• Matrix decomposition algorithms for the finite element Galerkin method with piecewise Hermite cubics
• Efficient spectral-Galerkin algorithms for direct solution of fourth-order differential equations using Jacobi polynomials
• Efficient spectral ultraspherical-Galerkin algorithms for the direct solution of 2nth-order linear differential equations
• Jacobi spectral Galerkin method for elliptic Neumann problems
• Efficient Jacobi Galerkin methods for second- and fourth-order elliptic problems
• Matrix decomposition algorithms for the \(C^{0}\)-quadratic finite element Galerkin method
• Efficient algorithms for solving tensor product finite element equations
• Superconvergence in Galerkin finite element methods
• Efficient spectral-Galerkin algorithms for direct solution for second-order differential equations using Jacobi polynomials
• High-Order, Fast-Direct Methods for Separable Elliptic Equations
• LAPACK Users' Guide
• Algorithm 685: a program for solving separable elliptic equations
• Efficient Spectral-Galerkin Algorithms for Direct Solution of Second-Order Equations Using Ultraspherical Polynomials
• A fast direct solver for elliptic problems with a divergence constraint
• Efficient spectral-Galerkin algorithms for direct solution of the integrated forms of second-order equations using ultraspherical polynomials

This page was built for publication: Matrix decomposition algorithms for arbitrary order \(C^0\) tensor product finite element systems