×

On a construction of fast direct solvers. (English) Zbl 1099.65027

The author constructs fast direct solvers for the Poisson equation with homogeneous Dirichlet and Neumann boundary conditions on special triangles and tetrahedra. The construction is performed in such a way that the given domain is extended by symmetrization or skew symmetrization onto a rectangle or a rectangular parallelepiped, and a fast direct solver is used there. All extendable domains are found.

MSC:

65F05 Direct numerical methods for linear systems and matrix inversion
65N22 Numerical solution of discretized equations for boundary value problems involving PDEs
PDF BibTeX XML Cite
Full Text: DOI EuDML

References:

[1] M. Práger: Eigenvalues and eigenfunctions of the Laplace operator on an equilateral triangle. Appl. Math. 43 (1998), 311-320. · Zbl 0940.35059
[2] M. Práger: Eigenvalues and eigenfunctions of the Laplace operator on an equilateral triangle for the discrete case. Appl. Math. 46 (2001), 231-239. · Zbl 1059.65101
[3] Handbook of Convex Geometry. P. M. Gruber, J. M. Wills (eds.), Elsevier Science Publishers B.V., 1993. · Zbl 0777.52002
[4] R. W. Hockney: A fast direct solution of Poisson’s equation using Fourier analysis. J. Assoc. Comp. Mach. 12 (1965), 95-113. · Zbl 0139.10902
[5] J. W. Cooley J. W. Tukey: An algorithm for the machine calculation of complex Fourier series. Math. Comp. 19 (1965), 297-301. · Zbl 0127.09002
[6] P. A. Swarztrauber: The methods of cyclic reduction, Fourier analysis and the FACR algorithm for the discrete solution of Poisson’s equation on a rectangle. SIAM Review 19 (1977), 490-501. · Zbl 0358.65088
[7] D. M. Y. Sommerville: Space-filling tetrahedra in Euclidean space. Proc. Edinburgh Math. Soc. 41 (1923), 49-57.
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.