نتایج جستجو برای: double exponential transformation

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

Journal: :iranian journal of science and technology (sciences) 2008
v. asil

in this paper the concept of homothetic dual exponential motions in d3 is discussed and theirvelocities obtained. due to the way in which the matter is presented, the paper gives some formula and factsabout dual exponential motions which are not generally known

Journal: :Algorithms 2012
Joachim Wuttke

The C library libkww provides functions to compute the Kohlrausch–Williams– Watts function, i.e., the Laplace–Fourier transform of the stretched (or compressed) exponential function exp(−t) for exponents β between 0.1 and 1.9 with double precision. Analytic error bounds are derived for the low and high frequency series expansions. For intermediate frequencies, the numeric integration is enormou...

Journal: :Japanese Journal of Biometrics 1983

1992
Giovanni Faglia Paul Young Alberto Bertoni Pierangelo Miglioli

‎In this paper‎, ‎the numerical solutions of linear and nonlinear Volterra integral‎ ‎equations with nonvanishing delay are considered by two methods‎. ‎The methods are developed by means of‎ ‎the sinc approximation with the single exponential (SE) and double exponential (DE)‎ ‎transformations‎. ‎The existence and uniqueness of sinc-collocation solutions for these equations are provided‎. ‎Thes...

2005
Carl E. Mungan

S imple LR and RC circuits are familiar to generations of physics students as examples of single-exponential growth and decay in the relevant voltages, currents, and charges. An element of novelty can be introduced by connecting two (instead of one) LR coils in parallel with a battery. The resulting circuit can still be treated using little more than the basic tools (Kirchhoff ’s rules plus a t...

2007
Deepak Kapur

A new algorithm for computing a complete set of uniiers for two terms involving associative-commutative function symbols is presented. The algorithm is based on a non-deterministic algorithm given by the authors in 1986 to show the NP-completeness of associative-commutative uniiability. The algorithm is easy to understand, its termination can be easily established. More importantly, its complex...

Journal: :Math. Oper. Res. 1986
David E. Bell

Your use of the JSTOR archive indicates your acceptance of JSTOR's Terms and Conditions of Use, available at http://www.jstor.org/about/terms.html. JSTOR's Terms and Conditions of Use provides, in part, that unless you have obtained prior permission, you may not download an entire issue of a journal or multiple copies of articles, and you may use content in the JSTOR archive only for your perso...

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

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