Kazuki IidaHiroyuki YoshidaA. NakaoHarald O. JeschkeYasir IqbalKenji NakajimaSeiko Ohira‐KawamuraKoji MunakataYasuhiro InamuraNaoki MuraiM. IshikadoReiji KumaiTakuya OkadaM. OdaKazuhisa KakuraiM. Matsuda
29
Citation
57
Reference
10
Related Paper
Citation Trend
Abstract:
Crystal and magnetic structures of the mineral centennialite ${\mathrm{CaCu}}_{3}{(\mathrm{OH})}_{6}{\mathrm{Cl}}_{2}\ifmmode\cdot\else\textperiodcentered\fi{}0.6{\mathrm{H}}_{2}\mathrm{O}$ are investigated by means of synchrotron x-ray diffraction and neutron diffraction measurements complemented by density functional theory (DFT) and pseudofermion functional renormalization group (PFFRG) calculations. ${\mathrm{CaCu}}_{3}{(\mathrm{OH})}_{6}{\mathrm{Cl}}_{2}\ifmmode\cdot\else\textperiodcentered\fi{}0.6{\mathrm{H}}_{2}\mathrm{O}$ crystallizes in the $P\overline{3}m1$ space group and ${\mathrm{Cu}}^{2+}$ ions form a geometrically perfect kagome network with antiferromagnetic ${J}_{1}$. No intersite disorder between ${\mathrm{Cu}}^{2+}$ and ${\mathrm{Ca}}^{2+}$ ions is detected. ${\mathrm{CaCu}}_{3}{(\mathrm{OH})}_{6}{\mathrm{Cl}}_{2}\ifmmode\cdot\else\textperiodcentered\fi{}0.6{\mathrm{H}}_{2}\mathrm{O}$ enters a magnetic long-range ordered state below ${T}_{\text{N}}=7.2$ K, and the $\mathbf{q}=\mathbf{0}$ magnetic structure with negative vector spin chirality is obtained. The ordered moment at 0.3 K is suppressed to $0.58(2){\ensuremath{\mu}}_{\text{B}}$. Our DFT calculations indicate the presence of antiferromagnetic ${J}_{2}$ and ferromagnetic ${J}_{d}$ superexchange couplings of a strength which places the system at the crossroads of three magnetic orders (at the classical level) and a spin-$\frac{1}{2}$ PFFRG analysis shows a dominance of $\mathbf{q}=\mathbf{0}$ type magnetic correlations, consistent with and indicating proximity to the observed $\mathbf{q}=\mathbf{0}$ spin structure. The results suggest that this material is located close to a quantum critical point and is a good realization of a ${J}_{1}\ensuremath{-}{J}_{2}\ensuremath{-}{J}_{d}$ kagome antiferromagnet.No abstract available.
Cite
Citations (2)
article Free Access Share on Remarks on algorithm 352 [S22], algorithm 385 [S13], algorithm 392 [D3] Author: Michael J. Frisch Univ. of Minnesota, Minneapolis Univ. of Minnesota, MinneapolisView Profile Authors Info & Claims Communications of the ACMVolume 15Issue 12Dec. 1972 https://doi.org/10.1145/361598.361914Online:01 December 1972Publication History 0citation209DownloadsMetricsTotal Citations0Total Downloads209Last 12 Months16Last 6 weeks1 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my Alerts New Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF
Cite
Citations (2)
There are a number of reports on seismic quiescence phenomena before large earthquakes. The RTL algorithm is a weighted coefficient statistical method that takes into account the magnitude, occurrence time, and place of earthquake when seismicity pattern changes before large earthquakes are being investigated. However, we consider the original RTL algorithm to be overweighted on distance. In this paper, we introduce a modified RTL algorithm, called the RTM algorithm, and apply it to three large earthquakes in Japan, namely, the Hyogo-ken Nanbu earthquake in 1995 (MJMA7.3), the Noto Hanto earthquake in 2007 (MJMA 6.9), and the Iwate-Miyagi Nairiku earthquake in 2008 (MJMA 7.2), as test cases. Because this algorithm uses several parameters to characterize the weighted coefficients, multiparameter sets have to be prepared for the tests. The results show that the RTM algorithm is more sensitive than the RTL algorithm to seismic quiescence phenomena. This paper represents the first step in a series of future analyses of seismic quiescence phenomena using the RTM algorithm. At this moment, whole surveyed parameters are empirically selected for use in the method. We have to consider the physical meaning of the "best fit" parameter, such as the relation of ACFS, among others, in future analyses.
Earthquake simulation
Cite
Citations (26)
We recently developed a family of image reconstruction algorithms that look like the emission maximum-likelihood expectation-maximization (ML-EM) algorithm. In this study, we extend these algorithms to Bayesian algorithms. The family of emission-EM-lookalike algorithms utilizes a multiplicative update scheme. The extension of these algorithms to Bayesian algorithms is achieved by introducing a new simple factor, which contains the Bayesian information. One of the extended algorithms can be applied to emission tomography and another to transmission tomography. Computer simulations are performed and compared with the corresponding un-extended algorithms. The total-variation norm is employed as the Bayesian constraint in the computer simulations. The newly developed algorithms demonstrate a stable performance. A simple Bayesian algorithm can be derived for any noise variance function. The proposed algorithms have properties such as multiplicative updating, non-negativity, faster convergence rates for bright objects, and ease of implementation. Our algorithms are inspired by Green's one-step-late algorithm. If written in additive-update form, Green's algorithm has a step size determined by the future image value, which is an undesirable feature that our algorithms do not have.
Cite
Citations (2)
This paper propose an improved image filtering algorithm which is based on median filteringing algorithm and medium filteringing algorithm according to the simpleness of median filteringing algorithm and the significant denoising effect of medium filteringing algorithm. The new algorithm combines the two algorithms and thus gets a better filtering effect. We did the simulation using MATLAB, and then did the objective evaluation using the classical method PSNR. Simulation results showed that the new algorithm has a better denoising effect than the medium filteringing algorithm and reduces the denoising time as well. Thus the improved algorithm has a better practicalility.
Algorithm design
Cite
Citations (6)
article Free Access Share on Remarks on Algorithm 332: Jacobi polynomials: Algorithm 344: student's t-distribution: Algorithm 351: modified Romberg quadrature: Algorithm 359: factoral analysis of variance Author: Arthur H. J. Sale Univ. of Sydney, Sydney, Australia Univ. of Sydney, Sydney, AustraliaView Profile Authors Info & Claims Communications of the ACMVolume 13Issue 7July 1970 https://doi.org/10.1145/362686.362700Published:01 July 1970Publication History 0citation275DownloadsMetricsTotal Citations0Total Downloads275Last 12 Months10Last 6 weeks3 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my Alerts New Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF
Quadrature (astronomy)
Cite
Citations (0)
article Free AccessRemarks on algorithms 372: Algorithm 401: An algorithm to produce complex primes, csieve: an improved algorithm to produce complex primes Author: Paul Bratley Univ. de Montréal, Quebec, Canada Univ. de Montréal, Quebec, CanadaView Profile Authors Info & Claims Communications of the ACMVolume 13Issue 1101 November 1970https://doi.org/10.1145/362790.362805Published:01 November 1970Publication History 0citation192DownloadsMetricsTotal Citations0Total Downloads192Last 12 Months9Last 6 weeks0 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF
Cite
Citations (0)