Update to overset validationSuite NACA4412 case

Switched from old overlpa assembly to new adaptiveOverlap assembly
This commit is contained in:
Vuko Vukcevic 2018-07-30 09:11:05 +02:00
parent 2f00bb4af1
commit 095ac84cb4
3 changed files with 90 additions and 81 deletions

View file

@ -35,25 +35,26 @@ regions
fringe fringe
{ {
type overlap; type adaptiveOverlap;
// Optional list of patches to start the fringe minimisation from // Optional list of patches to start the fringe minimisation from
initPatchNames (); initPatchNames ();
// Fraction of minimum allowable suitable pairs respecting the // Number of iterations for adaptive overlap search
// chosen donor suitability criteria specifiedIterationsNumber 12; // 5 by default
suitablePairFraction 0.8;
// Whether to start fringe assembly from the previous set of // Whether to try additional iterations
// acceptors (for moving mesh cases) additionalIterations yes; // yes by default
cacheFringe no;
// Orphan suitability
orphanSuitability 0; // 1 by default
donorSuitability donorSuitability
{ {
// Donor/acceptor pair must have cell volumes that differ not // Donor/acceptor pair must have cell volumes that differ not
// more than 60% of the larger cell // more than 20% of the larger cell
type cellVolumes; type cellVolumes;
threshold 0.6; threshold 0.2;
} }
} }
} }
@ -65,23 +66,24 @@ regions
fringe fringe
{ {
type overlap; type adaptiveOverlap;
// Optional list of patches to start the fringe minimisation from // Optional list of patches to start the fringe minimisation from
initPatchNames (OversetMiddle); initPatchNames (OversetMiddle);
// Fraction of minimum allowable suitable pairs respecting the // Number of iterations for adaptive overlap search
// chosen donor suitability criteria specifiedIterationsNumber 5; // 5 by default
suitablePairFraction 0.9;
// Whether to start fringe assembly from the previous set of // Whether to try additional iterations
// acceptors (for moving mesh cases) additionalIterations yes; // yes by default
cacheFringe no;
// Orphan suitability
orphanSuitability 0; // 1 by default
donorSuitability donorSuitability
{ {
// Donor/acceptor pair must have cell volumes that differ not // Donor/acceptor pair must have cell volumes that are at least
// more than 60% of the larger cell // 60% within each other
type cellVolumes; type cellVolumes;
threshold 0.6; threshold 0.6;
} }
@ -95,23 +97,24 @@ regions
fringe fringe
{ {
type overlap; type adaptiveOverlap;
// Optional list of patches to start the fringe minimisation from // Optional list of patches to start the fringe minimisation from
initPatchNames (OversetFront); initPatchNames (OversetFront);
// Fraction of minimum allowable suitable pairs respecting the // Number of iterations for adaptive overlap search
// chosen donor suitability criteria specifiedIterationsNumber 5; // 5 by default
suitablePairFraction 0.8;
// Whether to start fringe assembly from the previous set of // Whether to try additional iterations
// acceptors (for moving mesh cases) additionalIterations yes; // yes by default
cacheFringe no;
// Orphan suitability
orphanSuitability 0; // 1 by default
donorSuitability donorSuitability
{ {
// Donor/acceptor pair must have cell volumes that differ not // Donor/acceptor pair must have cell volumes that are at least
// more than 40% of the larger cell // 40% within each other
type cellVolumes; type cellVolumes;
threshold 0.4; threshold 0.4;
} }

View file

@ -35,25 +35,26 @@ regions
fringe fringe
{ {
type overlap; type adaptiveOverlap;
// Optional list of patches to start the fringe minimisation from // Optional list of patches to start the fringe minimisation from
initPatchNames (); initPatchNames ();
// Fraction of minimum allowable suitable pairs respecting the // Number of iterations for adaptive overlap search
// chosen donor suitability criteria specifiedIterationsNumber 12; // 5 by default
suitablePairFraction 0.8;
// Whether to start fringe assembly from the previous set of // Whether to try additional iterations
// acceptors (for moving mesh cases) additionalIterations yes; // yes by default
cacheFringe no;
// Orphan suitability
orphanSuitability 0; // 1 by default
donorSuitability donorSuitability
{ {
// Donor/acceptor pair must have cell volumes that differ not // Donor/acceptor pair must have cell volumes that differ not
// more than 60% of the larger cell // more than 20% of the larger cell
type cellVolumes; type cellVolumes;
threshold 0.6; threshold 0.2;
} }
} }
} }
@ -65,23 +66,24 @@ regions
fringe fringe
{ {
type overlap; type adaptiveOverlap;
// Optional list of patches to start the fringe minimisation from // Optional list of patches to start the fringe minimisation from
initPatchNames (OversetMiddle); initPatchNames (OversetMiddle);
// Fraction of minimum allowable suitable pairs respecting the // Number of iterations for adaptive overlap search
// chosen donor suitability criteria specifiedIterationsNumber 5; // 5 by default
suitablePairFraction 0.9;
// Whether to start fringe assembly from the previous set of // Whether to try additional iterations
// acceptors (for moving mesh cases) additionalIterations yes; // yes by default
cacheFringe no;
// Orphan suitability
orphanSuitability 0; // 1 by default
donorSuitability donorSuitability
{ {
// Donor/acceptor pair must have cell volumes that differ not // Donor/acceptor pair must have cell volumes that are at least
// more than 60% of the larger cell // 60% within each other
type cellVolumes; type cellVolumes;
threshold 0.6; threshold 0.6;
} }
@ -95,23 +97,24 @@ regions
fringe fringe
{ {
type overlap; type adaptiveOverlap;
// Optional list of patches to start the fringe minimisation from // Optional list of patches to start the fringe minimisation from
initPatchNames (OversetFront); initPatchNames (OversetFront);
// Fraction of minimum allowable suitable pairs respecting the // Number of iterations for adaptive overlap search
// chosen donor suitability criteria specifiedIterationsNumber 5; // 5 by default
suitablePairFraction 0.8;
// Whether to start fringe assembly from the previous set of // Whether to try additional iterations
// acceptors (for moving mesh cases) additionalIterations yes; // yes by default
cacheFringe no;
// Orphan suitability
orphanSuitability 0; // 1 by default
donorSuitability donorSuitability
{ {
// Donor/acceptor pair must have cell volumes that differ not // Donor/acceptor pair must have cell volumes that are at least
// more than 40% of the larger cell // 40% within each other
type cellVolumes; type cellVolumes;
threshold 0.4; threshold 0.4;
} }

View file

@ -35,25 +35,26 @@ regions
fringe fringe
{ {
type overlap; type adaptiveOverlap;
// Optional list of patches to start the fringe minimisation from // Optional list of patches to start the fringe minimisation from
initPatchNames (); initPatchNames ();
// Fraction of minimum allowable suitable pairs respecting the // Number of iterations for adaptive overlap search
// chosen donor suitability criteria specifiedIterationsNumber 12; // 5 by default
suitablePairFraction 0.8;
// Whether to start fringe assembly from the previous set of // Whether to try additional iterations
// acceptors (for moving mesh cases) additionalIterations yes; // yes by default
cacheFringe no;
// Orphan suitability
orphanSuitability 0; // 1 by default
donorSuitability donorSuitability
{ {
// Donor/acceptor pair must have cell volumes that differ not // Donor/acceptor pair must have cell volumes that differ not
// more than 60% of the larger cell // more than 20% of the larger cell
type cellVolumes; type cellVolumes;
threshold 0.6; threshold 0.2;
} }
} }
} }
@ -65,23 +66,24 @@ regions
fringe fringe
{ {
type overlap; type adaptiveOverlap;
// Optional list of patches to start the fringe minimisation from // Optional list of patches to start the fringe minimisation from
initPatchNames (OversetMiddle); initPatchNames (OversetMiddle);
// Fraction of minimum allowable suitable pairs respecting the // Number of iterations for adaptive overlap search
// chosen donor suitability criteria specifiedIterationsNumber 5; // 5 by default
suitablePairFraction 0.9;
// Whether to start fringe assembly from the previous set of // Whether to try additional iterations
// acceptors (for moving mesh cases) additionalIterations yes; // yes by default
cacheFringe no;
// Orphan suitability
orphanSuitability 0; // 1 by default
donorSuitability donorSuitability
{ {
// Donor/acceptor pair must have cell volumes that differ not // Donor/acceptor pair must have cell volumes that are at least
// more than 60% of the larger cell // 60% within each other
type cellVolumes; type cellVolumes;
threshold 0.6; threshold 0.6;
} }
@ -95,23 +97,24 @@ regions
fringe fringe
{ {
type overlap; type adaptiveOverlap;
// Optional list of patches to start the fringe minimisation from // Optional list of patches to start the fringe minimisation from
initPatchNames (OversetFront); initPatchNames (OversetFront);
// Fraction of minimum allowable suitable pairs respecting the // Number of iterations for adaptive overlap search
// chosen donor suitability criteria specifiedIterationsNumber 5; // 5 by default
suitablePairFraction 0.8;
// Whether to start fringe assembly from the previous set of // Whether to try additional iterations
// acceptors (for moving mesh cases) additionalIterations yes; // yes by default
cacheFringe no;
// Orphan suitability
orphanSuitability 0; // 1 by default
donorSuitability donorSuitability
{ {
// Donor/acceptor pair must have cell volumes that differ not // Donor/acceptor pair must have cell volumes that are at least
// more than 40% of the larger cell // 40% within each other
type cellVolumes; type cellVolumes;
threshold 0.4; threshold 0.4;
} }