How is the bandwidth of non-symmetric matrices reduced for ILU(0) preconditioner
Open
Nobody has claimed this yet.
- Dominant language
- Cuda
- Stars
- 692
- Forks
- 197
- PR merge metrics
- No merged PRs in 30d
Description
We have been experimenting with the GMRES solver with ILU(0) preconditioner. We would like to know how a non-symmetric matrix is re-ordered before computing the ILU(0) preconditioner? Could someone point to any documentation or sections of the code-base where this aspect can be understood?
Contributor guide
No contributing guide indexed for this repository
First steps
- Read the whole issue, then the project's contributing guide.
- Comment on the issue to say you are picking it up — it saves two people doing the same work.
- Fork the repository and make your change on a branch.
- Open a pull request that references the issue number.
Research direction
Start with the GMRES solver and ILU(0) preconditioner references in the code base, then trace how non-symmetric matrices are reordered before ILU(0) is computed. Done means documenting the ordering and bandwidth behavior and pointing readers to the relevant code sections.
Written by the indexing model from the issue text.
Assessment
- Domain
- backend
- Issue type
- Documentation
- Difficulty
- 4/5
- Estimated time
- 3-5 days
- Activity status
- Stale
- Clarity
- Needs clarification
- Newbie friendliness
- 25/100