ترغب بنشر مسار تعليمي؟ اضغط هنا

CRASH2: colored packets and other updates

37   0   0.0 ( 0 )
 نشر من قبل Antonella Maselli
 تاريخ النشر 2008
  مجال البحث فيزياء
والبحث باللغة English




اسأل ChatGPT حول البحث

In this paper we report on the improvements implemented in the cosmological radiative transfer code CRASH. In particular we present a new multi-frequency algorithm for spectra sampling which makes use of colored photon packets: we discuss the need for the multi-frequency approach, describe its implementation and present the improved CRASH performance in reproducing the effects of ionizing radiation with an arbitrary spectrum. We further discuss minor changes in the code implementation which allow for more efficient performance and an increased precision.

قيم البحث

اقرأ أيضاً

The classical and quantum representations of thermal equilibrium are strikingly different, even for free, non-interacting particles. While the first involves particles with well-defined positions and momenta, the second usually involves energy eigens tates that are delocalized over a confining volume. In this paper, we derive convex decompositions of the density operator for non-interacting, non-relativistic particles in thermal equilibrium that allow for a connection between these two descriptions. Associated with each element of the decomposition of the N-particle thermal state is an N-body wave function, described as a set of wave packets; the distribution of the average positions and momenta of the wave packets can be linked to the classical description of thermal equilibrium, while the different amplitudes in the wave function capture the statistics relevant for fermions or bosons.
A model named `Colored Percolation has been introduced with its infinite number
More than a century ago, Henrietta Leavitt discovered the first Cepheids in the Magellanic Clouds together with the famous period-luminosity relationship revealed by these stars, which soon after revolutionized our view of the Universe. Over the year s, the number of known Cepheids in these galaxies has steadily increased with the breakthrough in the last two decades thanks to the new generation of large-scale long-term sky variability surveys. Here we present the final upgrade of the OGLE Collection of Cepheids in the Magellanic System which already contained the vast majority of known Cepheids. The updated collection now comprises 9649 classical and 262 anomalous Cepheids. Type-II Cepheids will be updated shortly. Thanks to high completeness of the OGLE survey the sample of classical Cepheids includes virtually all stars of this type in the Magellanic Clouds. Thus, the OGLE survey concludes the work started by Leavitt. Additionally, the OGLE sample of RR Lyrae stars in the Magellanic System has been updated. It now counts 46 443 variables. A collection of seven anomalous Cepheids in the halo of our Galaxy detected in front of the Magellanic Clouds is also presented. OGLE photometric data are available to the astronomical community from the OGLE Internet Archive. The time-series photometry of all pulsating stars in the OGLE Collection has been supplemented with new observations.
Properly colored cycles in edge-colored graphs are closely related to directed cycles in oriented graphs. As an analogy of the well-known Caccetta-H{a}ggkvist Conjecture, we study the existence of properly colored cycles of bounded length in an edge- colored graph. We first prove that for all integers $s$ and $t$ with $tgeq sgeq2$, every edge-colored graph $G$ with no properly colored $K_{s,t}$ contains a spanning subgraph $H$ which admits an orientation $D$ such that every directed cycle in $D$ is a properly colored cycle in $G$. Using this result, we show that for $rgeq4$, if the Caccetta-H{a}ggkvist Conjecture holds , then every edge-colored graph of order $n$ with minimum color degree at least $n/r+2sqrt{n}+1$ contains a properly colored cycle of length at most $r$. In addition, we also obtain an asymptotically tight total color degree condition which ensures a properly colored (or rainbow) $K_{s,t}$.
A superdiagonal composition is one in which the $i$-th part or summand is of size greater than or equal to $i$. In this paper, we study the number of palindromic superdiagonal compositions and colored superdiagonal compositions. In particular, we giv e generating functions and explicit combinatorial formulas involving binomial coefficients and Stirling numbers of the first kind.
التعليقات
جاري جلب التعليقات جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
mircosoft-partner

هل ترغب بارسال اشعارات عن اخر التحديثات في شمرا-اكاديميا