QR Algorithm for Eigenvalues in Haskell
Budget: $250 – $750 USD
I'm seeking an implementation of the QR algorithm for finding eigenvalues and eigenvectors of a symmetric matrix in Haskell. Key requirements:
Implement Householder tridiagonalization, shifts, and recursive decomposition.
Input: Symmetric matrix M (n x n) and precision ϵ.
Output: Matrix V (eigenvectors) and vector (eigenvalues).
Code must be clear, well-structured, and extensively commented .
Ideal Skills:
Proficiency in Haskell
Experience with the QR Algorithm
Ability to write clear, educational code
i added the data file
Implement Householder tridiagonalization, shifts, and recursive decomposition.
Input: Symmetric matrix M (n x n) and precision ϵ.
Output: Matrix V (eigenvectors) and vector (eigenvalues).
Code must be clear, well-structured, and extensively commented .
Ideal Skills:
Proficiency in Haskell
Experience with the QR Algorithm
Ability to write clear, educational code
i added the data file