Please use this identifier to cite or link to this item: https://hdl.handle.net/10356/90844
Title: Rate of convergence of some space decomposition methods for linear and nonlinear problems
Authors: Tai, Xue Cheng
Espedal, Magne
Keywords: DRNTU::Science::Mathematics::Analysis
Issue Date: 1998
Source: Tai, X. C., & Espedal, M. (1998). Rate of convergence of some space decomposition methods for linear and nonlinear problems. SIAM Journal on Numerical Analysis, 35(4), 1558-1570.
Series/Report no.: SIAM Journal on Numerical Analysis.
Abstract: Convergence of a space decomposition method is proved for a class of convex programming problems. A space decomposition refers to a method that decomposes a space into a sum of subspaces, which could be a domain decomposition or a multilevel method when applied to partial differential equations. Two algorithms are proposed. Both can be used for linear as well as nonlinear elliptic problems, and they reduce to the standard additive and multiplicative Schwarz methods for linear elliptic problems.
URI: https://hdl.handle.net/10356/90844
http://hdl.handle.net/10220/4603
ISSN: 1095-7170
DOI: 10.1137/S0036142996297461
Rights: SIAM Journal on Numerical Analysis @ Copyright 1998 Society for Industrial and Applied Mathematics. The journal's website is located at http://scitation.aip.org/getabs/servlet/GetabsServlet?prog=normal&id=SJNAAM000035000004001558000001&idtype=cvips&gifs=yes.
Fulltext Permission: open
Fulltext Availability: With Fulltext
Appears in Collections:SPMS Journal Articles

Files in This Item:
File Description SizeFormat 
SIAM1998.pdfPublished version243.14 kBAdobe PDFThumbnail
View/Open

SCOPUSTM   
Citations

59
Updated on Sep 2, 2020

PublonsTM
Citations

57
Updated on Jan 15, 2021

Page view(s) 10

630
Updated on Jan 16, 2021

Download(s) 5

443
Updated on Jan 16, 2021

Google ScholarTM

Check

Altmetric


Plumx

Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.