





















Abstract:This paper presents a Jacobi-type iteration for computing a given specified eigenpair of a symmetric matrix. For a certain class of diagonally dominant matrices, the procedure is shown to converge at a linear rate depending on how the matrix is significantly dominated. The cost per iteration is generally quadratic. Therefore, the proposed procedure can compute an approximation of the desired eigenpair in quadratic time.
| Subjects: | Numerical Analysis (math.NA) |
| MSC classes: | 65F15 |
| Cite as: | arXiv:2605.25613 [math.NA] |
| (or arXiv:2605.25613v1 [math.NA] for this version) | |
| https://doi.org/10.48550/arXiv.2605.25613 arXiv-issued DOI via DataCite (pending registration) |
From: Luca Gemignani [view email]
[v1]
Mon, 25 May 2026 09:11:34 UTC (7,180 KB)
此内容由惯性聚合(RSS阅读器)自动聚合整理,仅供阅读参考。 原文来自 — 版权归原作者所有。