Q-criterion

1 Q-Criterion

 

1.1 Q-criterion– Hunt, Wray & Moin 1988

J. Fluid. Mech. 366, 87–108. Hunt, J. C. R., Wray, A. & Moin, P. 1988 Eddies, stream, and convergence zones in turbulent flows. Center for Turbulence Research Report CTR-S88.

velocity gradient, ∇ v ∇ v = S + Ω where, S is rate-of-strain tensor, and Ω is vorticity tensor

\begin{equation} S= 0.5[\nabla v + (\nabla v)^T] \end{equation}

\begin{equation} \Omega = 0.5[\nabla v - (\nabla v)^T] \end{equation}

Q-criterion: Q=0.5(||Ω||2 - ||S||2)

Q> 0

1.2 Q criterion-paraview

Qcriterion of a wind turbine

isosurface
a 3D surface representation of points with equal values in a 3D data distribution. Is the 3D equivalent of a contour line.

setup details

1.3 Q-Criterion with Tecplot

>>> analysze/calculate variables/Q criterion
http://download.tecplot.com/videos/3602017R2-QCriterion.mp4
Q-Criterion is an important calculation used to identify vortices.
In this video we’ll show you how to calculate Q-Criterion, plot the results, and compare the performance of Plot3D and SZL file formats for this work.

In this example, we are using the final time-step of a transient simulation of a wind turbine. An overset mesh was used and is composed of 5863 zones with a total of 263 million elements. The output is in Plot3D file format and the grid and solution files combine for a total of 21 GB.

To calculate Q-Criterion:

>> Analyze > Calculate Variables and select Q Criterion from the list.
The Calculate Variables dialog has a unique feature called Calculate-on-Demand – if you check this toggle, the formula will simply be registered and the calculation will not occur until it is required. This can save a significant amount of time particularly for a data set such as this which has many zones, because the calculation will only be performed on the zones required for the desired plot.

Use an iso-surface, at a positive value near zero, to view the resulting Q-Criterion calculation. Some adjustment of the iso-surface value will be required to see the vortices. Increasing Q reduces the complexity of the iso-surface, but too high of a value  makes an iso-surface that is too sparse. It is important to find a value that results in an iso-surface that is neither too dense nor too sparse.

When run in batch mode, the total time to load the data, calculate Q and generate an image with an iso-surface at Q=0.01, without Calculate-on-Demand, was 517 seconds for the Plot3D file and 409 seconds for the SZL file. Using Calculate-on-Demand was 27% faster, taking 372 seconds for the Plot3D file and 299 seconds for the SZL file. Additionally the SZL file is 35% smaller at only 13GB

https://www.youtube.com/watch?v=LmqQtTAsTiA

Author: kemina

Created: 2019-03-27 Wed 14:20

Emacs 24.5.1 (Org mode 8.2.10)

Validate

