Krylov subspace methods, Arnoldi method

Open
#107 1 comment 0 reactions 0 assignees View on GitHub

Nobody has claimed this yet.

Assessment

Difficulty
5/5
Estimated time
Over a week
Newbie friendliness
30/100
Issue type
Feature
Clarity
Mostly clear
Activity status
Stale
Tech stack
rust
Domain
backend

Research direction

Review the completed iterative QR decomposition and Arnoldi interface work listed in the issue before starting. Implement GMRES as the requested example and test; the issue names no files or test entry points, so locate the existing Arnoldi API and its testing conventions first.

Written by the indexing model from the issue text.

Description

Arnoldi method is a fundamental component of Krylov subspace method, which is used in sparse matrix context. However, the idea of Arnoldi method can be extended to general linear operators.

TODO

  • Iterative QR decomposition #150
    • modified Gram-Schmit #149
    • Householder #154
  • Interface of Arnoldi #155
  • Implement GMRES (as an example and test)
Dominant language
Rust
Stars
452
Forks
95
PR merge metrics
No merged PRs in 30d

Contributor guide

No contributing guide indexed for this repository

First steps

  1. Read the whole issue, then the project's contributing guide.
  2. Comment on the issue to say you are picking it up — it saves two people doing the same work.
  3. Fork the repository and make your change on a branch.
  4. Open a pull request that references the issue number.

More from rust-ndarray/ndarray-linalg

All issues in rust-ndarray/ndarray-linalg

Similar issues

More Rust issues

Get new issues in your inbox

A short digest of beginner-friendly GitHub issues.