Numerical solution of nonlinear elliptic partial differential equations by a generalized conjugate gradient method
dc.contributor.author | Concus, P. | en_US |
dc.contributor.author | O'Leary, Dianne P. | en_US |
dc.contributor.author | Golub, G. H. | en_US |
dc.date.accessioned | 2006-09-08T19:28:54Z | |
dc.date.available | 2006-09-08T19:28:54Z | |
dc.date.issued | 1978-12 | en_US |
dc.identifier.citation | Concus, P.; Golub, G. H.; O'Leary, D. P.; (1978). "Numerical solution of nonlinear elliptic partial differential equations by a generalized conjugate gradient method." Computing 19(4): 321-339. <http://hdl.handle.net/2027.42/41643> | en_US |
dc.identifier.issn | 1436-5057 | en_US |
dc.identifier.issn | 0010-485X | en_US |
dc.identifier.uri | https://hdl.handle.net/2027.42/41643 | |
dc.description.abstract | We have studied previously a generalized conjugate gradient method for solving sparse positive-definite systems of linear equations arising from the discretization of elliptic partial-differential boundary-value problems. Here, extensions to the nonlinear case are considered. We split the original discretized operator into the sum of two operators, one of which corresponds to a more easily solvable system of equations, and accelerate the associated iteration based on this splitting by (nonlinear) conjugate gradients. The behavior of the method is illustrated for the minimal surface equation with splittings corresponding to nonlinear SSOR, to approximate factorization of the Jacobian matrix, and to elliptic operators suitable for use with fast direct methods. The results of numerical experiments are given as well for a mildy nonlinear example, for which, in the corresponding linear case, the finite termination property of the conjugate gradient algorithm is crucial. Wir haben früher eine verallgemeinerte Methode der konjugierten Gradienten studiert, um dünnbesetzte positiv definite Systeme von linearen Gleichungen zu lösen, die von der Diskretisierung von elliptischen partiellen Differential-Randwertproblemen herrühren. Wir betrachten hier die Verallgemeinerung auf den nichtlinearen Fall: Wir spalten den ursprünglichen diskretisierten Operator auf in eine Summe von zwei Operatoren. Einer von diesen Operatoren entspricht einem leicht lösbaren System von Gleichungen, und wir beschleunigen die aus dieser Spaltung hervorgehende Iteration mit (nichtlinearen) konjugierten Gradienten. Das Verhalten der Methode wird illustriert durch Anwendung auf die Minimalflächen-Gleichung, mit Spaltungen entsprechend dem nichtlinearen SSOR-Verfahren, der angenäherten Faktorisierung der Jacobi-Matrix, oder den elliptischen Operatoren, die sich für schnelle direkte Methoden eignen. Die Resultate von numerischen Experimenten für ein nur schwach nichtlineares Beispiel sind ebenfalls angegeben. Für den entsprechenden linearen Fall ist in diesem Fall die Konvergenz des konjugierten Gradienten-Algorithmus in einer endlichen Anzahl von Schritten wesentlich. | en_US |
dc.format.extent | 1051169 bytes | |
dc.format.extent | 3115 bytes | |
dc.format.mimetype | application/pdf | |
dc.format.mimetype | text/plain | |
dc.language.iso | en_US | |
dc.publisher | Springer-Verlag | en_US |
dc.subject.other | Computational Mathematics and Numerical Analysis | en_US |
dc.subject.other | Mathematics | en_US |
dc.title | Numerical solution of nonlinear elliptic partial differential equations by a generalized conjugate gradient method | en_US |
dc.type | Article | en_US |
dc.subject.hlbsecondlevel | Philosophy | en_US |
dc.subject.hlbsecondlevel | Computer Science | en_US |
dc.subject.hlbtoplevel | Humanities | en_US |
dc.subject.hlbtoplevel | Engineering | en_US |
dc.description.peerreviewed | Peer Reviewed | en_US |
dc.contributor.affiliationum | Department of Mathematics, University of Michigan, 48109, Ann Arbor, MI, USA | en_US |
dc.contributor.affiliationother | Computer Science Department, Stanford University, 94305, Stanford, CA, USA | en_US |
dc.contributor.affiliationother | Lawrence Berkeley Laboratory, University of California, 94720, Berkeley, CA, USA | en_US |
dc.contributor.affiliationumcampus | Ann Arbor | en_US |
dc.description.bitstreamurl | http://deepblue.lib.umich.edu/bitstream/2027.42/41643/1/607_2005_Article_BF02252030.pdf | en_US |
dc.identifier.doi | http://dx.doi.org/10.1007/BF02252030 | en_US |
dc.identifier.source | Computing | en_US |
dc.owningcollname | Interdisciplinary and Peer-Reviewed |
Files in this item
Remediation of Harmful Language
The University of Michigan Library aims to describe library materials in a way that respects the people and communities who create, use, and are represented in our collections. Report harmful or offensive language in catalog records, finding aids, or elsewhere in our collections anonymously through our metadata feedback form. More information at Remediation of Harmful Language.
Accessibility
If you are unable to use this file in its current format, please select the Contact Us link and we can modify it to make it more accessible to you.