Description: Implementation of a conjugate-gradient type method for solving sparse linear equations:
Solve Ax = b or (A- sI)x = b.
The matrix A- sI must be symmetric but it may be definite or indefinite or singular. The scalar s is a shifting parameter – it may be any number. The method is based on Lanczos tridiagonalization. You may provide a preconditioner, but it must be positive definite.
- [arnoldi] - numerical analysis classic arnoldi algor
- [mifaandfanmifa] - calculated eigenvalues and eigenvectors
- [rtejfgds] - existing algebra feature extraction meth
- [CG] - Solving large-scale symmetric matrix of
- [LFMsignalpulsecompressionandthemodulationrealizati] - This article unifies L the FM signal pul
- [vol2.pdf] - chapters of Lanczos Algorithms by Jane C
- [GMRES] - For solving large linear equations of th
- [HASO] - The Higher-Order Spectral Analysis Toolb
- [SVD] - Least Squares Estimates of the SVD decom
File list (Check if you may need any files):
diagA.m
minres.m
test1.m
Download