High-Order, Fast-Direct Methods for Separable Elliptic Equations
From MaRDI portal
Recommendations
- Algorithm 685: a program for solving separable elliptic equations
- Matrix Decomposition Algorithms in Orthogonal Spline Collocation for Separable Elliptic Boundary Value Problems
- Matrix decomposition algorithms for separable elliptic boundary value problems in two space dimensions
- Fast algorithms for high-order spline collocation systems
- A Parallel Fast Direct Solver for Block Tridiagonal Systems with Separable Matrices of Arbitrary Dimension
Cited in
(14)- Matrix decomposition algorithms for the \(C^{0}\)-quadratic finite element Galerkin method
- The Dirichlet and Neumann problems for elliptical equations with conjugation conditions and high-precision algorithms of their discretization
- Matrix decomposition algorithms for separable elliptic boundary value problems in two space dimensions
- Quasi-Trefftz spectral method for separable linear elliptic equations
- Tensor Product Generalized ADI Methods for Separable Elliptic Problems
- An approximate inverse based multigrid approach to the biharmonic problem
- Algorithm 685: a program for solving separable elliptic equations
- B-spline Methods in Fluid Dynamics
- Matrix decomposition algorithms for arbitrary order \(C^0\) tensor product finite element systems
- Fast and stable contour integration for high order divided differences via elliptic functions
- Fast Direct Solvers for Elliptic PDEs
- Orthogonal Spline Collocation for Poisson’S Equation with Neumann Boundary Conditions
- Matrix decomposition algorithms for elliptic boundary value problems: A survey
- The sinc method in multiple space dimensions: Model problems
This page was built for publication: High-Order, Fast-Direct Methods for Separable Elliptic Equations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3702457)