.png){kind=icon}
Return
Scalable approximate optimal diagonal preconditioning
.png){kind=icon}
PRE
AI
DOI：10.1007/s10589-026-00770-8.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
We consider the problem of finding the optimal diagonal preconditioner for a positive definite matrix. Although this problem has been shown to be solvable and various methods have been proposed, none of the existing approaches are scalable to matrices of large dimensions or when access is limited to black-box matrix-vector products, thereby significantly limiting their practical application. In view of these challenges, we propose practical algorithms applicable to finding approximate optimal diagonal preconditioners of large sparse systems. Our approach is based on the idea of dimension reduction and combines techniques from semi-definite programming (SDP), random projection, semi-infinite programming (SIP), and column generation. Numerical experiments demonstrate that our method scales to sparse matrices of size greater than 107\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$10<^>7$$\end{document}. Notably, our approach is efficient and implementable using only black-box matrix-vector product operations, making it highly practical for various applications.
Keywords:
Semi-definite programming
Preconditioning
Dimension Reduction
Journal
C
IF:
2
Papers:
74
Citations:
3.5K
Organization
Cited Papers
No cited papers available