×

Stabilized and block approximate inverse preconditioners for problems in solid and structural mechanics. (English) Zbl 1021.74041

Summary: We consider the solution of linear systems arising in finite element analysis of shells and solids by the preconditioned conjugate gradient method. Stabilized and block versions of the AINV factorized approximate inverse preconditioner are presented and tested on a variety of problems. Comparisons with other preconditioning methods are also included.

MSC:

74S05 Finite element methods applied to problems in solid mechanics
65F10 Iterative numerical methods for linear systems
74K25 Shells

Software:

BPKit; MatrixMarket
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Ajiz, M. A.; Jennings, A., A robust incomplete Cholesky conjugate gradient algorithm, Int. J. Numer. Methods Engrg., 20, 949-966 (1984) · Zbl 0541.65019
[2] Allman, D. J., A compatible triangular element including vertex rotations for plane elasticity analysis, Comput. Struct., 19, 1-8 (1984) · Zbl 0548.73049
[3] Arioli, M.; Duff, I. S.; Ruiz, D., Stopping criteria for iterative solvers, SIAM J. Matrix Anal. Appl., 13, 138-144 (1992) · Zbl 0749.65023
[4] Ashcraft, C., Compressed graphs and the minimum degree algorithm, SIAM J. Sci. Comput., 16, 1404-1411 (1995) · Zbl 0837.65015
[5] Axelsson, O., Iterative Solution Methods (1994), Cambridge University Press: Cambridge University Press Cambridge, MA · Zbl 0795.65014
[6] S.T. Barnard, M.J. Grote, A block version of the SPAI preconditioner, in: B.A. Hendrickson et al. (Eds.), Proceedings of the Ninth SIAM Conference on Parallel Processing for Scientific Computing, SIAM, Philadelphia, PA, 1999 [CD-ROM]; S.T. Barnard, M.J. Grote, A block version of the SPAI preconditioner, in: B.A. Hendrickson et al. (Eds.), Proceedings of the Ninth SIAM Conference on Parallel Processing for Scientific Computing, SIAM, Philadelphia, PA, 1999 [CD-ROM]
[7] Benzi, M.; Cullum, J. K.; Tůma, M., Robust approximate inverse preconditioning for the conjugate gradient method, SIAM J. Sci. Comput., 22, 1318-1332 (2000) · Zbl 0985.65035
[8] Benzi, M.; Kouhia, R.; Tůma, M., An assessment of some preconditioning techniques in shell problems, Comm. Numer. Methods Engrg., 14, 897-906 (1998) · Zbl 0920.73348
[9] M. Benzi, J. Marı́n, M. Tůma, A two-level parallel preconditioner based on sparse approximate inverses, in: D.R. Kincaid, A.C. Elster, (Eds.), Iterative Methods in Scientific Computation IV, IMACS Series in Computational and Applied Mathematics, vol. 5, IMACS, New Brunswick, NJ, 1999, pp. 167-178; M. Benzi, J. Marı́n, M. Tůma, A two-level parallel preconditioner based on sparse approximate inverses, in: D.R. Kincaid, A.C. Elster, (Eds.), Iterative Methods in Scientific Computation IV, IMACS Series in Computational and Applied Mathematics, vol. 5, IMACS, New Brunswick, NJ, 1999, pp. 167-178
[10] Benzi, M.; Meyer, C. D.; Tůma, M., A sparse approximate inverse preconditioner for the conjugate gradient method, SIAM J. Sci. Comput., 17, 1135-1149 (1996) · Zbl 0856.65019
[11] Benzi, M.; Tůma, M., Orderings for factorized sparse approximate inverse preconditioners, SIAM J. Sci. Comput., 21, 1851-1868 (2000) · Zbl 0959.65047
[12] Bergamaschi, L.; Pini, G.; Sartoretto, F., Approximate inverse preconditioning in the parallel solution of sparse eigenproblems, Numer. Linear Algebra Appl., 7, 99-116 (2000) · Zbl 0982.65038
[13] R. Bridson, Multi-resolution approximate inverses, M.Sc. thesis, University of Waterloo, Ontario, Canada, 1999; R. Bridson, Multi-resolution approximate inverses, M.Sc. thesis, University of Waterloo, Ontario, Canada, 1999
[14] Bridson, R.; Tang, W.-P., Ordering, anisotropy, and factored sparse approximate inverses, SIAM J. Sci. Comput., 21, 867-882 (1999) · Zbl 0955.65018
[15] Bridson, R.; Tang, W.-P., Refining an approximate inverse, J. Comput. Appl. Math., 123, 293-306 (2000) · Zbl 0982.65035
[16] Challacombe, M., A simplified density matrix minimization for linear scaling self-consistent field theory, J. Chem. Phys., 110, 2332-2342 (1999)
[17] Challacombe, M., A general parallel sparse-blocked matrix multiply for linear scaling SCF theory, Comp. Phys. Comm., 128, 93-107 (2000) · Zbl 1003.81582
[18] H. Choi, D.B. Szyld, Application of threshold partitioning of sparse matrices to Markov chains, in: Proceedings of IEEE International Computer Performance and Dependability Symposium, IPDS’96, Urbana-Champaign, IN, September 4-6, 1996, IEEE Computer Society Press, Los Alamitos, CA, 1996, pp. 158-165; H. Choi, D.B. Szyld, Application of threshold partitioning of sparse matrices to Markov chains, in: Proceedings of IEEE International Computer Performance and Dependability Symposium, IPDS’96, Urbana-Champaign, IN, September 4-6, 1996, IEEE Computer Society Press, Los Alamitos, CA, 1996, pp. 158-165
[19] Chow, E., A priori sparsity patterns for parallel approximate inverse preconditioners, SIAM J. Sci. Comput., 21, 1804-1822 (2000) · Zbl 0957.65023
[20] Chow, E.; Heroux, M. A., An object-oriented framework for block preconditioning, ACM Trans. Math. Software, 24, 159-183 (1998) · Zbl 0930.65052
[21] Chow, E.; Saad, Y., Approximate inverse techniques for block-partitioned matrices, SIAM J. Sci. Comput., 18, 1657-1675 (1997) · Zbl 0888.65035
[22] Dongarra, J. J.; Duff, I. S.; Sorensen, D. C.; van der Vorst, H. A., Numerical Linear Algebra for High-Performance Computers (1998), SIAM: SIAM Philadelphia, PA · Zbl 0914.65014
[23] Duff, I. S.; Erisman, A. M.; Reid, J. K., Direct Methods for Sparse Matrices (1986), Oxford University Press: Oxford University Press Oxford · Zbl 0604.65011
[24] Duff, I. S.; Meurant, G., The effect of ordering on preconditioned conjugate gradients, BIT, 29, 635-657 (1989) · Zbl 0687.65037
[25] M.R. Field, Improving the performance of factorised sparse approximate inverse preconditioner, Technical Report HDL-TR-98-199, Hitachi Dublin Laboratory, Dublin, Ireland, 1998; M.R. Field, Improving the performance of factorised sparse approximate inverse preconditioner, Technical Report HDL-TR-98-199, Hitachi Dublin Laboratory, Dublin, Ireland, 1998
[26] Hughes, T. J.R.; Brezzi, F., On drilling degrees of freedom, Comput. Methods Appl. Mech. Engrg., 72, 105-121 (1989) · Zbl 0691.73015
[27] T.J.R. Hughes, F. Brezzi, A. Masud, I. Harari, Finite elements with drilling degrees of freedom: theory and numerical evaluations, in: R. Gruber, J. Periaux, R.P. Shaw (Eds.), Proceedings of the Fifth International Symposium on Numerical Methods in Engineering, Springer, Berlin, 1989, pp. 3-17; T.J.R. Hughes, F. Brezzi, A. Masud, I. Harari, Finite elements with drilling degrees of freedom: theory and numerical evaluations, in: R. Gruber, J. Periaux, R.P. Shaw (Eds.), Proceedings of the Fifth International Symposium on Numerical Methods in Engineering, Springer, Berlin, 1989, pp. 3-17
[28] Hughes, T. J.R.; Masud, A.; Harari, I., Numerical assessment of some membrane elements with drilling degrees of freedom, Comput. Struct., 55, 297-314 (1995) · Zbl 0918.73146
[29] Ibrahimbegović, A.; Taylor, R. L.; Wilson, E. L., A robust quadrilateral membrane finite element with drilling degrees of freedom, Int. J. Numer. Methods Engrg., 30, 445-457 (1990) · Zbl 0729.73207
[30] Kharchenko, S. A.; Kolotilina, L. Yu.; Nikishin, A. A.; Yeremin, A. Yu., A robust AINV-type method for constructing sparse approximate inverse preconditioners in factored form, Numer. Linear Algebra Appl., 8, 165-179 (2001) · Zbl 1051.65057
[31] Kolotilina, L. Yu.; Nikishin, A. A.; Yeremin, A. Yu., Factorized sparse approximate inverse preconditioning IV: simple approaches to rising efficiency, Numer. Linear Algebra Appl., 6, 515-531 (1999) · Zbl 0983.65062
[32] Kolotilina, L. Yu.; Yeremin, A. Yu., Factorized sparse approximate inverse preconditioning I: Theory, SIAM J. Matrix Anal. Appl., 14, 45-58 (1993) · Zbl 0767.65037
[33] R. Kouhia, Using iterative solvers in non-linear continuation algorithm, in: J. Aalto, T. Salmi (Eds.), Proceedings of the 6th Finnish Mechanics Days, 1997, pp. 253-267; R. Kouhia, Using iterative solvers in non-linear continuation algorithm, in: J. Aalto, T. Salmi (Eds.), Proceedings of the 6th Finnish Mechanics Days, 1997, pp. 253-267
[34] Kouhia, R.; Mikkola, M., Tracing the equilibrium path beyond compound critical points, Int. J. Numer. Methods Engrg., 46, 1049-1074 (1999) · Zbl 0967.74065
[35] Liu, J. W.H.; Ng, E. G.; Peyton, B. W., On finding supernodes for sparse matrix computations, SIAM J. Matrix Anal. Appl., 14, 242-252 (1993) · Zbl 0765.65034
[36] Lyly, M.; Stenberg, R.; Vihinen, T., A stable bilinear element for the Reissner-Mindlin plate model, Comput. Methods Appl. Mech. Engrg., 110, 343-357 (1993) · Zbl 0846.73065
[37] Meurant, G., Numerical experiments in computing bounds for the norm of the error in the preconditioned conjugate gradient method, Numer. Algorithms, 22, 353-365 (1999) · Zbl 0954.65025
[38] Meurant, G., Computer Solution of Large Linear Systems (1999), North-Holland: North-Holland Amsterdam · Zbl 0934.65032
[39] National Institute of Standards, Matrix Market, available online at http://math.nist.gov/MatrixMarket; National Institute of Standards, Matrix Market, available online at http://math.nist.gov/MatrixMarket
[40] E. Ng, B.W. Peyton, P. Raghavan, A blocked incomplete Cholesky preconditioner for hierarchical-memory computers, in: D.R. Kincaid, A.C. Elster (Eds.), Iterative Methods in Scientific Computation IV, IMACS Series in Computational and Applied Mathematics, vol. 5, 1999, pp. 211-221; E. Ng, B.W. Peyton, P. Raghavan, A blocked incomplete Cholesky preconditioner for hierarchical-memory computers, in: D.R. Kincaid, A.C. Elster (Eds.), Iterative Methods in Scientific Computation IV, IMACS Series in Computational and Applied Mathematics, vol. 5, 1999, pp. 211-221
[41] O’Neil, J.; Szyld, D. B., A block ordering method for sparse matrices, SIAM J. Sci. Stat. Comput., 11, 811-823 (1990) · Zbl 0706.65021
[42] Saad, Y., Iterative Methods for Sparse Linear Systems (1996), PWS Publishing Co: PWS Publishing Co Boston, MA · Zbl 1002.65042
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.