Stratospheric dynamics and midlatitude jets under geoengineering with space mirrors and sulfate and titania aerosols

The impact on the dynamics of the stratosphere of three approaches to geoengineering by solar radiation management is investigated using idealized simulations of a global climate model. The approaches are geoengineering with sulfate aerosols, titania aerosols, and reduction in total solar irradiance (representing mirrors placed in space). If it were possible to use stratospheric aerosols to counterbalance the surface warming produced by a quadrupling of atmospheric carbon dioxide concentrations, tropical lower stratospheric radiative heating would drive a thermal wind response which would intensify the stratospheric polar vortices. In the Northern Hemisphere this intensification results in strong dynamical cooling of the polar stratosphere. Northern Hemisphere stratospheric sudden warming events become rare (one and two in 65 years for sulfate and titania, respectively). The intensification of the polar vortices results in a poleward shift of the tropospheric midlatitude jets in winter. The aerosol radiative heating enhances the tropical upwelling in the lower stratosphere, influencing the strength of the Brewer-Dobson circulation. In contrast, solar dimming does not produce heating of the tropical lower stratosphere, and so there is little intensification of the polar vortex and no enhanced tropical upwelling. The dynamical response to titania aerosol is qualitatively similar to the response to sulfate.

Unrestricted Skyrme-tensor time-dependent Hartree-Fock model and its application to the nuclear response from spherical to triaxial nuclei

The nuclear time-dependent Hartree-Fock model formulated in three-dimensional space, based on the full standard Skyrme energy density functional complemented with the tensor force, is presented. Full self-consistency is achieved by the model. The application to the isovector giant dipole resonance is discussed in the linear limit, ranging from spherical nuclei (16O and 120Sn) to systems displaying axial or triaxial deformation (24Mg, 28Si, 178Os, 190W and 238U). Particular attention is paid to the spin-dependent terms from the central sector of the functional, recently included together with the tensor. They turn out to be capable of producing a qualitative change on the strength distribution in this channel. The effect on the deformation properties is also discussed. The quantitative effects on the linear response are small and, overall, the giant dipole energy remains unaffected. Calculations are compared to predictions from the (quasi)-particle random-phase approximation and experimental data where available, finding good agreement

Rapid preconditioning of data for accelerating convex hull algorithms

Given a dataset of two-dimensional points in the plane with integer coordinates, the method proposed reduces a set of n points down to a set of s points s ≤ n, such that the convex hull on the set of s points is the same as the convex hull of the original set of n points. The method is O(n). It helps any convex hull algorithm run faster. The empirical analysis of a practical case shows a percentage reduction in points of over 98%, that is reflected as a faster computation with a speedup factor of at least 4.

Reply to “Comment on ‘Temperature-dependent orientational ordering on a spherical surface modeled with a lattice spin model’ ”

A reply to the comment of S. Romano, Phys. Rev. E 2015 on our previous paper is provided.

Preconditioning 2D integer data for fast convex hull computations

In order to accelerate computing the convex hull on a set of n points, a heuristic procedure is often applied to reduce the number of points to a set of s points, s ≤ n, which also contains the same hull. We present an algorithm to precondition 2D data with integer coordinates bounded by a box of size p × q before building a 2D convex hull, with three distinct advantages. First, we prove that under the condition min(p, q) ≤ n the algorithm executes in time within O(n); second, no explicit sorting of data is required; and third, the reduced set of s points forms a simple polygonal chain and thus can be directly pipelined into an O(n) time convex hull algorithm. This paper empirically evaluates and quantifies the speed up gained by preconditioning a set of points by a method based on the proposed algorithm before using common convex hull algorithms to build the final hull. A speedup factor of at least four is consistently found from experiments on various datasets when the condition min(p, q) ≤ n holds; the smaller the ratio min(p, q)/n is in the dataset, the greater the speedup factor achieved.