Results 271 to 280 of about 27,799 (321)

The Allen-Cahn equation with weakly critical random initial datum. [PDF]

open access: yesProbab Theory Relat Fields
Gabriel S, Rosati T, Zygouras N.
europepmc   +1 more source

An iterative logarithmic multiplier

Microprocessors and Microsystems, 2011
Digital signal processing algorithms often rely heavily on a large number of multiplications, which is both time and power consuming. However, there are many practical solutions to simplify multiplication, like truncated and logarithmic multipliers. These methods consume less time and power but introduce errors.
Avramović, Aleksej   +2 more
openaire   +2 more sources

Iterated Logarithm laws for weighted averages

Zeitschrift f�r Wahrscheinlichkeitstheorie und Verwandte Gebiete, 1973
It Let {if,, n > 1 } be independent, identically distributed (i.i.d.) random variables with zero means and unit variances. The Law of the Iterated Logarithm is shown to hold for sequences {an Xn} provided that the constants {an} satisfy (i) n a, 2 < C ~ a~, (ii) ~ a~ --* oo.
Chow, Y. S., Teicher, H.
openaire   +2 more sources

Iterating the Logarithmic Function

The College Mathematics Journal, 2016
SummaryWe study the discrete dynamical system that results from iterating the absolute-valued logarithmic function, with different bases.
openaire   +1 more source

ITERATED LOGARITHM SPEED OF RETURN TIMES

Bulletin of the Australian Mathematical Society, 2017
In a general setting of an ergodic dynamical system, we give a more accurate calculation of the speed of the recurrence of a point to itself (or to a fixed point). Precisely, we show that for a certain $\unicode[STIX]{x1D709}$ depending on the dimension of the space, $\liminf _{n\rightarrow +\infty }(n\log \log n)^{\unicode[STIX]{x1D709}}d(T^{n}x,x)=0$
openaire   +1 more source

Iterative methods for logarithmic subtraction

Proceedings IEEE International Conference on Application-Specific Systems, Architectures, and Processors. ASAP 2003, 2004
The logarithmic number system (LNS) offers much better performance (in terms of power, speed and area) than floating point for multiplication, division, powers and roots. Moderate-precision addition (of like signs) in LNS generally can be done with table lookup followed by interpolation, whose implementation can be as, or more, efficient than the ...
openaire   +1 more source

Iterated logarithms of entire functions

Israel Journal of Mathematics, 1978
We characterize those sequences {f n} of entire functions satisfyingf n=exp(f n+1) for alln.
openaire   +2 more sources

Laws of the iterated logarithm for iterated Wiener processes

Journal of Theoretical Probability, 1995
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hu, Y., Pierre-Loti-Viaud, D., Shi, Z.
openaire   +2 more sources

The Law of Iterated Logarithm

1994
Let the kernel Φ have the rank r = 1 and satisfy the conditions $$Eg_1^2 < \infty ,E|\Phi {|^{4/3}} < \infty $$ (9.1.1)
V. S. Koroljuk, Yu. V. Borovskich
openaire   +1 more source

Home - About - Disclaimer - Privacy