Skip to content
GitLab
Explore
Sign in
Primary navigation
Search or go to…
Project
D
dune-solvers
Manage
Activity
Members
Labels
Plan
Issues
Issue boards
Milestones
Iterations
Wiki
Requirements
Code
Merge requests
Repository
Branches
Commits
Tags
Repository graph
Compare revisions
Locked files
Build
Pipelines
Jobs
Pipeline schedules
Test cases
Artifacts
Deploy
Releases
Model registry
Operate
Environments
Monitor
Incidents
Analyze
Value stream analytics
Contributor analytics
CI/CD analytics
Repository analytics
Code review analytics
Issue analytics
Insights
Model experiments
Help
Help
Support
GitLab documentation
Compare GitLab plans
Community forum
Contribute to GitLab
Provide feedback
Keyboard shortcuts
?
Snippets
Groups
Projects
Show more breadcrumbs
agnumpde
dune-solvers
Commits
ded337a0
Commit
ded337a0
authored
13 years ago
by
graeser
Committed by
graeser
13 years ago
Browse files
Options
Downloads
Patches
Plain Diff
Update TODO list
[[Imported from SVN: r5922]]
parent
2091d193
No related branches found
No related tags found
No related merge requests found
Changes
1
Hide whitespace changes
Inline
Side-by-side
Showing
1 changed file
TODO
+4
-5
4 additions, 5 deletions
TODO
with
4 additions
and
5 deletions
TODO
+
4
−
5
View file @
ded337a0
...
...
@@ -23,10 +23,10 @@ without any again.
Once for computing the residual, once for finding the diagonal entry.
This could be done in one loop.
* The ProjectedBlockGSStep 'solves' the local obstacle problems
by a local projected GS with a fixed number of 20 iteration steps
.
F
or
scalar valued problems one would be enough. Even for vector valued
problems one might still
be OK but much cheaper. (Does this have any
performance impact on
linear elasticity problems?)
by a local projected GS with a fixed number of 20 iteration steps
f
or
blocksize!=1. Even in this case using only one step might still
be OK but much cheaper. (Does this have any
performance impact on
linear elasticity problems?)
...
...
@@ -75,6 +75,5 @@ A wish list for features that would be very welcome.
* Transfer operator assembler for adaptively refined grids (without refinementtype=copy)
This is already implemented in dune-fufem. It could be moved here if the
dependency on P1NodalBasis is removed.
* Nested iteration for ObstacleTNNMGStep.
* An interface to add custom output and termination criteria to the LoopSolver.
This diff is collapsed.
Click to expand it.
Preview
0%
Loading
Try again
or
attach a new file
.
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Save comment
Cancel
Please
register
or
sign in
to comment