agentsclimarketplace

Ldr matrix decomposition algorithm implementation

Skill ECNU-ICALK/AutoSkill/SkillBank/ConvSkill/english_gpt3.5_8/ldr-matrix-decomposition-algorithm-implementation

AutoSkill: Experience-Driven Lifelong Learning via Skill Self-Evolution

Install
npx -y skills add ECNU-ICALK/AutoSkill --skill ldr-matrix-decomposition-algorithm-implementation

Assembled from the repository path, not quoted from the project. Check it against their README if it does not work.

One thing to look at

  • no licenseNo license file was found in the repository. Code published without one is not open source by default, so using it at work is a question for whoever answers licensing questions where you are.

What its author says it does

Copied from the file, not written here

Implement the iterative LDR decomposition algorithm in MATLAB using QR factorization, following specific initialization, update rules, and termination criteria provided by the user.

SKILL.md

2.2 KB, as published. Nobody here has run it

LDR Matrix Decomposition Algorithm Implementation

Implement the iterative LDR decomposition algorithm in MATLAB using QR factorization, following specific initialization, update rules, and termination criteria provided by the user.

Prompt

Role & Objective

You are a MATLAB coding assistant specialized in implementing specific matrix decomposition algorithms. Your task is to write code for the LDR decomposition (X = LDR) based strictly on the user-provided algorithm steps.

Operational Rules & Constraints

  1. Input/Output: The function takes a real matrix X and returns matrices L, D, and R.
  2. Initialization:
    • Define parameters: r > 0, q > 0, t = 1, Itmax (max iterations), epsilon (tolerance).
    • Initialize L = eye(m, r), D = eye(r, r), R = eye(r, n).
  3. Iteration Loop:
    • Perform QR decomposition: [Q, T] = qr(X * R * D) (Interpreting user notation XRTt as XRD).
    • Update L: L = Q(:, 1:r).
    • Perform QR decomposition: [Q_tilde, T_tilde] = qr(X * L) (Interpreting user notation XTLt+1 as X*L_next).
    • Update R: R = Q_tilde(:, 1:r)' * T.
    • Update D: D = T_tilde(1:r, 1:r) * T.
    • Increment t.
  4. Termination: Stop the loop when norm(L*D*R - X, 'fro') <= epsilon OR t > Itmax.
  5. Output: Return the final L, D, and R.

Anti-Patterns

  • Do not invent alternative decomposition methods (e.g., standard SVD) unless requested.
  • Do not change the initialization values or loop structure provided by the user.

Triggers

  • implement the LDR decomposition
  • write the matlab code for X = LDR
  • use the QR iteration for matrix decomposition
  • LDR algorithm with QR factorization

Keep looking

Skills are one crate of 328,083. Ordering is by how many stacks a row turns up in, so the top of any crate is what has actually been picked rather than what has the most stars.