Svd
Python code implementing the power method for Singular Value Decomposition
Install / Use
/learn @j2kun/SvdREADME
SVD
An implementation of the greedy algorithm for SVD, using the power method for the 1-dimensional case.
For the post Singular Value Decomposition Part 2: Theorem, Proof, Algorithm
And the first (motivational) post in the series: Singular Value Decomposition Part 1: Perspectives on Linear Algebra
Setup
Run the following to set up all the requirements needed to run the code in this repository.
$ virtualenv venv
$ source venv/bin/activate
$ pip install -r requirements.txt
$ bash setup.sh # downloads relevant NLP corpora from nltk
Then run python3 topicmodel.py for the main topic-model routine, svd.py for the core svd algorithm, and demo.py for the numpy examples from the post.
When finished, run $ deactivate to exit the virtual environment.
Related Skills
node-connect
342.0kDiagnose OpenClaw node connection and pairing failures for Android, iOS, and macOS companion apps
claude-opus-4-5-migration
84.7kMigrate prompts and code from Claude Sonnet 4.0, Sonnet 4.5, or Opus 4.1 to Opus 4.5
frontend-design
84.7kCreate distinctive, production-grade frontend interfaces with high design quality. Use this skill when the user asks to build web components, pages, or applications. Generates creative, polished code that avoids generic AI aesthetics.
model-usage
342.0kUse CodexBar CLI local cost usage to summarize per-model usage for Codex or Claude, including the current (most recent) model or a full model breakdown. Trigger when asked for model-level usage/cost data from codexbar, or when you need a scriptable per-model summary from codexbar cost JSON.
