.png){kind=icon}
Return
Lanczos algorithm explained in statistics
.png){kind=icon}
OA
AI
DOI：10.1016/j.rinam.2025.100666.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The Lanczos algorithm is a well-known three-term recurrence that can be used to generate an orthogonal basis for a Krylov subspace derived by a symmetric matrix. In the paper, we present a statistical interpretation of the entries of the tridiagonal matrix generated by the Lanczos process with a diagonal matrix X and an initial vector e. We show that the entries on the main diagonal line can be interpreted as weighted mean and the entries on the super-diagonal line can be understood as weighted sum of variance. Besides, a recurrence for producing the entries on the off-diagonal entries of the tridiagonal matrix is discovered, which leads to a new implementation of the Lanczos process. Finally, numerical examples are provided to investigate the preservation of orthogonality and efficiency in data fitting.
Keywords:
Lanczos algorithm
Krylov subspace
Orthogonalization
Mean
Variance
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
R
IF:
1.3
Papers:
81
Citations:
0
Organization
Cited Papers
.png){kind=icon}
ShareSave
ShareSaveShareSaveShareSaveShareSave
View more