-
Notifications
You must be signed in to change notification settings - Fork 6
Allow updating coefficients and reuse same solver instances. (Draft) #317
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
Open
julianlitz
wants to merge
2
commits into
main
Choose a base branch
from
litz_update_coefficients
base: main
Could not load branches
Branch not found: {{ refName }}
Loading
Could not load tags
Nothing to show
Loading
Are you sure you want to change the base?
Some commits from the old base branch may be removed from the timeline,
and old review comments may become outdated.
Open
Changes from all commits
Commits
Show all changes
2 commits
Select commit
Hold shift + click to select a range
File filter
Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
There are no files selected for viewing
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
48 changes: 38 additions & 10 deletions
48
include/DirectSolver/DirectSolverTake/directSolverTake.inl
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -1,27 +1,55 @@ | ||
| #pragma once | ||
|
|
||
| // template <class LevelCacheType> | ||
| // DirectSolverTake<LevelCacheType>::DirectSolverTake(const PolarGrid& grid, const LevelCacheType& level_cache, | ||
| // bool DirBC_Interior) | ||
| // : DirectSolver<LevelCacheType>(grid, level_cache, DirBC_Interior) | ||
| // #ifdef GMGPOLAR_USE_MUMPS | ||
| // , system_solver_(buildSolverMatrix()) | ||
| // #else | ||
| // , system_matrix_(buildSolverMatrix()) | ||
| // , system_solver_(system_matrix_) | ||
| // #endif | ||
| // { | ||
| // } | ||
|
|
||
| // template <class LevelCacheType> | ||
| // void DirectSolverTake<LevelCacheType>::solveInPlace(Vector<double> solution) | ||
| // { | ||
| // // Adjusts the right-hand side vector to account for symmetry corrections. | ||
| // // This transforms the system matrixA * solution = rhs into the equivalent system: | ||
| // // symmetric_DBc(matrixA) * solution = rhs - applySymmetryShift(rhs). | ||
| // // The correction modifies the rhs to account for the influence of the Dirichlet boundary conditions, | ||
| // // ensuring that the solution at the boundary is correctly adjusted and maintains the required symmetry. | ||
| // applySymmetryShift(solution); | ||
| // // Solves the adjusted system symmetric(matrixA) * solution = rhs using the MUMPS solver. | ||
| // system_solver_.solveInPlace(solution); | ||
| // } | ||
|
|
||
| template <class LevelCacheType> | ||
| DirectSolverTake<LevelCacheType>::DirectSolverTake(const PolarGrid& grid, const LevelCacheType& level_cache, | ||
| bool DirBC_Interior) | ||
| : DirectSolver<LevelCacheType>(grid, level_cache, DirBC_Interior) | ||
| #ifdef GMGPOLAR_USE_MUMPS | ||
| , system_solver_(buildSolverMatrix()) | ||
| #else | ||
| , system_matrix_(buildSolverMatrix()) | ||
| , system_solver_(system_matrix_) | ||
| #endif | ||
| { | ||
| } | ||
|
|
||
| template <class LevelCacheType> | ||
| void DirectSolverTake<LevelCacheType>::solveInPlace(Vector<double> solution) | ||
| { | ||
| // Adjusts the right-hand side vector to account for symmetry corrections. | ||
| // This transforms the system matrixA * solution = rhs into the equivalent system: | ||
| // symmetric_DBc(matrixA) * solution = rhs - applySymmetryShift(rhs). | ||
| // The correction modifies the rhs to account for the influence of the Dirichlet boundary conditions, | ||
| // ensuring that the solution at the boundary is correctly adjusted and maintains the required symmetry. | ||
| applySymmetryShift(solution); | ||
| // Solves the adjusted system symmetric(matrixA) * solution = rhs using the MUMPS solver. | ||
| system_solver_.solveInPlace(solution); | ||
| } | ||
|
|
||
| template <class LevelCacheType> | ||
| void DirectSolverTake<LevelCacheType>::updateValues() | ||
| { | ||
| // Refill system_matrix_'s numeric entries in place; sparsity pattern | ||
| // (grid + DirBC_Interior) is unchanged, so no reallocation happens here. | ||
| fillSolverMatrix(system_matrix_); | ||
|
|
||
| // Refactorize, reusing whatever one-time analysis/ordering work each | ||
| // backend already did (RCM ordering / MUMPS analysis phase). | ||
| system_solver_.updateValues(system_matrix_); | ||
| } |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Oops, something went wrong.
Oops, something went wrong.
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
Uh oh!
There was an error while loading. Please reload this page.
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
@EmilyBourne
It is possible to add such update Function.
Then you can keep using the same instance and avoid costly memory allocations.
I made this quick proof of concept with Claude.
Just let me know if we need such functionality or if you are fine with creating a new solver instance.
Depends how often you need to create a new instance if this refactoring is worth the effort.