Design and data structure of fully adaptive, multigrid, finite-element software. (English) Zbl 0578.65112

The author presents software for dealing with the finite element method approach in order to solve numerically partial differential equations in the following context: a) conforming triangulations are used; b) adaptive mesh refinements are employed for the generation of grids; c) the multigrid method is applied to obtain the numerical solution. On the basis of a), b) and c), a general purpose algorithm is discussed; its flexibility can be useful when dealing with singular or nearly singular differential problems. The main point in the paper is the design of efficient data structure for that algorithm; to cope with this problem, the notion of molecular list structure is introduced. The paper also contains numerical examples and a heuristic confrontation with methods that employ direct solvers for a fixed discretization of the differential problem.
Reviewer: J.P.Milaszewicz


65N30 Finite element, Rayleigh-Ritz and Galerkin methods for boundary value problems involving PDEs
65N50 Mesh generation, refinement, and adaptive methods for boundary value problems involving PDEs
35J25 Boundary value problems for second-order elliptic equations
65F10 Iterative numerical methods for linear systems
Full Text: DOI


[1] BABUSKA, I., The self-adaptive approach in the finite element method. In The Mathematics of Finite Element and Applications, J.R. Whiteman, Ed. Academic Press, New York 1976, pp. 125-143
[2] BABUSKA, I., AND RHEINROLDT, W.C. Computational aspects of finite element method. In Mathematical Software III, J.R. Rice, Ed. Academic Press, New York, 1977, pp. 225-255. · Zbl 0407.68035
[3] BABUSKA, I., AND RHEINBOLDT, W.C. Error estimates for adaptive finite element computations. SIAM J. Numer. Anal. 15 (1978), 736-754. · Zbl 0398.65069
[4] BABUSKA, I., AND RHEINEOLDT, W.C. Reliable error estimation and mesh adaptation for the finite element method. In Computational Methods m Nonlinear Mechanics, J.T. Oden, Ed. Elsevier North Holland, Amsterdam, 1980. 67-108. · Zbl 0451.65078
[5] BANK, R.E. PLTMG Users’ Guide. Dept. of Mathematics, Univ. of California, San Diego, June, 1981 version.
[6] BANK, R.E., AND DUPONT, T. An optimal order process for solving finite element equations. Math Comput., 36 (1981), 35-51. · Zbl 0466.65059
[7] BANK, R.E., AND SHERMAN, A.H. The use of adaptive grid refinement for badly behaved elliptic partial differential equations. In Mathematics and Computers in Simulation XXII, North Holland, Amsterdam, 1980. 18-24. · Zbl 0434.35008
[8] BRANDT, A. Multilevel adaptive solutions to boundary value problems. Math. Comput. 31 (1977), 390. · Zbl 0373.65054
[9] GEORGE, J.A. Computer implementation of the finite element method. Ph.D. dissertation, Stanford Univ., Stanford, Calif. (1971.)
[10] GEORGE, J.A. AND LIU, J.W. Computer Solution of Large Sparse Positive Defmtte Systems. Prentice-Hall, Englewood Cliffs, N.J., 1981. · Zbl 0516.65010
[11] HACKBUSCH, W. On the convergence of multigrid iterations, Beitrage. Numer. Math 9 (1981), 239. · Zbl 0465.65054
[12] HACKBUSCH, W. Multi-grid convergence theory. In Multigrid Methods, Lecture Notes in Mathemattcs 960, W. Hackbusch and U. Trottenberg, Eds. Springer-Verlag, New York, 1982, pp. 177-219 · Zbl 0504.65058
[13] KINCMD, D.R., RZSPl{SS, J.R., YOUNg, D.M., AND GmMES, R.G. Algorithm 586 ITPACK 2C: FORTRAN package for solving large sparse linear systems by adaptive iterative methods. ACM Trans. Math. So#w, 8 3, (Sept. 1982), 302-322.} · Zbl 0485.65025
[14] KNUTH, D.E. The Art of Computer Programming. Vol. 1, Fundamental Algorithms. Addison-Wesley, Reading, Mass., 1968. · Zbl 0191.17903
[15] NICOLAIDES, R.A. On some theoretical and practical aspects of multigrid methods. Math of Comput. 33 (1979), 933-952. · Zbl 0407.65043
[16] RHEINBOLDT, W.C., AND MESZTENYI, C.K. On a data structure for adaptive finite element mesh refinements. ACM Trans. Math. Soft. 6 (June 1980), 166-187. · Zbl 0437.65081
[17] RICE, J.R, HOUSTiS, E.N., AND DYKSEN, W.R. A population of hnear second order elliptic partial differentml equations on rectangular domains. Part I. Math. Comput. 36 (1981), 475-484. · Zbl 0475.65069
[18] RIVAl{A, M.C. Adaptive multigrid software for the finite element method, Ph.D. dissertation Leuven, Belgium. 1984.}
[19] RI VARA, M.C. Algorithms for refining triangular grids suitable for adaptive and multigrid techniques. Int. J. Numer. Methods Eng. 20 (1984), 745-756. · Zbl 0536.65085
[20] RIVARA, M.C. Mesh refinement processes based on the generalized bisection of simplices. SIAM Numer. Anal. To be published. · Zbl 0574.65133
[21] SEWELL, G. A finite element program with automatic, user-controlled mesh grading. In Advances in Computer Methods {or Partial Differential Equations III, R. Vichnevetsky and R.S. Stepleman, Eds. IMACS, Rutgers Univ., New Brunswick, N.J., 1979, pp. 8-10.}
[22] STUBEN, K. NDTROTTENBERGU. Multigrldmethods: Fundamentalalgorlthms, modelproblem analysis and apphcations. In Multigrwl Methods, Lecture Notes m Math. 960, W. Hackbusch and Trottenberg Eds Springer-Verlag, New York, 1982, pp. 1-176. · Zbl 0505.65035
[23] WEISI{R, A. Local-mesh, local-order, adaptive finite element methods with a posteriori error estimators for elliptlc partial differential equations. Tech. Rep. 213. Dept. of Computer Science, Umv., New Haven, CT., 1981.}
[24] YOUNG, D.M. Iterative solutmn of linear systems arising from finite element techniques. In Mathematics of Finite Elements and Applications, J.R. Whiteman Ed. Academic Press, New York, 1976, pp. 439-464.
[25] ZAVE, P., AND RHEINBOLDT, W.C. Design of an adaptive, parallel finite-element system. ACM Trans. Math Soft., 5 (Mar. 1978), 1-17. · Zbl 0401.65066
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. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.