Related papers: On the quasi-arithmetic Gauss-type iteration

For a family of quasi-arithmetic means satisfying certain smoothness condition we majorize the speed of convergence of the iterative sequence of self-mappings having a mean on each entry, described in the definition of Gaussian product, to…

Family of quasi-arithmetic means has a natural, partial order (point-wise order) $A^{[f]}\le A^{[g]}$ if and only if $A^{[f]}(v)\le A^{[g]}(v)$ for all admissible vectors $v$ ($f,\,g$ and, later, $h$ are continuous and monotone and defined…

We prove that whenever $M_1,\dots,M_n\colon I^k \to I$, ($n,k \in \mathbb{N}$) are symmetric, continuous means on the interval $I$ and $S_1,\dots,S_m\colon I^k \to I$ ($m <n$) satisfies a sort of embeddability assumptions then for every…

Classical result states that for two continuous and strict means $M,\,N \colon I^2 \to I$ ($I$ is an interval) there exists a unique $(M,N)$-invariant mean $K \colon I^2 \to I$, i.e. such a mean that $K \circ (M,N)=K$ and, moreover, the…

In this paper we characterize generalized quasi-arithmetic means, that is means of the form $M(x_1,...,x_n):=(f_1+...+f_n)^{-1}(f_1(x_1)+...+f_n(x_n))$, where $f_1,...,f_n:I\to\mathbb{R}$ are strictly increasing and continuous functions.…

We describe Gauss-type maps as geometric realizations of certain codes in the monoid of nonnegative matrices in the extended modular group. Each such code, together with an appropriate choice of unimodular intervals in P^1R, determines a…

We define so-called residual means, which have a Taylor expansion of the form $M(x)=\bar x +\tfrac12 \xi_M(\bar x) \text{Var}(x)+o(\|x-\bar x\|^\alpha)$ for some $\alpha>2$ and a single-variable function $\xi_M$ ($\bar x$ stands for the…

We deal with monotonic regression of multivariate functions $f: Q \to \mathbb{R}$ on a compact rectangular domain $Q$ in $\mathbb{R}^d$, where monotonicity is understood in a generalized sense: as isotonicity in some coordinate directions…

Let $I\subset (0,\infty )$ be an interval that is closed with respect to the multiplication. The operations $C_{f,g}\colon I^{2}\rightarrow I$ of the form \begin{equation*} C_{f,g}\left( x,y\right) =\left( f\circ g\right) ^{-1}\left(…

For a family of continuous functions $f_1,f_2,\dots \colon I \to \mathbb{R}$ ($I$ is a fixed interval) with $f_1\le f_2\le \dots$ define a set $$ I_f:=\big\{x \in I \colon \lim_{n \to \infty} f_n(x)=+\infty\big\}.$$ We study the properties…

Let $X$ be a symmetric, isotropic random vector in $\mathbb{R}^m$ and let $X_1...,X_n$ be independent copies of $X$. We show that under mild assumptions on $\|X\|_2$ (a suitable thin-shell bound) and on the tail-decay of the marginals…

This note presents an approach to studying the iterates of a mapping whose restriction to the complement of a finite set is continuous and open. The main examples to which the approach can be applied are piecewise monotone mappings defined…

The covariance function of a Gauss-Markov process evaluated at points $(s,t)$ admits a representation as a product of a function of $\min(s,t)$ and a function of $\max(s,t)$. We call these functions the covariance factors of a Gauss-Markov…

Let $n$ and $k$ be nonnegative integers such that $1\le k\le n+1$. The convex cone $\mathcal{F}_+^{k:n}$ of all functions $f$ on an arbitrary interval $I\subseteq\mathbb{R}$ whose derivatives $f^{(j)}$ of orders $j=k-1,\dots,n$ are…

The theory of quasi-arithmetic means is a powerful tool in the study of covariance functions across space-time. In the present study we use quasi-arithmetic functionals to make inferences about the permissibility of averages of functions…

We prove that whenever the selfmapping $(M_1,\dots,M_p)\colon I^p \to I^p$, ($p \in \mathbb{N}$ and $M_i$-s are $p$-variable means on the interval $I$) is invariant with respect to some continuous and strictly monotone mean $K \colon I^p…

Quasi-Newton methods form an important class of methods for solving nonlinear optimization problems. In such methods, first order information is used to approximate the second derivative. The aim is to mimic the fast convergence that can be…

Iteration of randomly chosen quadratic maps defines a Markov process: X_{n+1}=\epsilon_{n+1}X_n(1-X_n), where \epsilon_n are i.i.d. with values in the parameter space [0,4] of quadratic maps F_{\theta}(x)=\theta x(1-x). Its study is of…

We provide in a unified way quantitative forms of strong convergence results for numerous iterative procedures which satisfy a general type of Fejer monotonicity where the convergence uses the compactness of the underlying set. These…

We study Boolean functions of an arbitrary number of input variables that can be realized by simple iterative constructions based on constant-size primitives. This restricted type of construction needs little global coordination or control…