In [1]:
import matplotlib.pyplot as plt
import numpy as np
from subprocess import call , check_output , STDOUT
from os import path
%matplotlib inline
%cd /mnt/mint/home/steffenpl/Projects/motor/gsSandbox/results
binPath = "/mnt/mint/home/steffenpl/Projects/motor/gsSandbox-build/bin"
def genParam( args ):
print( check_output( binPath + "/genParam " + args , shell=True,universal_newlines=True) )
def optParam( args ):
print( check_output( binPath + "/optParam " + args , shell=True,universal_newlines=True) )
def testParam( args ):
print( check_output( binPath + "/testParam " + args , shell=True,universal_newlines=True) )
/mnt/mint/home/steffenpl/Projects/motor/gsSandbox/results
In [2]:
# Create surfaces
def generateParameterizations( names , argList ):
outputNames = []
for inputName in names:
fileName = inputName[0]
name = inputName[1]
for arg in argList:
newParam = not path.exists( "%s-%s" % (name,arg[1]) ) or arg[2] == True or inputName[2]
if newParam:
strArgs = "-i %s -o %s-%s %s" %( fileName , name , arg[1] , arg[0] )
print( "genParam " + strArgs)
genParam( strArgs )
outputNames.append( [name + "-" + arg[1] , newParam ] )
return outputNames
# Optimize surfaces
def optimizeParameterizations( names , argList ):
outputNames = []
for inputName in names:
name = inputName[0]
for arg in argList:
newParam = not path.exists( "%s-%s" % (name,arg[1]) ) or arg[2] == True or inputName[1]
if newParam:
strArgs = "-i %s/%s.xml -o %s-%s %s" %( name , name , name , arg[1] , arg[0] )
print( "optParam " + strArgs )
optParam( strArgs )
outputNames.append( [ name + "-" + arg[1] , newParam ] )
return outputNames
# Test parameterizations
def testParameterizations( names , argList ):
outputNames = []
for inputName in names:
name = inputName[0]
for arg in argList:
newParam = not path.exists( "%s-%s" % (name,arg[1]) ) or arg[2] == True or inputName[1]
if newParam:
strArgs = "-i %s/%s.xml -o %s-%s %s" % ( name , name , name , arg[1] , arg[0] )
print("testParam " + strArgs )
testParam( strArgs )
outputNames.append( [name + "-" + arg[1],newParam ] )
return outputNames
# Plot convergence plots
def estimateOrder( steps , errors ):
errors = np.log( errors ).reshape( (-1,1))
n = errors.shape[0]
A = np.matrix( [ np.ones(n) , np.log( steps ) ] ).T
x = np.linalg.solve( A.T * A , A.T * errors )
return x[1]
def plotErrors( fileNames ):
for fileName in fileNames:
name = path.basename( fileName[0] )
errors = np.loadtxt( fname= name + "/" + name + '_error.csv' , skiprows=1 , delimiter=',')
steps = 2**( -errors[:,0] - 4 )
degree = errors[:,1]
plt.loglog( steps , errors[:,2] , label='L_1')
plt.loglog( steps , errors[:,3] , label='L_2' )
plt.loglog( steps , errors[:,4] , label='L_\inf' )
#plt.loglog( steps , steps**2 , label='second order' )
plt.legend( loc = 'best')
plt.title( name )
plt.show()
print( "Error estimate %s: L_1: %.2f" % (name,estimateOrder(steps,errors[:,2])) )
print( "Error estimate %s: L_2: %.2f" % (name,estimateOrder(steps,errors[:,3])) )
print( "Error estimate %s: max: %.2f" % (name,estimateOrder(steps,errors[:,4])) )
In [ ]:
# Skip generation
files = [
[ "tudoMale2D" , False ],
]
#genArgList = [
# ["-a min -n 8 -m 8","min-88",False],
# ["-a bil -n 8 -m 8","bil-88",False],
#];
optArgList = [
["","no-opt",False],
["-f winslow --forcePositiveDet" , "winslow",False],
["-f liao --forcePositiveDet" , "liao",False],
#["-f liao" , "liao-no-det",True],
["-f contMechanics --forcePositiveDet" , "contMechanics",False],
]
testArgList = [
["-k 7 --exact \"sin(x) + cos(y)\" --rhs \"sin(x) + cos(y)\"" , "k7-sin+cos" , False],
]
optFiles = optimizeParameterizations( files , optArgList )
testFiles = testParameterizations( optFiles , testArgList )
plotErrors( testFiles )
testParam -i tudoMale2D-no-opt/tudoMale2D-no-opt.xml -o tudoMale2D-no-opt-k7-sin+cos -k 7 --exact "sin(x) + cos(y)" --rhs "sin(x) + cos(y)"
In [3]:
# Main
files = [
["../data/test/cube.xml" , "cube" , False ],
#["../data/UBW/turbineBoundary.xml" , "turbine" , False ]
]
genArgList = [
["-a min -n 8 -m 8","min-88",False],
["-a bil -n 8 -m 8","bil-88",False],
];
optArgList = [
["","no-opt",False],
["-f winslow --forcePositiveDet" , "winslow",False],
["-f liao --forcePositiveDet" , "liao",False],
["-f liao --forcePositiveDet -q gauss2" , "liao-gauss2",False],
["-f contMechanics --forcePositiveDet" , "contMechanics",False],
]
testArgList = [
["-k 5 --exact \"sin(x) + cos(y)\" --rhs \"sin(x) + cos(y)\"" , "k5-sin+cos" , False],
]
genFiles = generateParameterizations( files , genArgList )
optFiles = optimizeParameterizations( genFiles , optArgList )
testFiles = testParameterizations( optFiles , testArgList )
plotErrors( testFiles )
optParam -i cube-min-88/cube-min-88.xml -o cube-min-88-liao-gauss2 -f liao --forcePositiveDet -q gauss2
List of user-set options:
Name Value used
hessian_approximation = limited-memory yes
max_iter = 300 yes
mu_strategy = adaptive yes
print_level = 5 yes
print_user_options = yes yes
tol = 1e-08 yes
******************************************************************************
This program contains Ipopt, a library for large-scale nonlinear optimization.
Ipopt is released as open source code under the Eclipse Public License (EPL).
For more information visit http://projects.coin-or.org/Ipopt
******************************************************************************
This is Ipopt version 3.12.5, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation).
Number of nonzeros in equality constraint Jacobian...: 0
Number of nonzeros in inequality constraint Jacobian.: 0
Number of nonzeros in Lagrangian Hessian.............: 0
Total number of variables............................: 72
variables with only lower bounds: 0
variables with lower and upper bounds: 0
variables with only upper bounds: 0
Total number of equality constraints.................: 0
Total number of inequality constraints...............: 196
inequality constraints with only lower bounds: 196
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 0
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
0 5.2169946e+00 0.00e+00 5.20e+00 0.0 0.00e+00 - 0.00e+00 0.00e+00 0
1 4.8536791e+00 0.00e+00 2.51e+00 -6.0 5.20e+00 - 9.90e-01 1.56e-02f 7
2 4.7293863e+00 0.00e+00 4.76e-01 -2.3 5.57e-01 - 1.00e+00 1.00e+00h 1
3 4.6715935e+00 0.00e+00 3.35e-01 -3.0 2.53e-01 - 1.00e+00 1.00e+00h 1
4 4.6272220e+00 0.00e+00 7.14e-01 -4.2 9.77e-02 - 1.00e+00 1.00e+00h 1
5 4.6845347e+00 0.00e+00 1.14e+00 -4.9 1.60e-01 - 8.71e-01 1.00e+00H 1
6 4.6020169e+00 0.00e+00 1.70e-01 -6.4 2.48e-02 - 1.00e+00 1.00e+00f 1
7 4.6025388e+00 0.00e+00 2.37e-01 -7.1 1.85e-01 - 1.00e+00 1.00e+00h 1
8 4.5997123e+00 0.00e+00 1.89e-02 -8.1 7.39e-02 - 1.00e+00 1.00e+00h 1
9 4.5996333e+00 0.00e+00 1.32e-02 -9.4 4.37e-02 - 1.00e+00 1.00e+00h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
10 4.5997010e+00 0.00e+00 4.89e-02 -11.0 3.12e-03 - 1.00e+00 1.00e+00H 1
11 4.5995760e+00 0.00e+00 3.18e-02 -11.0 8.47e-04 - 1.00e+00 1.00e+00f 1
12 4.5995634e+00 0.00e+00 2.37e-02 -11.0 7.92e-03 - 1.00e+00 1.00e+00h 1
13 4.5995547e+00 0.00e+00 1.89e-03 -11.0 5.59e-03 - 1.00e+00 1.00e+00h 1
14 4.5995545e+00 0.00e+00 7.15e-04 -11.0 2.28e-03 - 1.00e+00 1.00e+00h 1
15 4.5995544e+00 0.00e+00 5.01e-04 -11.0 3.90e-04 - 1.00e+00 1.00e+00h 1
16 4.5995543e+00 0.00e+00 4.69e-04 -11.0 1.16e-04 - 1.00e+00 1.00e+00h 1
17 4.5995544e+00 0.00e+00 1.56e-03 -11.0 2.11e-04 - 1.00e+00 1.00e+00H 1
18 4.5995542e+00 0.00e+00 2.16e-04 -11.0 2.71e-05 - 1.00e+00 1.00e+00f 1
19 4.5995542e+00 0.00e+00 1.25e-04 -11.0 3.10e-04 - 1.00e+00 1.00e+00h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
20 4.5995542e+00 0.00e+00 1.85e-05 -11.0 6.82e-05 - 1.00e+00 1.00e+00h 1
21 4.5995542e+00 0.00e+00 1.18e-05 -11.0 2.68e-05 - 1.00e+00 1.00e+00h 1
22 4.5995542e+00 0.00e+00 1.15e-05 -11.0 3.78e-06 - 1.00e+00 1.00e+00h 1
23 4.5995542e+00 0.00e+00 2.82e-05 -11.0 3.49e-06 - 1.00e+00 1.00e+00h 1
24 4.5995542e+00 0.00e+00 2.35e-06 -11.0 4.58e-06 - 1.00e+00 1.00e+00h 1
25 4.5995542e+00 0.00e+00 1.76e-06 -11.0 3.23e-06 - 1.00e+00 1.00e+00h 1
26 4.5995542e+00 0.00e+00 2.88e-06 -11.0 3.93e-07 - 1.00e+00 1.00e+00h 1
27 4.5995542e+00 0.00e+00 3.65e-06 -11.0 5.91e-07 - 1.00e+00 1.00e+00H 1
28 4.5995542e+00 0.00e+00 4.05e-07 -11.0 5.61e-08 - 1.00e+00 1.00e+00f 1
29 4.5995542e+00 0.00e+00 2.11e-07 -11.0 6.06e-07 - 1.00e+00 1.00e+00h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
30 4.5995542e+00 0.00e+00 6.90e-08 -11.0 1.08e-07 - 1.00e+00 1.00e+00h 1
31 4.5995542e+00 0.00e+00 2.55e-08 -11.0 3.59e-08 - 1.00e+00 1.00e+00h 1
32 4.5995542e+00 0.00e+00 7.42e-08 -11.0 1.37e-08 - 1.00e+00 1.00e+00h 1
33 4.5995542e+00 0.00e+00 1.15e-08 -11.0 2.11e-08 - 1.00e+00 1.00e+00h 1
34 4.5995542e+00 0.00e+00 5.60e-09 -11.0 1.59e-08 - 1.00e+00 1.00e+00h 1
Number of Iterations....: 34
(scaled) (unscaled)
Objective...............: 4.5995542339110900e+00 4.5995542339110900e+00
Dual infeasibility......: 5.5955240441107890e-09 5.5955240441107890e-09
Constraint violation....: 0.0000000000000000e+00 0.0000000000000000e+00
Complementarity.........: 1.0000000000000001e-11 1.0000000000000001e-11
Overall NLP error.......: 5.5955240441107890e-09 5.5955240441107890e-09
Number of objective function evaluations = 47
Number of objective gradient evaluations = 35
Number of equality constraint evaluations = 0
Number of inequality constraint evaluations = 47
Number of equality constraint Jacobian evaluations = 0
Number of inequality constraint Jacobian evaluations = 35
Number of Lagrangian Hessian evaluations = 0
Total CPU secs in IPOPT (w/o function evaluations) = 0.483
Total CPU secs in NLP function evaluations = 12.030
EXIT: Optimal Solution Found.
optParam -i cube-bil-88/cube-bil-88.xml -o cube-bil-88-no-opt
No functional given (-f).
optParam -i cube-bil-88/cube-bil-88.xml -o cube-bil-88-winslow -f winslow --forcePositiveDet
List of user-set options:
Name Value used
hessian_approximation = limited-memory yes
max_iter = 300 yes
mu_strategy = adaptive yes
print_level = 5 yes
print_user_options = yes yes
tol = 1e-08 yes
******************************************************************************
This program contains Ipopt, a library for large-scale nonlinear optimization.
Ipopt is released as open source code under the Eclipse Public License (EPL).
For more information visit http://projects.coin-or.org/Ipopt
******************************************************************************
This is Ipopt version 3.12.5, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation).
Number of nonzeros in equality constraint Jacobian...: 0
Number of nonzeros in inequality constraint Jacobian.: 0
Number of nonzeros in Lagrangian Hessian.............: 0
Total number of variables............................: 72
variables with only lower bounds: 0
variables with lower and upper bounds: 0
variables with only upper bounds: 0
Total number of equality constraints.................: 0
Total number of inequality constraints...............: 196
inequality constraints with only lower bounds: 196
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 0
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
0 4.3890092e+00 0.00e+00 3.28e+00 0.0 0.00e+00 - 0.00e+00 0.00e+00 0
1 4.2437990e+00 0.00e+00 9.70e-01 -6.0 3.28e+00 - 1.12e-02 2.21e-02F 1
2 4.2100810e+00 0.00e+00 2.64e-01 -0.1 5.03e-01 - 1.00e+00 1.00e+00f 1
3 4.1671184e+00 0.00e+00 3.28e-01 -6.1 1.59e-01 - 8.06e-01 1.00e+00h 1
4 4.1534364e+00 0.00e+00 2.59e-01 -1.5 2.15e-01 - 9.73e-01 1.00e+00h 1
5 4.1427285e+00 0.00e+00 1.78e-01 -2.7 2.09e-01 - 8.21e-01 1.00e+00h 1
6 4.1402833e+00 0.00e+00 1.79e-01 -2.7 2.29e-01 - 9.90e-01 1.00e+00h 1
7 4.1360433e+00 0.00e+00 3.69e-02 -3.2 2.29e-01 - 9.98e-01 1.00e+00h 1
8 4.1355579e+00 0.00e+00 2.22e-02 -4.2 1.67e-01 - 9.99e-01 1.00e+00h 1
9 4.1354436e+00 0.00e+00 5.08e-02 -5.6 2.69e-02 - 1.00e+00 1.00e+00h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
10 4.1354214e+00 0.00e+00 3.72e-02 -6.8 3.51e-02 - 1.00e+00 1.00e+00h 1
11 4.1353052e+00 0.00e+00 6.11e-03 -8.0 3.83e-02 - 1.00e+00 1.00e+00h 1
12 4.1353174e+00 0.00e+00 1.43e-02 -9.5 1.66e-02 - 1.00e+00 1.00e+00h 1
13 4.1352968e+00 0.00e+00 8.26e-04 -11.0 1.24e-02 - 1.00e+00 1.00e+00h 1
14 4.1352961e+00 0.00e+00 6.11e-04 -11.0 8.42e-03 - 1.00e+00 1.00e+00h 1
15 4.1352952e+00 0.00e+00 1.68e-03 -11.0 7.39e-04 - 1.00e+00 1.00e+00h 1
16 4.1352962e+00 0.00e+00 2.16e-03 -11.0 1.71e-03 - 1.00e+00 1.00e+00h 1
17 4.1352948e+00 0.00e+00 1.11e-04 -11.0 1.94e-03 - 1.00e+00 1.00e+00h 1
18 4.1352948e+00 0.00e+00 2.03e-04 -11.0 1.84e-03 - 1.00e+00 1.00e+00h 1
19 4.1352948e+00 0.00e+00 5.29e-05 -11.0 2.20e-04 - 1.00e+00 1.00e+00h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
20 4.1352948e+00 0.00e+00 1.17e-05 -11.0 1.55e-04 - 1.00e+00 1.00e+00h 1
21 4.1352948e+00 0.00e+00 6.73e-06 -11.0 2.06e-05 - 1.00e+00 1.00e+00h 1
22 4.1352948e+00 0.00e+00 1.54e-05 -11.0 1.80e-05 - 1.00e+00 1.00e+00h 1
23 4.1352948e+00 0.00e+00 4.24e-06 -11.0 2.36e-05 - 1.00e+00 1.00e+00h 1
24 4.1352948e+00 0.00e+00 3.83e-07 -11.0 1.74e-05 - 1.00e+00 1.00e+00h 1
25 4.1352948e+00 0.00e+00 7.49e-07 -11.0 3.01e-06 - 1.00e+00 1.00e+00h 1
26 4.1352948e+00 0.00e+00 4.00e-07 -11.0 8.48e-07 - 1.00e+00 1.00e+00h 1
27 4.1352948e+00 0.00e+00 1.14e-07 -11.0 6.30e-07 - 1.00e+00 1.00e+00h 1
28 4.1352948e+00 0.00e+00 1.16e-07 -11.0 2.24e-07 - 1.00e+00 1.00e+00h 1
29 4.1352948e+00 0.00e+00 3.35e-07 -11.0 1.09e-07 - 1.00e+00 1.00e+00H 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
30 4.1352948e+00 0.00e+00 1.00e-07 -11.0 1.56e-08 - 1.00e+00 1.00e+00f 1
31 4.1352948e+00 0.00e+00 1.29e-08 -11.0 1.98e-07 - 1.00e+00 1.00e+00h 1
32 4.1352948e+00 0.00e+00 5.63e-09 -11.0 9.12e-08 - 1.00e+00 1.00e+00h 1
Number of Iterations....: 32
(scaled) (unscaled)
Objective...............: 4.1352948306690012e+00 4.1352948306690012e+00
Dual infeasibility......: 5.6325314782649603e-09 5.6325314782649603e-09
Constraint violation....: 0.0000000000000000e+00 0.0000000000000000e+00
Complementarity.........: 1.0000000000000001e-11 1.0000000000000001e-11
Overall NLP error.......: 5.6325314782649603e-09 5.6325314782649603e-09
Number of objective function evaluations = 35
Number of objective gradient evaluations = 33
Number of equality constraint evaluations = 0
Number of inequality constraint evaluations = 35
Number of equality constraint Jacobian evaluations = 0
Number of inequality constraint Jacobian evaluations = 33
Number of Lagrangian Hessian evaluations = 0
Total CPU secs in IPOPT (w/o function evaluations) = 1.123
Total CPU secs in NLP function evaluations = 35.777
EXIT: Optimal Solution Found.
optParam -i cube-bil-88/cube-bil-88.xml -o cube-bil-88-liao -f liao --forcePositiveDet
List of user-set options:
Name Value used
hessian_approximation = limited-memory yes
max_iter = 300 yes
mu_strategy = adaptive yes
print_level = 5 yes
print_user_options = yes yes
tol = 1e-08 yes
******************************************************************************
This program contains Ipopt, a library for large-scale nonlinear optimization.
Ipopt is released as open source code under the Eclipse Public License (EPL).
For more information visit http://projects.coin-or.org/Ipopt
******************************************************************************
This is Ipopt version 3.12.5, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation).
Number of nonzeros in equality constraint Jacobian...: 0
Number of nonzeros in inequality constraint Jacobian.: 0
Number of nonzeros in Lagrangian Hessian.............: 0
Total number of variables............................: 72
variables with only lower bounds: 0
variables with lower and upper bounds: 0
variables with only upper bounds: 0
Total number of equality constraints.................: 0
Total number of inequality constraints...............: 196
inequality constraints with only lower bounds: 196
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 0
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
0 5.3406337e+00 0.00e+00 5.43e+00 0.0 0.00e+00 - 0.00e+00 0.00e+00 0
1 5.1642247e+00 0.00e+00 6.72e+00 -6.0 5.43e+00 - 2.85e-02 2.27e-02F 1
2 4.7650264e+00 0.00e+00 2.31e+02 -6.0 9.78e-01 - 9.39e-03 1.00e+00h 1
3 4.7298257e+00 0.00e+00 4.49e-01 -0.3 5.43e-01 - 9.99e-01 1.00e+00h 1
4 4.6405221e+00 0.00e+00 9.95e-01 -6.3 3.77e-02 - 9.34e-01 1.00e+00h 1
5 4.8003686e+00 0.00e+00 1.89e+00 -2.3 2.45e-01 - 8.18e-01 1.00e+00H 1
6 4.6035228e+00 0.00e+00 2.42e-01 -3.7 3.28e-02 - 1.00e+00 1.00e+00f 1
7 4.6022366e+00 0.00e+00 2.75e-01 -4.1 2.93e-01 - 1.00e+00 1.00e+00h 1
8 4.6000597e+00 0.00e+00 4.05e-02 -5.4 7.56e-02 - 1.00e+00 1.00e+00h 1
9 4.5998273e+00 0.00e+00 1.97e-02 -6.6 3.59e-02 - 1.00e+00 1.00e+00h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
10 4.5998904e+00 0.00e+00 5.24e-02 -8.3 6.87e-03 - 1.00e+00 1.00e+00H 1
11 4.5997103e+00 0.00e+00 4.30e-02 -9.9 1.39e-03 - 1.00e+00 1.00e+00f 1
12 4.5996803e+00 0.00e+00 2.07e-02 -11.0 1.01e-02 - 1.00e+00 1.00e+00h 1
13 4.5996743e+00 0.00e+00 3.55e-03 -11.0 5.59e-03 - 1.00e+00 1.00e+00h 1
14 4.5996739e+00 0.00e+00 8.04e-04 -11.0 1.88e-03 - 1.00e+00 1.00e+00h 1
15 4.5996737e+00 0.00e+00 6.74e-04 -11.0 5.05e-04 - 1.00e+00 1.00e+00h 1
16 4.5996739e+00 0.00e+00 2.05e-03 -11.0 1.34e-04 - 1.00e+00 1.00e+00H 1
17 4.5996736e+00 0.00e+00 1.69e-03 -11.0 5.11e-05 - 1.00e+00 1.00e+00f 1
18 4.5996735e+00 0.00e+00 2.39e-04 -11.0 5.84e-04 - 1.00e+00 1.00e+00h 1
19 4.5996735e+00 0.00e+00 2.09e-04 -11.0 3.42e-04 - 1.00e+00 1.00e+00h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
20 4.5996735e+00 0.00e+00 3.47e-05 -11.0 8.79e-05 - 1.00e+00 1.00e+00h 1
21 4.5996735e+00 0.00e+00 1.82e-05 -11.0 3.99e-05 - 1.00e+00 1.00e+00h 1
22 4.5996735e+00 0.00e+00 3.04e-05 -11.0 4.43e-06 - 1.00e+00 1.00e+00h 1
23 4.5996735e+00 0.00e+00 6.69e-05 -11.0 9.07e-06 - 1.00e+00 1.00e+00H 1
24 4.5996735e+00 0.00e+00 8.96e-06 -11.0 7.66e-07 - 1.00e+00 1.00e+00f 1
25 4.5996735e+00 0.00e+00 3.67e-06 -11.0 1.03e-05 - 1.00e+00 1.00e+00h 1
26 4.5996735e+00 0.00e+00 1.56e-06 -11.0 1.44e-06 - 1.00e+00 1.00e+00h 1
27 4.5996735e+00 0.00e+00 1.58e-06 -11.0 5.54e-07 - 1.00e+00 1.00e+00h 1
28 4.5996735e+00 0.00e+00 8.36e-06 -11.0 7.05e-07 - 1.00e+00 1.00e+00H 1
29 4.5996735e+00 0.00e+00 6.99e-07 -11.0 1.05e-07 - 1.00e+00 1.00e+00f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
30 4.5996735e+00 0.00e+00 4.55e-07 -11.0 8.89e-07 - 1.00e+00 1.00e+00h 1
31 4.5996735e+00 0.00e+00 2.13e-07 -11.0 2.07e-07 - 1.00e+00 1.00e+00h 1
32 4.5996735e+00 0.00e+00 5.26e-07 -11.0 9.19e-08 - 1.00e+00 1.00e+00H 1
33 4.5996735e+00 0.00e+00 2.88e-07 -11.0 1.86e-08 - 1.00e+00 2.50e-01f 3
34 4.5996735e+00 0.00e+00 7.98e-08 -11.0 4.92e-08 - 1.00e+00 1.00e+00H 1
35 4.5996735e+00 0.00e+00 1.63e-08 -11.0 1.25e-09 - 1.00e+00 1.00e+00f 1
36 4.5996735e+00 0.00e+00 8.97e-09 -11.0 2.07e-08 - 1.00e+00 1.00e+00h 1
Number of Iterations....: 36
(scaled) (unscaled)
Objective...............: 4.5996734777231580e+00 4.5996734777231580e+00
Dual infeasibility......: 8.9706020389712648e-09 8.9706020389712648e-09
Constraint violation....: 0.0000000000000000e+00 0.0000000000000000e+00
Complementarity.........: 1.0000000000000001e-11 1.0000000000000001e-11
Overall NLP error.......: 8.9706020389712648e-09 8.9706020389712648e-09
Number of objective function evaluations = 51
Number of objective gradient evaluations = 37
Number of equality constraint evaluations = 0
Number of inequality constraint evaluations = 51
Number of equality constraint Jacobian evaluations = 0
Number of inequality constraint Jacobian evaluations = 37
Number of Lagrangian Hessian evaluations = 0
Total CPU secs in IPOPT (w/o function evaluations) = 2.927
Total CPU secs in NLP function evaluations = 107.773
EXIT: Optimal Solution Found.
optParam -i cube-bil-88/cube-bil-88.xml -o cube-bil-88-liao-gauss2 -f liao --forcePositiveDet -q gauss2
List of user-set options:
Name Value used
hessian_approximation = limited-memory yes
max_iter = 300 yes
mu_strategy = adaptive yes
print_level = 5 yes
print_user_options = yes yes
tol = 1e-08 yes
******************************************************************************
This program contains Ipopt, a library for large-scale nonlinear optimization.
Ipopt is released as open source code under the Eclipse Public License (EPL).
For more information visit http://projects.coin-or.org/Ipopt
******************************************************************************
This is Ipopt version 3.12.5, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation).
Number of nonzeros in equality constraint Jacobian...: 0
Number of nonzeros in inequality constraint Jacobian.: 0
Number of nonzeros in Lagrangian Hessian.............: 0
Total number of variables............................: 72
variables with only lower bounds: 0
variables with lower and upper bounds: 0
variables with only upper bounds: 0
Total number of equality constraints.................: 0
Total number of inequality constraints...............: 196
inequality constraints with only lower bounds: 196
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 0
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
0 5.3406219e+00 0.00e+00 5.43e+00 0.0 0.00e+00 - 0.00e+00 0.00e+00 0
1 5.1632937e+00 0.00e+00 6.69e+00 -6.0 5.43e+00 - 2.85e-02 2.27e-02F 1
2 4.7648743e+00 0.00e+00 2.31e+02 -6.0 9.78e-01 - 9.39e-03 1.00e+00h 1
3 4.7296126e+00 0.00e+00 4.48e-01 -0.3 5.42e-01 - 1.00e+00 1.00e+00h 1
4 4.6403097e+00 0.00e+00 9.84e-01 -6.3 3.80e-02 - 9.34e-01 1.00e+00h 1
5 4.7997351e+00 0.00e+00 1.89e+00 -2.3 2.44e-01 - 8.18e-01 1.00e+00H 1
6 4.6034131e+00 0.00e+00 2.42e-01 -3.7 3.27e-02 - 1.00e+00 1.00e+00f 1
7 4.6021297e+00 0.00e+00 2.78e-01 -4.2 2.92e-01 - 1.00e+00 1.00e+00h 1
8 4.5999419e+00 0.00e+00 4.15e-02 -5.4 7.58e-02 - 1.00e+00 1.00e+00h 1
9 4.5997092e+00 0.00e+00 1.99e-02 -6.6 3.61e-02 - 1.00e+00 1.00e+00h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
10 4.5997815e+00 0.00e+00 5.49e-02 -8.3 6.68e-03 - 1.00e+00 1.00e+00H 1
11 4.5995911e+00 0.00e+00 4.23e-02 -9.9 1.40e-03 - 1.00e+00 1.00e+00f 1
12 4.5995606e+00 0.00e+00 1.96e-02 -11.0 1.02e-02 - 1.00e+00 1.00e+00h 1
13 4.5995550e+00 0.00e+00 3.72e-03 -11.0 5.47e-03 - 1.00e+00 1.00e+00h 1
14 4.5995546e+00 0.00e+00 8.13e-04 -11.0 1.86e-03 - 1.00e+00 1.00e+00h 1
15 4.5995545e+00 0.00e+00 6.78e-04 -11.0 5.26e-04 - 1.00e+00 1.00e+00h 1
16 4.5995546e+00 0.00e+00 2.10e-03 -11.0 1.36e-04 - 1.00e+00 1.00e+00H 1
17 4.5995544e+00 0.00e+00 1.54e-03 -11.0 5.17e-05 - 1.00e+00 1.00e+00f 1
18 4.5995542e+00 0.00e+00 2.63e-04 -11.0 5.78e-04 - 1.00e+00 1.00e+00h 1
19 4.5995542e+00 0.00e+00 2.03e-04 -11.0 3.19e-04 - 1.00e+00 1.00e+00h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
20 4.5995542e+00 0.00e+00 4.24e-05 -11.0 8.85e-05 - 1.00e+00 1.00e+00h 1
21 4.5995542e+00 0.00e+00 1.99e-05 -11.0 3.76e-05 - 1.00e+00 1.00e+00h 1
22 4.5995542e+00 0.00e+00 2.43e-05 -11.0 5.20e-06 - 1.00e+00 1.00e+00h 1
23 4.5995542e+00 0.00e+00 8.49e-05 -11.0 7.73e-06 - 1.00e+00 1.00e+00H 1
24 4.5995542e+00 0.00e+00 7.87e-06 -11.0 9.71e-07 - 1.00e+00 1.00e+00f 1
25 4.5995542e+00 0.00e+00 4.83e-06 -11.0 1.33e-05 - 1.00e+00 1.00e+00h 1
26 4.5995542e+00 0.00e+00 1.65e-06 -11.0 1.84e-06 - 1.00e+00 1.00e+00h 1
27 4.5995542e+00 0.00e+00 1.11e-06 -11.0 7.26e-07 - 1.00e+00 1.00e+00h 1
28 4.5995542e+00 0.00e+00 9.99e-06 -11.0 5.94e-07 - 1.00e+00 1.00e+00H 1
29 4.5995542e+00 0.00e+00 1.13e-06 -11.0 1.27e-07 - 1.00e+00 1.00e+00f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
30 4.5995542e+00 0.00e+00 4.26e-07 -11.0 1.03e-06 - 1.00e+00 1.00e+00h 1
31 4.5995542e+00 0.00e+00 1.80e-07 -11.0 2.76e-07 - 1.00e+00 1.00e+00h 1
32 4.5995542e+00 0.00e+00 1.57e-07 -11.0 9.88e-08 - 1.00e+00 1.00e+00h 1
33 4.5995542e+00 0.00e+00 5.33e-07 -11.0 4.03e-08 - 1.00e+00 1.00e+00H 1
34 4.5995542e+00 0.00e+00 2.02e-07 -11.0 7.93e-09 - 1.00e+00 1.00e+00f 1
35 4.5995542e+00 0.00e+00 5.03e-08 -11.0 9.91e-08 - 1.00e+00 1.00e+00h 1
36 4.5995542e+00 0.00e+00 4.88e-08 -11.0 5.37e-08 - 1.00e+00 1.00e+00h 1
37 4.5995542e+00 0.00e+00 5.12e-09 -11.0 1.33e-08 - 1.00e+00 1.00e+00h 1
Number of Iterations....: 37
(scaled) (unscaled)
Objective...............: 4.5995542339110909e+00 4.5995542339110909e+00
Dual infeasibility......: 5.1218288869373891e-09 5.1218288869373891e-09
Constraint violation....: 0.0000000000000000e+00 0.0000000000000000e+00
Complementarity.........: 1.0000000000000003e-11 1.0000000000000003e-11
Overall NLP error.......: 5.1218288869373891e-09 5.1218288869373891e-09
Number of objective function evaluations = 45
Number of objective gradient evaluations = 38
Number of equality constraint evaluations = 0
Number of inequality constraint evaluations = 45
Number of equality constraint Jacobian evaluations = 0
Number of inequality constraint Jacobian evaluations = 38
Number of Lagrangian Hessian evaluations = 0
Total CPU secs in IPOPT (w/o function evaluations) = 0.427
Total CPU secs in NLP function evaluations = 13.167
EXIT: Optimal Solution Found.
optParam -i cube-bil-88/cube-bil-88.xml -o cube-bil-88-contMechanics -f contMechanics --forcePositiveDet
List of user-set options:
Name Value used
hessian_approximation = limited-memory yes
max_iter = 300 yes
mu_strategy = adaptive yes
print_level = 5 yes
print_user_options = yes yes
tol = 1e-08 yes
******************************************************************************
This program contains Ipopt, a library for large-scale nonlinear optimization.
Ipopt is released as open source code under the Eclipse Public License (EPL).
For more information visit http://projects.coin-or.org/Ipopt
******************************************************************************
This is Ipopt version 3.12.5, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation).
Number of nonzeros in equality constraint Jacobian...: 0
Number of nonzeros in inequality constraint Jacobian.: 0
Number of nonzeros in Lagrangian Hessian.............: 0
Total number of variables............................: 72
variables with only lower bounds: 0
variables with lower and upper bounds: 0
variables with only upper bounds: 0
Total number of equality constraints.................: 0
Total number of inequality constraints...............: 196
inequality constraints with only lower bounds: 196
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 0
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
0 1.3299378e-01 0.00e+00 4.47e-01 0.0 0.00e+00 - 0.00e+00 0.00e+00 0
1 1.2663686e-01 0.00e+00 7.40e-01 -6.0 4.47e-01 - 9.90e-01 2.50e-01f 3
2 4.9641114e-02 0.00e+00 1.55e-01 -2.0 9.64e-01 - 1.00e+00 1.00e+00h 1
3 4.1922312e-02 0.00e+00 8.46e-02 -2.2 6.00e-01 - 9.70e-01 1.00e+00h 1
4 2.5656228e-02 0.00e+00 7.87e-02 -3.1 1.27e-01 - 9.98e-01 1.00e+00h 1
5 9.2742038e-02 0.00e+00 4.14e-01 -3.7 2.73e-01 - 6.82e-01 1.00e+00H 1
6 4.0210827e-02 0.00e+00 2.92e-01 -5.1 5.34e-02 - 1.00e+00 1.00e+00f 1
7 2.0990913e-02 0.00e+00 1.35e-01 -5.2 7.17e-01 - 5.70e-01 1.00e+00h 1
8 1.4405640e-02 0.00e+00 6.95e-02 -4.9 6.21e-01 - 1.00e+00 1.00e+00h 1
9 1.2934679e-02 0.00e+00 5.57e-02 -5.5 2.55e-01 - 1.00e+00 1.00e+00h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
10 1.1902438e-02 0.00e+00 1.59e-02 -6.1 1.80e-01 - 1.00e+00 1.00e+00h 1
11 1.1795397e-02 0.00e+00 7.11e-03 -7.0 7.59e-02 - 1.00e+00 1.00e+00h 1
12 1.1752562e-02 0.00e+00 3.97e-03 -8.4 2.53e-02 - 1.00e+00 1.00e+00h 1
13 1.1690924e-02 0.00e+00 1.04e-02 -10.2 6.45e-03 - 1.00e+00 1.00e+00h 1
14 1.1928539e-02 0.00e+00 2.20e-02 -11.0 2.36e-02 - 1.00e+00 1.00e+00H 1
15 1.1676975e-02 0.00e+00 1.32e-02 -11.0 3.33e-03 - 1.00e+00 1.00e+00f 1
16 1.1607318e-02 0.00e+00 6.82e-03 -11.0 4.36e-02 - 1.00e+00 1.00e+00h 1
17 1.1577768e-02 0.00e+00 4.40e-03 -11.0 2.87e-02 - 1.00e+00 1.00e+00h 1
18 1.1568638e-02 0.00e+00 4.45e-03 -11.0 1.15e-02 - 1.00e+00 1.00e+00h 1
19 1.1545958e-02 0.00e+00 5.16e-03 -11.0 1.05e-02 - 1.00e+00 1.00e+00h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
20 1.1664020e-02 0.00e+00 1.68e-02 -11.0 1.08e-02 - 1.00e+00 1.00e+00H 1
21 1.1661111e-02 0.00e+00 1.66e-02 -11.0 5.49e-03 - 1.00e+00 5.00e-01f 2
22 1.1468571e-02 0.00e+00 4.45e-03 -11.0 3.65e-02 - 1.00e+00 1.00e+00h 1
23 1.1479575e-02 0.00e+00 1.07e-02 -11.0 3.57e-02 - 1.00e+00 1.00e+00h 1
24 1.1448504e-02 0.00e+00 2.42e-03 -11.0 1.80e-02 - 1.00e+00 1.00e+00h 1
25 1.1460593e-02 0.00e+00 6.81e-03 -11.0 1.11e-02 - 1.00e+00 1.00e+00H 1
26 1.1434463e-02 0.00e+00 2.14e-03 -11.0 8.16e-04 - 1.00e+00 1.00e+00f 1
27 1.1431004e-02 0.00e+00 3.11e-03 -11.0 9.42e-03 - 1.00e+00 1.00e+00h 1
28 1.1421477e-02 0.00e+00 3.34e-03 -11.0 7.71e-03 - 1.00e+00 1.00e+00h 1
29 1.1849350e-02 0.00e+00 2.30e-02 -11.0 1.41e-02 - 1.00e+00 1.00e+00H 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
30 1.1838084e-02 0.00e+00 2.93e-02 -11.0 5.39e-03 - 1.00e+00 1.00e+00f 1
31 1.1456874e-02 0.00e+00 8.62e-03 -11.0 6.55e-02 - 1.00e+00 1.00e+00h 1
32 1.1600112e-02 0.00e+00 1.67e-02 -11.0 5.45e-02 - 1.00e+00 1.00e+00h 1
33 1.1401142e-02 0.00e+00 4.50e-03 -11.0 3.58e-02 - 1.00e+00 1.00e+00h 1
34 1.1393566e-02 0.00e+00 1.72e-03 -11.0 3.03e-02 - 1.00e+00 1.00e+00h 1
35 1.1392668e-02 0.00e+00 1.69e-03 -11.0 7.59e-03 - 1.00e+00 1.00e+00h 1
36 1.1391707e-02 0.00e+00 5.87e-04 -11.0 3.55e-03 - 1.00e+00 1.00e+00h 1
37 1.1391330e-02 0.00e+00 3.25e-04 -11.0 2.43e-03 - 1.00e+00 1.00e+00h 1
38 1.1391234e-02 0.00e+00 2.39e-03 -11.0 1.13e-03 - 1.00e+00 1.00e+00h 1
39 1.1446397e-02 0.00e+00 1.37e-02 -11.0 4.63e-03 - 1.00e+00 1.00e+00H 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
40 1.1389938e-02 0.00e+00 1.55e-03 -11.0 2.25e-03 - 1.00e+00 1.00e+00f 1
41 1.1419409e-02 0.00e+00 8.00e-03 -11.0 2.43e-02 - 1.00e+00 1.00e+00h 1
42 1.1388559e-02 0.00e+00 3.98e-04 -11.0 1.38e-02 - 1.00e+00 1.00e+00h 1
43 1.1388572e-02 0.00e+00 5.67e-04 -11.0 1.21e-02 - 1.00e+00 1.00e+00h 1
44 1.1388379e-02 0.00e+00 2.72e-04 -11.0 1.25e-03 - 1.00e+00 1.00e+00h 1
45 1.1388306e-02 0.00e+00 2.61e-04 -11.0 8.26e-04 - 1.00e+00 1.00e+00h 1
46 1.1388243e-02 0.00e+00 1.56e-04 -11.0 6.36e-04 - 1.00e+00 1.00e+00h 1
47 1.1389576e-02 0.00e+00 1.33e-03 -11.0 8.64e-04 - 1.00e+00 1.00e+00H 1
48 1.1389206e-02 0.00e+00 1.48e-03 -11.0 3.61e-04 - 1.00e+00 5.00e-01f 2
49 1.1388149e-02 0.00e+00 2.69e-04 -11.0 2.15e-03 - 1.00e+00 1.00e+00h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
50 1.1391491e-02 0.00e+00 2.77e-03 -11.0 3.43e-03 - 1.00e+00 1.00e+00H 1
51 1.1388105e-02 0.00e+00 4.68e-05 -11.0 2.65e-04 - 1.00e+00 1.00e+00f 1
52 1.1388103e-02 0.00e+00 3.88e-05 -11.0 5.14e-03 - 1.00e+00 1.00e+00h 1
53 1.1388371e-02 0.00e+00 5.46e-04 -11.0 5.67e-04 - 1.00e+00 1.00e+00H 1
54 1.1388298e-02 0.00e+00 3.41e-04 -11.0 2.29e-04 - 1.00e+00 2.50e-01f 3
55 1.1388116e-02 0.00e+00 2.46e-04 -11.0 7.02e-04 - 1.00e+00 1.00e+00h 1
56 1.1396010e-02 0.00e+00 3.57e-03 -11.0 1.43e-03 - 1.00e+00 1.00e+00H 1
57 1.1388093e-02 0.00e+00 2.06e-04 -11.0 1.26e-03 - 1.00e+00 1.00e+00f 1
58 1.1389677e-02 0.00e+00 2.15e-03 -11.0 6.21e-03 - 1.00e+00 1.00e+00h 1
59 1.1388069e-02 0.00e+00 2.41e-05 -11.0 3.11e-03 - 1.00e+00 1.00e+00h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
60 1.1388068e-02 0.00e+00 2.04e-05 -11.0 2.82e-03 - 1.00e+00 1.00e+00h 1
61 1.1388068e-02 0.00e+00 1.17e-05 -11.0 6.04e-05 - 1.00e+00 1.00e+00h 1
62 1.1388069e-02 0.00e+00 5.27e-05 -11.0 2.53e-05 - 1.00e+00 1.00e+00H 1
63 1.1388068e-02 0.00e+00 3.87e-05 -11.0 1.70e-05 - 1.00e+00 1.00e+00f 1
64 1.1388068e-02 0.00e+00 5.65e-05 -11.0 1.14e-04 - 1.00e+00 1.00e+00H 1
65 1.1388067e-02 0.00e+00 9.36e-06 -11.0 6.13e-06 - 1.00e+00 1.00e+00f 1
66 1.1388066e-02 0.00e+00 7.69e-06 -11.0 8.44e-05 - 1.00e+00 1.00e+00h 1
67 1.1388070e-02 0.00e+00 7.54e-05 -11.0 6.94e-05 - 1.00e+00 1.00e+00H 1
68 1.1388070e-02 0.00e+00 4.55e-05 -11.0 6.13e-05 - 1.00e+00 2.50e-01f 3
69 1.1388069e-02 0.00e+00 7.00e-05 -11.0 9.57e-05 - 1.00e+00 1.00e+00h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
70 1.1388282e-02 0.00e+00 4.70e-04 -11.0 2.86e-04 - 1.00e+00 1.00e+00H 1
71 1.1388084e-02 0.00e+00 2.15e-04 -11.0 2.48e-04 - 1.00e+00 1.00e+00F 1
72 1.1388078e-02 0.00e+00 1.77e-04 -11.0 7.65e-04 - 1.00e+00 1.56e-02f 7
73 1.1388106e-02 0.00e+00 3.32e-04 -11.0 7.10e-05 - 1.00e+00 1.00e+00H 1
74 1.1388071e-02 0.00e+00 1.28e-04 -11.0 5.01e-05 - 1.00e+00 1.00e+00F 1
75 1.1388067e-02 0.00e+00 4.13e-05 -11.0 1.93e-05 - 1.00e+00 1.00e+00f 1
76 1.1388066e-02 0.00e+00 1.79e-05 -11.0 1.99e-04 - 1.00e+00 1.00e+00h 1
77 1.1388066e-02 0.00e+00 4.14e-06 -11.0 9.06e-05 - 1.00e+00 1.00e+00h 1
78 1.1388066e-02 0.00e+00 2.16e-06 -11.0 2.76e-05 - 1.00e+00 1.00e+00h 1
79 1.1388066e-02 0.00e+00 1.47e-06 -11.0 6.22e-06 - 1.00e+00 1.00e+00h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
80 1.1388066e-02 0.00e+00 2.15e-06 -11.0 2.53e-06 - 1.00e+00 1.00e+00h 1
81 1.1388067e-02 0.00e+00 3.43e-05 -11.0 1.64e-05 - 1.00e+00 1.00e+00H 1
82 1.1388066e-02 0.00e+00 2.20e-05 -11.0 1.09e-05 - 1.00e+00 5.00e-01f 2
83 1.1388066e-02 0.00e+00 2.62e-05 -11.0 4.38e-05 - 1.00e+00 1.00e+00H 1
84 1.1388066e-02 0.00e+00 1.77e-05 -11.0 8.33e-06 - 1.00e+00 5.00e-01f 2
85 1.1388066e-02 0.00e+00 6.07e-06 -11.0 4.99e-05 - 1.00e+00 1.00e+00h 1
86 1.1388067e-02 0.00e+00 4.08e-05 -11.0 3.56e-05 - 1.00e+00 1.00e+00H 1
87 1.1388066e-02 0.00e+00 1.68e-06 -11.0 5.02e-06 - 1.00e+00 1.00e+00f 1
88 1.1388066e-02 0.00e+00 2.20e-06 -11.0 5.65e-05 - 1.00e+00 1.00e+00h 1
89 1.1388066e-02 0.00e+00 1.02e-06 -11.0 5.03e-06 - 1.00e+00 1.00e+00h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
90 1.1388066e-02 0.00e+00 9.26e-07 -11.0 2.15e-06 - 1.00e+00 1.00e+00h 1
91 1.1388066e-02 0.00e+00 1.48e-05 -11.0 5.74e-06 - 1.00e+00 1.00e+00H 1
92 1.1388066e-02 0.00e+00 5.66e-06 -11.0 1.51e-06 - 1.00e+00 1.00e+00f 1
93 1.1388066e-02 0.00e+00 2.43e-06 -11.0 2.20e-05 - 1.00e+00 1.00e+00h 1
94 1.1388066e-02 0.00e+00 1.36e-06 -11.0 1.00e-05 - 1.00e+00 1.00e+00h 1
95 1.1388066e-02 0.00e+00 1.01e-06 -11.0 5.67e-06 - 1.00e+00 1.00e+00h 1
96 1.1388066e-02 0.00e+00 1.57e-06 -11.0 3.16e-06 - 1.00e+00 1.00e+00h 1
97 1.1388066e-02 0.00e+00 4.84e-06 -11.0 3.52e-06 - 1.00e+00 1.00e+00H 1
98 1.1388066e-02 0.00e+00 1.31e-06 -11.0 1.07e-06 - 1.00e+00 1.00e+00f 1
99 1.1388066e-02 0.00e+00 4.46e-06 -11.0 8.22e-06 - 1.00e+00 1.00e+00H 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
100 1.1388066e-02 0.00e+00 2.36e-07 -11.0 6.40e-07 - 1.00e+00 1.00e+00f 1
101 1.1388066e-02 0.00e+00 2.88e-07 -11.0 6.68e-06 - 1.00e+00 1.00e+00h 1
102 1.1388066e-02 0.00e+00 3.51e-07 -11.0 5.18e-07 - 1.00e+00 1.00e+00H 1
103 1.1388066e-02 0.00e+00 3.87e-07 -11.0 5.18e-06 - 1.00e+00 6.25e-02f 5
104 1.1388066e-02 0.00e+00 1.12e-06 -11.0 1.17e-06 - 1.00e+00 1.00e+00H 1
105 1.1388066e-02 0.00e+00 8.12e-07 -11.0 2.93e-07 - 1.00e+00 1.00e+00F 1
106 1.1388066e-02 0.00e+00 4.99e-07 -11.0 2.30e-07 - 1.00e+00 2.50e-01f 3
107 1.1388066e-02 0.00e+00 2.54e-07 -11.0 5.75e-07 - 1.00e+00 1.00e+00H 1
108 1.1388066e-02 0.00e+00 2.84e-07 -11.0 1.29e-07 - 1.00e+00 5.00e-01f 2
109 1.1388066e-02 0.00e+00 1.20e-07 -11.0 7.87e-07 - 1.00e+00 1.00e+00h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
110 1.1388066e-02 0.00e+00 2.35e-07 -11.0 4.47e-07 - 1.00e+00 1.00e+00H 1
111 1.1388066e-02 0.00e+00 1.65e-07 -11.0 3.63e-08 - 1.00e+00 1.00e+00f 1
112 1.1388066e-02 0.00e+00 1.78e-07 -11.0 4.15e-07 - 1.00e+00 1.00e+00h 1
113 1.1388066e-02 0.00e+00 4.09e-08 -11.0 5.11e-07 - 1.00e+00 1.00e+00h 1
114 1.1388066e-02 0.00e+00 3.16e-08 -11.0 2.17e-07 - 1.00e+00 1.00e+00h 1
115 1.1388066e-02 0.00e+00 1.99e-07 -11.0 1.87e-07 - 1.00e+00 1.00e+00H 1
116 1.1388066e-02 0.00e+00 1.43e-07 -11.0 5.89e-07 - 1.00e+00 6.25e-02f 5
117 1.1388066e-02 0.00e+00 3.87e-07 -11.0 1.56e-07 - 1.00e+00 1.00e+00H 1
118 1.1388066e-02 0.00e+00 2.76e-07 -11.0 1.30e-07 - 1.00e+00 1.00e+00F 1
119 1.1388066e-02 0.00e+00 2.41e-07 -11.0 1.01e-07 - 1.00e+00 6.25e-02f 5
Number of Iterations....: 119
(scaled) (unscaled)
Objective...............: 1.1388065819832791e-02 1.1388065819832791e-02
Dual infeasibility......: 2.4129102940232777e-07 2.4129102940232777e-07
Constraint violation....: 0.0000000000000000e+00 0.0000000000000000e+00
Complementarity.........: 1.0000000000000001e-11 1.0000000000000001e-11
Overall NLP error.......: 2.4129102940232777e-07 2.4129102940232777e-07
Number of objective function evaluations = 232
Number of objective gradient evaluations = 120
Number of equality constraint evaluations = 0
Number of inequality constraint evaluations = 232
Number of equality constraint Jacobian evaluations = 0
Number of inequality constraint Jacobian evaluations = 120
Number of Lagrangian Hessian evaluations = 0
Total CPU secs in IPOPT (w/o function evaluations) = 3.027
Total CPU secs in NLP function evaluations = 334.543
EXIT: Solved To Acceptable Level.
testParam -i cube-min-88-no-opt/cube-min-88-no-opt.xml -o cube-min-88-no-opt-k5-sin+cos -k 5 --exact "sin(x) + cos(y)" --rhs "sin(x) + cos(y)"
Using elimination for Dirichlet boundaries.
Assembling...
Warning: rational domain boundary iterator with evaluate the source.
Solving...
Sol: gsMultiPatch (1): #Boundaries= 0, #Interfaces= 0.
Writing to Paraview...
Plotting absolute error in Paraview...
Warning: rational domain boundary iterator with evaluate the source.
Warning: rational domain boundary iterator with evaluate the source.
Warning: rational domain boundary iterator with evaluate the source.
Using elimination for Dirichlet boundaries.
Assembling...
Warning: rational domain boundary iterator with evaluate the source.
Solving...
Sol: gsMultiPatch (1): #Boundaries= 0, #Interfaces= 0.
Writing to Paraview...
Plotting absolute error in Paraview...
Warning: rational domain boundary iterator with evaluate the source.
Warning: rational domain boundary iterator with evaluate the source.
Warning: rational domain boundary iterator with evaluate the source.
Using elimination for Dirichlet boundaries.
Assembling...
Warning: rational domain boundary iterator with evaluate the source.
Solving...
Sol: gsMultiPatch (1): #Boundaries= 0, #Interfaces= 0.
Writing to Paraview...
Plotting absolute error in Paraview...
Warning: rational domain boundary iterator with evaluate the source.
Warning: rational domain boundary iterator with evaluate the source.
Warning: rational domain boundary iterator with evaluate the source.
Using elimination for Dirichlet boundaries.
Assembling...
Warning: rational domain boundary iterator with evaluate the source.
Solving...
Sol: gsMultiPatch (1): #Boundaries= 0, #Interfaces= 0.
Writing to Paraview...
Plotting absolute error in Paraview...
Warning: rational domain boundary iterator with evaluate the source.
Warning: rational domain boundary iterator with evaluate the source.
Warning: rational domain boundary iterator with evaluate the source.
Using elimination for Dirichlet boundaries.
Assembling...
Warning: rational domain boundary iterator with evaluate the source.
Solving...
Sol: gsMultiPatch (1): #Boundaries= 0, #Interfaces= 0.
Writing to Paraview...
Plotting absolute error in Paraview...
Warning: rational domain boundary iterator with evaluate the source.
Warning: rational domain boundary iterator with evaluate the source.
Warning: rational domain boundary iterator with evaluate the source.
Using elimination for Dirichlet boundaries.
Assembling...
Warning: rational domain boundary iterator with evaluate the source.
Solving...
Sol: gsMultiPatch (1): #Boundaries= 0, #Interfaces= 0.
Writing to Paraview...
Plotting absolute error in Paraview...
Warning: rational domain boundary iterator with evaluate the source.
Warning: rational domain boundary iterator with evaluate the source.
Warning: rational domain boundary iterator with evaluate the source.
Test is done. Exiting.
testParam -i cube-min-88-winslow/cube-min-88-winslow.xml -o cube-min-88-winslow-k5-sin+cos -k 5 --exact "sin(x) + cos(y)" --rhs "sin(x) + cos(y)"
---------------------------------------------------------------------------
CalledProcessError Traceback (most recent call last)
<ipython-input-3-09b1b86284c5> in <module>()
24 genFiles = generateParameterizations( files , genArgList )
25 optFiles = optimizeParameterizations( genFiles , optArgList )
---> 26 testFiles = testParameterizations( optFiles , testArgList )
27 plotErrors( testFiles )
<ipython-input-2-69650e6e5dca> in testParameterizations(names, argList)
38 strArgs = "-i %s/%s.xml -o %s-%s %s" % ( name , name , name , arg[1] , arg[0] )
39 print("testParam " + strArgs )
---> 40 testParam( strArgs )
41 outputNames.append( [name + "-" + arg[1],newParam ] )
42 return outputNames
<ipython-input-1-0949ccc33a6a> in testParam(args)
16
17 def testParam( args ):
---> 18 print( check_output( binPath + "/testParam " + args , shell=True,universal_newlines=True) )
/usr/lib/python3.5/subprocess.py in check_output(timeout, *popenargs, **kwargs)
624
625 return run(*popenargs, stdout=PIPE, timeout=timeout, check=True,
--> 626 **kwargs).stdout
627
628
/usr/lib/python3.5/subprocess.py in run(input, timeout, check, *popenargs, **kwargs)
706 if check and retcode:
707 raise CalledProcessError(retcode, process.args,
--> 708 output=stdout, stderr=stderr)
709 return CompletedProcess(process.args, retcode, stdout, stderr)
710
CalledProcessError: Command '/mnt/mint/home/steffenpl/Projects/motor/gsSandbox-build/bin/testParam -i cube-min-88-winslow/cube-min-88-winslow.xml -o cube-min-88-winslow-k5-sin+cos -k 5 --exact "sin(x) + cos(y)" --rhs "sin(x) + cos(y)"' returned non-zero exit status 255
In [5]:
# Main
files = [
["../data/test/horseshoe.xml" , "horseshoe" , False ],
]
genArgList = [
["-a min -n 4 -m 4","min-44",False],
["-a bil -n 4 -m 4","bil-44",False],
["-a min -n 8 -m 8","min-88",False],
["-a bil -n 8 -m 8","bil-88",False],
["-a min -n 16 -m 16","min-16",False],
["-a bil -n 16 -m 16","bil-16",False],
["-a min -n 32 -m 32","min-32",False],
["-a bil -n 32 -m 32","bil-32",False],
["-a min -n 64 -m 64","min-64",False],
["-a bil -n 64 -m 64","bil-64",False],
];
optArgList = [
["","no-opt",False],
#["-f winslow --forcePositiveDet" , "winslow",False],
#["-f liao --forcePositiveDet" , "liao",True],
#["-f contMechanics --forcePositiveDet" , "contMechanics",False],
]
testArgList = [
["-k 5 --exact \"sin(x) + cos(y)\" --rhs \"sin(x) + cos(y)\"" , "k5-sin+cos" , False],
]
genFiles = generateParameterizations( files , genArgList )
optFiles = optimizeParameterizations( genFiles , optArgList )
#testFiles = testParameterizations( optFiles , testArgList )
#plotErrors( testFiles )
genParam -i ../data/test/horseshoe.xml -o horseshoe-min-32 -a min -n 32 -m 32
----------------------
n: 32
m: 32
degree: 3
input: ../data/test/horseshoe.xml
output: horseshoe-min-32
----------------------
Warning: gsBSplineBasis: Converting basis to periodicBSplineBasis: deg=1, size=9, knot vector:
[ 0 0 0.12 0.25 ... 0.75 0.82 1 1 ] (deg=1, size=11, minSpan=0.07, maxSpan=0.18)
Writing the surface (with determinate coordinate) to a paraview file: horseshoe-min-32/horseshoe-min-32Det.vts
genParam -i ../data/test/horseshoe.xml -o horseshoe-bil-32 -a bil -n 32 -m 32
----------------------
n: 32
m: 32
degree: 3
input: ../data/test/horseshoe.xml
output: horseshoe-bil-32
----------------------
Warning: gsBSplineBasis: Converting basis to periodicBSplineBasis: deg=1, size=9, knot vector:
[ 0 0 0.12 0.25 ... 0.75 0.82 1 1 ] (deg=1, size=11, minSpan=0.07, maxSpan=0.18)
Writing the surface (with determinate coordinate) to a paraview file: horseshoe-bil-32/horseshoe-bil-32Det.vts
genParam -i ../data/test/horseshoe.xml -o horseshoe-min-64 -a min -n 64 -m 64
----------------------
n: 64
m: 64
degree: 3
input: ../data/test/horseshoe.xml
output: horseshoe-min-64
----------------------
Warning: gsBSplineBasis: Converting basis to periodicBSplineBasis: deg=1, size=9, knot vector:
[ 0 0 0.12 0.25 ... 0.75 0.82 1 1 ] (deg=1, size=11, minSpan=0.07, maxSpan=0.18)
Writing the surface (with determinate coordinate) to a paraview file: horseshoe-min-64/horseshoe-min-64Det.vts
genParam -i ../data/test/horseshoe.xml -o horseshoe-bil-64 -a bil -n 64 -m 64
----------------------
n: 64
m: 64
degree: 3
input: ../data/test/horseshoe.xml
output: horseshoe-bil-64
----------------------
Warning: gsBSplineBasis: Converting basis to periodicBSplineBasis: deg=1, size=9, knot vector:
[ 0 0 0.12 0.25 ... 0.75 0.82 1 1 ] (deg=1, size=11, minSpan=0.07, maxSpan=0.18)
Writing the surface (with determinate coordinate) to a paraview file: horseshoe-bil-64/horseshoe-bil-64Det.vts
optParam -i horseshoe-min-32/horseshoe-min-32.xml -o horseshoe-min-32-no-opt
No functional given (-f).
optParam -i horseshoe-bil-32/horseshoe-bil-32.xml -o horseshoe-bil-32-no-opt
No functional given (-f).
optParam -i horseshoe-min-64/horseshoe-min-64.xml -o horseshoe-min-64-no-opt
No functional given (-f).
optParam -i horseshoe-bil-64/horseshoe-bil-64.xml -o horseshoe-bil-64-no-opt
No functional given (-f).
In [10]:
# Main
files = [
["../data/test/cube.xml" , "cube" , True ],
]
genArgList = [
["-a min -n 4 -m 4","min-44",False],
];
optArgList = [
["","no-opt",False],
["-f winslow --forcePositiveDet -v 5" , "winslow",False],
["-f liao --forcePositiveDet " , "liao",False],
["-f contMechanics --forcePositiveDet " , "contMechanics",False],
]
testArgList = [
["-k 4 --exact \"sin(x) + cos(y)\" --rhs \"sin(x) + cos(y)\"" , "k4-sin+cos" , False],
]
genFiles = generateParameterizations( files , genArgList )
optFiles = optimizeParameterizations( genFiles , optArgList )
testFiles = testParameterizations( optFiles , testArgList )
plotErrors( testFiles )
genParam -i ../data/test/cube.xml -o cube-min-44 -a min -n 4 -m 4
----------------------
n: 4
m: 4
degree: 3
input: ../data/test/cube.xml
output: cube-min-44
----------------------
Warning: gsBSplineBasis: Converting basis to periodicBSplineBasis: deg=1, size=5, knot vector:
[ 0 0 0.25 0.5 0.75 1 1 ] (deg=1, size=7, minSpan=0.25, maxSpan=0.25)
optParam -i cube-min-44/cube-min-44.xml -o cube-min-44-no-opt
No functional given (-f).
optParam -i cube-min-44/cube-min-44.xml -o cube-min-44-winslow -f winslow --forcePositiveDet -v 5
List of user-set options:
Name Value used
hessian_approximation = limited-memory yes
max_iter = 300 yes
mu_strategy = adaptive yes
print_level = 5 yes
print_user_options = yes yes
tol = 1e-08 yes
******************************************************************************
This program contains Ipopt, a library for large-scale nonlinear optimization.
Ipopt is released as open source code under the Eclipse Public License (EPL).
For more information visit http://projects.coin-or.org/Ipopt
******************************************************************************
This is Ipopt version 3.12.5, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation).
Number of nonzeros in equality constraint Jacobian...: 0
Number of nonzeros in inequality constraint Jacobian.: 0
Number of nonzeros in Lagrangian Hessian.............: 0
Total number of variables............................: 8
variables with only lower bounds: 0
variables with lower and upper bounds: 0
variables with only upper bounds: 0
Total number of equality constraints.................: 0
Total number of inequality constraints...............: 100
inequality constraints with only lower bounds: 100
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 0
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
0 4.6944737e+00 0.00e+00 3.06e+00 0.0 0.00e+00 - 0.00e+00 0.00e+00 0
1 4.4657640e+00 0.00e+00 8.06e-01 -6.0 3.06e+00 - 4.69e-02 4.25e-02F 1
2 4.4106718e+00 0.00e+00 2.47e+02 -6.1 8.56e-01 - 8.14e-03 1.00e+00h 1
3 4.3905523e+00 0.00e+00 9.27e-02 -0.8 1.71e-01 - 1.00e+00 1.00e+00h 1
4 4.3899735e+00 0.00e+00 4.33e-02 -1.7 1.35e-01 - 9.99e-01 1.00e+00h 1
5 4.3897940e+00 0.00e+00 1.29e-02 -3.1 4.46e-02 - 9.98e-01 1.00e+00h 1
6 4.3897818e+00 0.00e+00 5.14e-03 -4.7 1.60e-02 - 9.90e-01 1.00e+00h 1
7 4.3897810e+00 0.00e+00 1.93e-03 -6.5 3.72e-03 - 1.00e+00 1.00e+00h 1
8 4.3897808e+00 0.00e+00 1.38e-04 -8.6 8.82e-04 - 1.00e+00 1.00e+00h 1
9 4.3897808e+00 0.00e+00 2.36e-05 -11.0 5.46e-04 - 1.00e+00 1.00e+00h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
10 4.3897808e+00 0.00e+00 6.48e-06 -11.0 4.18e-05 - 1.00e+00 1.00e+00h 1
11 4.3897808e+00 0.00e+00 8.25e-07 -11.0 7.75e-06 - 1.00e+00 1.00e+00h 1
12 4.3897808e+00 0.00e+00 3.70e-07 -11.0 2.83e-06 - 1.00e+00 1.00e+00h 1
13 4.3897808e+00 0.00e+00 1.06e-08 -11.0 4.49e-07 - 1.00e+00 1.00e+00h 1
14 4.3897808e+00 0.00e+00 2.48e-09 -11.0 1.39e-07 - 1.00e+00 1.00e+00h 1
Number of Iterations....: 14
(scaled) (unscaled)
Objective...............: 4.3897808183618787e+00 4.3897808183618787e+00
Dual infeasibility......: 2.4794980883295161e-09 2.4794980883295161e-09
Constraint violation....: 0.0000000000000000e+00 0.0000000000000000e+00
Complementarity.........: 9.9999999999999994e-12 9.9999999999999994e-12
Overall NLP error.......: 2.4794980883295161e-09 2.4794980883295161e-09
Number of objective function evaluations = 16
Number of objective gradient evaluations = 15
Number of equality constraint evaluations = 0
Number of inequality constraint evaluations = 16
Number of equality constraint Jacobian evaluations = 0
Number of inequality constraint Jacobian evaluations = 15
Number of Lagrangian Hessian evaluations = 0
Total CPU secs in IPOPT (w/o function evaluations) = 0.040
Total CPU secs in NLP function evaluations = 0.323
EXIT: Optimal Solution Found.
optParam -i cube-min-44/cube-min-44.xml -o cube-min-44-liao -f liao --forcePositiveDet
List of user-set options:
Name Value used
hessian_approximation = limited-memory yes
max_iter = 300 yes
mu_strategy = adaptive yes
print_level = 5 yes
print_user_options = yes yes
tol = 1e-08 yes
******************************************************************************
This program contains Ipopt, a library for large-scale nonlinear optimization.
Ipopt is released as open source code under the Eclipse Public License (EPL).
For more information visit http://projects.coin-or.org/Ipopt
******************************************************************************
This is Ipopt version 3.12.5, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation).
Number of nonzeros in equality constraint Jacobian...: 0
Number of nonzeros in inequality constraint Jacobian.: 0
Number of nonzeros in Lagrangian Hessian.............: 0
Total number of variables............................: 8
variables with only lower bounds: 0
variables with lower and upper bounds: 0
variables with only upper bounds: 0
Total number of equality constraints.................: 0
Total number of inequality constraints...............: 100
inequality constraints with only lower bounds: 100
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 0
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
0 6.3340911e+00 0.00e+00 6.41e+00 0.0 0.00e+00 - 0.00e+00 0.00e+00 0
1 5.9881963e+00 0.00e+00 3.51e+00 -6.0 6.41e+00 - 9.13e-03 6.00e-03F 1
2 5.5957931e+00 0.00e+00 2.63e+02 -6.1 1.10e+00 - 9.31e-03 1.00e+00h 1
3 5.5885598e+00 0.00e+00 2.73e-01 -0.6 2.65e-01 - 1.00e+00 1.00e+00h 1
4 5.5874444e+00 0.00e+00 6.57e-02 -2.3 6.07e-02 - 9.76e-01 1.00e+00h 1
5 5.5873764e+00 0.00e+00 7.31e-03 -8.0 2.13e-02 - 9.79e-01 1.00e+00h 1
6 5.5873752e+00 0.00e+00 1.74e-03 -5.3 6.48e-03 - 9.99e-01 1.00e+00h 1
7 5.5873751e+00 0.00e+00 5.94e-04 -7.4 4.43e-04 - 1.00e+00 1.00e+00h 1
8 5.5873751e+00 0.00e+00 1.61e-04 -9.5 2.27e-04 - 1.00e+00 1.00e+00h 1
9 5.5873751e+00 0.00e+00 3.03e-06 -11.0 7.44e-05 - 1.00e+00 1.00e+00h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
10 5.5873751e+00 0.00e+00 7.34e-07 -11.0 1.99e-05 - 1.00e+00 1.00e+00h 1
11 5.5873751e+00 0.00e+00 1.20e-07 -11.0 3.65e-07 - 1.00e+00 1.00e+00h 1
12 5.5873751e+00 0.00e+00 4.22e-09 -11.0 5.43e-08 - 1.00e+00 1.00e+00h 1
Number of Iterations....: 12
(scaled) (unscaled)
Objective...............: 5.5873750727993885e+00 5.5873750727993885e+00
Dual infeasibility......: 4.2188474935755949e-09 4.2188474935755949e-09
Constraint violation....: 0.0000000000000000e+00 0.0000000000000000e+00
Complementarity.........: 1.0000000000000001e-11 1.0000000000000001e-11
Overall NLP error.......: 4.2188474935755949e-09 4.2188474935755949e-09
Number of objective function evaluations = 14
Number of objective gradient evaluations = 13
Number of equality constraint evaluations = 0
Number of inequality constraint evaluations = 14
Number of equality constraint Jacobian evaluations = 0
Number of inequality constraint Jacobian evaluations = 13
Number of Lagrangian Hessian evaluations = 0
Total CPU secs in IPOPT (w/o function evaluations) = 0.083
Total CPU secs in NLP function evaluations = 0.803
EXIT: Optimal Solution Found.
optParam -i cube-min-44/cube-min-44.xml -o cube-min-44-contMechanics -f contMechanics --forcePositiveDet
List of user-set options:
Name Value used
hessian_approximation = limited-memory yes
max_iter = 300 yes
mu_strategy = adaptive yes
print_level = 5 yes
print_user_options = yes yes
tol = 1e-08 yes
******************************************************************************
This program contains Ipopt, a library for large-scale nonlinear optimization.
Ipopt is released as open source code under the Eclipse Public License (EPL).
For more information visit http://projects.coin-or.org/Ipopt
******************************************************************************
This is Ipopt version 3.12.5, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation).
Number of nonzeros in equality constraint Jacobian...: 0
Number of nonzeros in inequality constraint Jacobian.: 0
Number of nonzeros in Lagrangian Hessian.............: 0
Total number of variables............................: 8
variables with only lower bounds: 0
variables with lower and upper bounds: 0
variables with only upper bounds: 0
Total number of equality constraints.................: 0
Total number of inequality constraints...............: 100
inequality constraints with only lower bounds: 100
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 0
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
0 2.6666511e-01 0.00e+00 7.78e-01 0.0 0.00e+00 - 0.00e+00 0.00e+00 0
1 2.5588631e-01 0.00e+00 1.52e+00 -6.0 7.78e-01 - 1.69e-01 4.28e-01F 1
2 8.7326029e-02 0.00e+00 1.34e+01 -0.2 6.35e-01 - 8.44e-02 1.00e+00f 1
3 6.3099855e-02 0.00e+00 2.14e+00 0.1 8.50e-01 - 5.32e-01 1.00e+00f 1
4 5.9507974e-02 0.00e+00 3.68e-01 -1.1 4.75e-01 - 8.79e-01 1.00e+00h 1
5 5.9096994e-02 0.00e+00 4.95e-02 -2.5 9.62e-02 - 9.32e-01 1.00e+00h 1
6 5.8928339e-02 0.00e+00 1.26e-02 -4.0 3.12e-02 - 9.68e-01 1.00e+00h 1
7 5.8872994e-02 0.00e+00 1.67e-02 -4.7 2.23e-02 - 1.00e+00 1.00e+00h 1
8 5.8805531e-02 0.00e+00 3.95e-03 -5.9 2.95e-02 - 1.00e+00 1.00e+00h 1
9 5.8800724e-02 0.00e+00 1.57e-03 -7.6 1.49e-02 - 1.00e+00 1.00e+00h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
10 5.8799941e-02 0.00e+00 6.03e-04 -9.5 5.40e-03 - 1.00e+00 1.00e+00h 1
11 5.8799907e-02 0.00e+00 4.30e-04 -11.0 1.56e-03 - 1.00e+00 1.00e+00h 1
12 5.8799886e-02 0.00e+00 4.68e-05 -11.0 9.43e-04 - 1.00e+00 1.00e+00h 1
13 5.8799885e-02 0.00e+00 1.88e-05 -11.0 3.72e-04 - 1.00e+00 1.00e+00h 1
14 5.8799885e-02 0.00e+00 1.75e-05 -11.0 3.14e-05 - 1.00e+00 1.00e+00h 1
15 5.8799885e-02 0.00e+00 1.82e-05 -11.0 3.46e-05 - 1.00e+00 1.00e+00h 1
16 5.8799885e-02 0.00e+00 1.19e-06 -11.0 2.08e-05 - 1.00e+00 1.00e+00h 1
17 5.8799885e-02 0.00e+00 6.34e-07 -11.0 1.23e-05 - 1.00e+00 1.00e+00h 1
18 5.8799885e-02 0.00e+00 2.04e-07 -11.0 7.70e-07 - 1.00e+00 1.00e+00H 1
19 5.8799885e-02 0.00e+00 2.57e-07 -11.0 8.04e-08 - 1.00e+00 1.00e+00f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
20 5.8799885e-02 0.00e+00 9.42e-08 -11.0 3.72e-07 - 1.00e+00 1.00e+00h 1
21 5.8799885e-02 0.00e+00 5.46e-08 -11.0 1.64e-07 - 1.00e+00 1.00e+00h 1
22 5.8799885e-02 0.00e+00 3.19e-08 -11.0 4.36e-08 - 1.00e+00 1.00e+00H 1
23 5.8799885e-02 0.00e+00 3.22e-08 -11.0 1.20e-08 - 1.00e+00 5.00e-01f 2
24 5.8799885e-02 0.00e+00 1.49e-09 -11.0 4.39e-08 - 1.00e+00 1.00e+00h 1
Number of Iterations....: 24
(scaled) (unscaled)
Objective...............: 5.8799884998835782e-02 5.8799884998835782e-02
Dual infeasibility......: 1.4850389436678786e-09 1.4850389436678786e-09
Constraint violation....: 0.0000000000000000e+00 0.0000000000000000e+00
Complementarity.........: 1.0000000000000001e-11 1.0000000000000001e-11
Overall NLP error.......: 1.4850389436678786e-09 1.4850389436678786e-09
Number of objective function evaluations = 33
Number of objective gradient evaluations = 25
Number of equality constraint evaluations = 0
Number of inequality constraint evaluations = 33
Number of equality constraint Jacobian evaluations = 0
Number of inequality constraint Jacobian evaluations = 25
Number of Lagrangian Hessian evaluations = 0
Total CPU secs in IPOPT (w/o function evaluations) = 0.113
Total CPU secs in NLP function evaluations = 1.533
EXIT: Optimal Solution Found.
testParam -i cube-min-44-no-opt/cube-min-44-no-opt.xml -o cube-min-44-no-opt-k4-sin+cos -k 4 --exact "sin(x) + cos(y)" --rhs "sin(x) + cos(y)"
Using elimination for Dirichlet boundaries.
Assembling...
Warning: rational domain boundary iterator with evaluate the source.
Solving...
Sol: gsMultiPatch (1): #Boundaries= 0, #Interfaces= 0.
Writing to Paraview...
Plotting absolute error in Paraview...
Warning: rational domain boundary iterator with evaluate the source.
Warning: rational domain boundary iterator with evaluate the source.
Warning: rational domain boundary iterator with evaluate the source.
Using elimination for Dirichlet boundaries.
Assembling...
Warning: rational domain boundary iterator with evaluate the source.
Solving...
Sol: gsMultiPatch (1): #Boundaries= 0, #Interfaces= 0.
Writing to Paraview...
Plotting absolute error in Paraview...
Warning: rational domain boundary iterator with evaluate the source.
Warning: rational domain boundary iterator with evaluate the source.
Warning: rational domain boundary iterator with evaluate the source.
Using elimination for Dirichlet boundaries.
Assembling...
Warning: rational domain boundary iterator with evaluate the source.
Solving...
Sol: gsMultiPatch (1): #Boundaries= 0, #Interfaces= 0.
Writing to Paraview...
Plotting absolute error in Paraview...
Warning: rational domain boundary iterator with evaluate the source.
Warning: rational domain boundary iterator with evaluate the source.
Warning: rational domain boundary iterator with evaluate the source.
Using elimination for Dirichlet boundaries.
Assembling...
Warning: rational domain boundary iterator with evaluate the source.
Solving...
Sol: gsMultiPatch (1): #Boundaries= 0, #Interfaces= 0.
Writing to Paraview...
Plotting absolute error in Paraview...
Warning: rational domain boundary iterator with evaluate the source.
Warning: rational domain boundary iterator with evaluate the source.
Warning: rational domain boundary iterator with evaluate the source.
Using elimination for Dirichlet boundaries.
Assembling...
Warning: rational domain boundary iterator with evaluate the source.
Solving...
Sol: gsMultiPatch (1): #Boundaries= 0, #Interfaces= 0.
Writing to Paraview...
Plotting absolute error in Paraview...
Warning: rational domain boundary iterator with evaluate the source.
Warning: rational domain boundary iterator with evaluate the source.
Warning: rational domain boundary iterator with evaluate the source.
Test is done. Exiting.
testParam -i cube-min-44-winslow/cube-min-44-winslow.xml -o cube-min-44-winslow-k4-sin+cos -k 4 --exact "sin(x) + cos(y)" --rhs "sin(x) + cos(y)"
Using elimination for Dirichlet boundaries.
Assembling...
Warning: rational domain boundary iterator with evaluate the source.
Solving...
Sol: gsMultiPatch (1): #Boundaries= 0, #Interfaces= 0.
Writing to Paraview...
Plotting absolute error in Paraview...
Warning: rational domain boundary iterator with evaluate the source.
Warning: rational domain boundary iterator with evaluate the source.
Warning: rational domain boundary iterator with evaluate the source.
Using elimination for Dirichlet boundaries.
Assembling...
Warning: rational domain boundary iterator with evaluate the source.
Solving...
Sol: gsMultiPatch (1): #Boundaries= 0, #Interfaces= 0.
Writing to Paraview...
Plotting absolute error in Paraview...
Warning: rational domain boundary iterator with evaluate the source.
Warning: rational domain boundary iterator with evaluate the source.
Warning: rational domain boundary iterator with evaluate the source.
Using elimination for Dirichlet boundaries.
Assembling...
Warning: rational domain boundary iterator with evaluate the source.
Solving...
Sol: gsMultiPatch (1): #Boundaries= 0, #Interfaces= 0.
Writing to Paraview...
Plotting absolute error in Paraview...
Warning: rational domain boundary iterator with evaluate the source.
Warning: rational domain boundary iterator with evaluate the source.
Warning: rational domain boundary iterator with evaluate the source.
Using elimination for Dirichlet boundaries.
Assembling...
Warning: rational domain boundary iterator with evaluate the source.
Solving...
Sol: gsMultiPatch (1): #Boundaries= 0, #Interfaces= 0.
Writing to Paraview...
Plotting absolute error in Paraview...
Warning: rational domain boundary iterator with evaluate the source.
Warning: rational domain boundary iterator with evaluate the source.
Warning: rational domain boundary iterator with evaluate the source.
Using elimination for Dirichlet boundaries.
Assembling...
Warning: rational domain boundary iterator with evaluate the source.
Solving...
Sol: gsMultiPatch (1): #Boundaries= 0, #Interfaces= 0.
Writing to Paraview...
Plotting absolute error in Paraview...
Warning: rational domain boundary iterator with evaluate the source.
Warning: rational domain boundary iterator with evaluate the source.
Warning: rational domain boundary iterator with evaluate the source.
Test is done. Exiting.
testParam -i cube-min-44-liao/cube-min-44-liao.xml -o cube-min-44-liao-k4-sin+cos -k 4 --exact "sin(x) + cos(y)" --rhs "sin(x) + cos(y)"
Using elimination for Dirichlet boundaries.
Assembling...
Warning: rational domain boundary iterator with evaluate the source.
Solving...
Sol: gsMultiPatch (1): #Boundaries= 0, #Interfaces= 0.
Writing to Paraview...
Plotting absolute error in Paraview...
Warning: rational domain boundary iterator with evaluate the source.
Warning: rational domain boundary iterator with evaluate the source.
Warning: rational domain boundary iterator with evaluate the source.
Using elimination for Dirichlet boundaries.
Assembling...
Warning: rational domain boundary iterator with evaluate the source.
Solving...
Sol: gsMultiPatch (1): #Boundaries= 0, #Interfaces= 0.
Writing to Paraview...
Plotting absolute error in Paraview...
Warning: rational domain boundary iterator with evaluate the source.
Warning: rational domain boundary iterator with evaluate the source.
Warning: rational domain boundary iterator with evaluate the source.
Using elimination for Dirichlet boundaries.
Assembling...
Warning: rational domain boundary iterator with evaluate the source.
Solving...
Sol: gsMultiPatch (1): #Boundaries= 0, #Interfaces= 0.
Writing to Paraview...
Plotting absolute error in Paraview...
Warning: rational domain boundary iterator with evaluate the source.
Warning: rational domain boundary iterator with evaluate the source.
Warning: rational domain boundary iterator with evaluate the source.
Using elimination for Dirichlet boundaries.
Assembling...
Warning: rational domain boundary iterator with evaluate the source.
Solving...
Sol: gsMultiPatch (1): #Boundaries= 0, #Interfaces= 0.
Writing to Paraview...
Plotting absolute error in Paraview...
Warning: rational domain boundary iterator with evaluate the source.
Warning: rational domain boundary iterator with evaluate the source.
Warning: rational domain boundary iterator with evaluate the source.
Using elimination for Dirichlet boundaries.
Assembling...
Warning: rational domain boundary iterator with evaluate the source.
Solving...
Sol: gsMultiPatch (1): #Boundaries= 0, #Interfaces= 0.
Writing to Paraview...
Plotting absolute error in Paraview...
Warning: rational domain boundary iterator with evaluate the source.
Warning: rational domain boundary iterator with evaluate the source.
Warning: rational domain boundary iterator with evaluate the source.
Test is done. Exiting.
testParam -i cube-min-44-contMechanics/cube-min-44-contMechanics.xml -o cube-min-44-contMechanics-k4-sin+cos -k 4 --exact "sin(x) + cos(y)" --rhs "sin(x) + cos(y)"
Using elimination for Dirichlet boundaries.
Assembling...
Warning: rational domain boundary iterator with evaluate the source.
Solving...
Sol: gsMultiPatch (1): #Boundaries= 0, #Interfaces= 0.
Writing to Paraview...
Plotting absolute error in Paraview...
Warning: rational domain boundary iterator with evaluate the source.
Warning: rational domain boundary iterator with evaluate the source.
Warning: rational domain boundary iterator with evaluate the source.
Using elimination for Dirichlet boundaries.
Assembling...
Warning: rational domain boundary iterator with evaluate the source.
Solving...
Sol: gsMultiPatch (1): #Boundaries= 0, #Interfaces= 0.
Writing to Paraview...
Plotting absolute error in Paraview...
Warning: rational domain boundary iterator with evaluate the source.
Warning: rational domain boundary iterator with evaluate the source.
Warning: rational domain boundary iterator with evaluate the source.
Using elimination for Dirichlet boundaries.
Assembling...
Warning: rational domain boundary iterator with evaluate the source.
Solving...
Sol: gsMultiPatch (1): #Boundaries= 0, #Interfaces= 0.
Writing to Paraview...
Plotting absolute error in Paraview...
Warning: rational domain boundary iterator with evaluate the source.
Warning: rational domain boundary iterator with evaluate the source.
Warning: rational domain boundary iterator with evaluate the source.
Using elimination for Dirichlet boundaries.
Assembling...
Warning: rational domain boundary iterator with evaluate the source.
Solving...
Sol: gsMultiPatch (1): #Boundaries= 0, #Interfaces= 0.
Writing to Paraview...
Plotting absolute error in Paraview...
Warning: rational domain boundary iterator with evaluate the source.
Warning: rational domain boundary iterator with evaluate the source.
Warning: rational domain boundary iterator with evaluate the source.
Using elimination for Dirichlet boundaries.
Assembling...
Warning: rational domain boundary iterator with evaluate the source.
Solving...
Sol: gsMultiPatch (1): #Boundaries= 0, #Interfaces= 0.
Writing to Paraview...
Plotting absolute error in Paraview...
Warning: rational domain boundary iterator with evaluate the source.
Warning: rational domain boundary iterator with evaluate the source.
Warning: rational domain boundary iterator with evaluate the source.
Test is done. Exiting.
Error estimate cube-min-44-no-opt-k4-sin+cos: L_1: 2.00
Error estimate cube-min-44-no-opt-k4-sin+cos: L_2: 2.00
Error estimate cube-min-44-no-opt-k4-sin+cos: max: 1.98
Error estimate cube-min-44-winslow-k4-sin+cos: L_1: 2.00
Error estimate cube-min-44-winslow-k4-sin+cos: L_2: 2.00
Error estimate cube-min-44-winslow-k4-sin+cos: max: 1.97
Error estimate cube-min-44-liao-k4-sin+cos: L_1: 2.00
Error estimate cube-min-44-liao-k4-sin+cos: L_2: 2.00
Error estimate cube-min-44-liao-k4-sin+cos: max: 1.97
Error estimate cube-min-44-contMechanics-k4-sin+cos: L_1: 2.00
Error estimate cube-min-44-contMechanics-k4-sin+cos: L_2: 2.00
Error estimate cube-min-44-contMechanics-k4-sin+cos: max: 1.95
In [ ]:
# Main
files = [
["../data/test/cube.xml" , "cube" , False ],
["../data/UBW/turbineBoundary.xml" , "turbine" , False ],
]
genArgList = [
["-a min -n 8 -m 8","min-88",False],
["-a bil -n 8 -m 8","bil-88",False],
];
optArgList = [
#["","no-opt",False],
#["-f winslow --forcePositiveDet" , "winslow",False],
["-f liao --forcePositiveDet" , "liao",False],
["-f liao --forcePositiveDet -q gauss2" , "liao-gauss2",False],
#["-f contMechanics --forcePositiveDet" , "contMechanics",False],
]
testArgList = [
["-k 5 --exact \"sin(x) + cos(y)\" --rhs \"sin(x) + cos(y)\"" , "k5-sin+cos" , False],
]
genFiles = generateParameterizations( files , genArgList )
optFiles = optimizeParameterizations( genFiles , optArgList )
#testFiles = testParameterizations( optFiles , testArgList )
#plotErrors( testFiles )
In [7]:
# Polar
files = [
["../data/test/cube.xml" , "cube" , True ],
#["../data/UBW/turbineBoundary.xml" , "turbine" , False ]
]
genArgList = [
["-a naivePolar -n 4","polar-4",False],
];
optArgList = [
["","no-opt",False],
["-f winslow --forcePositiveDet --polar" , "winslow",False],
["-f liao --forcePositiveDet --polar" , "liao",True],
["-f contMechanics --forcePositiveDet --polar" , "contMechanics",False],
]
testArgList = [
["-k 5 --polar --exact \"sin(x) + cos(y)\" --rhs \"sin(x) + cos(y)\"" , "k5-sin+cos" , False],
]
genFiles = generateParameterizations( files , genArgList )
optFiles = optimizeParameterizations( genFiles , optArgList )
testFiles = testParameterizations( optFiles , testArgList )
plotErrors( testFiles )
genParam -i ../data/test/cube.xml -o cube-polar-4 -a naivePolar -n 4
----------------------
n: 4
m: 8
degree: 3
input: ../data/test/cube.xml
output: cube-polar-4
----------------------
Warning: gsBSplineBasis: Converting basis to periodicBSplineBasis: deg=1, size=5, knot vector:
[ 0 0 0.25 0.5 0.75 1 1 ] (deg=1, size=7, minSpan=0.25, maxSpan=0.25)
Writing the surface (with determinate coordinate) to a paraview file: cube-polar-4/cube-polar-4Det.vts
optParam -i cube-polar-4/cube-polar-4.xml -o cube-polar-4-no-opt
No functional given (-f).
optParam -i cube-polar-4/cube-polar-4.xml -o cube-polar-4-winslow -f winslow --forcePositiveDet --polar
List of user-set options:
Name Value used
hessian_approximation = limited-memory yes
max_iter = 300 yes
mu_strategy = adaptive yes
print_level = 5 yes
print_user_options = yes yes
tol = 1e-08 yes
******************************************************************************
This program contains Ipopt, a library for large-scale nonlinear optimization.
Ipopt is released as open source code under the Eclipse Public License (EPL).
For more information visit http://projects.coin-or.org/Ipopt
******************************************************************************
This is Ipopt version 3.12.5, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation).
Number of nonzeros in equality constraint Jacobian...: 0
Number of nonzeros in inequality constraint Jacobian.: 0
Number of nonzeros in Lagrangian Hessian.............: 0
Total number of variables............................: 50
variables with only lower bounds: 0
variables with lower and upper bounds: 0
variables with only upper bounds: 0
Total number of equality constraints.................: 0
Total number of inequality constraints...............: 112
inequality constraints with only lower bounds: 112
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 0
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
0 1.0281970e+01 0.00e+00 1.14e+00 0.0 0.00e+00 - 0.00e+00 0.00e+00 0
1 8.3457344e+00 0.00e+00 1.60e+00 -6.0 1.14e+00 - 1.98e-02 5.18e-02F 1
2 8.0929520e+00 0.00e+00 6.41e+01 -6.1 2.88e+00 - 6.06e-03 1.25e-01h 4
3 7.6860922e+00 0.00e+00 7.42e+00 0.1 2.56e+00 - 1.00e+00 9.90e-01h 1
4 7.7475675e+00 0.00e+00 1.44e+00 -0.8 1.32e-01 - 9.82e-01 1.00e+00f 1
5 7.3704248e+00 0.00e+00 4.96e+00 -0.8 5.58e-01 - 6.76e-01 1.00e+00f 1
6 3.3364016e+01 2.80e-02 8.81e+04 -1.3 6.13e-01 - 7.86e-01 8.88e-01H 1
7 2.1664945e+01 1.32e-02 1.18e+04 -1.6 1.02e-01 - 1.00e+00 1.54e-01f 1
8 2.1425343e+01 1.32e-02 1.13e+04 -1.6 5.10e+01 - 1.54e-06 1.03e-07H 1
9 1.7739432e+01 3.16e-02 1.87e+05 -1.6 2.06e-01 - 2.24e-04 3.87e-01f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
10 1.7666819e+01 3.17e-02 1.87e+05 -1.6 1.89e+00 - 2.52e-01 1.27e-03h 2
11 1.7645000e+01 3.17e-02 1.87e+05 -1.6 1.89e+00 - 7.29e-01 1.60e-04f 4
12 1.7643718e+01 3.17e-02 1.21e+07 -1.6 1.89e+00 - 2.94e-01 2.80e-04h 3
13 1.3330781e+01 2.95e-01 1.42e+10 -1.6 1.45e+02 - 1.00e+00 8.44e-04f 1
14 1.1343127e+01 4.42e-01 2.27e+14 -1.6 1.42e+03 - 1.09e-01 6.75e-06f 1
15 1.0990314e+01 7.49e-01 9.47e+13 -1.6 4.39e+00 - 5.84e-01 1.14e-02f 3
16 1.0724360e+01 7.40e-01 9.47e+13 -1.6 4.97e+01 - 6.04e-06 1.13e-05F 1
17 1.0462274e+01 6.98e-01 8.17e+13 -1.6 4.69e+00 - 1.37e-01 4.02e-02h 1
18 1.0334303e+01 7.01e-01 8.04e+11 -1.6 4.45e+00 - 9.90e-01 1.75e-04f 12
19 1.3782047e+01 2.70e-01 6.61e+11 -1.6 4.45e+00 - 1.77e-01 7.25e-01h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
20 1.1337194e+01 5.03e-01 6.61e+11 -1.6 4.34e+00 - 5.00e-04 3.50e-03F 1
21 1.1256661e+01 5.14e-01 2.24e+11 -1.6 2.91e+01 - 6.60e-01 2.35e-05f 5
22r 1.1256661e+01 5.14e-01 1.00e+03 0.0 0.00e+00 - 0.00e+00 3.60e-08R 2
23r 1.1256661e+01 5.14e-01 5.28e+02 0.4 9.98e+02 - 2.07e-01 6.61e-04f 1
24 1.1205994e+01 5.13e-01 3.19e+04 -1.6 8.11e-01 - 8.38e-01 4.39e-05h 1
25r 1.1205994e+01 5.13e-01 1.00e+03 -0.3 0.00e+00 - 0.00e+00 2.19e-07R 2
26r 1.1205994e+01 5.13e-01 6.45e+02 1.0 3.18e+02 - 3.14e-02 1.28e-03f 1
27r 1.1205994e+01 5.13e-01 3.03e+02 0.0 3.07e+00 - 5.31e-01 3.32e-02f 1
28r 1.1205994e+01 5.13e-01 5.59e-06 -0.4 1.79e-02 - 1.00e+00 5.58e-01f 1
29r 1.1205994e+01 5.13e-01 4.18e-07 -1.6 1.14e-03 - 9.85e-01 8.07e-01f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
30r 1.1205994e+01 5.13e-01 8.33e-08 -2.4 2.38e-04 - 9.32e-01 7.83e-01f 1
31r 1.1205994e+01 5.13e-01 1.05e-07 -2.1 4.25e-05 - 1.00e+00 1.00e+00f 1
32r 1.1205994e+01 5.13e-01 1.41e-08 -4.2 1.81e-05 - 8.73e-01 7.65e-01f 1
33r 1.1205994e+01 5.13e-01 2.05e-09 -4.7 3.88e-06 - 8.71e-01 1.00e+00f 1
34r 1.1205994e+01 5.13e-01 7.22e-12 -6.3 6.66e-07 - 1.00e+00 1.00e+00f 1
Number of Iterations....: 34
(scaled) (unscaled)
Objective...............: 1.1205993654722100e+01 1.1205993654722100e+01
Dual infeasibility......: 8.5789692752179435e+03 8.5789692752179435e+03
Constraint violation....: 5.1333713417279336e-01 5.1333713417279336e-01
Complementarity.........: 1.0000000000001541e-09 1.0000000000001541e-09
Overall NLP error.......: 2.5285383003927432e+03 8.5789692752179435e+03
Number of objective function evaluations = 78
Number of objective gradient evaluations = 27
Number of equality constraint evaluations = 0
Number of inequality constraint evaluations = 80
Number of equality constraint Jacobian evaluations = 0
Number of inequality constraint Jacobian evaluations = 38
Number of Lagrangian Hessian evaluations = 0
Total CPU secs in IPOPT (w/o function evaluations) = 0.033
Total CPU secs in NLP function evaluations = 11.667
EXIT: Converged to a point of local infeasibility. Problem may be infeasible.
optParam -i cube-polar-4/cube-polar-4.xml -o cube-polar-4-liao -f liao --forcePositiveDet --polar
List of user-set options:
Name Value used
hessian_approximation = limited-memory yes
max_iter = 300 yes
mu_strategy = adaptive yes
print_level = 5 yes
print_user_options = yes yes
tol = 1e-08 yes
******************************************************************************
This program contains Ipopt, a library for large-scale nonlinear optimization.
Ipopt is released as open source code under the Eclipse Public License (EPL).
For more information visit http://projects.coin-or.org/Ipopt
******************************************************************************
This is Ipopt version 3.12.5, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation).
Number of nonzeros in equality constraint Jacobian...: 0
Number of nonzeros in inequality constraint Jacobian.: 0
Number of nonzeros in Lagrangian Hessian.............: 0
Total number of variables............................: 50
variables with only lower bounds: 0
variables with lower and upper bounds: 0
variables with only upper bounds: 0
Total number of equality constraints.................: 0
Total number of inequality constraints...............: 112
inequality constraints with only lower bounds: 112
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 0
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
0 1.0441111e+02 0.00e+00 4.64e+01 0.0 0.00e+00 - 0.00e+00 0.00e+00 0
1 7.5950000e+01 5.90e-01 5.08e+01 -1.7 4.64e+01 - 1.00e+00 7.81e-03f 8
2 4.6484428e+01 2.03e-01 1.21e+01 -1.0 8.09e+00 - 1.00e+00 7.09e-01f 1
3 4.4907822e+01 1.85e-01 8.25e+00 -1.3 1.22e+00 - 9.97e-01 4.07e-01h 1
4 4.4875503e+01 1.85e-01 4.67e+02 -0.2 7.11e-01 - 9.35e-01 7.51e-03h 1
5r 4.4875503e+01 1.85e-01 9.99e+02 -0.0 0.00e+00 - 0.00e+00 2.96e-07R 9
6r 4.4875503e+01 1.85e-01 6.57e+02 1.9 4.98e+02 - 1.33e-02 1.40e-03f 1
7 4.4868541e+01 1.85e-01 8.17e+00 -0.7 2.25e-01 - 1.29e-03 1.29e-03s 13
8r 4.4868541e+01 1.85e-01 9.99e+02 -0.6 0.00e+00 - 0.00e+00 4.03e-07R 6
9r 4.4868541e+01 1.85e-01 6.63e+02 1.7 1.31e+02 - 5.11e-03 1.52e-03f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
10r 4.4868541e+01 1.85e-01 1.25e-04 1.0 1.36e+01 - 1.00e+00 6.69e-03f 1
11 4.4782977e+01 1.83e-01 8.04e+00 -1.7 1.97e-01 - 1.46e-02 1.46e-02s 16
12 4.4782100e+01 1.83e-01 8.04e+00 -1.5 1.92e-01 - 1.50e-04 1.50e-04s 10
13r 4.4782100e+01 1.83e-01 9.99e+02 -0.7 0.00e+00 - 0.00e+00 3.75e-07R 3
14r 4.4782100e+01 1.83e-01 1.01e-04 0.9 2.84e+00 - 1.00e+00 9.22e-03f 1
15r 4.4782100e+01 1.83e-01 3.69e-06 -0.6 1.63e-02 - 1.00e+00 9.35e-01f 1
16r 4.4782100e+01 1.83e-01 8.17e-08 -2.5 1.01e-03 - 9.90e-01 9.90e-01f 1
17r 4.4782100e+01 1.83e-01 1.81e-10 -8.1 1.39e-05 - 9.98e-01 9.98e-01f 1
Number of Iterations....: 17
(scaled) (unscaled)
Objective...............: 4.4782099789743974e+01 4.4782099789743974e+01
Dual infeasibility......: 8.0388917814033789e+00 8.0388917814033789e+00
Constraint violation....: 1.8291151268279698e-01 1.8291151268279698e-01
Complementarity.........: 1.0003833229137083e-09 1.0003833229137083e-09
Overall NLP error.......: 5.6272242468490745e+00 8.0388917814033789e+00
Number of objective function evaluations = 83
Number of objective gradient evaluations = 14
Number of equality constraint evaluations = 0
Number of inequality constraint evaluations = 88
Number of equality constraint Jacobian evaluations = 0
Number of inequality constraint Jacobian evaluations = 22
Number of Lagrangian Hessian evaluations = 0
Total CPU secs in IPOPT (w/o function evaluations) = 0.030
Total CPU secs in NLP function evaluations = 16.043
EXIT: Converged to a point of local infeasibility. Problem may be infeasible.
optParam -i cube-polar-4/cube-polar-4.xml -o cube-polar-4-contMechanics -f contMechanics --forcePositiveDet --polar
List of user-set options:
Name Value used
hessian_approximation = limited-memory yes
max_iter = 300 yes
mu_strategy = adaptive yes
print_level = 5 yes
print_user_options = yes yes
tol = 1e-08 yes
******************************************************************************
This program contains Ipopt, a library for large-scale nonlinear optimization.
Ipopt is released as open source code under the Eclipse Public License (EPL).
For more information visit http://projects.coin-or.org/Ipopt
******************************************************************************
This is Ipopt version 3.12.5, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation).
Number of nonzeros in equality constraint Jacobian...: 0
Number of nonzeros in inequality constraint Jacobian.: 0
Number of nonzeros in Lagrangian Hessian.............: 0
Total number of variables............................: 50
variables with only lower bounds: 0
variables with lower and upper bounds: 0
variables with only upper bounds: 0
Total number of equality constraints.................: 0
Total number of inequality constraints...............: 112
inequality constraints with only lower bounds: 112
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 0
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
0 6.6666667e-01 0.00e+00 4.90e-01 0.0 0.00e+00 - 0.00e+00 0.00e+00 0
1 6.0937977e-01 0.00e+00 1.96e+00 -6.0 4.90e-01 - 2.16e-01 8.22e-02F 1
2 6.2331597e-01 0.00e+00 3.35e+01 0.3 8.11e-01 - 9.08e-02 1.00e+00f 1
3 3.7677677e-01 0.00e+00 9.26e-01 -0.6 1.46e+00 - 8.09e-01 1.00e+00h 1
4 2.8420604e-01 0.00e+00 3.34e-01 -0.9 1.13e+00 - 9.87e-01 1.00e+00h 1
5 2.4563412e-01 0.00e+00 3.06e-01 -1.8 3.49e-01 - 8.13e-01 1.00e+00h 1
6 7.5349560e-01 0.00e+00 2.34e+00 -2.3 1.38e-01 - 1.97e-01 1.00e+00H 1
7 1.6382003e-01 0.00e+00 7.68e-01 -1.9 9.79e-02 - 1.00e+00 1.00e+00f 1
8 1.5578197e-01 0.00e+00 6.52e-01 -1.0 1.44e+00 - 8.47e-01 1.00e+00f 1
9 8.7860581e-02 0.00e+00 1.11e-01 -1.4 6.88e-01 - 6.88e-01 1.00e+00h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
10 1.3237340e-01 0.00e+00 8.34e-01 -2.1 3.84e-01 - 7.93e-01 1.00e+00H 1
11 8.9134728e-02 0.00e+00 2.63e-01 -3.6 8.35e-03 - 1.00e+00 1.00e+00f 1
12 8.1566496e-02 0.00e+00 3.83e-02 -3.7 3.90e-01 - 1.00e+00 1.00e+00h 1
13 8.1054206e-02 0.00e+00 1.70e-02 -4.6 1.00e-01 - 1.00e+00 1.00e+00h 1
14 8.1936040e-02 0.00e+00 1.20e-01 -6.0 2.58e-02 - 1.00e+00 1.00e+00H 1
15 8.1026869e-02 0.00e+00 6.81e-04 -7.6 1.29e-03 - 1.00e+00 1.00e+00f 1
16 8.1026782e-02 0.00e+00 4.14e-04 -9.2 4.95e-02 - 1.00e+00 1.00e+00h 1
17 8.1026670e-02 0.00e+00 1.18e-04 -11.0 2.12e-04 - 1.00e+00 1.00e+00h 1
18 8.1026701e-02 0.00e+00 5.80e-04 -11.0 5.85e-04 - 1.00e+00 1.00e+00h 1
19 8.1026668e-02 0.00e+00 1.96e-05 -11.0 3.38e-04 - 1.00e+00 1.00e+00h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
20 8.1026668e-02 0.00e+00 3.25e-05 -11.0 2.74e-04 - 1.00e+00 1.00e+00h 1
21 8.1026667e-02 0.00e+00 7.02e-06 -11.0 1.52e-05 - 1.00e+00 1.00e+00h 1
22 8.1026667e-02 0.00e+00 3.65e-06 -11.0 1.33e-05 - 1.00e+00 1.00e+00h 1
23 8.1026667e-02 0.00e+00 1.26e-06 -11.0 3.38e-06 - 1.00e+00 1.00e+00h 1
24 8.1026667e-02 0.00e+00 1.21e-06 -11.0 7.36e-07 - 1.00e+00 1.00e+00h 1
25 8.1026667e-02 0.00e+00 8.05e-06 -11.0 1.04e-06 - 1.00e+00 1.00e+00H 1
26 8.1026667e-02 0.00e+00 6.76e-07 -11.0 9.34e-08 - 1.00e+00 1.00e+00f 1
27 8.1026667e-02 0.00e+00 3.04e-07 -11.0 3.73e-06 - 1.00e+00 1.00e+00h 1
28 8.1026667e-02 0.00e+00 1.13e-06 -11.0 3.04e-07 - 1.00e+00 1.00e+00H 1
29 8.1026667e-02 0.00e+00 1.80e-07 -11.0 8.87e-09 - 1.00e+00 1.00e+00f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
30 8.1026667e-02 0.00e+00 7.63e-08 -11.0 3.72e-07 - 1.00e+00 1.00e+00h 1
31 8.1026667e-02 0.00e+00 1.15e-06 -11.0 7.63e-08 - 1.00e+00 1.00e+00H 1
32 8.1026667e-02 0.00e+00 3.06e-07 -11.0 2.32e-08 - 1.00e+00 1.00e+00f 1
33 8.1026667e-02 0.00e+00 1.21e-06 -11.0 3.73e-07 - 1.00e+00 1.00e+00H 1
34 8.1026667e-02 0.00e+00 4.38e-08 -11.0 1.16e-08 - 1.00e+00 1.00e+00F 1
35 8.1026667e-02 0.00e+00 1.66e-08 -11.0 5.94e-10 - 1.00e+00 1.00e+00f 1
36 8.1026667e-02 0.00e+00 3.49e-08 -11.0 1.08e-08 - 1.00e+00 1.00e+00H 1
37 8.1026667e-02 0.00e+00 1.35e-08 -11.0 7.68e-10 - 1.00e+00 1.00e+00F 1
38 8.1026667e-02 0.00e+00 2.72e-08 -11.0 5.20e-10 - 1.00e+00 1.00e+00f 1
39 8.1026667e-02 0.00e+00 3.47e-10 -11.0 1.80e-08 - 1.00e+00 1.00e+00h 1
Number of Iterations....: 39
(scaled) (unscaled)
Objective...............: 8.1026667488191012e-02 8.1026667488191012e-02
Dual infeasibility......: 3.4729163989055678e-10 3.4729163989055678e-10
Constraint violation....: 0.0000000000000000e+00 0.0000000000000000e+00
Complementarity.........: 1.0000000000000001e-11 1.0000000000000001e-11
Overall NLP error.......: 3.4729163989055678e-10 3.4729163989055678e-10
Number of objective function evaluations = 51
Number of objective gradient evaluations = 40
Number of equality constraint evaluations = 0
Number of inequality constraint evaluations = 51
Number of equality constraint Jacobian evaluations = 0
Number of inequality constraint Jacobian evaluations = 40
Number of Lagrangian Hessian evaluations = 0
Total CPU secs in IPOPT (w/o function evaluations) = 1.133
Total CPU secs in NLP function evaluations = 43.107
EXIT: Optimal Solution Found.
testParam -i cube-polar-4-no-opt/cube-polar-4-no-opt.xml -o cube-polar-4-no-opt-k5-sin+cos -k 5 --polar --exact "sin(x) + cos(y)" --rhs "sin(x) + cos(y)"
Using elimination for Dirichlet boundaries.
Assembling...
Warning: rational domain boundary iterator with evaluate the source.
Warning: rational domain boundary iterator with evaluate the source.
Solving...
Sol: gsMultiPatch (1): #Boundaries= 0, #Interfaces= 0.
Writing to Paraview...
Plotting absolute error in Paraview...
Warning: rational domain boundary iterator with evaluate the source.
Warning: rational domain boundary iterator with evaluate the source.
Warning: rational domain boundary iterator with evaluate the source.
Using elimination for Dirichlet boundaries.
Assembling...
Warning: rational domain boundary iterator with evaluate the source.
Warning: rational domain boundary iterator with evaluate the source.
Solving...
Sol: gsMultiPatch (1): #Boundaries= 0, #Interfaces= 0.
Writing to Paraview...
Plotting absolute error in Paraview...
Warning: rational domain boundary iterator with evaluate the source.
Warning: rational domain boundary iterator with evaluate the source.
Warning: rational domain boundary iterator with evaluate the source.
Using elimination for Dirichlet boundaries.
Assembling...
Warning: rational domain boundary iterator with evaluate the source.
Warning: rational domain boundary iterator with evaluate the source.
Solving...
Sol: gsMultiPatch (1): #Boundaries= 0, #Interfaces= 0.
Writing to Paraview...
Plotting absolute error in Paraview...
Warning: rational domain boundary iterator with evaluate the source.
Warning: rational domain boundary iterator with evaluate the source.
Warning: rational domain boundary iterator with evaluate the source.
Using elimination for Dirichlet boundaries.
Assembling...
Warning: rational domain boundary iterator with evaluate the source.
Warning: rational domain boundary iterator with evaluate the source.
Solving...
Sol: gsMultiPatch (1): #Boundaries= 0, #Interfaces= 0.
Writing to Paraview...
Plotting absolute error in Paraview...
Warning: rational domain boundary iterator with evaluate the source.
Warning: rational domain boundary iterator with evaluate the source.
Warning: rational domain boundary iterator with evaluate the source.
Using elimination for Dirichlet boundaries.
Assembling...
Warning: rational domain boundary iterator with evaluate the source.
Warning: rational domain boundary iterator with evaluate the source.
Solving...
Sol: gsMultiPatch (1): #Boundaries= 0, #Interfaces= 0.
Writing to Paraview...
Plotting absolute error in Paraview...
Warning: rational domain boundary iterator with evaluate the source.
Warning: rational domain boundary iterator with evaluate the source.
Warning: rational domain boundary iterator with evaluate the source.
Using elimination for Dirichlet boundaries.
Assembling...
Warning: rational domain boundary iterator with evaluate the source.
Warning: rational domain boundary iterator with evaluate the source.
Solving...
Sol: gsMultiPatch (1): #Boundaries= 0, #Interfaces= 0.
Writing to Paraview...
Plotting absolute error in Paraview...
Warning: rational domain boundary iterator with evaluate the source.
Warning: rational domain boundary iterator with evaluate the source.
Warning: rational domain boundary iterator with evaluate the source.
Test is done. Exiting.
testParam -i cube-polar-4-winslow/cube-polar-4-winslow.xml -o cube-polar-4-winslow-k5-sin+cos -k 5 --polar --exact "sin(x) + cos(y)" --rhs "sin(x) + cos(y)"
Using elimination for Dirichlet boundaries.
Assembling...
Warning: rational domain boundary iterator with evaluate the source.
Warning: rational domain boundary iterator with evaluate the source.
Solving...
Sol: gsMultiPatch (1): #Boundaries= 0, #Interfaces= 0.
Writing to Paraview...
Plotting absolute error in Paraview...
Warning: rational domain boundary iterator with evaluate the source.
Warning: rational domain boundary iterator with evaluate the source.
Warning: rational domain boundary iterator with evaluate the source.
Using elimination for Dirichlet boundaries.
Assembling...
Warning: rational domain boundary iterator with evaluate the source.
Warning: rational domain boundary iterator with evaluate the source.
Solving...
Sol: gsMultiPatch (1): #Boundaries= 0, #Interfaces= 0.
Writing to Paraview...
Plotting absolute error in Paraview...
Warning: rational domain boundary iterator with evaluate the source.
Warning: rational domain boundary iterator with evaluate the source.
Warning: rational domain boundary iterator with evaluate the source.
Using elimination for Dirichlet boundaries.
Assembling...
Warning: rational domain boundary iterator with evaluate the source.
Warning: rational domain boundary iterator with evaluate the source.
Solving...
Sol: gsMultiPatch (1): #Boundaries= 0, #Interfaces= 0.
Writing to Paraview...
Plotting absolute error in Paraview...
Warning: rational domain boundary iterator with evaluate the source.
Warning: rational domain boundary iterator with evaluate the source.
Warning: rational domain boundary iterator with evaluate the source.
Using elimination for Dirichlet boundaries.
Assembling...
Warning: rational domain boundary iterator with evaluate the source.
Warning: rational domain boundary iterator with evaluate the source.
Solving...
Sol: gsMultiPatch (1): #Boundaries= 0, #Interfaces= 0.
Writing to Paraview...
Plotting absolute error in Paraview...
Warning: rational domain boundary iterator with evaluate the source.
Warning: rational domain boundary iterator with evaluate the source.
Warning: rational domain boundary iterator with evaluate the source.
Using elimination for Dirichlet boundaries.
Assembling...
Warning: rational domain boundary iterator with evaluate the source.
Warning: rational domain boundary iterator with evaluate the source.
Solving...
Sol: gsMultiPatch (1): #Boundaries= 0, #Interfaces= 0.
Writing to Paraview...
Plotting absolute error in Paraview...
Warning: rational domain boundary iterator with evaluate the source.
Warning: rational domain boundary iterator with evaluate the source.
Warning: rational domain boundary iterator with evaluate the source.
Using elimination for Dirichlet boundaries.
Assembling...
Warning: rational domain boundary iterator with evaluate the source.
Warning: rational domain boundary iterator with evaluate the source.
Solving...
Sol: gsMultiPatch (1): #Boundaries= 0, #Interfaces= 0.
Writing to Paraview...
Plotting absolute error in Paraview...
Warning: rational domain boundary iterator with evaluate the source.
Warning: rational domain boundary iterator with evaluate the source.
Warning: rational domain boundary iterator with evaluate the source.
Test is done. Exiting.
testParam -i cube-polar-4-liao/cube-polar-4-liao.xml -o cube-polar-4-liao-k5-sin+cos -k 5 --polar --exact "sin(x) + cos(y)" --rhs "sin(x) + cos(y)"
Using elimination for Dirichlet boundaries.
Assembling...
Warning: rational domain boundary iterator with evaluate the source.
Warning: rational domain boundary iterator with evaluate the source.
Solving...
Sol: gsMultiPatch (1): #Boundaries= 0, #Interfaces= 0.
Writing to Paraview...
Plotting absolute error in Paraview...
Warning: rational domain boundary iterator with evaluate the source.
Warning: rational domain boundary iterator with evaluate the source.
Warning: rational domain boundary iterator with evaluate the source.
Using elimination for Dirichlet boundaries.
Assembling...
Warning: rational domain boundary iterator with evaluate the source.
Warning: rational domain boundary iterator with evaluate the source.
Solving...
Sol: gsMultiPatch (1): #Boundaries= 0, #Interfaces= 0.
Writing to Paraview...
Plotting absolute error in Paraview...
Warning: rational domain boundary iterator with evaluate the source.
Warning: rational domain boundary iterator with evaluate the source.
Warning: rational domain boundary iterator with evaluate the source.
Using elimination for Dirichlet boundaries.
Assembling...
Warning: rational domain boundary iterator with evaluate the source.
Warning: rational domain boundary iterator with evaluate the source.
Solving...
Sol: gsMultiPatch (1): #Boundaries= 0, #Interfaces= 0.
Writing to Paraview...
Plotting absolute error in Paraview...
Warning: rational domain boundary iterator with evaluate the source.
Warning: rational domain boundary iterator with evaluate the source.
Warning: rational domain boundary iterator with evaluate the source.
Using elimination for Dirichlet boundaries.
Assembling...
Warning: rational domain boundary iterator with evaluate the source.
Warning: rational domain boundary iterator with evaluate the source.
Solving...
Sol: gsMultiPatch (1): #Boundaries= 0, #Interfaces= 0.
Writing to Paraview...
Plotting absolute error in Paraview...
Warning: rational domain boundary iterator with evaluate the source.
Warning: rational domain boundary iterator with evaluate the source.
Warning: rational domain boundary iterator with evaluate the source.
Using elimination for Dirichlet boundaries.
Assembling...
Warning: rational domain boundary iterator with evaluate the source.
Warning: rational domain boundary iterator with evaluate the source.
Solving...
Sol: gsMultiPatch (1): #Boundaries= 0, #Interfaces= 0.
Writing to Paraview...
Plotting absolute error in Paraview...
Warning: rational domain boundary iterator with evaluate the source.
Warning: rational domain boundary iterator with evaluate the source.
Warning: rational domain boundary iterator with evaluate the source.
Using elimination for Dirichlet boundaries.
Assembling...
Warning: rational domain boundary iterator with evaluate the source.
Warning: rational domain boundary iterator with evaluate the source.
Solving...
Sol: gsMultiPatch (1): #Boundaries= 0, #Interfaces= 0.
Writing to Paraview...
Plotting absolute error in Paraview...
Warning: rational domain boundary iterator with evaluate the source.
Warning: rational domain boundary iterator with evaluate the source.
Warning: rational domain boundary iterator with evaluate the source.
Test is done. Exiting.
testParam -i cube-polar-4-contMechanics/cube-polar-4-contMechanics.xml -o cube-polar-4-contMechanics-k5-sin+cos -k 5 --polar --exact "sin(x) + cos(y)" --rhs "sin(x) + cos(y)"
Using elimination for Dirichlet boundaries.
Assembling...
Warning: rational domain boundary iterator with evaluate the source.
Warning: rational domain boundary iterator with evaluate the source.
Solving...
Sol: gsMultiPatch (1): #Boundaries= 0, #Interfaces= 0.
Writing to Paraview...
Plotting absolute error in Paraview...
Warning: rational domain boundary iterator with evaluate the source.
Warning: rational domain boundary iterator with evaluate the source.
Warning: rational domain boundary iterator with evaluate the source.
Using elimination for Dirichlet boundaries.
Assembling...
Warning: rational domain boundary iterator with evaluate the source.
Warning: rational domain boundary iterator with evaluate the source.
Solving...
Sol: gsMultiPatch (1): #Boundaries= 0, #Interfaces= 0.
Writing to Paraview...
Plotting absolute error in Paraview...
Warning: rational domain boundary iterator with evaluate the source.
Warning: rational domain boundary iterator with evaluate the source.
Warning: rational domain boundary iterator with evaluate the source.
Using elimination for Dirichlet boundaries.
Assembling...
Warning: rational domain boundary iterator with evaluate the source.
Warning: rational domain boundary iterator with evaluate the source.
Solving...
Sol: gsMultiPatch (1): #Boundaries= 0, #Interfaces= 0.
Writing to Paraview...
Plotting absolute error in Paraview...
Warning: rational domain boundary iterator with evaluate the source.
Warning: rational domain boundary iterator with evaluate the source.
Warning: rational domain boundary iterator with evaluate the source.
Using elimination for Dirichlet boundaries.
Assembling...
Warning: rational domain boundary iterator with evaluate the source.
Warning: rational domain boundary iterator with evaluate the source.
Solving...
Sol: gsMultiPatch (1): #Boundaries= 0, #Interfaces= 0.
Writing to Paraview...
Plotting absolute error in Paraview...
Warning: rational domain boundary iterator with evaluate the source.
Warning: rational domain boundary iterator with evaluate the source.
Warning: rational domain boundary iterator with evaluate the source.
Using elimination for Dirichlet boundaries.
Assembling...
Warning: rational domain boundary iterator with evaluate the source.
Warning: rational domain boundary iterator with evaluate the source.
Solving...
Sol: gsMultiPatch (1): #Boundaries= 0, #Interfaces= 0.
Writing to Paraview...
Plotting absolute error in Paraview...
Warning: rational domain boundary iterator with evaluate the source.
Warning: rational domain boundary iterator with evaluate the source.
Warning: rational domain boundary iterator with evaluate the source.
Using elimination for Dirichlet boundaries.
Assembling...
Warning: rational domain boundary iterator with evaluate the source.
Warning: rational domain boundary iterator with evaluate the source.
Solving...
Sol: gsMultiPatch (1): #Boundaries= 0, #Interfaces= 0.
Writing to Paraview...
Plotting absolute error in Paraview...
Warning: rational domain boundary iterator with evaluate the source.
Warning: rational domain boundary iterator with evaluate the source.
Warning: rational domain boundary iterator with evaluate the source.
Test is done. Exiting.
Error estimate cube-polar-4-no-opt-k5-sin+cos: L_1: 2.02
Error estimate cube-polar-4-no-opt-k5-sin+cos: L_2: 2.02
Error estimate cube-polar-4-no-opt-k5-sin+cos: max: 1.94
Error estimate cube-polar-4-winslow-k5-sin+cos: L_1: 0.21
Error estimate cube-polar-4-winslow-k5-sin+cos: L_2: 0.12
Error estimate cube-polar-4-winslow-k5-sin+cos: max: -0.13
Error estimate cube-polar-4-liao-k5-sin+cos: L_1: 0.62
Error estimate cube-polar-4-liao-k5-sin+cos: L_2: 0.46
Error estimate cube-polar-4-liao-k5-sin+cos: max: -0.01
Error estimate cube-polar-4-contMechanics-k5-sin+cos: L_1: 2.02
Error estimate cube-polar-4-contMechanics-k5-sin+cos: L_2: 2.02
Error estimate cube-polar-4-contMechanics-k5-sin+cos: max: 1.94
In [ ]:
Content source: SteffenPL/gsSandbox
Similar notebooks: