نتایج جستجو برای: infiltration finite difference
تعداد نتایج: 707351 فیلتر نتایج به سال:
A function on a discrete group is weakly combable if its discrete derivative with respect to a combing can be calculated by a finite state automaton. A weakly combable function is bicombable if it is Lipschitz in both the left and right invariant word metrics. Examples of bicombable functions on word-hyperbolic groups include (1) homomorphisms to Z (2) word length with respect to a finite gener...
A function on a discrete group is weakly combable if its discrete derivative with respect to a combing can be calculated by a finite-state automaton. A weakly combable function is bicombable if it is Lipschitz in both the leftand right-invariant word metrics. Examples of bicombable functions on word-hyperbolic groups include: (1) homomorphisms to Z; (2) word length with respect to a finite gene...
Exact finite-difference scheme and nonstandard finite-difference scheme for coupled Burgers equation
A sound synthesis algorithm which simulates and extends the behaviour of the acoustic prepared piano is presented. The algorithm is based on a finite difference approximation to multiple stiff string vibration, including an excitation method (a hammer) as well as several connected preparation elements, modeled as lumped nonlinearities. Numerical issues and implementation details are discussed, ...
Article history: Received 22 August 2012 Received in revised form 14 May 2013 Accepted 22 July 2013 Available online xxxx
Analysis `1-recovery refers to a technique of recovering a signal that is sparse in some transform domain from incomplete corrupted measurements. This includes total variation minimization as an important special case when the transform domain is generated by a difference operator. In the present paper we provide a bound on the number of Gaussian measurements required for successful recovery fo...
In [Ergodic Theory Dynam. System, 16 (1996) 663–682], S. Ferenczi proved that any minimal subshift with first difference of complexity bounded by 2 is S-adic with Card(S) ≤ 327. In this paper, we improve this result by giving an S-adic charaterization of these subshifts with a set S of 5 morphisms, solving by this way the S-adic conjecture for this particular case.
Article history: Received 30 March 2013 Received in revised form 21 July 2013 Accepted 5 February 2014 Available online 14 February 2014
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید