.png){kind=icon}
.png){kind=icon}
Return
Preconditioners for regularized saddle point matrices
.png){kind=icon}
PRE
AI
DOI：10.1515/JNUM.2011.005.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Saddle point problems with singular or indefinite pivot blockmatrix arise in various applications. In some problems it may be necessary to regularize the corresponding matrix is some way. By straightforward derivations it is shown that use of certain preconditioners on block diagonal and block triangular form can be very efficient, both for the original matrix and for its regularized forms. As the value of regularization parameter increases, the eigenvalues cluster at unity or at just two points on the real line.
Keywords:
saddle point matrices
preconditioning
regularization
eigenvalue clustering
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
4
Papers:
308
Citations:
659
Organization
No organization information available