Matrix decomposition algorithms for arbitrary order C^0 tensor product finite element systems
DOI10.1016/J.CAM.2014.08.015zbMATH Open1297.65029OpenAlexW1984188273MaRDI QIDQ457717FDOQ457717
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
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
Poisson's equationfinite element Galerkin method\(C^0\) piecewise polynomialsmatrix decomposition algorithms
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)
Cites Work
- LAPACK Users' Guide
- Efficient spectral-Galerkin algorithms for direct solution of fourth-order differential equations using Jacobi polynomials
- Title not available (Why is that?)
- Efficient Spectral-Galerkin Algorithms for Direct Solution of Second-Order Equations Using Ultraspherical Polynomials
- Superconvergence in Galerkin finite element methods
- Jacobi spectral Galerkin method for elliptic Neumann problems
- Efficient spectral-Galerkin algorithms for direct solution for second-order differential equations using Jacobi polynomials
- Efficient spectral ultraspherical-Galerkin algorithms for the direct solution of 2nth-order linear differential equations
- Matrix decomposition algorithms for elliptic boundary value problems: A survey
- Efficient spectral-Galerkin algorithms for direct solution of the integrated forms of second-order equations using ultraspherical polynomials
- Matrix decomposition algorithms for the \(C^{0}\)-quadratic finite element Galerkin method
- Efficient Jacobi Galerkin methods for second- and fourth-order elliptic problems
- Efficient algorithms for solving tensor product finite element equations
- High-Order, Fast-Direct Methods for Separable Elliptic Equations
- Algorithm 685: a program for solving separable elliptic equations
- A fast direct solver for elliptic problems with a divergence constraint
- Matrix decomposition algorithms for the finite element Galerkin method with piecewise Hermite cubics
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
Uses Software
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)
