[互助]物理光学消隐计算

此外，我们在离散化超巨型模型的速度是FEKO的10倍以上；并且，对于普通PC电脑，如果内存升到顶，仍然觉得需要计算更大模型时，我们可以用固态硬盘进行扩容，并且速度的降低程度可以容忍（依赖于SSD自身的性能，主要是IOPS指数）。

我们的算例还包括一个假象的300米级别前苏联航母，计算频率为1GHz，单站RCS，可以在64GB内存的过时服务器上完成。

实际上就是O(N)，哈哈，之前写错了，因为我们习惯和频率或者波长比较。 5'[b:YC  
CR'
1,  
内容来自[短消息]

Very good. right now it is clear for me, for example, we have \lambda \times \lambda plate, if we subdivided the side with 10 segment, we will got \lambda^2/50 triangles. The total number of triangles approximate 1/(f^2). ,LVZ  
&`Ek-b!7  
内容来自[短消息]

daiweifeng:此外，我们在离散化超巨型模型的速度是FEKO的10倍以上；并且，对于普通PC电脑，如果内存升到顶，仍然觉得需要计算更大模型时，我们可以用固态硬盘进行扩容，并且速度的降低程度可以容忍（依赖于SSD自身的性能，主要是IOPS指数）。 (2014-05-26 23:13)  Ws*UhJY<GS  

`A ^  
By the way, you mean the mesh generator in EASTFDTD is 10 times faster than FEKO? :.aMhyh#*  
In PO solver, the shadow judge time is including the buffer or tree construction procedure? Gqs)E"h  
="J *v>  
My meaning is: when the mesh is ready, we will record the total time for the buffer or tree construction and the shadow judge procedure for the judgement. +Fa!<txn  
4Be'w`Q {  
I expect your reply for this question. (rm*KD"]  
N|\Q:<!2_w  
Regards! U;#9^<^  
Daopu

（1）离散化快 hjD%=Ri0Z  
（2）消隐也快 nO+R>8,Q  
都是高数倍的速度。之所以提到离散化问题，是因为这个计算在离散化的时候可能产生峰值内存，操作速度很慢很慢，使用经验表明高频下往往FEKO还没离散化完EASTFDTD(PO)已经全算完了。

daiweifeng:（1）离散化快
te
4=  
（2）消隐也快 m*jTvn  
都是高数倍的速度。之所以提到离散化问题，是因为这个计算在离散化的时候可能产生峰值内存，操作速度很慢很慢，使用经验表明高频下往往FEKO还没离散化完EASTFDTD(PO)已经全算完了。 (2014-06-04 19:38)  HuJc*op-6  

DD2K>1A1  
very good, but you still not answer my question: FASTFDTD PO solver shadow judgement based on pixels or based on triangles? 2RQ-L  
P0pBR_:o  
Thanks!

xiangdaopu:very good, but you still not answer my question: FASTFDTD PO solver shadow judgement based on pixels or based on triangles?
Thanks! (2014-06-04 19:54)  BM`6<Z"3q  

5dB62dqN  
I can imaging what you are talking about the compoexity: O(N^2*M), actually, I think M is the number of pixels on the screen, for each pixel, FASTFDTD will check on all triangle, the triangle is cover this pixel or not...

xiangdaopu:very good, but you still not answer my question: FASTFDTD PO solver shadow judgement based on pixels or based on triangles?
Thanks! (2014-06-04 19:54)  !TJ,:c]4{!  

0'fswa)  
I can imaging what you are talking about the compoexity: O(N^2*M), actually, I think M is the number of pixels on the screen, for each pixel, FASTFDTD will check on all triangle, the triangle is cover this pixel or not..., this kind of shadow judgement algorithm will be very fast!

xiangdaopu:very good, but you still not answer my question: FASTFDTD PO solver shadow judgement based on pixels or based on triangles?
Thanks! (2014-06-04 19:54)  N);w~)MYh  

wOl?(w=|  
I can imaging what you are talking about the compoexity: O(N^2*M), actually, I think M is the number of pixels on the screen, for each pixel, FASTFDTD will check on all triangle, the triangle is cover this pixel or not..., this kind of shadow judgement algorithm will be very fast! /N"3kK,N  
I think I'm clear now!