نتایج جستجو برای: recursion method

تعداد نتایج: 1648570  

Journal: :journal of sciences islamic republic of iran 0

in this paper, using the tight-binding model, we extend the real-space renormalization group method to time-dependent hamiltonians. we drive the time-dependent recursion relations for the renormalized tight-binding hamiltonian by decimating selective sites of lattice iteratively. the formalism is then used for the calculation of the local density of electronic states for a one dimensional quant...

2007
S. D. Cohen H. Niederreiter I. E. Shparlinski M. Zieve

We present a method of bounding incomplete character sums for finite abelian groups with arguments produced by a first-order recursion. This method is particularly effective if the recursion involves a special type of permutation called an R-orthomorphism. Examples of Rorthomorphisms are given.

2003
Kamal Krishna Saha Indra Dasgupta

We present here an efficient method which systematically reduces the rank of the augmented space and thereby helps to implement augmented space recursion for any real calculation. Our method is based on the symmetry of the Hamiltonian in the augmented space and keeping recursion basis vectors in the irreducible subspace of the Hilbert space. PACS numbers: 71.20,71.20c

Journal: :IFAC-PapersOnLine 2021

We propose an efficient algorithm for the optimal control problems (OCPs) of nonlinear switched systems that optimizes input and switching instants simultaneously a given sequence. consider as optimization variables formulate OCP based on direct multiple shooting method. derive linear equation to be solved in Newton’s method Riccati recursion solve efficiently. The computational time proposed s...

Journal: :Acta Mathematica Sinica, English Series 2006

Journal: :ACM Transactions on Computational Logic 2009

Journal: :Frontiers in Psychology 2014

Journal: :Journal of High Energy Physics 2023

A bstract We examine the BCFW recursion relations for celestial amplitudes and how they inform bootstrap program. start by recasting incarnation of shift as a generalization action familiar asymptotic symmetries on hard particles, before focusing two limits: z → ∞ 0. then discuss CFT data encodes large- behavior determining which shifts are allowed, while infinitesimal limit is tied to program ...

2002
YI OUYANG

Let Uz be the universal norm distribution and M a fixed power of prime p, by using the double complex method employed by Anderson, we study the universal Kolyvagin recursion occurred in the canonical basis in the cohomology group H(Gz ,Uz/MUz). We furthermore show that the universal Kolyvagin recursion implies the Kolyvagin recursion in the theory of Euler systems. One certainly hopes this coul...

Journal: :Annals of Pure and Applied Logic 2014

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید