Abstract
The approximation to the solution of large sparse symmetric linear problems arising from nonlinear systems of equations is considered. We are focusing herein on reusing information from previous processes while solving a succession of linear problems with a Conjugate Gradient algorithm. We present a new Rayleigh–Ritz preconditioner that is based on the Krylov subspaces and superconvergence properties, and consists of a suitable reuse of a given set of Ritz vectors. The relevance and the mathematical foundations of the current approach are detailed and the construction of the preconditioner is presented either for the unconstrained or the constrained problems. A corresponding practical preconditioner for iterative domain decomposition methods applied to nonlinear elasticity is addressed, and numerical validation is performed on a poorly-conditioned large-scale practical problem.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Z. Bai and J.W. Demmel, On the block implementation of Hessenberg multishift QR iteration, Internat. J. High Speed Comput. 1 (1989) 97–112.
J. Ball, Convexity conditions and existence theorems in nonlinear elasticity, Arch. Rational Mech. Anal. 63 (1977) 337–403.
F. Brezzi and M. Fortin, Mixed and Hybrid Finite Element Methods, Springer Series in Computational Mathematics (Springer, Berlin, 1991).
P.G. Ciarlet, The Finite Element Method for Elliptic Problems (North-Holland, Amsterdam, 1978).
P.G. Ciarlet and G. Geymonat, Sur les lois de comportement en élasticité non linéaire compressible, Comptes Rendus Acad. Sci. Paris Série II295 (1982) 423–426.
P.G. Ciarlet, Mathematical Elasticity (North-Holland, Amsterdam, 1988).
P. Concus, G.H. Golub and D.P. O'Leary, A generalized Conjugate Gradient method for the numerical solution of elliptic partial differential equations, in: Sparse Matrix Computation, eds. J.R. Bunch and D.J. Rose (Academic Press, New York, 1979) pp. 309–332.
C. Farhat and F.-X. Roux, Implicit parallel processing in structural mechanics, Comput. Mech. Adv. 2(1) (1994).
C. Farhat, P.-S. Chen, F. Risler and F.-X. Roux, A simple and unified framework for accelerating the convergence of iterative substructuring methods with Lagrange multipliers, Internat. J. Numer. Methods. Engrg. (in press).
G.H. Golub and C.F. Van Loan, Matrix Computation (North Oxford Academic, Oxford, 1983).
W. Karush, An iterative method for finding characteristic vectors of a symmetric matrix, Pacific J. Math. 1 (1950) 233–248.
H.B. Keller, The bordering algorithm and path following near singular points of higher nullity, SIAM J. Sci. Statist. Comput. 4 (1983) 573–582.
P. Le Tallec, Numerical analysis of equilibrium problems in finite elasticity, Cahier de la Décision, CEREMADE 9021, Université Paris–Dauphine (1990).
P. Le Tallec, Implicit parallel processing in structural mechanics, Comput. Mech. Adv. 1(1) (1994).
J. Mandel, R. Tezaur and C. Farhat, An optimal Lagrange multiplier based domain decomposition method for plate bending problems, SIAM J. Sci. Statist. Comput. (in press).
C.C. Paige, Some aspects of generalized QR factorization, in: Reliable Numerical Computation, eds. M. Cox and S. Hammarling (Clarendon Press, Oxford, 1990).
C.C. Paige, B.N. Parlett and H.A. Van der Vorst, Approximate solutions and eigenvalue bounds from Krylov subspaces, Numer. Linear Algebra Appl. 2 (1995) 115–133.
B.N. Parlett, The Symmetric Eigenvalue Problem (Prenctice-Hall, Englewood Cliffs, NJ, 1980).
B.N. Parlett, A new look at the Lanczos algorithm for solving symmetric systems of linear equations, Linear Algebra Appl. 20 (1980) 323–346.
C. Rey, Une technique d'accélération de la résolution de problèmes d'élasticité non linéaire par décomposition de domaines, Comptes Rendus Acad. Sci. Paris Série II b 322 (1996) 601–606.
C. Rey and F. Risler, A Krylov subspaces based preconditioner for the iterative solution to a succession of linear problems – Part I: General framework, Rapport LM2S 1-697, submitted (1997).
F.-X. Roux, Méthode de décomposition de domaine à l'aide de multiplicateurs de Lagrange et application à la résolution en parallèle des équations de l'élasticité linéaire, Thèse de Doctorat de l'Université Paris VI (1989).
Y. Saad, Numerical methods for large eigenvalue problems, in: Algorithms and Architecture for Advanced Scientific Computing (1991).
A. Van der Sluis and H.A. Van der Vorst, The rate of convergence of conjugate gradients, Numer. Math. 48 (1986) 543–560.
D.S. Watkins and L. Elsner, Convergence of algorithms of decomposition type for eigenvalue problem, Linear Algebra Appl. 143 (1991) 19–47.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Rey, C., Risler, F. A Rayleigh–Ritz preconditioner for the iterative solution to large scale nonlinear problems. Numerical Algorithms 17, 279–311 (1998). https://doi.org/10.1023/A:1016680306741
Issue Date:
DOI: https://doi.org/10.1023/A:1016680306741