اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدالتقدير الثنائي المنفصل: نظرة عامة وتطورات حديثة
The discrete dipole approximation: an overview and recent developments
368
0
0.0
(
0
)
اسأل ChatGPT حول البحث
نقدر نقدم مراجعة للتقاط المقطع المحدد (DDA)، الذي هو طريقة عامة لمحاكاة الانعكاس الضوئي بأشكال بدون حدود. نضع الطريقة في سياق تاريخي ونناقش التطورات الحديثة، من وجهة نظر هيكل عام بناء على المعادلات الحاصلة للمجال الكهربائي. نراجع كلا من نظرية DDA وجوانبها الرقمية، الأخيرة يكون من الأهمية الحاسمة لأي تطبيق عملي للطريقة. وأخيرا، نظر الموقع لDDA بين طرق أخرى لمحاكاة الانعكاس الضوئي ونناقش التطورات المحتملة في المستقبل.
We present a review of the discrete dipole approximation (DDA), which is a general method to simulate light scattering by arbitrarily shaped particles. We put the method in historical context and discuss recent developments, taking the viewpoint of a general framework based on the integral equations for the electric field. We review both the theory of the DDA and its numerical aspects, the latter being of critical importance for any practical application of the method. Finally, the position of the DDA among other methods of light scattering simulation is shown and possible future developments are discussed.
قيم البحث
اقرأ أيضاً
We propose an extrapolation technique that allows accuracy improvement of the discrete dipole approximation computations. The performance of this technique was studied empirically based on extensive simulations for 5 test cases using many different d
iscretizations. The quality of the extrapolation improves with refining discretization reaching extraordinary performance especially for cubically shaped particles. A two order of magnitude decrease of error was demonstrated. We also propose estimates of the extrapolation error, which were proven to be reliable. Finally we propose a simple method to directly separate shape and discretization errors and illustrated this for one test case.
We performed a rigorous theoretical convergence analysis of the discrete dipole approximation (DDA). We prove that errors in any measured quantity are bounded by a sum of a linear and quadratic term in the size of a dipole d, when the latter is in th
e range of DDA applicability. Moreover, the linear term is significantly smaller for cubically than for non-cubically shaped scatterers. Therefore, for small d errors for cubically shaped particles are much smaller than for non-cubically shaped. The relative importance of the linear term decreases with increasing size, hence convergence of DDA for large enough scatterers is quadratic in the common range of d. Extensive numerical simulations were carried out for a wide range of d. Finally we discuss a number of new developments in DDA and their consequences for convergence.
We present a method of incorporating the discrete dipole approximation (DDA) method with the point matching method to formulate the T-matrix for modeling arbitrarily shaped micro-sized objects. The emph{T}-matrix elements are calculated using point m
atching between fields calculated using vector spherical wave functions and DDA. When applied to microrotors, their discrete rotational and mirror symmetries can be exploited to reduce memory usage and calculation time by orders of magnitude; a number of optimization methods can be employed based on the knowledge of the relationship between the azimuthal mode and phase at each discrete rotational point, and mode redundancy from Floquets theorem. A reduced-mode T-matrix can also be calculated if the illumination conditions are known.
In this manuscript we investigate the capabilities of the Discrete Dipole Approximation (DDA) to simulate scattering from particles that are much larger than the wavelength of the incident light, and describe an optimized publicly available DDA compu
ter program that processes the large number of dipoles required for such simulations. Numerical simulations of light scattering by spheres with size parameters x up to 160 and 40 for refractive index m=1.05 and 2 respectively are presented and compared with exact results of the Mie theory. Errors of both integral and angle-resolved scattering quantities generally increase with m and show no systematic dependence on x. Computational times increase steeply with both x and m, reaching values of more than 2 weeks on a cluster of 64 processors. The main distinctive feature of the computer program is the ability to parallelize a single DDA simulation over a cluster of computers, which allows it to simulate light scattering by very large particles, like the ones that are considered in this manuscript. Current limitations and possible ways for improvement are discussed.
PYSCF is a Python-based general-purpose electronic structure platform that both supports first-principles simulations of molecules and solids, as well as accelerates the development of new methodology and complex computational workflows. The present
paper explains the design and philosophy behind PYSCF that enables it to meet these twin objectives. With several case studies, we show how users can easily implement their own methods using PYSCF as a development environment. We then summarize the capabilities of PYSCF for molecular and solid-state simulations. Finally, we describe the growing ecosystem of projects that use PYSCF across the domains of quantum chemistry, materials science, machine learning and quantum information science.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
