Matrix decomposition algorithms for separable elliptic boundary value problems in two space dimensions

DOI10.1016/0377-0427(93)90033-8zbMath0781.65031OpenAlexW2089584655MaRDI QIDQ1801852

Graeme Fairweather, Bernard Bialecki

Publication date: 17 February 1994

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

Full work available at URL: https://doi.org/10.1016/0377-0427(93)90033-8

zbMATH Keywords

finite elementsfinite differencesspectral methodsmatrix decompositionorthogonal spline collocationmatrix tensor productsseparable elliptic boundary value problems

Mathematics Subject Classification ID

Spectral, collocation and related methods for boundary value problems involving PDEs (65N35) Boundary value problems for second-order elliptic equations (35J25) Finite element, Rayleigh-Ritz and Galerkin methods for boundary value problems involving PDEs (65N30) Finite difference methods for boundary value problems involving PDEs (65N06) Numerical solution of discretized equations for boundary value problems involving PDEs (65N22)

Related Items

Matrix decomposition MFS algorithms for elasticity and thermo-elasticity problems in axisymmetric domains, Matrix decomposition algorithms for the finite element Galerkin method with piecewise Hermite cubics, The plane waves method for axisymmetric Helmholtz problems, A matrix decomposition MFS algorithm for certain linear elasticity problems, A direct solver for the Legendre tau approximation for the two-dimensional Poisson problem, Matrix decomposition algorithms for elliptic boundary value problems: A survey, Matrix decomposition RBF algorithm for solving 3D elliptic problems, Spectral Chebyshev-Fourier collocation for the Helmholtz and variable coefficient equations in a disk, Local RBF Algorithms for Elliptic Boundary Value Problems in Annular Domains, Orthogonal spline collocation methods for partial differential equations, A matrix decomposition MFS algorithm for axisymmetric potential problems, Efficient Kansa-type MFS algorithm for elliptic problems, A matrix decomposition MFS algorithm for axisymmetric biharmonic problems, A matrix decomposition MFS algorithm for problems in hollow axisymmetric domains, The method of fundamental solutions for elliptic problems in circular domains with mixed boundary conditions, B-spline Methods in Fluid Dynamics, Almost block diagonal linear systems: sequential and parallel solution techniques, and applications, Efficient MFS algorithms in regular polygonal domains, Matrix decomposition algorithms for the \(C^{0}\)-quadratic finite element Galerkin method

Uses Software

• ELLPACK
• ABDPACK
• COLROW
• ARCELO

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The sinc method in multiple space dimensions: Model problems
• A fast algorithm for solving the tensor product collocation equations
• Vector and parallel methods for the direct solution of Poisson's equation
• Parallel Poisson and biharmonic solvers
• Collocation methods for parabolic partial differential equations in one space dimension
• Efficient algorithms for solving tensor product finite element equations
• Direct methods for the solution of the discrete Poisson equation: some comparisons
• Direct solution of partial difference equations by tensor product methods
• Tensor Product Generalized ADI Methods for Separable Elliptic Problems
• Matrix and other direct methods for the solution of systems of linear difference equations
• FORTRAN Packages for Solving Certain Almost Block Diagonal Linear Systems by Modified Alternate Row and Column Elimination
• High-Order, Fast-Direct Methods for Separable Elliptic Equations
• Symmetrization of the Sinc-Galerkin Method with Block Techniques for Elliptic Equations
• A Hessenberg-Schur method for the problem AX + XB= C
• Sinc-Collection Methods for Two-Point Boundary Value Problems
• Fast Direct Solvers for Piecewise Hermite Bicubic Orthogonal Spline Collocation Equations
• Algorithm 685: a program for solving separable elliptic equations
• The solution of almost block diagonal linear systems arising in spline collocation at Gaussian points with monomial basis functions
• Algorithm 704: ABDPACK and ABBPACK-FORTRAN programs for the solution of almost block diagonal linear systems arising in spline collocation at Gaussian points with monomial basis functions
• Numerical Solution of Singular Poisson Problems via the Sinc–Galerkin Method
• Matrix Decomposition Algorithms in Orthogonal Spline Collocation for Separable Elliptic Boundary Value Problems
• Algorithm 432 [C2: Solution of the matrix equation AX + XB = C [F4]]
• The Direct Solution of the Discrete Poisson Equation on a Rectangle
• On Direct Methods for Solving Poisson’s Equations
• A Fast Poisson Solver Amenable to Parallel Computation