منابع مشابه
The Peano curve and counting occurrences of some patterns
We introduce Peano words, which are words corresponding to finite approximations of the Peano space filling curve. We then find the number of occurrences of certain patterns in these words.
متن کاملLagrangian Flows and the One Dimensional Peano Phenomenon for Odes
We consider the one dimensional ordinary differential equation with a vector field which is merely continuous and nonnegative, and satisfying a condition on the amount of zeros. Although it is classically known that this problem lacks uniqueness of classical trajectories, we show that there is uniqueness for the so-called regular Lagrangian flow (the by now usual notion of flow in nonsmooth sit...
متن کاملGROUPS FOR A FINITELY NON-n-DIMENSIONAL CURVE
Assume we are given a hyperbolic, reducible morphism W . Every student is aware that exp (E2) ∼= ` ( −1, σC,B · C ) P̄−1 (−2) ∧ · · · × c ( S−5,−O′′ )
متن کاملCache oblivious matrix multiplication using an element ordering based on the Peano curve
One of the keys to tap the full performance potential of current hardware is the optimal utilisation of cache memory. Cache oblivious algorithms are designed to inherently benefit from any underlying hierarchy of caches, but do not need to know about the exact structure of the cache. In this paper, we present a cache oblivious algorithm for matrix multiplication. The algorithm uses a block recu...
متن کاملThe Peano-baker Series
Abstract. This note reviews the Peano-Baker series and its use to solve the general linear system of ODEs. The account is elementary and self-contained, and is meant as a pedagogic introduction to this approach, which is well known but usually treated as a folklore result or as a purely formal tool. Here, a simple convergence result is given, and two examples illustrate that the series can be u...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: São Paulo Journal of Mathematical Sciences
سال: 2019
ISSN: 1982-6907,2316-9028
DOI: 10.1007/s40863-019-00132-9