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

DOI10.1016/J.CAM.2014.08.015MaRDI QIDQ457717zbMATH OpenOpenAlexFDO

Authors Kui Du, Graeme Fairweather, Weiwei Sun

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

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

Recommendations

• Matrix decomposition algorithms for the \(C^{0}\)-quadratic finite element Galerkin method
• Matrix decomposition algorithms for the finite element Galerkin method with piecewise Hermite cubics
• Structured Matrix Approximations via Tensor Decompositions
• Matrix decomposition algorithms for elliptic boundary value problems: A survey
• Krylov subspace methods for linear systems with tensor product structure
• Matrix Decomposition Algorithms Related to the MFS for Axisymmetric Problems
• Tensor product based fast spectral element solvers
• scientific article; zbMATH DE number 1225903
• An adaptive algebraic multigrid algorithm for low-rank canonical tensor decomposition

Cites work

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

Cited in

(6)

• Arbitrary high-order \(C^0\) tensor product Galerkin finite element methods for the electromagnetic scattering from a large cavity
• A tensor product finite element method for the diffraction grating problem with transparent boundary conditions
• Matrix decomposition algorithms for the \(C^{0}\)-quadratic finite element Galerkin method
• Matrix decomposition algorithms for the finite element Galerkin method with piecewise Hermite cubics
• 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

Describes a project that uses

Uses Software

• LAPACK

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q457717)