Abstract

The general equation δM(r) = ρ(r) + g(r) of the δ direct methods (δ-GEQ) is established which, when expressed in the form δM(r) - ρ(r) = g(r), is used in the SMAR phasing algorithm [Rius (2020). Acta Cryst A76, 489-493]. It is shown that SMAR is based on the alternating minimization of the two residuals Rρ(χ) = ∫V [ρ(χ) - ρ(Φ)sρ]2 dV and Rδ(Φ) = ∫V mρ[δM(χ) - ρ(Φ)sρ]2 dV in each iteration of the algorithm by maximizing the respective Sρ(Φ) and Sδ(Φ) sum functions. While Rρ(χ) converges to zero, Rδ(Φ) converges, as predicted by the theory, to a positive quantity. These two independent residuals combine δM and ρ each with |ρ| while keeping the same unknowns, leading to overdetermination for diffraction data extending to atomic resolution. At the beginning of a SMAR phase refinement, the zero part of the mρ mask [resulting from the zero conversion of the slightly negative ρ(Φ) values] occupies ∼50% of the unit-cell volume and increases by ∼5% when convergence is reached. The effects on the residuals of the two SMAR phase refinement modes, i.e. only using density functions (slow mode) supplemented by atomic constraints (fast mode), are discussed in detail. Due to its architecture, the SMAR algorithm is particularly well suited for Deep Learning. Another way of using δ-GEQ is by solving it in the form ρ(r) = δM(r) - g(r), which provides a simple new derivation of the already known δM tangent formula, the core of the δ recycling phasing algorithm [Rius (2012). Acta Cryst. A68, 399-400]. The nomenclature used here is: (i) Φ is the set of φ structure factor phases of ρ to be refined; (ii) δM(χ) = FT-1{c(|E| - 〈|E|〉)×exp(iα)} with χ = {α}, the set of phases of |ρ| and c = scaling constant; (iii) mρ = mask, being either 0 or 1; sρ is 1 or -1 depending on whether ρ(Φ) is positive or negative.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.