.png){kind=icon}
返回
Robust subspace correction methods for nearly singular systems
.png){kind=icon}
PRE
AI
DOI：10.1142/S0218202507002522.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper, we discuss convergence results for general (successive) subspace correction methods for solving nearly singular systems of equations. We provide parameter independent estimates under appropriate assumptions on the subspace solvers and space decompositions. The main assumption is that any component in the kernel of the singular part of the system can be decomposed into a sum of local (in each subspace) kernel components. This assumption also covers the case of ''hidden'' nearly singular behavior due to decreasing mesh size in the systems resulting from finite element discretizations of second order elliptic problems. To illustrate our abstract convergence framework, we analyze a multilevel method for the Neumann problem (H(grad) system), and also two-level methods for H(div) and H(curl) systems.
Keyword:
nearly singular problems
subspace corrections
nonexpansive operators
multigrid, domain decomposition
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3
论文数:
2.2K
被引数:
4.6K
机构
引用论文
Handedness and lateral positioning in heterosexual couples: Are men still strong-arming women?.png)
Sex Roles
Sex RolesIF0
PREAI
分享收藏
查看更多内容