An approximate inverse based multigrid approach to the biharmonic problem
DOI10.1080/00207169108804013zbMath0746.65083OpenAlexW1991744583MaRDI QIDQ3991123
R. N. Banerjee, Maurice W. Benson
Publication date: 28 June 1992
Published in: International Journal of Computer Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207169108804013
multigrid methodlarge sparse linear systemsbiharmonic problemfourth order problemshypercube multiprocessorsapproximate inverse multigrid algorithm FAPINbicubic Hermite basic functions
Computational methods for sparse matrices (65F50) Multigrid methods; domain decomposition for boundary value problems involving PDEs (65N55) Boundary value problems for higher-order elliptic equations (35J40) Iterative numerical methods for linear systems (65F10)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Analysis of a Multigrid Method as an Iterative Technique for Solving Linear Systems
- Frequency domain behavior of a set of parallel multigrid smoothing operators
- Parallel algorithms for the solution of certain large sparse linear systems
- High-Order, Fast-Direct Methods for Separable Elliptic Equations
- Icosahedral Discretization of the Two-Sphere
- Multigrid Methods for Variational Problems: General Theory for the V-Cycle
- Hypercube Algorithms and Implementations
- Fast Numerical Solution of the Biharmonic Dirichlet Problem on Rectangles