The efficiency of the calculation of Green＇s function （GF） for nano-devices is very important because the calculation is often needed to be repeated countlessly. We present a set of efficient algorithms for the num...The efficiency of the calculation of Green＇s function （GF） for nano-devices is very important because the calculation is often needed to be repeated countlessly. We present a set of efficient algorithms for the numerical calculation of GF for devices with arbitrary shapes and multi-terminal configurations. These algorithms can be used to calculate the specified blocks related to the transmission, the diagonals needed by the local density of states calculation, and the full matrix of GF, to meet different calculation levels. In addition, the algorithms for the non-equilibrium occupation and current flow are also given. All these algorithms are described using the basic theory of GF, based on a new partition strategy of the computational area. We apply these algorithms to the tight-binding graphene lattice to manifest their stability and efficiency. We also discuss the physics of the calculation results.展开更多
In this paper we consider the Cauchy problem for the singular semilinear parabolic equation u t-Δu+V 1(x)u=V 2(x)u p,x∈R n\{0},t>0, where V 1(x),V 2(x) may have singularities at the origin. Using functions...In this paper we consider the Cauchy problem for the singular semilinear parabolic equation u t-Δu+V 1(x)u=V 2(x)u p,x∈R n\{0},t>0, where V 1(x),V 2(x) may have singularities at the origin. Using functions of the Kato class and the Green tight functions we got the existence of the positive solution being singular at the origin.展开更多
基金Project supported by the National Natural Science Foundation of China (Grant Nos.10904040 and 10974058)
文摘The efficiency of the calculation of Green＇s function （GF） for nano-devices is very important because the calculation is often needed to be repeated countlessly. We present a set of efficient algorithms for the numerical calculation of GF for devices with arbitrary shapes and multi-terminal configurations. These algorithms can be used to calculate the specified blocks related to the transmission, the diagonals needed by the local density of states calculation, and the full matrix of GF, to meet different calculation levels. In addition, the algorithms for the non-equilibrium occupation and current flow are also given. All these algorithms are described using the basic theory of GF, based on a new partition strategy of the computational area. We apply these algorithms to the tight-binding graphene lattice to manifest their stability and efficiency. We also discuss the physics of the calculation results.
文摘In this paper we consider the Cauchy problem for the singular semilinear parabolic equation u t-Δu+V 1(x)u=V 2(x)u p,x∈R n\{0},t>0, where V 1(x),V 2(x) may have singularities at the origin. Using functions of the Kato class and the Green tight functions we got the existence of the positive solution being singular at the origin.
基金supported by the National Natural Science Foundation of China (10874052)Foundation for the Author of National Excellent Doctoral Dissertation of China (200726)+2 种基金Natural Science Foundation of Jiangsu Province,China (BK2010499)Natural Science Fund for Collegesand Universities in Jiangsu Province,China (11KJB140012)General Program of Yancheng Institute of Technology,China (XKY2011014)~~
基金supported by the National Natural Science Foundation of China(10874052)Foundation for the Author of National Excellent Doctoral Dissertation of China(200726)~~
