Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Support for Modified Incomplete Choleksy Decomposition #42

Open
RoyiAvital opened this issue Sep 8, 2021 · 0 comments · May be fixed by #54
Open

Support for Modified Incomplete Choleksy Decomposition #42

RoyiAvital opened this issue Sep 8, 2021 · 0 comments · May be fixed by #54

Comments

@RoyiAvital
Copy link

In the book Yousef Saad - Iterative Methods for Sparse Linear Systems (2nd Edition):

image

This method, originally for the ILU decomposition, can improve the performance of the conditioner greatly.
Basically it enforces the conditioner to comply A e = L L' e where e is a vector of ones.
Namely the sum of values of a row matches the input matrix.
The way it is implemented is that any component which is dropped in the incomplete decomposition is compensated by the diagonal component.

Since component of the row is computed anyway it should come almost freely (Unless I'm wrong and the values are not computed).

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Projects
None yet
Development

Successfully merging a pull request may close this issue.

2 participants