arXiv subjects

Hui Huang

Publications and source records attributed to Hui Huang.

240 records · Page 14Linked to original sources

arXiv2017

Sunspots rotation and magnetic transients associated with flares in NOAA AR 11429

We analyze sunspots rotation and magnetic transients in NOAA AR 11429 during two X-class (X5.4 and X1.3) flares using the data from the Helioseismic and Magnetic Imager on board the \emph{Solar Dynamics Observatory}. A large leading sunspot with positive magnetic polarity rotated counterclockwise. As expected, the rotation was significantly affected by the two flares. The magnetic transients induced by the flares were clearly evident in the sunspots with negative polarity. They were moving across the sunspots with speed of order $3-7\ \rm km \ s^{-1}$. Furthermore, the trend of magnetic flux evolution of these sunspots exhibited changes associated with the flares. These results may shed light on the understanding of the evolution of sunspots.

astro-ph.SR↗

arXiv2017

Ultimate Positivity of Diagonals of Quasi-rational Functions

The problem to decide whether a given multivariate (quasi-)rational function has only positive coefficients in its power series expansion has a long history. It dates back to Szego in 1933 who showed certain quasi-rational function to be positive, in the sense that all the series coefficients are positive, using an involved theory of special functions. In contrast to the simplicity of the statement, the method was surprisingly difficult. This dependency motivated further research for positivity of (quasi-)rational functions. More and more (quasi-)rational functions have been proven to be positive, and some of the proofs are even quite simple. However, there are also others whose positivity are still open conjectures. In this talk, we focus on a less difficult but also interesting question to decide whether the diagonal of a given quasi-rational function is ultimately positive, especially for the one conjectured to be positive by Kauers in 2007. To solve this question, it suffices to compute the asymptotics of the diagonal coefficients, which can be done by the multivariate singularity analysis developed by Baryshnikov, Pemantle and Wilson. Note that the ultimate positivity is a necessary condition for the positivity, and therefore can be used to either exclude the nonpositive cases or further support the conjectural positivity.

cs.SC↗

arXiv2016

New Bounds for Hypergeometric Creative Telescoping

Based on a modified version of Abramov-Petkovšek reduction, a new algorithm to compute minimal telescopers for bivariate hypergeometric terms was developed last year. We investigate further in this paper and present a new argument for the termination of this algorithm, which provides an independent proof of the existence of telescopers and even enables us to derive lower as well as upper bounds for the order of telescopers for hypergeometric terms. Compared to the known bounds in the literature, our bounds are sometimes better, and never worse than the known ones.

cs.SC↗

arXiv2015

A Modified Abramov-Petkovsek Reduction and Creative Telescoping for Hypergeometric Terms

The Abramov-Petkovsek reduction computes an additive decomposition of a hypergeometric term, which extends the functionality of the Gosper algorithm for indefinite hypergeometric summation. We modify the Abramov-Petkovsek reduction so as to decompose a hypergeometric term as the sum of a summable term and a non-summable one. The outputs of the Abramov-Petkovsek reduction and our modified version share the same required properties. The modified reduction does not solve any auxiliary linear difference equation explicitly. It is also more efficient than the original reduction according to computational experiments. Based on this reduction, we design a new algorithm to compute minimal telescopers for bivariate hypergeometric terms. The new algorithm can avoid the costly computation of certificates.

cs.SC↗

arXiv2014

Establishment of correlated states in a quantum dot interacting with an acoustic phonon reservoir

We investigate the effects of a low frequency (acoustic) phonon bath on the dynamics of a quantum dot modelled as a cascade three-level system. We show that the phonon bath appears to the upper transition of the cascade system as a broadband reservoir of inverted rather than conventional harmonic oscillators. The action of the annihilation and creation operators of the inverted oscillator are interchanges relative to those of the usual harmonic oscillator that it serves as a linear amplifier to the system, and thereby gives rise to unusual features in the dynamics of the quantum dot. We find that the phonon bath, although being in a thermal state, affects the quantum dot as a correlated-type reservoir which results in the decay of the system to a correlated two-photon state with the population distribution no longer obeying a Boltzmann distribution. It is particularly interesting that even for a zero temperature phonon reservoir the steady state is a correlated state which under appropriate conditions on the Rabi frequencies and the damping rates can reduce to a strongly correlated pure state. It is shown that the two-photon correlations result in a significant squeezing and strong two-photon correlations in the radiation field emitted by the quantum dot. The presence of the correlations in the system is manifest in the presence of quantum beats in the time evolution of the populations and the radiation intensity. The effect of the ordinary spontaneous emission on the features induced by the phonon bath is also discussed.

quant-ph↗

arXiv2013

Faster gradient descent and the efficient recovery of images

Much recent attention has been devoted to gradient descent algorithms where the steepest descent step size is replaced by a similar one from a previous iteration or gets updated only once every second step, thus forming a {\em faster gradient descent method}. For unconstrained convex quadratic optimization these methods can converge much faster than steepest descent. But the context of interest here is application to certain ill-posed inverse problems, where the steepest descent method is known to have a smoothing, regularizing effect, and where a strict optimization solution is not necessary. Specifically, in this paper we examine the effect of replacing steepest descent by a faster gradient descent algorithm in the practical context of image deblurring and denoising tasks. We also propose several highly efficient schemes for carrying out these tasks independently of the step size selection, as well as a scheme for the case where both blur and significant noise are present. In the above context there are situations where many steepest descent steps are required, thus building slowness into the solution procedure. Our general conclusion regarding gradient descent methods is that in such cases the faster gradient descent methods offer substantial advantages. In other situations where no such slowness buildup arises the steepest descent method can still be very effective.

cs.CV↗