共查询到20条相似文献,搜索用时 0 毫秒
1.
2.
Theoretical and Mathematical Physics - We consider three one-dimensional superconducting structures: 1) the one with $$p$$ -wave superconductivity; 2) the main experimental model of a nanowire with... 相似文献
3.
Theoretical and Mathematical Physics - Using the Bogoliubov–de Gennes Hamiltonian, we analytically study two models with superconducting order, the p-wave model with an impurity potential and... 相似文献
4.
5.
Anikin A. Yu. Dobrokhotov S. Yu. Tsvetkova A. V. 《Theoretical and Mathematical Physics》2020,204(2):984-992
Theoretical and Mathematical Physics - We consider the one-dimensional Schrödinger operator with a semiclassical small parameter $$h$$ . We show that the “global” asymptotic form... 相似文献
6.
Computing stock price comovements with a three-regime panel smooth transition error correction model
Jawadi Fredj Chlibi Souhir Cheffou Abdoulkarim Idi 《Annals of Operations Research》2019,274(1-2):331-345
Annals of Operations Research - This paper studies the hypothesis of stock price comovements toward the US market for a large sample of developed and emerging stock markets (G6, BRICS, and MENA)... 相似文献
7.
Lattice dynamics of a Sierpinski triangle submitted to different levels of disorder was studied via atomistic Green’s functions. It was found that there is a critical level of disorder that separates two regions of thermal transport. The first is characterized by a fast destruction of fracton states and the formation of spatially extended phonon states. The second region is characterized by a transition from extended to localized phonon states as predicted by the Anderson model. 相似文献
8.
9.
10.
LetA generate a strongly continuous contraction semigroup {T(t)} on a Hilbert space and letL be a bounded operator. IfL(ζI−A)−1 is compact, then the Cesàro limit of ‖LT(t)f‖2 (ast→∞) is computed for all vectorsf. This limit is interpreted in terms of bound and scattered states in the context of quantum mechanical and classical wave
propagation problems.
Partially supported by a NSF grant. 相似文献
11.
谷峰 《数学的实践与认识》2010,40(20)
提出了一个仅使用基本运算加、减和移位计算切比雪夫多项式的坐标旋转算法,证明了收敛性,讨论了误差估计.算法编码占用空间很小,适合在微计算系统中使用. 相似文献
12.
13.
George K. Eleftherakis Evgenios T.A. Kakariadis Elias G. Katsoulis 《Israel Journal of Mathematics》2017,222(2):949-972
We revisit a central result of Muhly and Solel on operator algebras of C*-correspondences. We prove that (possibly non-injective) strongly Morita equivalent C*-correspondences have strongly Morita equivalent relative Cuntz–Pimsner C*-algebras. The same holds for strong Morita equivalence (in the sense of Blecher, Muhly and Paulsen) and strong Δ-equivalence (in the sense of Eleftherakis) for the related tensor algebras. In particular, we obtain stable isomorphism of the operator algebras when the equivalence is given by a σ-TRO. As an application we show that strong Morita equivalence coincides with strong Δ-equivalence for tensor algebras of aperiodic C*-correspondences. 相似文献
14.
Abstract Programming environments such as S and Lisp-Stat have languages for performing computations, data storage mechanisms, and a graphical interface. These languages provide an interactive interface to data analysis that is invaluable. To take full advantage of these programming environments, statisticians must understand the differences between them. Ihaka and Gentleman introduced R, a version of S which uses a different scoping regimen. In some ways this makes R behave more like Lisp-Stat. This article discusses the concept of scoping rules and shows how lexical scope can enhance the functionality of a language. 相似文献
15.
The 2-rank of any 2-(28,4,1) design (unital on 28 points) is known to be between 19 and 27. It is shown by the enumeration and analysis of certain binary linear codes that there are no unitals of 2-rank 20, and that there are exactly 4 isomorphism classes of unitals of 2-rank 21. Combined with previous results, this completes the classification of unitals on 28 points of 2-rank less than 22. 相似文献
16.
Thomas Shermer 《Computational Geometry》1991,1(2)
Shermer, T., Computing bushy and thin triangulations, Computational Geometry: Theory and Applications 1 (1991) 115–125. Given a triangulation of a simple polygon P, let t2 be the number of leaves in the dual tree of the triangulation. Also, define tmax(P) and tmin(P) as the maximum and minimum values of t2 over all triangulations of P. We present an O(n) time, O(n) space algorithm for finding a triangulation with t2 = tmax(P), assuming that we are given any triangulation of P. We also show a triangulation with t2 = tmin(P) can be found in O(n3) time, using O(n2) space. 相似文献
17.
18.
Achim Kehrein 《Journal of Pure and Applied Algebra》2006,205(2):279-295
This paper presents several algorithms that compute border bases of a zero-dimensional ideal. The first relates to the FGLM algorithm as it uses a linear basis transformation. In particular, it is able to compute border bases that do not contain a reduced Gröbner basis. The second algorithm is based on a generic algorithm by Bernard Mourrain originally designed for computing an ideal basis that need not be a border basis. Our fully detailed algorithm computes a border basis of a zero-dimensional ideal from a given set of generators. To obtain concrete instructions we appeal to a degree-compatible term ordering σ and hence compute a border basis that contains the reduced σ-Gröbner basis. We show an example in which this computation actually has advantages over Buchberger's algorithm. Moreover, we formulate and prove two optimizations of the Border Basis Algorithm which reduce the dimensions of the linear algebra subproblems. 相似文献
19.
Hadrien Montanelli 《Regular and Chaotic Dynamics》2016,21(5):522-530
An algorithm is presented for numerical computation of choreographies in spaces of constant negative curvature in a hyperbolic cotangent potential, extending the ideas given in a companion paper [14] for computing choreographies in the plane in a Newtonian potential and on a sphere in a cotangent potential. Following an idea of Diacu, Pérez-Chavela and Reyes Victoria [9], we apply stereographic projection and study the problem in the Poincaré disk. Using approximation by trigonometric polynomials and optimization methods with exact gradient and exact Hessian matrix, we find new choreographies, hyperbolic analogues of the ones presented in [14]. The algorithm proceeds in two phases: first BFGS quasi-Newton iteration to get close to a solution, then Newton iteration for high accuracy. 相似文献
20.
We use projected Delaunay tetrahedra and a maximum independent set approach to compute large subsets of convex quadrangulations on a given set of points in the plane. The new method improves over the popular pairing method based on triangulating the point set. 相似文献