In [2]:
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/chart_generator/results
binPath = "/mnt/mint/home/steffenpl/Projects/motor/chart_generator/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/chart_generator/results
In [6]:
# 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 [18]:
# 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",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/cube.xml -o cube-min-88 -a min -n 8 -m 8
----------------------
n: 8
m: 8
degree: 3
input: ../data/test/cube.xml
output: cube-min-88
----------------------
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)
genParam -i ../data/test/cube.xml -o cube-bil-88 -a bil -n 8 -m 8
----------------------
n: 8
m: 8
degree: 3
input: ../data/test/cube.xml
output: cube-bil-88
----------------------
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)
genParam -i ../data/UBW/turbineBoundary.xml -o turbine-min-88 -a min -n 8 -m 8
----------------------
n: 8
m: 8
degree: 3
input: ../data/UBW/turbineBoundary.xml
output: turbine-min-88
----------------------
Warning: gsBSplineBasis: Converting basis to periodicBSplineBasis: deg=3, size=15, knot vector:
[ 0 0 0 0 0.1 0.2 ... 0.8 0.9 1 1 1 1 ] (deg=3, size=19, minSpan=0.1, maxSpan=0.1)
genParam -i ../data/UBW/turbineBoundary.xml -o turbine-bil-88 -a bil -n 8 -m 8
----------------------
n: 8
m: 8
degree: 3
input: ../data/UBW/turbineBoundary.xml
output: turbine-bil-88
----------------------
Warning: gsBSplineBasis: Converting basis to periodicBSplineBasis: deg=3, size=15, knot vector:
[ 0 0 0 0 0.1 0.2 ... 0.8 0.9 1 1 1 1 ] (deg=3, size=19, minSpan=0.1, maxSpan=0.1)
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.130
Total CPU secs in NLP function evaluations = 35.473
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.913
Total CPU secs in NLP function evaluations = 105.517
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.017
Total CPU secs in NLP function evaluations = 330.347
EXIT: Solved To Acceptable Level.
optParam -i turbine-bil-88/turbine-bil-88.xml -o turbine-bil-88-no-opt
No functional given (-f).
optParam -i turbine-bil-88/turbine-bil-88.xml -o turbine-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 2.0231826e+01 0.00e+00 1.00e+02 0.0 0.00e+00 - 0.00e+00 0.00e+00 0
1 1.9150293e+01 0.00e+00 2.56e+01 -3.5 1.00e+02 - 7.55e-06 5.39e-06F 1
2 1.8871369e+01 0.00e+00 1.62e+01 -2.2 1.39e-02 - 1.00e+00 1.00e+00h 1
3 1.8331343e+01 0.00e+00 7.09e+00 -3.2 4.93e-04 - 1.00e+00 1.00e+00h 1
4 1.7736607e+01 0.00e+00 2.49e+00 -3.8 9.89e-04 - 1.00e+00 1.00e+00h 1
5 1.7309965e+01 0.00e+00 1.32e+01 -4.0 1.49e-03 - 1.00e+00 1.00e+00h 1
6 1.7194969e+01 0.00e+00 7.18e+00 -4.5 2.02e-03 - 1.00e+00 1.00e+00h 1
7 1.7041631e+01 0.00e+00 1.79e+00 -4.2 4.05e-03 - 1.00e+00 1.00e+00h 1
8 1.7010105e+01 0.00e+00 4.90e-01 -4.7 2.21e-03 - 1.00e+00 1.00e+00h 1
9 1.7004305e+01 0.00e+00 3.64e-01 -5.3 1.03e-03 - 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.6999893e+01 0.00e+00 1.66e-01 -6.6 3.80e-04 - 1.00e+00 1.00e+00h 1
11 1.6995615e+01 0.00e+00 1.03e+00 -7.7 6.88e-04 - 1.00e+00 1.00e+00h 1
12 1.7204870e+01 0.00e+00 6.89e+00 -8.7 1.42e-03 - 8.00e-01 1.00e+00H 1
13 1.6989500e+01 0.00e+00 8.07e-01 -9.9 1.12e-03 - 1.00e+00 1.00e+00f 1
14 1.7044282e+01 0.00e+00 3.50e+00 -10.4 1.97e-03 - 1.00e+00 1.00e+00h 1
15 1.6983821e+01 0.00e+00 1.14e-01 -10.5 1.21e-03 - 1.00e+00 1.00e+00h 1
16 1.6982290e+01 0.00e+00 1.19e-01 -11.0 1.11e-03 - 1.00e+00 1.00e+00h 1
17 1.7018238e+01 0.00e+00 4.39e+00 -11.0 3.21e-03 - 1.00e+00 1.00e+00H 1
18 1.7012493e+01 0.00e+00 2.76e+00 -11.0 2.86e-02 - 1.00e+00 1.56e-02f 7
19 1.7509809e+01 0.00e+00 7.64e+00 -11.0 3.93e-03 - 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.7466442e+01 0.00e+00 5.92e+00 -11.0 3.25e-03 - 1.00e+00 3.12e-02f 6
21 1.7016734e+01 0.00e+00 5.47e+00 -11.0 5.70e-03 - 1.00e+00 1.00e+00H 1
22 1.7008532e+01 0.00e+00 1.61e+00 -11.0 4.57e-03 - 1.00e+00 6.25e-02f 5
23 1.6960817e+01 0.00e+00 1.35e+00 -11.0 9.25e-04 - 1.00e+00 1.00e+00h 1
24 1.7514549e+01 0.00e+00 4.65e+00 -11.0 2.66e-03 - 1.00e+00 1.00e+00H 1
25 1.6957022e+01 0.00e+00 5.92e-01 -11.0 2.54e-03 - 1.00e+00 1.00e+00f 1
26 1.7903189e+01 0.00e+00 5.81e+01 -10.7 2.69e-03 - 1.00e+00 1.00e+00h 1
27 1.6952822e+01 0.00e+00 6.54e-01 -10.8 6.02e-03 - 1.00e+00 1.00e+00h 1
28 1.6951881e+01 0.00e+00 5.08e-01 -10.6 5.77e-03 - 1.00e+00 1.00e+00h 1
29 1.6950474e+01 0.00e+00 5.14e-01 -11.0 7.23e-05 - 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.6952981e+01 0.00e+00 5.93e-01 -11.0 2.04e-04 - 1.00e+00 1.00e+00H 1
31 1.6949174e+01 0.00e+00 9.23e-02 -11.0 1.52e-04 - 1.00e+00 1.00e+00f 1
32 1.6948571e+01 0.00e+00 1.50e-01 -11.0 4.74e-04 - 1.00e+00 1.00e+00h 1
33 1.6947850e+01 0.00e+00 6.66e-01 -11.0 7.52e-04 - 1.00e+00 1.00e+00h 1
34 1.7052687e+01 0.00e+00 4.59e+00 -11.0 1.96e-03 - 1.00e+00 1.00e+00H 1
35 1.7023800e+01 0.00e+00 2.83e+00 -11.0 9.21e-04 - 1.00e+00 1.00e+00f 1
36 1.6998240e+01 0.00e+00 7.05e+00 -11.0 1.64e-03 - 1.00e+00 1.00e+00h 1
37 1.8495674e+01 0.00e+00 2.16e+01 -11.0 2.32e-03 - 1.00e+00 1.00e+00H 1
38 1.6953262e+01 0.00e+00 2.73e+00 -11.0 2.34e-03 - 1.00e+00 1.00e+00f 1
39 1.6940279e+01 0.00e+00 7.73e-01 -11.0 6.30e-03 - 3.69e-01 1.00e+00h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
40 1.6937065e+01 0.00e+00 2.79e-01 -11.0 7.47e-04 - 1.00e+00 1.00e+00h 1
41 1.6936139e+01 0.00e+00 1.74e-01 -11.0 2.73e-04 - 1.00e+00 1.00e+00h 1
42 1.6935259e+01 0.00e+00 8.63e-02 -11.0 1.05e-04 - 1.00e+00 1.00e+00h 1
43 1.6935576e+01 0.00e+00 5.48e-01 -11.0 1.97e-04 - 1.00e+00 1.00e+00H 1
44 1.6935081e+01 0.00e+00 6.18e-01 -11.0 9.22e-05 - 1.00e+00 1.00e+00f 1
45 1.6934216e+01 0.00e+00 1.09e-01 -11.0 1.67e-04 - 1.00e+00 1.00e+00h 1
46 1.6933829e+01 0.00e+00 6.38e-02 -11.0 1.83e-04 - 1.00e+00 1.00e+00h 1
47 1.6934099e+01 0.00e+00 2.95e-01 -11.0 2.92e-04 - 1.00e+00 1.00e+00H 1
48 1.6933894e+01 0.00e+00 2.16e-01 -11.0 1.96e-03 - 1.00e+00 2.50e-01f 3
49 1.7024330e+01 0.00e+00 2.62e+00 -11.0 9.85e-04 - 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.6932158e+01 0.00e+00 1.75e-01 -11.0 1.18e-03 - 1.00e+00 1.00e+00f 1
51 1.6937400e+01 0.00e+00 1.06e+00 -11.0 1.67e-03 - 1.00e+00 1.00e+00h 1
52 1.6931760e+01 0.00e+00 2.11e-01 -11.0 4.54e-04 - 1.00e+00 1.00e+00h 1
53 1.6932562e+01 0.00e+00 7.34e-01 -11.0 3.45e-04 - 1.00e+00 1.00e+00h 1
54 1.6931597e+01 0.00e+00 3.39e-02 -11.0 1.84e-04 - 1.00e+00 1.00e+00h 1
55 1.6931495e+01 0.00e+00 3.34e-02 -11.0 1.38e-04 - 1.00e+00 1.00e+00h 1
56 1.7116464e+01 0.00e+00 4.83e+00 -11.0 3.24e-03 - 1.00e+00 1.00e+00H 1
57 1.6953522e+01 0.00e+00 1.20e+00 -11.0 1.89e-03 - 1.00e+00 1.00e+00f 1
58 1.8044045e+01 0.00e+00 2.57e+01 -11.0 3.79e-03 - 1.00e+00 1.00e+00H 1
59 1.7109118e+01 0.00e+00 2.43e+00 -11.0 2.60e-03 - 3.96e-01 1.00e+00F 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
60 1.6983060e+01 0.00e+00 1.78e+00 -11.0 2.98e-03 - 1.00e+00 2.50e-01f 3
61 1.8614767e+01 0.00e+00 9.60e+01 -11.0 1.91e-03 - 1.00e+00 1.00e+00H 1
62 1.6939793e+01 0.00e+00 1.01e+00 -11.0 1.92e-03 - 1.00e+00 1.00e+00f 1
63 1.6935208e+01 0.00e+00 6.83e-01 -11.0 4.41e-03 - 6.15e-01 1.00e+00h 1
64 1.6941914e+01 0.00e+00 7.89e-01 -11.0 3.23e-04 - 1.00e+00 1.00e+00H 1
65 1.6929817e+01 0.00e+00 2.22e-01 -11.0 2.38e-04 - 1.00e+00 1.00e+00f 1
66 1.6932553e+01 0.00e+00 4.67e-01 -11.0 5.75e-04 - 1.00e+00 1.00e+00h 1
67 1.6928634e+01 0.00e+00 3.71e-02 -11.0 5.83e-04 - 1.00e+00 1.00e+00h 1
68 1.6928553e+01 0.00e+00 2.93e-02 -11.0 3.80e-04 - 1.00e+00 1.00e+00h 1
69 1.6934671e+01 0.00e+00 1.80e+00 -11.0 3.31e-04 - 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.6932796e+01 0.00e+00 3.55e-01 -11.0 3.30e-04 - 1.00e+00 5.00e-01f 2
71 1.6942912e+01 0.00e+00 8.00e-01 -11.0 6.28e-04 - 1.00e+00 1.00e+00H 1
72 1.6934671e+01 0.00e+00 5.17e-01 -11.0 3.64e-04 - 1.00e+00 1.00e+00F 1
73 1.6931327e+01 0.00e+00 4.70e-01 -11.0 3.02e-04 - 1.00e+00 1.00e+00f 1
74 1.6930350e+01 0.00e+00 2.33e-01 -11.0 7.64e-04 - 1.00e+00 1.00e+00h 1
75 1.6927795e+01 0.00e+00 2.84e-02 -11.0 5.25e-04 - 1.00e+00 1.00e+00h 1
76 1.6927796e+01 0.00e+00 8.71e-02 -11.0 3.06e-04 - 1.00e+00 1.00e+00h 1
77 1.6927753e+01 0.00e+00 1.20e-01 -11.0 6.94e-05 - 1.00e+00 1.00e+00h 1
78 1.6927726e+01 0.00e+00 1.77e-02 -11.0 3.49e-05 - 1.00e+00 1.00e+00h 1
79 1.6927689e+01 0.00e+00 1.56e-02 -11.0 2.55e-05 - 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.6928946e+01 0.00e+00 4.13e-01 -11.0 2.06e-04 - 1.00e+00 1.00e+00H 1
81 1.6927793e+01 0.00e+00 2.09e-01 -11.0 3.11e-04 - 1.00e+00 1.00e+00f 1
82 1.6965360e+01 0.00e+00 1.75e+00 -11.0 6.05e-04 - 1.00e+00 1.00e+00H 1
83 1.6926931e+01 0.00e+00 3.55e-02 -11.0 5.59e-04 - 1.00e+00 1.00e+00f 1
84 1.6926861e+01 0.00e+00 1.38e-01 -11.0 1.22e-03 - 1.00e+00 1.00e+00h 1
85 1.8646442e+01 0.00e+00 4.24e+01 -11.0 1.72e-02 - 1.00e+00 1.00e+00H 1
86 1.8495468e+01 0.00e+00 3.51e+01 -11.0 1.90e-03 - 1.00e+00 1.00e+00f 1
87 1.7359323e+01 0.00e+00 2.52e+01 -11.0 1.99e-02 - 3.33e-01 1.00e+00h 1
88 1.7303830e+01 0.00e+00 1.73e+01 -11.0 1.18e+00 - 2.85e-04 4.71e-04F 1
89 1.7525604e+01 0.00e+00 7.69e+03 -11.0 6.79e-03 - 2.62e-12 2.50e-01h 3
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
90 1.7067367e+01 0.00e+00 9.14e+00 -11.0 7.47e-03 - 8.54e-01 1.00e+00h 1
91 1.7566161e+01 0.00e+00 1.92e+01 -11.0 3.53e-03 - 1.00e+00 1.00e+00H 1
92 1.6963799e+01 0.00e+00 4.31e+00 -11.0 1.41e-03 - 1.00e+00 1.00e+00f 1
93 1.6948260e+01 0.00e+00 2.87e+00 -11.0 4.57e-03 - 4.02e-01 1.00e+00h 1
94 1.6936511e+01 0.00e+00 2.32e+00 -11.0 1.09e-02 - 1.00e+00 3.12e-02h 6
95 2.1315335e+01 0.00e+00 4.38e+01 -11.0 8.67e-03 - 8.05e-01 1.00e+00H 1
96 2.1088680e+01 0.00e+00 1.97e+01 -11.0 2.55e-03 - 1.00e+00 6.25e-02f 5
97 2.0375213e+01 2.22e-04 7.11e+02 -11.0 9.08e-03 - 8.17e-02 7.08e-01F 1
In iteration 97, 1 Slack too small, adjusting variable bound
98 2.0375213e+01 2.22e-04 7.11e+02 -11.0 1.10e-02 - 1.00e+00 3.67e-10h 1
99 2.0375213e+01 2.22e-04 1.91e+10 -11.0 1.69e-02 - 1.00e+00 8.18e-09h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
100 2.0129318e+01 2.30e-04 1.23e+07 -11.0 1.19e-02 - 1.00e+00 1.56e-02h 7
101 2.0261285e+01 2.32e-04 3.75e+06 -11.0 2.15e-03 - 7.25e-01 1.00e+00H 1
102 1.9171396e+01 2.19e-04 1.30e+07 -11.0 1.22e-01 - 1.00e+00 3.28e-03f 9
103 1.8819112e+01 2.86e-04 7.50e+01 -11.0 4.45e-04 - 1.00e+00 1.00e+00h 1
104 4.6949642e+01 8.01e-06 2.88e+06 -11.0 2.77e-03 - 4.55e-01 7.82e-01H 1
105 3.3148841e+02 9.51e-06 1.22e+06 -11.0 1.77e+03 - 4.13e-09 4.13e-09s 45
106r 3.3148841e+02 9.51e-06 1.00e+03 -3.8 0.00e+00 - 0.00e+00 0.00e+00R 1
In iteration 106, 1 Slack too small, adjusting variable bound
107r 3.3148841e+02 9.51e-06 6.80e+05 -9.0 1.73e-01 - 4.95e-01 1.04e-08f 1
108r 3.3148841e+02 9.51e-06 7.35e+03 -1.6 3.15e-04 - 9.89e-01 5.73e-01f 1
109 2.1781974e+02 9.57e-06 1.44e+04 -11.0 1.40e-02 - 3.61e-01 6.60e-06F 1
In iteration 109, 1 Slack too small, adjusting variable bound
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
110 2.1483804e+02 9.58e-06 1.02e+08 -11.0 2.72e-02 - 4.54e-01 1.33e-07F 1
111 2.1444173e+02 9.58e-06 2.28e+06 -11.0 1.46e+04 - 8.09e-12 1.80e-13H 1
In iteration 111, 1 Slack too small, adjusting variable bound
112 1.5063951e+02 9.66e-06 2.28e+06 -11.0 1.46e+04 - 3.67e-09 4.32e-11f 1
113 3.9328928e+01 1.12e-05 2.74e+10 -11.0 2.23e+04 - 1.00e+00 4.24e-10F 1
114 3.9278837e+01 1.12e-05 2.73e+10 -11.0 1.13e+05 - 4.64e-19 1.57e-13H 1
115 2.2122249e+01 2.80e-04 2.73e+10 -11.0 1.28e-03 - 7.67e-12 1.00e+00f 1
116 2.1291368e+01 2.43e-04 5.40e+02 -11.0 1.27e-03 - 1.00e+00 1.00e+00h 1
117r 2.1291368e+01 2.43e-04 1.00e+03 -2.9 0.00e+00 - 0.00e+00 9.71e-11R 7
118r 2.1291368e+01 2.43e-04 1.57e-10 -4.9 1.35e+00 - 1.00e+00 9.32e-04f 1
119 2.1291368e+01 2.43e-04 1.66e+04 -11.0 2.43e-04 - 1.00e+00 5.13e-08h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
120 2.1237938e+01 2.37e-04 1.17e+07 -11.0 9.12e-05 - 1.00e+00 1.40e-01h 1
In iteration 120, 1 Slack too small, adjusting variable bound
121 2.1237938e+01 2.37e-04 1.33e+07 -11.0 2.34e-05 - 1.00e+00 5.22e-10h 1
122 2.1022319e+01 2.00e-04 4.29e+04 -11.0 2.34e-05 - 1.00e+00 9.97e-01h 1
In iteration 122, 1 Slack too small, adjusting variable bound
123 2.0982130e+01 1.83e-04 2.75e+05 -11.0 2.99e-05 - 1.00e+00 9.76e-01h 1
124 2.0969464e+01 1.75e-04 2.56e+01 -11.0 1.73e-05 - 1.00e+00 1.00e+00h 1
125 2.0949167e+01 1.67e-04 7.85e+01 -11.0 1.78e-05 - 1.00e+00 1.00e+00h 1
126 2.0914218e+01 1.39e-04 3.97e+02 -11.0 3.08e-04 - 1.00e+00 1.00e+00h 1
127 2.0532080e+01 1.46e-04 1.34e+02 -11.0 5.72e-04 - 1.00e+00 1.00e+00h 1
128 2.0416105e+01 1.59e-04 2.66e+01 -11.0 3.21e-04 - 1.00e+00 1.00e+00h 1
129 2.0291200e+01 1.45e-04 1.62e+02 -11.0 6.40e-04 - 1.00e+00 1.00e+00H 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
130 2.0198799e+01 2.06e-04 2.23e+02 -11.0 8.62e-04 - 1.00e+00 1.00e+00H 1
131 2.0059696e+01 1.51e-04 2.05e+02 -11.0 1.15e-03 - 1.00e+00 1.00e+00H 1
132 1.9695452e+01 1.46e-04 7.97e+06 -11.0 9.69e-03 - 1.00e+00 6.25e-02f 5
133 1.9602811e+01 1.51e-04 7.71e+06 -11.0 4.53e-03 - 1.00e+00 6.25e-02h 5
134 1.9802927e+01 2.60e-04 3.69e+02 -11.0 1.37e-03 - 1.00e+00 1.00e+00H 1
In iteration 134, 1 Slack too small, adjusting variable bound
135 1.9405526e+01 1.36e-03 7.48e+07 -11.0 1.24e-02 - 1.00e+00 5.56e-01F 1
136 1.9262500e+01 1.40e-03 7.55e+07 -11.0 2.30e-02 - 1.00e+00 1.56e-02f 7
137 1.9187879e+01 1.44e-03 7.81e+07 -11.0 1.99e-02 - 1.00e+00 7.81e-03h 8
138 1.9132332e+01 1.43e-03 8.06e+07 -11.0 1.89e-02 - 1.00e+00 3.91e-03h 9
In iteration 138, 1 Slack too small, adjusting variable bound
139 1.8797168e+01 1.44e-03 3.87e+06 -11.0 1.98e-03 - 1.00e+00 9.76e-01H 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
140 1.8780281e+01 1.41e-03 8.03e+07 -11.0 2.91e-02 - 1.00e+00 7.81e-03h 8
141 1.8767035e+01 1.38e-03 7.87e+07 -11.0 8.45e-02 - 1.00e+00 3.91e-03h 9
142 1.8673248e+01 1.52e-03 7.50e+07 -11.0 4.91e-02 - 1.00e+00 3.12e-02h 6
143 1.8667670e+01 1.54e-03 8.52e+07 -11.0 1.91e-02 - 1.00e+00 3.91e-03h 9
144 1.8579665e+01 1.50e-03 1.91e+01 -11.0 3.88e-03 - 1.00e+00 1.00e+00h 1
145 1.8601298e+01 1.52e-03 8.28e+07 -11.0 6.37e-02 - 1.00e+00 1.56e-02h 7
146 2.3739749e+01 1.09e-03 6.62e+07 -11.0 1.38e-02 - 1.88e-01 2.98e-01H 1
147 2.3739749e+01 1.09e-03 6.12e+07 -11.0 4.06e-03 - 1.00e+00 9.79e-11h 1
148 2.1539249e+01 1.12e-03 6.10e+07 -11.0 1.20e-01 - 1.00e+00 3.91e-03f 9
In iteration 148, 1 Slack too small, adjusting variable bound
149 2.1318400e+01 1.03e-03 2.06e+07 -11.0 1.70e-03 - 1.00e+00 8.28e-01F 1
In iteration 149, 1 Slack too small, adjusting variable bound
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
150 6.7477396e+01 6.78e-04 1.42e+07 -11.0 1.43e-03 - 1.00e+00 8.40e-01H 1
151 2.1072525e+01 1.07e-03 4.47e+02 -11.0 9.53e-04 - 1.00e+00 1.00e+00F 1
152 2.0988601e+01 1.08e-03 3.55e+02 -11.0 1.54e-04 - 1.00e+00 1.00e+00h 1
153 2.0986577e+01 1.10e-03 6.02e+07 -11.0 2.23e-02 - 1.00e+00 3.91e-03h 9
154 2.3104179e+01 4.77e-04 3.96e+06 -11.0 1.03e-02 - 1.00e+00 9.42e-01H 1
In iteration 154, 1 Slack too small, adjusting variable bound
155 2.3104179e+01 4.77e-04 1.54e+08 -11.0 7.63e-02 - 2.88e-01 1.01e-12H 1
156 2.3060468e+01 4.75e-04 8.99e+07 -11.0 1.93e-03 - 4.73e-01 1.34e-02F 1
157 2.2976006e+01 4.63e-04 3.35e+07 -11.0 1.91e-03 - 8.69e-01 1.56e-02h 7
158 2.2964684e+01 4.62e-04 2.98e+07 -11.0 1.31e-03 - 1.00e+00 7.81e-03h 8
159 2.2926067e+01 4.58e-04 7.91e+07 -11.0 1.59e-03 - 1.00e+00 9.52e-03F 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
160 2.1946288e+01 3.25e-04 6.95e+01 -11.0 5.45e-04 - 1.00e+00 1.00e+00H 1
161 2.1919909e+01 3.06e-04 3.73e+07 -11.0 2.64e-03 - 1.00e+00 7.81e-03h 8
162 2.1916648e+01 3.07e-04 3.75e+07 -11.0 4.64e-03 - 1.00e+00 1.95e-03h 10
163 2.1914758e+01 3.07e-04 3.76e+07 -11.0 5.09e-03 - 1.00e+00 4.88e-04h 12
164 2.1913630e+01 3.06e-04 3.76e+07 -11.0 7.59e-02 - 1.00e+00 1.53e-05h 17
In iteration 164, 1 Slack too small, adjusting variable bound
165 2.1691982e+01 2.05e-04 4.52e+07 -11.0 1.76e-03 - 1.00e+00 3.20e-01H 1
166 2.1642486e+01 2.63e-04 3.43e+07 -11.0 1.65e-02 - 1.00e+00 3.12e-02f 6
167 2.1342018e+01 1.63e-04 4.28e+07 -11.0 1.54e-02 - 1.68e-01 1.09e-01F 1
168 2.1321704e+01 1.06e-04 4.17e+07 -11.0 8.63e-03 - 1.44e-11 3.12e-02f 6
In iteration 168, 1 Slack too small, adjusting variable bound
169 2.1072313e+01 1.44e-04 8.88e+07 -11.0 9.45e-04 - 1.00e+00 2.03e-01H 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
170 2.1000542e+01 1.68e-04 3.12e+07 -11.0 6.94e-04 - 1.95e-01 1.00e+00h 1
171 2.1102970e+01 1.04e-04 3.95e+07 -11.0 6.64e-03 - 1.00e+00 6.25e-02h 5
In iteration 171, 1 Slack too small, adjusting variable bound
172 2.1142976e+01 2.73e-04 3.97e+07 -11.0 1.16e-03 - 1.00e+00 5.30e-01H 1
173 2.1089245e+01 3.04e-04 4.16e+07 -11.0 7.17e-03 - 1.00e+00 1.56e-02h 7
174 2.0975941e+01 2.66e-04 4.09e+07 -11.0 3.93e-03 - 1.00e+00 6.25e-02h 5
175 2.0963714e+01 1.34e-04 9.69e+07 -11.0 1.39e-02 - 3.28e-01 1.02e-01H 1
In iteration 175, 1 Slack too small, adjusting variable bound
176 2.0963714e+01 1.34e-04 9.69e+07 -11.0 2.50e-03 - 6.07e-11 8.31e-10h 1
177r 2.0963714e+01 1.34e-04 1.00e+03 -3.0 0.00e+00 - 0.00e+00 1.76e-10R 6
178r 2.0963714e+01 1.34e-04 1.33e+03 -5.3 1.04e+02 - 2.16e-05 3.74e-07f 1
179r 2.0963714e+01 1.34e-04 9.68e+02 -5.2 2.32e-01 - 2.74e-01 2.06e-03f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
180r 2.0963714e+01 1.34e-04 6.68e+02 -2.4 4.25e-04 - 3.09e-01 2.84e-01f 1
181r 2.0963714e+01 1.34e-04 6.64e+02 -0.7 4.18e-02 - 6.06e-03 2.36e-02f 1
182 2.0947592e+01 1.33e-04 8.99e+01 -11.0 3.76e-04 - 9.93e-01 4.08e-02h 1
In iteration 182, 1 Slack too small, adjusting variable bound
183 2.0947592e+01 1.33e-04 2.43e+11 -11.0 1.22e-02 - 9.92e-01 4.27e-13h 1
184 2.0918952e+01 1.40e-04 1.53e+09 -11.0 1.22e-02 - 9.94e-01 2.02e-02h 1
In iteration 184, 1 Slack too small, adjusting variable bound
185 2.0911256e+01 1.41e-04 7.69e+08 -11.0 2.38e-03 - 4.99e-01 6.13e-03h 1
In iteration 185, 1 Slack too small, adjusting variable bound
186 2.0909584e+01 1.94e-04 1.25e+08 -11.0 4.05e-03 - 8.43e-01 1.71e-01H 1
187 2.0883652e+01 1.86e-04 1.07e+07 -11.0 1.90e-02 - 1.00e+00 1.97e-02h 3
188 2.0652255e+01 1.51e-04 9.87e+06 -11.0 4.57e-03 - 1.00e+00 5.68e-02h 1
In iteration 188, 1 Slack too small, adjusting variable bound
189 2.0652254e+01 1.51e-04 8.50e+06 -11.0 8.66e-03 - 1.00e+00 2.52e-07h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
190 2.0626649e+01 1.49e-04 7.37e+06 -11.0 1.02e-03 - 1.00e+00 1.32e-01h 1
191r 2.0626649e+01 1.49e-04 1.00e+03 -3.0 0.00e+00 - 0.00e+00 1.48e-11R 2
192r 2.0626649e+01 1.49e-04 6.64e+02 -5.3 9.90e-01 - 2.83e-03 9.90e-04f 1
193 2.0626648e+01 1.49e-04 2.63e+07 -11.0 2.02e-02 - 9.27e-01 3.53e-08h 1
194 2.0585592e+01 1.23e-04 7.41e+06 -11.0 1.70e-03 - 9.34e-01 2.58e-01h 1
In iteration 194, 1 Slack too small, adjusting variable bound
195 2.0585590e+01 1.23e-04 6.03e+06 -11.0 4.56e-03 - 8.71e-01 1.96e-06h 1
196 2.0564822e+01 1.22e-04 5.56e+06 -11.0 9.93e-03 - 2.69e-02 2.55e-02H 1
197 2.0490223e+01 1.72e-04 4.33e+06 -11.0 1.35e-03 - 1.37e-08 2.21e-01h 3
198 2.0486612e+01 8.88e-05 8.82e+06 -11.0 1.23e-02 - 8.86e-01 1.72e-02h 6
199 2.0480553e+01 1.24e-04 5.16e+06 -11.0 8.67e-03 - 8.84e-01 3.12e-02h 6
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
200 2.0473478e+01 1.21e-04 6.39e+06 -11.0 3.10e-03 - 8.80e-01 5.18e-02h 5
201 2.0460830e+01 1.22e-04 1.44e+07 -11.0 2.18e-03 - 7.80e-01 1.12e-01H 1
202 2.0456113e+01 1.41e-04 1.42e+07 -11.0 2.51e-02 - 1.16e-11 1.56e-02h 7
203 2.0454976e+01 1.35e-04 7.57e+06 -11.0 2.74e-03 - 9.75e-01 4.37e-02h 1
204r 2.0454976e+01 1.35e-04 1.00e+03 -3.1 0.00e+00 - 0.00e+00 3.92e-10R 2
205r 2.0454976e+01 1.35e-04 1.19e+03 -9.0 7.28e-01 - 9.63e-01 9.90e-04f 1
206r 2.0454976e+01 1.35e-04 9.99e+02 -3.7 0.00e+00 - 0.00e+00 4.00e-12R 2
207r 2.0454976e+01 1.35e-04 6.53e+02 -1.8 1.66e-01 - 2.06e-02 1.09e-03f 1
208 2.0448241e+01 1.41e-04 2.01e+01 -11.0 3.30e-04 - 9.57e-01 1.05e-01h 1
In iteration 208, 1 Slack too small, adjusting variable bound
209 2.0448241e+01 1.41e-04 9.15e+10 -11.0 2.01e+01 - 9.63e-01 1.12e-12h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
210 2.0448068e+01 1.41e-04 1.44e+09 -11.0 1.28e-04 - 9.84e-01 8.97e-03h 1
In iteration 210, 1 Slack too small, adjusting variable bound
211 2.0448068e+01 1.41e-04 2.33e+07 -11.0 1.21e-04 - 9.89e-01 5.79e-07h 1
212r 2.0448068e+01 1.41e-04 1.00e+03 -3.9 0.00e+00 - 0.00e+00 3.88e-09R 2
213r 2.0448068e+01 1.41e-04 2.69e-11 -5.7 2.67e-02 - 1.00e+00 2.27e-03f 1
214r 2.0448068e+01 1.41e-04 4.55e-13 -8.4 1.55e-05 - 9.86e-01 9.97e-01f 1
Number of Iterations....: 214
(scaled) (unscaled)
Objective...............: 6.5183875505088240e-01 2.0448068228972094e+01
Dual infeasibility......: 1.9879772851606806e+01 6.2362501231518763e+02
Constraint violation....: 1.4074533262367771e-04 1.4074533262367771e-04
Complementarity.........: 1.0033216102482143e-09 3.1474024186174939e-08
Overall NLP error.......: 1.9879772851606806e+01 6.2362501231518763e+02
Number of objective function evaluations = 653
Number of objective gradient evaluations = 210
Number of equality constraint evaluations = 0
Number of inequality constraint evaluations = 656
Number of equality constraint Jacobian evaluations = 0
Number of inequality constraint Jacobian evaluations = 223
Number of Lagrangian Hessian evaluations = 0
Total CPU secs in IPOPT (w/o function evaluations) = 0.503
Total CPU secs in NLP function evaluations = 229.087
EXIT: Converged to a point of local infeasibility. Problem may be infeasible.
optParam -i turbine-bil-88/turbine-bil-88.xml -o turbine-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 1.6881883e-02 0.00e+00 1.24e-01 0.0 0.00e+00 - 0.00e+00 0.00e+00 0
1 2.9408579e-02 0.00e+00 1.22e+00 -8.0 1.24e-01 - 2.50e-01 5.56e-01H 1
2 1.2419794e-02 0.00e+00 3.04e-02 -2.8 4.36e-02 - 1.00e+00 1.00e+00h 1
3 1.1998527e-02 0.00e+00 3.92e+02 -8.7 1.66e-02 - 1.66e-02 1.00e+00h 1
4 1.0574167e-02 0.00e+00 1.43e-02 -3.6 1.51e-02 - 1.00e+00 1.00e+00h 1
5 9.9718535e-03 1.63e-04 5.84e-02 -4.2 3.57e-02 - 3.83e-01 3.49e-01H 1
6 9.9458275e-03 1.69e-04 8.42e+01 -4.6 3.47e-02 - 1.00e+00 9.23e-03h 2
7 9.9352126e-03 1.72e-04 9.40e+03 -5.2 3.57e-02 - 1.00e+00 4.52e-03h 2
8 9.9218363e-03 1.76e-04 2.06e+06 -5.7 4.47e-02 - 1.00e+00 4.51e-03h 1
9r 9.9218363e-03 1.76e-04 1.00e+03 -2.6 0.00e+00 - 0.00e+00 3.47e-07R 8
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
10r 9.9218363e-03 1.76e-04 5.06e-09 -3.4 2.49e+00 - 1.00e+00 9.90e-04f 1
11r 9.9218363e-03 1.76e-04 9.99e+02 -3.1 0.00e+00 - 0.00e+00 3.63e-07R 8
12r 9.9218363e-03 1.76e-04 6.59e+02 -1.7 4.67e-01 - 1.11e-02 1.33e-03f 1
13 9.6325612e-03 2.67e-04 8.75e-01 -3.4 3.53e-02 - 1.25e-01 1.25e-01s 19
14 9.6312617e-03 2.67e-04 1.07e+04 -2.8 1.56e-02 - 1.00e+00 9.38e-04h 1
15r 9.6312617e-03 2.67e-04 1.00e+03 -2.7 0.00e+00 - 0.00e+00 2.93e-07R 6
16r 9.6312617e-03 2.67e-04 6.60e+02 -0.7 1.73e+00 - 8.40e-03 1.06e-03f 1
17 9.6309792e-03 2.67e-04 1.52e+05 -3.3 3.85e-03 - 1.00e+00 7.11e-04h 1
18r 9.6309792e-03 2.67e-04 1.00e+03 -3.2 0.00e+00 - 0.00e+00 4.45e-07R 5
19r 9.6309792e-03 2.67e-04 7.65e-07 -1.2 5.00e-01 - 1.00e+00 1.29e-03f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
20 9.6308321e-03 2.67e-04 1.00e+00 -3.4 6.55e-03 - 2.82e-04 2.82e-04s 11
21r 9.6308321e-03 2.67e-04 9.89e+02 -2.2 0.00e+00 - 0.00e+00 3.54e-07R 4
22r 9.6308321e-03 2.67e-04 4.51e+02 -2.6 4.28e-02 - 3.16e-01 8.64e-03f 1
23 9.6164914e-03 2.71e-04 9.79e-01 -3.5 1.00e-02 - 2.14e-02 2.14e-02s 17
24 9.6162991e-03 2.71e-04 9.78e-01 -3.5 1.45e-02 - 2.16e-04 2.16e-04s 10
25r 9.6162991e-03 2.71e-04 9.79e+02 -2.2 0.00e+00 - 0.00e+00 2.71e-07R 4
26r 9.6162991e-03 2.71e-04 3.66e+02 -2.8 6.14e-03 - 4.35e-01 3.89e-03f 1
27r 9.6162991e-03 2.71e-04 4.13e-07 -1.5 2.87e-04 - 1.00e+00 5.63e-01f 1
28r 9.6162991e-03 2.71e-04 1.68e-08 -2.9 7.61e-05 - 1.00e+00 7.94e-01f 1
29r 9.6162991e-03 2.71e-04 9.27e-10 -4.2 1.63e-05 - 1.00e+00 9.63e-01f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
30r 9.6162991e-03 2.71e-04 5.68e-13 -9.0 5.12e-07 - 9.99e-01 9.96e-01f 1
Number of Iterations....: 30
(scaled) (unscaled)
Objective...............: 9.6162991256960352e-03 9.6162991256960352e-03
Dual infeasibility......: 1.5141200979407649e-02 1.5141200979407649e-02
Constraint violation....: 2.7069378962934408e-04 2.7069378962934408e-04
Complementarity.........: 1.0000087620178118e-09 1.0000087620178118e-09
Overall NLP error.......: 1.5141200979407649e-02 1.5141200979407649e-02
Number of objective function evaluations = 135
Number of objective gradient evaluations = 27
Number of equality constraint evaluations = 0
Number of inequality constraint evaluations = 135
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.120
Total CPU secs in NLP function evaluations = 78.417
EXIT: Converged to a point of local infeasibility. Problem may be infeasible.
optParam -i turbine-bil-88/turbine-bil-88.xml -o turbine-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.9712783e+00 0.00e+00 1.30e-03 0.0 0.00e+00 - 0.00e+00 0.00e+00 0
1 1.9712753e+00 0.00e+00 1.00e-02 -8.0 9.52e-03 - 9.90e-01 1.00e+00h 1
2 1.9712717e+00 0.00e+00 8.02e-03 -3.1 3.63e-03 - 9.91e-01 1.00e+00h 1
3 1.9712738e+00 0.00e+00 1.06e-01 -3.3 6.85e-03 - 9.39e-01 1.00e+00h 1
4 1.9712694e+00 0.00e+00 1.07e-01 -3.4 1.03e-02 - 7.43e-01 1.00e+00h 1
5 1.9712690e+00 0.00e+00 2.12e-04 -3.5 7.15e-03 - 1.00e+00 1.00e+00h 1
6 1.9712685e+00 0.00e+00 1.01e-01 -9.5 1.56e-03 - 8.29e-01 1.00e+00h 1
7 1.9712698e+00 0.00e+00 1.65e-03 -5.3 1.02e-02 - 1.00e+00 1.00e+00h 1
8 1.9712745e+00 1.64e-05 2.65e-03 -5.4 2.61e-02 - 7.18e-01 9.83e-01H 1
9 1.9712744e+00 1.90e-05 9.91e+00 -7.0 4.03e-02 - 1.00e+00 8.35e-04h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
10r 1.9712744e+00 1.90e-05 9.99e+02 -4.0 0.00e+00 - 0.00e+00 4.74e-07R 3
11r 1.9712744e+00 1.90e-05 2.82e-11 -5.7 1.09e-01 - 1.00e+00 9.90e-04f 1
12 1.9712744e+00 1.90e-05 1.35e+07 -9.2 6.76e-03 - 1.00e+00 1.26e-05h 1
13r 1.9712744e+00 1.90e-05 1.00e+03 -4.6 0.00e+00 - 0.00e+00 6.40e-08R 2
14r 1.9712744e+00 1.90e-05 5.23e-12 -6.4 2.74e-02 - 1.00e+00 9.90e-04f 1
15 1.9712744e+00 1.90e-05 1.22e+07 -8.2 5.25e-03 - 1.00e+00 1.46e-07h 1
16 1.9712643e+00 6.34e-05 3.48e+07 -8.2 1.38e-02 - 4.13e-03 4.86e-01H 1
17r 1.9712643e+00 6.34e-05 1.00e+03 -2.7 0.00e+00 - 0.00e+00 4.37e-07R 2
18r 1.9712643e+00 6.34e-05 1.30e+03 -8.9 4.11e-01 - 2.44e-02 2.77e-08f 1
19r 1.9712643e+00 6.34e-05 6.73e+02 -4.1 3.44e-02 - 4.83e-01 2.63e-02f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
20r 1.9712643e+00 6.34e-05 6.64e+02 -0.3 5.25e-02 - 1.25e-02 3.86e-02f 1
21 1.9712580e+00 0.00e+00 2.10e+01 -3.5 6.92e-03 - 4.51e-02 1.00e+00H 1
22 1.9712706e+00 3.81e-04 3.16e-03 -2.3 9.31e-03 - 1.00e+00 1.00e+00h 1
23 1.9712571e+00 0.00e+00 4.09e+00 -3.4 1.76e-02 - 2.84e-01 6.83e-01h 1
24 1.9712584e+00 0.00e+00 3.43e+02 -3.4 5.92e-03 - 1.32e-02 1.00e+00h 1
25 1.9712543e+00 0.00e+00 2.69e+00 -3.4 9.27e-03 - 4.38e-01 1.00e+00h 1
26 1.9712543e+00 0.00e+00 1.10e+00 -3.4 6.16e-03 - 4.04e-01 1.00e+00h 1
27 1.9712536e+00 0.00e+00 4.15e-04 -3.1 3.65e-03 - 1.00e+00 1.00e+00h 1
28 1.9712538e+00 0.00e+00 7.20e-04 -9.2 2.96e-03 - 4.26e-01 1.00e+00H 1
29 1.9712528e+00 0.00e+00 7.33e-04 -9.4 1.60e-03 - 9.99e-01 1.00e+00f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
30 1.9712527e+00 0.00e+00 9.81e-04 -7.0 4.39e-03 - 1.00e+00 1.00e+00h 1
31 1.9712503e+00 0.00e+00 3.78e-04 -6.7 6.96e-03 - 1.00e+00 1.00e+00h 1
32 1.9712556e+00 1.91e-05 1.47e-03 -7.0 5.42e-03 - 3.38e-01 9.61e-01H 1
33 1.9712534e+00 0.00e+00 3.03e-02 -6.9 3.87e-03 - 1.00e+00 1.48e-01h 1
34 1.9712593e+00 0.00e+00 7.74e+07 -4.9 4.50e-03 - 4.56e-10 1.00e+00h 1
35 1.9712481e+00 0.00e+00 4.10e-03 -7.0 1.78e-02 - 8.00e-02 1.00e+00h 1
36 1.9712457e+00 0.00e+00 1.54e-04 -6.7 1.06e-02 - 1.00e+00 1.00e+00h 1
37 1.9712450e+00 0.00e+00 2.80e-04 -6.0 6.03e-03 - 9.89e-01 1.00e+00h 1
38 1.9712436e+00 0.00e+00 5.04e-04 -6.5 1.37e-01 - 1.00e+00 6.25e-02h 5
39 1.9712423e+00 0.00e+00 1.14e-03 -6.8 5.49e-01 - 1.00e+00 1.56e-02h 7
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
40 1.9712413e+00 5.58e-04 1.18e-03 -7.1 4.12e-01 - 1.00e+00 1.56e-02h 7
41 1.9712406e+00 1.10e-03 7.28e-04 -6.7 1.53e-01 - 1.00e+00 2.72e-02h 6
42 1.9712401e+00 8.30e-04 8.00e-04 -6.5 1.03e-01 - 1.00e+00 2.40e-02h 6
43 1.9712397e+00 1.59e-03 5.52e-04 -6.0 1.86e-01 - 1.00e+00 2.53e-02h 6
44 1.9712514e+00 3.25e-03 3.26e-03 -5.7 4.19e-02 - 3.12e-01 2.45e-01H 1
45 1.9712513e+00 3.16e-03 1.30e-01 -6.0 1.49e-02 - 7.47e-01 3.63e-03h 1
46r 1.9712513e+00 3.16e-03 9.99e+02 -2.2 0.00e+00 - 0.00e+00 1.79e-09R 2
47r 1.9712513e+00 3.16e-03 1.97e+02 -3.7 6.43e+00 - 7.04e-01 9.90e-04f 1
48 1.9712513e+00 3.16e-03 1.74e+03 -6.0 1.93e-02 - 7.49e-01 4.31e-04h 1
49r 1.9712513e+00 3.16e-03 1.00e+03 -2.5 0.00e+00 - 0.00e+00 2.06e-10R 2
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
50r 1.9712513e+00 3.16e-03 1.94e-06 -0.8 7.82e-01 - 1.00e+00 2.05e-03f 1
51r 1.9712513e+00 3.16e-03 3.18e-07 -6.8 6.78e-04 - 8.36e-01 8.21e-01f 1
52r 1.9712513e+00 3.16e-03 3.67e-08 -2.6 9.91e-05 - 1.00e+00 1.00e+00f 1
53r 1.9712513e+00 3.16e-03 2.95e-10 -4.7 4.12e-06 - 1.00e+00 9.96e-01f 1
Number of Iterations....: 53
(scaled) (unscaled)
Objective...............: 1.9712512714654196e+00 1.9712512714654196e+00
Dual infeasibility......: 3.2340559082596103e-03 3.2340559082596103e-03
Constraint violation....: 3.1594970582448784e-03 3.1594970582448784e-03
Complementarity.........: 6.6514891148497133e-09 6.6514891148497133e-09
Overall NLP error.......: 3.2340559082596103e-03 3.2340559082596103e-03
Number of objective function evaluations = 115
Number of objective gradient evaluations = 49
Number of equality constraint evaluations = 0
Number of inequality constraint evaluations = 115
Number of equality constraint Jacobian evaluations = 0
Number of inequality constraint Jacobian evaluations = 60
Number of Lagrangian Hessian evaluations = 0
Total CPU secs in IPOPT (w/o function evaluations) = 0.240
Total CPU secs in NLP function evaluations = 135.687
EXIT: Converged to a point of local infeasibility. Problem may be infeasible.
testParam -i cube-bil-88-no-opt/cube-bil-88-no-opt.xml -o cube-bil-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-bil-88-winslow/cube-bil-88-winslow.xml -o cube-bil-88-winslow-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-bil-88-liao/cube-bil-88-liao.xml -o cube-bil-88-liao-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-bil-88-contMechanics/cube-bil-88-contMechanics.xml -o cube-bil-88-contMechanics-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 turbine-bil-88-no-opt/turbine-bil-88-no-opt.xml -o turbine-bil-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 turbine-bil-88-winslow/turbine-bil-88-winslow.xml -o turbine-bil-88-winslow-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 turbine-bil-88-liao/turbine-bil-88-liao.xml -o turbine-bil-88-liao-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 turbine-bil-88-contMechanics/turbine-bil-88-contMechanics.xml -o turbine-bil-88-contMechanics-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.
Error estimate cube-bil-88-no-opt-k5-sin+cos: L_1: 2.00
Error estimate cube-bil-88-no-opt-k5-sin+cos: L_2: 2.00
Error estimate cube-bil-88-no-opt-k5-sin+cos: max: 2.00
Error estimate cube-bil-88-winslow-k5-sin+cos: L_1: 2.00
Error estimate cube-bil-88-winslow-k5-sin+cos: L_2: 2.00
Error estimate cube-bil-88-winslow-k5-sin+cos: max: 1.98
Error estimate cube-bil-88-liao-k5-sin+cos: L_1: 2.00
Error estimate cube-bil-88-liao-k5-sin+cos: L_2: 2.00
Error estimate cube-bil-88-liao-k5-sin+cos: max: 1.97
Error estimate cube-bil-88-contMechanics-k5-sin+cos: L_1: 2.00
Error estimate cube-bil-88-contMechanics-k5-sin+cos: L_2: 2.00
Error estimate cube-bil-88-contMechanics-k5-sin+cos: max: 1.93
Error estimate turbine-bil-88-no-opt-k5-sin+cos: L_1: 1.93
Error estimate turbine-bil-88-no-opt-k5-sin+cos: L_2: 1.95
Error estimate turbine-bil-88-no-opt-k5-sin+cos: max: 1.58
Error estimate turbine-bil-88-winslow-k5-sin+cos: L_1: 0.35
Error estimate turbine-bil-88-winslow-k5-sin+cos: L_2: 0.11
Error estimate turbine-bil-88-winslow-k5-sin+cos: max: -0.48
Error estimate turbine-bil-88-liao-k5-sin+cos: L_1: 0.75
Error estimate turbine-bil-88-liao-k5-sin+cos: L_2: 0.60
Error estimate turbine-bil-88-liao-k5-sin+cos: max: 0.50
Error estimate turbine-bil-88-contMechanics-k5-sin+cos: L_1: 0.39
Error estimate turbine-bil-88-contMechanics-k5-sin+cos: L_2: 0.14
Error estimate turbine-bil-88-contMechanics-k5-sin+cos: max: -0.81
In [8]:
# Main
files = [
["../data/test/horseshoe.xml" , "horseshoe" , True ],
]
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],
];
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-44 -a min -n 4 -m 4
----------------------
n: 4
m: 4
degree: 3
input: ../data/test/horseshoe.xml
output: horseshoe-min-44
----------------------
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)
genParam -i ../data/test/horseshoe.xml -o horseshoe-bil-44 -a bil -n 4 -m 4
----------------------
n: 4
m: 4
degree: 3
input: ../data/test/horseshoe.xml
output: horseshoe-bil-44
----------------------
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)
genParam -i ../data/test/horseshoe.xml -o horseshoe-min-88 -a min -n 8 -m 8
----------------------
n: 8
m: 8
degree: 3
input: ../data/test/horseshoe.xml
output: horseshoe-min-88
----------------------
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)
genParam -i ../data/test/horseshoe.xml -o horseshoe-bil-88 -a bil -n 8 -m 8
----------------------
n: 8
m: 8
degree: 3
input: ../data/test/horseshoe.xml
output: horseshoe-bil-88
----------------------
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)
optParam -i horseshoe-min-44/horseshoe-min-44.xml -o horseshoe-min-44-no-opt
No functional given (-f).
optParam -i horseshoe-min-44/horseshoe-min-44.xml -o horseshoe-min-44-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............................: 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...............: 36
inequality constraints with only lower bounds: 36
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 3.1687263e+01 6.49e+00 1.00e+02 0.0 0.00e+00 - 0.00e+00 0.00e+00 0
1 1.6265891e+01 6.94e+00 6.51e+02 -1.3 1.00e+02 - 9.96e-01 1.52e-03f 1
2 1.6265557e+01 6.94e+00 1.26e+07 -6.5 6.94e+00 - 2.78e-01 1.43e-05h 1
3r 1.6265557e+01 6.94e+00 1.00e+03 0.8 0.00e+00 - 0.00e+00 7.14e-08R 2
4r 1.6265557e+01 6.94e+00 2.00e-04 1.2 2.76e+03 - 1.00e+00 1.57e-03f 1
5r 1.6265557e+01 6.94e+00 1.18e-04 -0.0 1.11e+00 - 4.36e-01 9.89e-01f 1
6r 1.6265557e+01 6.94e+00 3.61e-06 -1.1 6.05e-02 - 9.78e-01 9.92e-01f 1
7r 1.6265557e+01 6.94e+00 3.98e-08 -6.8 6.06e-04 - 9.89e-01 9.89e-01f 1
8r 1.6265557e+01 6.94e+00 4.05e-11 -8.7 6.43e-06 - 9.99e-01 9.99e-01f 1
Number of Iterations....: 8
(scaled) (unscaled)
Objective...............: 9.9262686088669678e+00 1.6265556899542755e+01
Dual infeasibility......: 6.8920822876891421e+01 1.1293625129849733e+02
Constraint violation....: 6.9355032032799615e+00 6.9355032032799615e+00
Complementarity.........: 1.0000003877312228e-09 1.6386382282338470e-09
Overall NLP error.......: 3.1014370294550229e+01 1.1293625129849733e+02
Number of objective function evaluations = 12
Number of objective gradient evaluations = 5
Number of equality constraint evaluations = 0
Number of inequality constraint evaluations = 12
Number of equality constraint Jacobian evaluations = 0
Number of inequality constraint Jacobian evaluations = 11
Number of Lagrangian Hessian evaluations = 0
Total CPU secs in IPOPT (w/o function evaluations) = 0.010
Total CPU secs in NLP function evaluations = 0.117
EXIT: Converged to a point of local infeasibility. Problem may be infeasible.
optParam -i horseshoe-min-44/horseshoe-min-44.xml -o horseshoe-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...............: 36
inequality constraints with only lower bounds: 36
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.5046426e+03 6.49e+00 1.00e+02 0.0 0.00e+00 - 0.00e+00 0.00e+00 0
1 2.2056565e+03 6.59e+00 6.51e+02 -1.3 1.00e+02 - 9.96e-01 1.52e-03f 1
2 2.2056417e+03 6.59e+00 2.34e+07 -6.5 6.59e+00 - 5.45e-01 1.50e-05h 1
3r 2.2056417e+03 6.59e+00 1.00e+03 0.8 0.00e+00 - 0.00e+00 7.51e-08R 2
4r 2.2056417e+03 6.59e+00 1.06e-05 -0.1 1.95e+02 - 1.00e+00 5.76e-03f 1
5r 2.2056417e+03 6.59e+00 2.21e-04 1.2 2.79e-01 - 1.00e+00 7.73e-01f 1
6r 2.2056417e+03 6.59e+00 1.00e-05 -0.1 7.93e-02 - 9.98e-01 6.75e-01f 1
7r 2.2056417e+03 6.59e+00 1.92e-06 -0.8 2.57e-02 - 1.00e+00 9.87e-01f 1
8r 2.2056417e+03 6.59e+00 3.22e-08 -2.7 4.66e-04 - 9.96e-01 9.94e-01f 1
9r 2.2056417e+03 6.59e+00 2.04e-11 -8.5 4.69e-06 - 9.99e-01 9.99e-01f 1
Number of Iterations....: 9
(scaled) (unscaled)
Objective...............: 1.6400730757213577e+02 2.2056417289513888e+03
Dual infeasibility......: 7.9255402471542311e+01 1.0658611834060139e+03
Constraint violation....: 6.5917156446582412e+00 6.5917156446582412e+00
Complementarity.........: 1.0000011552846202e-09 1.3448451229072469e-08
Overall NLP error.......: 3.1702160988611670e+01 1.0658611834060139e+03
Number of objective function evaluations = 14
Number of objective gradient evaluations = 5
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 = 12
Number of Lagrangian Hessian evaluations = 0
Total CPU secs in IPOPT (w/o function evaluations) = 0.030
Total CPU secs in NLP function evaluations = 0.317
EXIT: Converged to a point of local infeasibility. Problem may be infeasible.
optParam -i horseshoe-min-44/horseshoe-min-44.xml -o horseshoe-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...............: 36
inequality constraints with only lower bounds: 36
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 3.3816391e+01 6.49e+00 4.88e+01 0.0 0.00e+00 - 0.00e+00 0.00e+00 0
1 2.6074360e+01 6.32e+00 6.42e+02 -5.6 4.88e+01 - 9.90e-01 1.52e-03f 1
2 2.6073715e+01 6.32e+00 1.59e+07 -6.6 6.32e+00 - 3.90e-01 1.57e-05h 1
3r 2.6073715e+01 6.32e+00 1.00e+03 0.8 0.00e+00 - 0.00e+00 7.83e-08R 2
4r 2.6073715e+01 6.32e+00 2.77e-06 -0.7 6.01e+02 - 1.00e+00 3.21e-03f 1
5r 2.6073715e+01 6.32e+00 5.52e-06 -0.4 4.90e-01 - 1.00e+00 9.91e-01f 1
6r 2.6073715e+01 6.32e+00 8.35e-08 -6.1 4.91e-03 - 9.85e-01 9.89e-01f 1
7r 2.6073715e+01 6.32e+00 5.99e-10 -8.0 5.27e-05 - 9.93e-01 9.93e-01f 1
Number of Iterations....: 7
(scaled) (unscaled)
Objective...............: 2.6073715408381311e+01 2.6073715408381311e+01
Dual infeasibility......: 3.8024505080998715e+01 3.8024505080998715e+01
Constraint violation....: 6.3193973370904359e+00 6.3193973370904359e+00
Complementarity.........: 2.8612450200910217e-09 2.8612450200910217e-09
Overall NLP error.......: 1.7111027286375883e+01 3.8024505080998715e+01
Number of objective function evaluations = 11
Number of objective gradient evaluations = 5
Number of equality constraint evaluations = 0
Number of inequality constraint evaluations = 11
Number of equality constraint Jacobian evaluations = 0
Number of inequality constraint Jacobian evaluations = 10
Number of Lagrangian Hessian evaluations = 0
Total CPU secs in IPOPT (w/o function evaluations) = 0.013
Total CPU secs in NLP function evaluations = 0.300
EXIT: Converged to a point of local infeasibility. Problem may be infeasible.
optParam -i horseshoe-bil-44/horseshoe-bil-44.xml -o horseshoe-bil-44-no-opt
No functional given (-f).
optParam -i horseshoe-bil-44/horseshoe-bil-44.xml -o horseshoe-bil-44-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............................: 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...............: 36
inequality constraints with only lower bounds: 36
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 3.9532074e+01 6.20e+00 1.00e+02 0.0 0.00e+00 - 0.00e+00 0.00e+00 0
1 2.4919629e+01 6.24e+00 6.19e+02 -1.5 1.00e+02 - 9.94e-01 7.97e-04f 2
2 2.4748460e+01 6.24e+00 2.32e+05 -1.1 6.25e+00 - 3.02e-01 8.00e-04h 1
3r 2.4748460e+01 6.24e+00 1.00e+03 0.8 0.00e+00 - 0.00e+00 2.50e-07R 6
4r 2.4748460e+01 6.24e+00 1.37e-04 1.0 8.08e+02 - 1.00e+00 2.74e-03f 1
5r 2.4748460e+01 6.24e+00 5.21e-05 -0.1 5.69e-01 - 6.77e-01 9.90e-01f 1
6r 2.4748460e+01 6.24e+00 8.93e-07 -1.7 1.12e-02 - 9.88e-01 9.92e-01f 1
7r 2.4748460e+01 6.24e+00 9.05e-09 -7.3 1.36e-04 - 9.90e-01 9.90e-01f 1
8r 2.4748460e+01 6.24e+00 1.96e-12 -9.0 1.38e-06 - 1.00e+00 1.00e+00f 1
Number of Iterations....: 8
(scaled) (unscaled)
Objective...............: 3.3360009947254801e+00 2.4748460142973801e+01
Dual infeasibility......: 1.5643907524859549e+02 1.1605590719891682e+03
Constraint violation....: 6.2410907894795358e+00 6.2410907894795358e+00
Complementarity.........: 1.0000000018325511e-09 7.4186009618870555e-09
Overall NLP error.......: 7.0397583861755038e+01 1.1605590719891682e+03
Number of objective function evaluations = 18
Number of objective gradient evaluations = 5
Number of equality constraint evaluations = 0
Number of inequality constraint evaluations = 18
Number of equality constraint Jacobian evaluations = 0
Number of inequality constraint Jacobian evaluations = 11
Number of Lagrangian Hessian evaluations = 0
Total CPU secs in IPOPT (w/o function evaluations) = 0.007
Total CPU secs in NLP function evaluations = 0.123
EXIT: Converged to a point of local infeasibility. Problem may be infeasible.
optParam -i horseshoe-bil-44/horseshoe-bil-44.xml -o horseshoe-bil-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...............: 36
inequality constraints with only lower bounds: 36
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.8845441e+03 6.20e+00 1.00e+02 0.0 0.00e+00 - 0.00e+00 0.00e+00 0
1 2.4938454e+03 6.33e+00 6.22e+02 -1.3 1.00e+02 - 9.96e-01 1.59e-03f 1
2 2.4938258e+03 6.33e+00 1.30e+07 -6.5 6.33e+00 - 3.29e-01 1.56e-05h 1
3r 2.4938258e+03 6.33e+00 1.00e+03 0.8 0.00e+00 - 0.00e+00 7.83e-08R 2
4r 2.4938258e+03 6.33e+00 2.82e-05 0.3 2.30e+02 - 1.00e+00 5.19e-03f 1
5r 2.4938258e+03 6.33e+00 6.35e-06 -0.4 3.04e-01 - 9.60e-01 9.90e-01f 1
6r 2.4938258e+03 6.33e+00 7.54e-08 -6.0 3.77e-03 - 9.88e-01 9.83e-01f 1
7r 2.4938258e+03 6.33e+00 6.74e-10 -7.8 6.60e-05 - 9.91e-01 9.91e-01f 1
Number of Iterations....: 7
(scaled) (unscaled)
Objective...............: 1.6189126737459523e+02 2.4938258127849808e+03
Dual infeasibility......: 7.8896579776727592e+01 1.2153486125498603e+03
Constraint violation....: 6.3258602758001041e+00 6.3258602758001041e+00
Complementarity.........: 1.6381476171436778e-08 2.5234559461026184e-07
Overall NLP error.......: 3.5503460898010466e+01 1.2153486125498603e+03
Number of objective function evaluations = 12
Number of objective gradient evaluations = 5
Number of equality constraint evaluations = 0
Number of inequality constraint evaluations = 12
Number of equality constraint Jacobian evaluations = 0
Number of inequality constraint Jacobian evaluations = 10
Number of Lagrangian Hessian evaluations = 0
Total CPU secs in IPOPT (w/o function evaluations) = 0.017
Total CPU secs in NLP function evaluations = 0.317
EXIT: Converged to a point of local infeasibility. Problem may be infeasible.
optParam -i horseshoe-bil-44/horseshoe-bil-44.xml -o horseshoe-bil-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...............: 36
inequality constraints with only lower bounds: 36
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.4023566e+01 6.20e+00 4.58e+01 0.0 0.00e+00 - 0.00e+00 0.00e+00 0
1 1.8466260e+01 6.07e+00 6.13e+02 -5.7 4.58e+01 - 9.90e-01 1.59e-03f 1
2 1.8465909e+01 6.07e+00 1.59e+07 -6.5 6.07e+00 - 4.25e-01 1.63e-05h 1
3r 1.8465909e+01 6.07e+00 1.00e+03 0.8 0.00e+00 - 0.00e+00 8.16e-08R 2
4r 1.8465909e+01 6.07e+00 4.43e-06 -0.5 6.07e+02 - 1.00e+00 3.13e-03f 1
5r 1.8465909e+01 6.07e+00 5.91e-06 -0.4 4.84e-01 - 1.00e+00 9.91e-01f 1
6r 1.8465909e+01 6.07e+00 8.24e-08 -6.0 4.91e-03 - 9.86e-01 9.89e-01f 1
7r 1.8465909e+01 6.07e+00 5.83e-10 -8.0 5.21e-05 - 9.93e-01 9.93e-01f 1
Number of Iterations....: 7
(scaled) (unscaled)
Objective...............: 1.8465908708583314e+01 1.8465908708583314e+01
Dual infeasibility......: 2.8797854173430910e+01 2.8797854173430910e+01
Constraint violation....: 6.0683656134984751e+00 6.0683656134984751e+00
Complementarity.........: 2.8212031905264571e-09 2.8212031905264571e-09
Overall NLP error.......: 1.2959034377996103e+01 2.8797854173430910e+01
Number of objective function evaluations = 11
Number of objective gradient evaluations = 5
Number of equality constraint evaluations = 0
Number of inequality constraint evaluations = 11
Number of equality constraint Jacobian evaluations = 0
Number of inequality constraint Jacobian evaluations = 10
Number of Lagrangian Hessian evaluations = 0
Total CPU secs in IPOPT (w/o function evaluations) = 0.007
Total CPU secs in NLP function evaluations = 0.303
EXIT: Converged to a point of local infeasibility. Problem may be infeasible.
optParam -i horseshoe-min-88/horseshoe-min-88.xml -o horseshoe-min-88-no-opt
No functional given (-f).
optParam -i horseshoe-min-88/horseshoe-min-88.xml -o horseshoe-min-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.7232475e+01 1.13e+01 1.00e+02 0.0 0.00e+00 - 0.00e+00 0.00e+00 0
1 4.1095859e+01 1.13e+01 1.66e+03 -5.4 1.00e+02 - 9.90e-01 8.75e-04f 1
2 3.8261601e+01 1.13e+01 3.11e+06 -6.2 8.30e+02 - 2.46e-02 8.76e-06f 1
3r 3.8261601e+01 1.13e+01 1.00e+03 1.1 0.00e+00 - 0.00e+00 4.38e-08R 2
4r 3.8261601e+01 1.13e+01 5.05e-06 -0.4 3.72e+02 - 1.00e+00 1.51e-03f 1
5r 3.8261601e+01 1.13e+01 1.27e-04 1.2 1.48e+00 - 5.41e-01 2.24e-01f 1
6r 3.8261601e+01 1.13e+01 3.02e-04 1.5 1.16e+00 - 6.44e-01 3.89e-01f 1
7r 3.8261601e+01 1.13e+01 2.02e-04 1.2 6.86e-01 - 1.00e+00 4.93e-01f 1
8r 3.8261601e+01 1.13e+01 7.73e-05 0.8 3.66e-01 - 1.00e+00 9.17e-01f 1
9r 3.8261601e+01 1.13e+01 6.91e-06 -0.3 3.56e-02 - 1.00e+00 9.56e-01f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
10r 3.8261601e+01 1.13e+01 1.24e-07 -2.0 2.15e-03 - 1.00e+00 9.93e-01f 1
11r 3.8261601e+01 1.13e+01 4.14e-10 -7.9 2.53e-05 - 9.97e-01 9.96e-01f 1
Number of Iterations....: 11
(scaled) (unscaled)
Objective...............: 5.9825751835896024e-01 3.8261600955784218e+01
Dual infeasibility......: 9.9978802204419151e+02 6.3941512084558854e+04
Constraint violation....: 1.1300651748547262e+01 1.1300651748547262e+01
Complementarity.........: 1.0880817210756204e-09 6.9588341711568497e-08
Overall NLP error.......: 3.1104516241366957e+02 6.3941512084558854e+04
Number of objective function evaluations = 15
Number of objective gradient evaluations = 5
Number of equality constraint evaluations = 0
Number of inequality constraint evaluations = 15
Number of equality constraint Jacobian evaluations = 0
Number of inequality constraint Jacobian evaluations = 14
Number of Lagrangian Hessian evaluations = 0
Total CPU secs in IPOPT (w/o function evaluations) = 0.057
Total CPU secs in NLP function evaluations = 5.543
EXIT: Converged to a point of local infeasibility. Problem may be infeasible.
optParam -i horseshoe-min-88/horseshoe-min-88.xml -o horseshoe-min-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 8.0084003e+03 1.13e+01 1.00e+02 0.0 0.00e+00 - 0.00e+00 0.00e+00 0
1 7.3841325e+03 1.13e+01 1.12e+03 -5.4 1.00e+02 - 9.90e-01 8.75e-04f 1
2 7.3840926e+03 1.13e+01 7.29e+06 -6.2 1.13e+01 - 5.77e-02 8.78e-06h 1
3r 7.3840926e+03 1.13e+01 1.00e+03 1.1 0.00e+00 - 0.00e+00 4.39e-08R 2
4r 7.3840926e+03 1.13e+01 1.55e-05 0.1 1.44e+02 - 1.00e+00 8.71e-03f 1
5r 7.3840926e+03 1.13e+01 4.16e-05 0.6 3.20e-01 - 6.44e-01 1.00e+00f 1
6r 7.3840926e+03 1.13e+01 2.20e-06 -0.8 1.35e-02 - 1.00e+00 8.67e-01f 1
7r 7.3840926e+03 1.13e+01 2.13e-07 -2.0 1.94e-03 - 9.68e-01 9.96e-01f 1
8r 7.3840926e+03 1.13e+01 2.56e-09 -7.8 5.80e-05 - 9.88e-01 9.91e-01f 1
Number of Iterations....: 8
(scaled) (unscaled)
Objective...............: 2.4446742278254007e+02 7.3840925911021513e+03
Dual infeasibility......: 7.9828712887867923e+01 2.4112112799457464e+03
Constraint violation....: 1.1278920930922391e+01 1.1278920930922391e+01
Complementarity.........: 2.5092717962327185e-08 7.5792083332531979e-07
Overall NLP error.......: 2.7449873202134579e+01 2.4112112799457464e+03
Number of objective function evaluations = 12
Number of objective gradient evaluations = 5
Number of equality constraint evaluations = 0
Number of inequality constraint evaluations = 12
Number of equality constraint Jacobian evaluations = 0
Number of inequality constraint Jacobian evaluations = 11
Number of Lagrangian Hessian evaluations = 0
Total CPU secs in IPOPT (w/o function evaluations) = 0.113
Total CPU secs in NLP function evaluations = 14.447
EXIT: Converged to a point of local infeasibility. Problem may be infeasible.
optParam -i horseshoe-min-88/horseshoe-min-88.xml -o horseshoe-min-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 9.1443250e+01 1.13e+01 7.67e+01 0.0 0.00e+00 - 0.00e+00 0.00e+00 0
1 7.9184785e+01 1.09e+01 1.12e+03 -5.4 7.67e+01 - 9.90e-01 8.75e-04f 1
2 7.9184237e+01 1.09e+01 2.24e+07 -6.2 1.09e+01 - 1.83e-01 9.05e-06h 1
3r 7.9184237e+01 1.09e+01 1.00e+03 1.0 0.00e+00 - 0.00e+00 4.52e-08R 2
4r 7.9184237e+01 1.09e+01 5.08e+02 1.2 1.71e+03 - 2.36e-01 2.50e-03f 1
5r 7.9184237e+01 1.09e+01 2.77e+02 1.6 4.42e+00 - 4.55e-01 2.45e-01f 1
6r 7.9184237e+01 1.09e+01 1.99e+00 0.9 1.42e-01 - 9.93e-01 6.54e-01f 1
7r 7.9184237e+01 1.09e+01 1.14e-05 -0.1 1.90e-02 - 1.00e+00 6.74e-01f 1
8r 7.9184237e+01 1.09e+01 3.00e-06 -1.0 5.82e-03 - 8.46e-01 9.91e-01f 1
9r 7.9184237e+01 1.09e+01 1.28e-07 -2.1 1.50e-03 - 9.90e-01 1.00e+00f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
10r 7.9184237e+01 1.09e+01 3.25e-10 -8.1 1.51e-05 - 9.97e-01 9.98e-01f 1
Number of Iterations....: 10
(scaled) (unscaled)
Objective...............: 7.9184236986745049e+01 7.9184236986745049e+01
Dual infeasibility......: 4.0472419563997164e+01 4.0472419563997164e+01
Constraint violation....: 1.0942143989492401e+01 1.0942143989492401e+01
Complementarity.........: 9.9999998378956851e-10 9.9999998378956851e-10
Overall NLP error.......: 1.3676886611235794e+01 4.0472419563997164e+01
Number of objective function evaluations = 15
Number of objective gradient evaluations = 5
Number of equality constraint evaluations = 0
Number of inequality constraint evaluations = 15
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.027
Total CPU secs in NLP function evaluations = 13.800
EXIT: Converged to a point of local infeasibility. Problem may be infeasible.
optParam -i horseshoe-bil-88/horseshoe-bil-88.xml -o horseshoe-bil-88-no-opt
No functional given (-f).
optParam -i horseshoe-bil-88/horseshoe-bil-88.xml -o horseshoe-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.5622714e+01 8.93e+00 1.00e+02 0.0 0.00e+00 - 0.00e+00 0.00e+00 0
1 3.0891461e+01 9.53e+00 1.91e+03 -5.4 1.00e+02 - 9.90e-01 1.11e-03f 1
2 3.0861002e+01 9.53e+00 1.89e+03 1.7 9.57e+00 - 1.11e-05 1.11e-05s 6
3r 3.0861002e+01 9.53e+00 1.00e+03 1.7 0.00e+00 - 0.00e+00 5.56e-08R 2
4r 3.0861002e+01 9.53e+00 6.42e+02 1.3 1.05e+03 - 2.46e-01 9.55e-05f 1
5r 3.0861002e+01 9.53e+00 6.37e+02 3.9 2.08e+03 - 7.92e-03 5.54e-04f 1
6r 3.0861002e+01 9.53e+00 5.56e+02 1.9 2.17e+01 - 1.27e-01 1.10e-01f 1
7r 3.0861002e+01 9.53e+00 3.70e+02 2.5 1.17e+01 - 3.35e-01 2.32e-01f 1
8r 3.0861002e+01 9.53e+00 2.48e+01 2.1 2.29e+00 - 9.33e-01 5.25e-01f 1
9r 3.0861002e+01 9.53e+00 7.24e-05 0.7 2.89e-01 - 1.00e+00 7.74e-01f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
10r 3.0861002e+01 9.53e+00 1.58e-04 1.1 4.81e-02 - 1.00e+00 9.88e-01f 1
11r 3.0861002e+01 9.53e+00 1.92e-05 -0.6 2.71e-02 - 8.97e-01 9.07e-01f 1
12r 3.0861002e+01 9.53e+00 1.26e-06 -1.0 3.80e-03 - 1.00e+00 9.74e-01f 1
13r 3.0861002e+01 9.53e+00 2.01e-08 -2.8 2.07e-04 - 1.00e+00 9.92e-01f 1
14r 3.0861002e+01 9.53e+00 9.83e-12 -8.7 3.80e-06 - 1.00e+00 9.99e-01f 1
Number of Iterations....: 14
(scaled) (unscaled)
Objective...............: 2.2135300960276254e+00 3.0861001765460600e+01
Dual infeasibility......: 1.8894412551874259e+03 2.6342560246511108e+04
Constraint violation....: 9.5318697483848371e+00 9.5318697483848371e+00
Complementarity.........: 9.9999999989084634e-10 1.3941984261914844e-08
Overall NLP error.......: 5.2904355145295233e+02 2.6342560246511108e+04
Number of objective function evaluations = 23
Number of objective gradient evaluations = 5
Number of equality constraint evaluations = 0
Number of inequality constraint evaluations = 23
Number of equality constraint Jacobian evaluations = 0
Number of inequality constraint Jacobian evaluations = 17
Number of Lagrangian Hessian evaluations = 0
Total CPU secs in IPOPT (w/o function evaluations) = 0.033
Total CPU secs in NLP function evaluations = 5.397
EXIT: Converged to a point of local infeasibility. Problem may be infeasible.
optParam -i horseshoe-bil-88/horseshoe-bil-88.xml -o horseshoe-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 8.6084900e+03 8.93e+00 1.00e+02 0.0 0.00e+00 - 0.00e+00 0.00e+00 0
1 7.7546861e+03 8.92e+00 8.83e+02 -5.4 1.00e+02 - 9.90e-01 1.11e-03f 1
2r 7.7546861e+03 8.92e+00 9.99e+02 1.1 0.00e+00 - 0.00e+00 3.47e-07R 6
3r 7.7546861e+03 8.92e+00 6.59e+02 2.2 1.46e+02 - 1.55e-02 9.76e-03f 1
4r 7.7546861e+03 8.92e+00 6.16e+01 1.8 1.43e+02 - 9.07e-01 8.88e-03f 1
5r 7.7546861e+03 8.92e+00 2.16e+01 1.1 4.52e-01 - 6.49e-01 9.32e-01f 1
6r 7.7546861e+03 8.92e+00 5.81e-05 0.6 4.39e-02 - 1.00e+00 9.75e-01f 1
7r 7.7546861e+03 8.92e+00 1.21e-05 -0.2 6.97e-03 - 9.21e-01 9.94e-01f 1
8r 7.7546861e+03 8.92e+00 2.04e-07 -1.8 1.62e-03 - 1.00e+00 1.00e+00f 1
9r 7.7546861e+03 8.92e+00 8.02e-10 -7.8 2.28e-05 - 9.96e-01 9.95e-01f 1
Number of Iterations....: 9
(scaled) (unscaled)
Objective...............: 2.4281526272810038e+02 7.7546861323080138e+03
Dual infeasibility......: 7.5935764716339605e+01 2.4251277081020817e+03
Constraint violation....: 8.9192891669526162e+00 8.9192891669526162e+00
Complementarity.........: 1.4501814390055662e-09 4.6313818036140727e-08
Overall NLP error.......: 2.4399032597390732e+01 2.4251277081020817e+03
Number of objective function evaluations = 17
Number of objective gradient evaluations = 4
Number of equality constraint evaluations = 0
Number of inequality constraint evaluations = 17
Number of equality constraint Jacobian evaluations = 0
Number of inequality constraint Jacobian evaluations = 12
Number of Lagrangian Hessian evaluations = 0
Total CPU secs in IPOPT (w/o function evaluations) = 0.020
Total CPU secs in NLP function evaluations = 11.473
EXIT: Converged to a point of local infeasibility. Problem may be infeasible.
optParam -i horseshoe-bil-88/horseshoe-bil-88.xml -o horseshoe-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 7.8635093e+01 8.93e+00 7.20e+01 0.0 0.00e+00 - 0.00e+00 0.00e+00 0
1 6.6066574e+01 8.85e+00 8.83e+02 -5.4 7.20e+01 - 9.90e-01 1.11e-03f 1
2 6.6065939e+01 8.85e+00 3.18e+06 -6.3 8.85e+00 - 4.05e-02 1.12e-05h 1
3r 6.6065939e+01 8.85e+00 1.00e+03 0.9 0.00e+00 - 0.00e+00 5.59e-08R 2
4r 6.6065939e+01 8.85e+00 5.96e+02 1.4 2.80e+03 - 1.05e-01 1.77e-03f 1
5r 6.6065939e+01 8.85e+00 4.57e+02 1.8 1.11e+01 - 2.33e-01 1.12e-01f 1
6r 6.6065939e+01 8.85e+00 2.02e+02 1.5 6.47e-01 - 5.59e-01 3.41e-01f 1
7r 6.6065939e+01 8.85e+00 1.61e+00 0.8 1.22e-01 - 9.92e-01 7.20e-01f 1
8r 6.6065939e+01 8.85e+00 1.20e-05 -0.0 1.91e-02 - 1.00e+00 9.62e-01f 1
9r 6.6065939e+01 8.85e+00 1.28e-06 -1.4 2.04e-03 - 9.33e-01 1.00e+00f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
10r 6.6065939e+01 8.85e+00 1.50e-08 -3.3 2.36e-04 - 9.93e-01 9.93e-01f 1
11r 6.6065939e+01 8.85e+00 7.50e-12 -9.0 2.42e-06 - 1.00e+00 1.00e+00f 1
Number of Iterations....: 11
(scaled) (unscaled)
Objective...............: 6.6065939341213650e+01 6.6065939341213650e+01
Dual infeasibility......: 3.9095739589356526e+01 3.9095739589356526e+01
Constraint violation....: 8.8543536587601572e+00 8.8543536587601572e+00
Complementarity.........: 9.9999999998574030e-10 9.9999999998574030e-10
Overall NLP error.......: 1.2163118983344553e+01 3.9095739589356526e+01
Number of objective function evaluations = 15
Number of objective gradient evaluations = 5
Number of equality constraint evaluations = 0
Number of inequality constraint evaluations = 15
Number of equality constraint Jacobian evaluations = 0
Number of inequality constraint Jacobian evaluations = 14
Number of Lagrangian Hessian evaluations = 0
Total CPU secs in IPOPT (w/o function evaluations) = 0.027
Total CPU secs in NLP function evaluations = 13.697
EXIT: Converged to a point of local infeasibility. Problem may be infeasible.
testParam -i horseshoe-min-44-no-opt/horseshoe-min-44-no-opt.xml -o horseshoe-min-44-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 horseshoe-min-44-winslow/horseshoe-min-44-winslow.xml -o horseshoe-min-44-winslow-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 horseshoe-min-44-liao/horseshoe-min-44-liao.xml -o horseshoe-min-44-liao-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 horseshoe-min-44-contMechanics/horseshoe-min-44-contMechanics.xml -o horseshoe-min-44-contMechanics-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 horseshoe-bil-44-no-opt/horseshoe-bil-44-no-opt.xml -o horseshoe-bil-44-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 horseshoe-bil-44-winslow/horseshoe-bil-44-winslow.xml -o horseshoe-bil-44-winslow-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 horseshoe-bil-44-liao/horseshoe-bil-44-liao.xml -o horseshoe-bil-44-liao-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 horseshoe-bil-44-contMechanics/horseshoe-bil-44-contMechanics.xml -o horseshoe-bil-44-contMechanics-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 horseshoe-min-88-no-opt/horseshoe-min-88-no-opt.xml -o horseshoe-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 horseshoe-min-88-winslow/horseshoe-min-88-winslow.xml -o horseshoe-min-88-winslow-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 horseshoe-min-88-liao/horseshoe-min-88-liao.xml -o horseshoe-min-88-liao-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 horseshoe-min-88-contMechanics/horseshoe-min-88-contMechanics.xml -o horseshoe-min-88-contMechanics-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 horseshoe-bil-88-no-opt/horseshoe-bil-88-no-opt.xml -o horseshoe-bil-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 horseshoe-bil-88-winslow/horseshoe-bil-88-winslow.xml -o horseshoe-bil-88-winslow-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 horseshoe-bil-88-liao/horseshoe-bil-88-liao.xml -o horseshoe-bil-88-liao-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 horseshoe-bil-88-contMechanics/horseshoe-bil-88-contMechanics.xml -o horseshoe-bil-88-contMechanics-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.
Error estimate horseshoe-min-44-no-opt-k5-sin+cos: L_1: 0.27
Error estimate horseshoe-min-44-no-opt-k5-sin+cos: L_2: 0.23
Error estimate horseshoe-min-44-no-opt-k5-sin+cos: max: 0.15
Error estimate horseshoe-min-44-winslow-k5-sin+cos: L_1: 0.28
Error estimate horseshoe-min-44-winslow-k5-sin+cos: L_2: 0.24
Error estimate horseshoe-min-44-winslow-k5-sin+cos: max: 0.14
Error estimate horseshoe-min-44-liao-k5-sin+cos: L_1: 0.28
Error estimate horseshoe-min-44-liao-k5-sin+cos: L_2: 0.22
Error estimate horseshoe-min-44-liao-k5-sin+cos: max: 0.15
Error estimate horseshoe-min-44-contMechanics-k5-sin+cos: L_1: 0.32
Error estimate horseshoe-min-44-contMechanics-k5-sin+cos: L_2: 0.27
Error estimate horseshoe-min-44-contMechanics-k5-sin+cos: max: 0.18
Error estimate horseshoe-bil-44-no-opt-k5-sin+cos: L_1: 0.39
Error estimate horseshoe-bil-44-no-opt-k5-sin+cos: L_2: 0.34
Error estimate horseshoe-bil-44-no-opt-k5-sin+cos: max: 0.26
Error estimate horseshoe-bil-44-winslow-k5-sin+cos: L_1: 0.37
Error estimate horseshoe-bil-44-winslow-k5-sin+cos: L_2: 0.32
Error estimate horseshoe-bil-44-winslow-k5-sin+cos: max: 0.23
Error estimate horseshoe-bil-44-liao-k5-sin+cos: L_1: 0.34
Error estimate horseshoe-bil-44-liao-k5-sin+cos: L_2: 0.29
Error estimate horseshoe-bil-44-liao-k5-sin+cos: max: 0.24
Error estimate horseshoe-bil-44-contMechanics-k5-sin+cos: L_1: 0.42
Error estimate horseshoe-bil-44-contMechanics-k5-sin+cos: L_2: 0.37
Error estimate horseshoe-bil-44-contMechanics-k5-sin+cos: max: 0.32
Error estimate horseshoe-min-88-no-opt-k5-sin+cos: L_1: 0.27
Error estimate horseshoe-min-88-no-opt-k5-sin+cos: L_2: 0.25
Error estimate horseshoe-min-88-no-opt-k5-sin+cos: max: 0.20
Error estimate horseshoe-min-88-winslow-k5-sin+cos: L_1: 0.27
Error estimate horseshoe-min-88-winslow-k5-sin+cos: L_2: 0.25
Error estimate horseshoe-min-88-winslow-k5-sin+cos: max: 0.20
Error estimate horseshoe-min-88-liao-k5-sin+cos: L_1: 0.27
Error estimate horseshoe-min-88-liao-k5-sin+cos: L_2: 0.24
Error estimate horseshoe-min-88-liao-k5-sin+cos: max: 0.20
Error estimate horseshoe-min-88-contMechanics-k5-sin+cos: L_1: 0.27
Error estimate horseshoe-min-88-contMechanics-k5-sin+cos: L_2: 0.25
Error estimate horseshoe-min-88-contMechanics-k5-sin+cos: max: 0.20
Error estimate horseshoe-bil-88-no-opt-k5-sin+cos: L_1: 0.27
Error estimate horseshoe-bil-88-no-opt-k5-sin+cos: L_2: 0.24
Error estimate horseshoe-bil-88-no-opt-k5-sin+cos: max: 0.21
Error estimate horseshoe-bil-88-winslow-k5-sin+cos: L_1: 0.23
Error estimate horseshoe-bil-88-winslow-k5-sin+cos: L_2: 0.22
Error estimate horseshoe-bil-88-winslow-k5-sin+cos: max: 0.16
Error estimate horseshoe-bil-88-liao-k5-sin+cos: L_1: 0.27
Error estimate horseshoe-bil-88-liao-k5-sin+cos: L_2: 0.24
Error estimate horseshoe-bil-88-liao-k5-sin+cos: max: 0.20
Error estimate horseshoe-bil-88-contMechanics-k5-sin+cos: L_1: 0.27
Error estimate horseshoe-bil-88-contMechanics-k5-sin+cos: L_2: 0.25
Error estimate horseshoe-bil-88-contMechanics-k5-sin+cos: max: 0.21
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 [12]:
# Main
files = [
["../data/test/cube.xml" , "cube" , True ],
["../data/UBW/turbineBoundary.xml" , "turbine" , True ],
]
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",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/cube.xml -o cube-min-88 -a min -n 8 -m 8 --det
-c (--det) -- Missing a value for this argument!
USAGE:
-c <int>, --det <int>
number of det values ((todo: better desc))
--nonPeriodic
Do not force the boundary to be periodic, i.e. no call of
.setPeriodic()
--rectangle
Consider the boundary curve to have corners at t={0,0.25,0.5,0.75}
-s <float>, --start <float>
The surface map should map the point (0,0) onto boundary(start)
--plotDet
Append the determinate as a third coordinate to the surface NURBS
--opt
Optimize the surface parameterization using IOPT
--plot
Plot surface using ParaView
-a <string>, --algorithm <string>
Algorithms: bil , min , ...
-o <string>, --output <string>
Name of the output file.
-i <string>, --input <string>
Name of the input file.
-d <int>, --degree <int>
Degree of a surface
-m <int>, --m <int>
Number of basis function in other direction
-n <int>, --n <int>
Number of basis function in one direction
--, --ignore_rest
Ignores the rest of the labeled arguments following this flag.
--version
Displays version information and exits.
-h, --help
Displays usage information and exits.
Tutorial on gsTensorBSpline class.
Warning:
Something went wrong when reading the command line.
Warning: Error: Missing a value for this argument! Argument: -c (--det)
----------------------
n: 8
m: 8
degree: 3
input:
output:
----------------------
Warning: gsBSplineBasis: Converting basis to periodicBSplineBasis: deg=2, size=10, knot vector:
[ 0 0 0 0.125 0.25 ... 0.75 0.875 1 1 1 ] (deg=2, size=13, minSpan=0.125, maxSpan=0.125)
genParam -i ../data/test/cube.xml -o cube-bil-88 -a bil -n 8 -m 8 --det
-c (--det) -- Missing a value for this argument!
USAGE:
-c <int>, --det <int>
number of det values ((todo: better desc))
--nonPeriodic
Do not force the boundary to be periodic, i.e. no call of
.setPeriodic()
--rectangle
Consider the boundary curve to have corners at t={0,0.25,0.5,0.75}
-s <float>, --start <float>
The surface map should map the point (0,0) onto boundary(start)
--plotDet
Append the determinate as a third coordinate to the surface NURBS
--opt
Optimize the surface parameterization using IOPT
--plot
Plot surface using ParaView
-a <string>, --algorithm <string>
Algorithms: bil , min , ...
-o <string>, --output <string>
Name of the output file.
-i <string>, --input <string>
Name of the input file.
-d <int>, --degree <int>
Degree of a surface
-m <int>, --m <int>
Number of basis function in other direction
-n <int>, --n <int>
Number of basis function in one direction
--, --ignore_rest
Ignores the rest of the labeled arguments following this flag.
--version
Displays version information and exits.
-h, --help
Displays usage information and exits.
Tutorial on gsTensorBSpline class.
Warning:
Something went wrong when reading the command line.
Warning: Error: Missing a value for this argument! Argument: -c (--det)
----------------------
n: 8
m: 8
degree: 3
input:
output:
----------------------
Warning: gsBSplineBasis: Converting basis to periodicBSplineBasis: deg=2, size=10, knot vector:
[ 0 0 0 0.125 0.25 ... 0.75 0.875 1 1 1 ] (deg=2, size=13, minSpan=0.125, maxSpan=0.125)
genParam -i ../data/UBW/turbineBoundary.xml -o turbine-min-88 -a min -n 8 -m 8 --det
-c (--det) -- Missing a value for this argument!
USAGE:
-c <int>, --det <int>
number of det values ((todo: better desc))
--nonPeriodic
Do not force the boundary to be periodic, i.e. no call of
.setPeriodic()
--rectangle
Consider the boundary curve to have corners at t={0,0.25,0.5,0.75}
-s <float>, --start <float>
The surface map should map the point (0,0) onto boundary(start)
--plotDet
Append the determinate as a third coordinate to the surface NURBS
--opt
Optimize the surface parameterization using IOPT
--plot
Plot surface using ParaView
-a <string>, --algorithm <string>
Algorithms: bil , min , ...
-o <string>, --output <string>
Name of the output file.
-i <string>, --input <string>
Name of the input file.
-d <int>, --degree <int>
Degree of a surface
-m <int>, --m <int>
Number of basis function in other direction
-n <int>, --n <int>
Number of basis function in one direction
--, --ignore_rest
Ignores the rest of the labeled arguments following this flag.
--version
Displays version information and exits.
-h, --help
Displays usage information and exits.
Tutorial on gsTensorBSpline class.
Warning:
Something went wrong when reading the command line.
Warning: Error: Missing a value for this argument! Argument: -c (--det)
----------------------
n: 8
m: 8
degree: 3
input:
output:
----------------------
Warning: gsBSplineBasis: Converting basis to periodicBSplineBasis: deg=2, size=10, knot vector:
[ 0 0 0 0.125 0.25 ... 0.75 0.875 1 1 1 ] (deg=2, size=13, minSpan=0.125, maxSpan=0.125)
genParam -i ../data/UBW/turbineBoundary.xml -o turbine-bil-88 -a bil -n 8 -m 8 --det
-c (--det) -- Missing a value for this argument!
USAGE:
-c <int>, --det <int>
number of det values ((todo: better desc))
--nonPeriodic
Do not force the boundary to be periodic, i.e. no call of
.setPeriodic()
--rectangle
Consider the boundary curve to have corners at t={0,0.25,0.5,0.75}
-s <float>, --start <float>
The surface map should map the point (0,0) onto boundary(start)
--plotDet
Append the determinate as a third coordinate to the surface NURBS
--opt
Optimize the surface parameterization using IOPT
--plot
Plot surface using ParaView
-a <string>, --algorithm <string>
Algorithms: bil , min , ...
-o <string>, --output <string>
Name of the output file.
-i <string>, --input <string>
Name of the input file.
-d <int>, --degree <int>
Degree of a surface
-m <int>, --m <int>
Number of basis function in other direction
-n <int>, --n <int>
Number of basis function in one direction
--, --ignore_rest
Ignores the rest of the labeled arguments following this flag.
--version
Displays version information and exits.
-h, --help
Displays usage information and exits.
Tutorial on gsTensorBSpline class.
Warning:
Something went wrong when reading the command line.
Warning: Error: Missing a value for this argument! Argument: -c (--det)
----------------------
n: 8
m: 8
degree: 3
input:
output:
----------------------
Warning: gsBSplineBasis: Converting basis to periodicBSplineBasis: deg=2, size=10, knot vector:
[ 0 0 0 0.125 0.25 ... 0.75 0.875 1 1 1 ] (deg=2, size=13, minSpan=0.125, maxSpan=0.125)
In [ ]:
In [ ]:
Content source: SteffenPL/gsSandbox
Similar notebooks: