Hauptseite > Externe Publikationen > Vita Publikationen > Using nonlinear domain decomposition as smoother in nonlinear multigrid > print

001     1019407
005     20231213202054.0
037 _ _ |a FZJ-2023-05367
041 _ _ |a English
100 1 _ |a Babamehdi, Mehdi
|0 P:(DE-Juel1)186758
|b 0
|u fzj
111 2 _ |a SIAM-CSE
|c Amsterdam
|d 2023-02-26 - 2023-03-03
|w Netherlands
245 _ _ |a Using nonlinear domain decomposition as smoother in nonlinear multigrid
260 _ _ |c 2023
336 7 _ |a Conference Paper
|0 33
|2 EndNote
336 7 _ |a INPROCEEDINGS
|2 BibTeX
336 7 _ |a conferenceObject
|2 DRIVER
336 7 _ |a CONFERENCE_POSTER
|2 ORCID
336 7 _ |a Output Types/Conference Poster
|2 DataCite
336 7 _ |a Poster
|b poster
|m poster
|0 PUB:(DE-HGF)24
|s 1702479612_10687
|2 PUB:(DE-HGF)
|x After Call
520 _ _ |a Nonlinear partial differential equations frequently arise in different fields ofscience. Discretization of the nonlinear problems usually leads to large non-linear systems. Solution of such big discretized nonlinear problems needsfast, highly scalable, and parallelize solvers.Nonlinear multigrid is a well-known method for efficiently solving nonlin-ear boundary value problems. The full approximation scheme (FAS) solvesnonlinear problems on fine and coarse grids. To smooth the nonlinear prob-lem a suitable nonlinear solver is needed and since a matrix-free implemen-tation is desirable, this form of implementation of the smoother should beplausible. For this purpose, the nonlinear additive Schwarz method (NASM)seems to be an appropriate choice. NASM converges with the same rateas linear iterations applied to the linearised equation. In addition, it is inher-ently parallel and proper to be implemented in matrix-free form.We combine FAS and NASM to obtain hybrid NASM/FAS. The FAS solvesthe nonlinear problem and the NASM is the smoother of the nonlinearboundary value problem in local subdomains on each level of the multigridmethod. Within the NASM, Jacobian-Free Newton Krylov method is usedas a solver on each subdomain. We consider different nonlinear equationsin 3D space as test problems. We investigated several parameters of themethods to have a better understanding of influence of the parameters onthe efficiency of the method and its convergence rate.
536 _ _ |a 5112 - Cross-Domain Algorithms, Tools, Methods Labs (ATMLs) and Research Groups (POF4-511)
|0 G:(DE-HGF)POF4-5112
|c POF4-511
|f POF IV
|x 0
856 4 _ |u https://juser.fz-juelich.de/record/1019407/files/FZJ_Poster_hoch.pdf
|y Restricted
856 4 _ |u https://juser.fz-juelich.de/record/1019407/files/FZJ_Poster_hoch.gif?subformat=icon
|x icon
|y Restricted
856 4 _ |u https://juser.fz-juelich.de/record/1019407/files/FZJ_Poster_hoch.jpg?subformat=icon-1440
|x icon-1440
|y Restricted
856 4 _ |u https://juser.fz-juelich.de/record/1019407/files/FZJ_Poster_hoch.jpg?subformat=icon-180
|x icon-180
|y Restricted
856 4 _ |u https://juser.fz-juelich.de/record/1019407/files/FZJ_Poster_hoch.jpg?subformat=icon-640
|x icon-640
|y Restricted
909 C O |o oai:juser.fz-juelich.de:1019407
|p extern4vita
910 1 _ |a Forschungszentrum Jülich
|0 I:(DE-588b)5008462-8
|k FZJ
|b 0
|6 P:(DE-Juel1)186758
913 1 _ |a DE-HGF
|b Key Technologies
|l Engineering Digital Futures – Supercomputing, Data Management and Information Security for Knowledge and Action
|1 G:(DE-HGF)POF4-510
|0 G:(DE-HGF)POF4-511
|3 G:(DE-HGF)POF4
|2 G:(DE-HGF)POF4-500
|4 G:(DE-HGF)POF
|v Enabling Computational- & Data-Intensive Science and Engineering
|9 G:(DE-HGF)POF4-5112
|x 0
920 _ _ |l no
980 1 _ |a EXTERN4VITA
980 _ _ |a poster
980 _ _ |a USER
980 _ _ |a I:(DE-Juel1)JSC-20090406

LibraryCollectionCLSMajorCLSMinorLanguageAuthor
Marc 21