On the nonlinear domain decomposition method (Q1359968): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
(3 intermediate revisions by 2 users not shown) | |||
Property / author | |||
Property / author: Maksymilian Dryja / rank | |||
Property / author | |||
Property / author: Wolfgang Hackbusch / rank | |||
Property / reviewed by | |||
Property / reviewed by: Raytcho D. Lazarov / rank | |||
Property / author | |||
Property / author: Maksymilian Dryja / rank | |||
Normal rank | |||
Property / author | |||
Property / author: Wolfgang Hackbusch / rank | |||
Normal rank | |||
Property / reviewed by | |||
Property / reviewed by: Raytcho D. Lazarov / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4326654 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Multiplicative Schwarz Algorithms for Some Nonsymmetric and Indefinite Problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4162607 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Domain Decomposition Algorithms with Small Overlap / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3727300 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Iterative solution of large sparse systems of equations. Transl. from the German / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Analysis of a damped nonlinear multilevel method / rank | |||
Normal rank |
Latest revision as of 17:21, 27 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On the nonlinear domain decomposition method |
scientific article |
Statements
On the nonlinear domain decomposition method (English)
0 references
19 July 1998
0 references
The known abstract framework of the subspace iteration method for linear problems is generalized to the nonlinear case. The proposed method requires the solution of local nonlinear problems and a global problem. The presented analysis shows (under relatively weak assumptions) that the nonlinear iteration converges locally at the same asymptotic rate as the corresponding linear iteration applied to the linearized problem. The analysis is similar to the technique developed in the multigrid method for nonlinear problems. Next, conditions which guarantee the global convergence of the method are discussed. It should be noted that the proposed algorithm uses different strategies depending on whether the iterates are in a neighbourhood of the solution or outside.
0 references
nonlinear domain decomposition method
0 references
subspace iteration method
0 references
multigrid method
0 references
global convergence
0 references
algorithm
0 references