Q-criterion- definition and post-processing的更多相关文章

  1. post processing in CFD

    post post Table of Contents 1. Post-processing 1.1. Reverse flow 1.1.1. reasons 1.1.2. solutions 1.2 ...

  2. Q准则涡识别方法

    Q准则(Q Criterion)在涡识别中计算效率高,效果也不错,是一种常用的涡提取/识别方法. 了解Q准则需要从速度梯度张量入手,而速度梯度张量可以分解成两部分 \[\frac{\partial u ...

  3. <<Differential Geometry of Curves and Surfaces>>笔记

    <Differential Geometry of Curves and Surfaces> by Manfredo P. do Carmo real line Rinterval I== ...

  4. <Differential Geometry of Curves and Surfaces>(by Manfredo P. do Carmo) Notes

    <Differential Geometry of Curves and Surfaces> by Manfredo P. do Carmo real line Rinterval I== ...

  5. Visual Studio 2010 RDLC 报表简单使用

    原文:Visual Studio 2010 RDLC 报表简单使用 RDLC(Report Definition Language Client-side Processing)是Visual Stu ...

  6. 分布式系统根基:物理时钟和Lamport逻辑时钟

    分布式系统解决了传统单体架构的单点问题和性能容量问题,另一方面也带来了很多的问题,其中一个问题就是多节点的时间同步问题:不同机器上的物理时钟难以同步,导致无法区分在分布式系统中多个节点的事件时序.19 ...

  7. Discrete Mathematics and Its Applications | 1 CHAPTER The Foundations: Logic and Proofs | 1.4 Predicates and Quantifiers

    The statements that describe valid input are known as preconditions and the conditions that the outp ...

  8. Python - 常用的PyCharm的快捷键和使用场景介绍

    关于PyCharm的快捷键,由于数量众多,差不多有100个,相信几乎没有人会记住所有,每个人都会有自己顺手的几个,这里我将自己用着顺手,不别扭的快捷键分享出来,同时分享在哪里可以找到所有的快捷键. 一 ...

  9. IGS_学习笔记03_Integrated SOA Gateway设定配置(案例)

    20150506 Created By BaoXinjian

随机推荐

  1. 学生表、课程表、 成绩表 、教师表sql练习

    转自:http://yuncode.net/code/c_58df7a8ca687e58 1.查询“1”课程比“2”课程成绩高的所有学生的学号: SELECT t1.student_id FROM   ...

  2. eclipse maven创建web项目

    记录地址 jdk设置及文件包miss 实例下载地址 创建SSM整合项目 一.使用Eclipse中的maven插件创建web项目 1: 2: 3: 4: 5:maven web项目创建成功.(去掉ind ...

  3. Nginx配置try_files实践一

    参考资料: http://linuxplayer.org/2013/06/nginx-try-files-on-multiple-named-location-or-serverhttp://stac ...

  4. bzoj 1668: [Usaco2006 Oct]Cow Pie Treasures 馅饼里的财富【记忆化搜索+剪枝】

    c[x][y]为从(x,y)到(n,m)的最大值,记忆化一下 有个剪枝是因为y只能+1所以当n-x>m-y时就算x也一直+1也是走不到(n,m)的,直接返回0即可 #include<ios ...

  5. CSS左侧固定右侧自适应

    方法一: float + margin.left{ float: left; width: 100px; }.right {margin-left:100px; } /*清除浮动*/ .contain ...

  6. codechef: BINARY, Binary Movements

    非常有毛病的一道题,我一个一个读字符死活过不去,改成整行整行读就 A 了... 做法就是...最小点覆盖... 我们发现可以把一个点向上跳看做被吃掉了,然后最顶层的点是无法向上跳所以不能被吃掉,然后被 ...

  7. 树形DP UVA 1292 Strategic game

    题目传送门 /* 题解:选择一个点,它相邻的点都当做被选择,问最少选择多少点将所有点都被选择 树形DP:dp[i][0/1]表示当前点选或不选,如果选,相邻的点可选可不选,取最小值 */ /***** ...

  8. 二分搜索 POJ 3273 Monthly Expense

    题目传送门 /* 题意:分成m个集合,使最大的集合值(求和)最小 二分搜索:二分集合大小,判断能否有m个集合. */ #include <cstdio> #include <algo ...

  9. [ CodeForces 515 D ] Drazil and Tiles

    \(\\\) \(Description\) 给出一个\(N\times M\) 的网格,一些位置是障碍,其他位置是空地,求是否存在一个用 \(1\times 2\)的骨牌铺满空地的方案,以及方案是否 ...

  10. IT项目为什么失败 --美国IT项目管理硕士笔记(一)

    IT项目为什么失败 什么是项目   项目可以被看作任何一系列的活动和任务.这些活动和任务有一个特定目标需要在特定要求下完成,并有一个明确的开始结束日期和资金限制(如果有).项目需要消耗人力或非人力资源 ...