Skip to content
Snippets Groups Projects
Commit 93dc6f24 authored by Oliver Sander's avatar Oliver Sander Committed by sander
Browse files

New parameter file for measuring discretization errors

The plan is to minimize the harmonic energy starting from the inverse
stereographic projection.  That projection already is the minimizer
of the energy, so it should be possible to measure convergence orders
against a known solution.

[[Imported from SVN: r10019]]
parent d79f69d5
No related branches found
No related tags found
No related merge requests found
#############################################
# Grid parameters
#############################################
structuredGrid = true
lower = -5 -5
upper = 5 5
elements = 30 30
# Number of grid levels
numLevels = 1
#############################################
# Solver parameters
#############################################
# Tolerance of the trust region solver
tolerance = 1e-12
# Max number of steps of the trust region solver
maxTrustRegionSteps = 10
# Initial trust-region radius
initialTrustRegionRadius = 1
# Number of multigrid iterations per trust-region step
numIt = 200
# Number of presmoothing steps
nu1 = 3
# Number of postsmoothing steps
nu2 = 3
# Number of coarse grid corrections
mu = 1
# Number of base solver iterations
baseIt = 100
# Tolerance of the multigrid solver
mgTolerance = 1e-10
# Tolerance of the base grid solver
baseTolerance = 1e-8
# Measure convergence
instrumented = false
############################
# Problem specifications
############################
# Type of energy we are minimizing
energy = harmonic
# Inverse stereographic projection
initialIterate = "[2*x[0] / (x[0]*x[0]+x[1]*x[1]+1), 2*x[1] / (x[0]*x[0]+x[1]*x[1]+1), (x[0]*x[0]+x[1]*x[1]-1)/ (x[0]*x[0]+x[1]*x[1]+1)]"
0% Loading or .
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment