Search results for "Crete"
showing 10 items of 2495 documents
Produktintegration mit nicht-�quidistanten St�tzstellen
1980
For the numerical evaluation of $$\int\limits_a^b {(t - a)^{\alpha - 1} x(t)dt}$$ , 0<?<1 andx `smooth', product integration rules are applied. It is known that high-order rules, e.g. Gauss-Legendre quadrature, become `normal'-order rules in this case. In this paper it is shown that the high order is preserved by a nonequidistant spacing. Furthermore, the leading error terms of this product integration method and numerical examples are given.
Miscellaneous Graph Preliminaries. Part I
2021
Summary This article contains many auxiliary theorems which were missing in the Mizar Mathematical Library to the best of the author’s knowledge. Most of them regard graph theory as formalized in the GLIB series and are needed in upcoming articles.
On generalized weakly G-contraction mapping in G-metric spaces
2011
In this paper, we establish some common fixed point results for two self-mappings f and g on a generalized metric space X. To prove our results we assume that f is a generalized weakly G-contraction mapping of types A and B with respect to g.
Common fixed points in generalized metric spaces
2012
Abstract We establish some common fixed point theorems for mappings satisfying a ( ψ , φ ) -weakly contractive condition in generalized metric spaces. Presented theorems extend and generalize many existing results in the literature.
Fixed point theory for 1-set contractive and pseudocontractive mappings
2013
The purpose of this paper is to study the existence and uniqueness of fixed point for a class of nonlinear mappings defined on a real Banach space, which, among others, contains the class of separate contractive mappings, as well as to see that an important class of 1-set contractions and of pseudocontractions falls into this type of nonlinear mappings. As a particular case, we give an iterative method to approach the fixed point of a nonexpansive mapping. Later on, we establish some fixed point results of Krasnoselskii type for the sum of two nonlinear mappings where one of them is either a 1-set contraction or a pseudocontraction and the another one is completely continuous, which extend …
Cluster sets and quasiconformal mappings
2010
Certain classical results on cluster sets and boundary cluster sets of analytic functions, due to Iversen, Lindelof, Noshiro, Tsuji, Ohtsuka, Pommerenke, Carmona, Cufi and others, are extended to n-dimensional quasiconformal mappings. Unlike what is usually the case in the context of analytic functions, our considerations are not restricted to mappings of a disk or ball only. It is shown, for instance, that quasiconformal cluster sets and boundary cluster sets, taken at a non-isolated boundary point of an arbitrary domain, coincide. More refined versions are established in the special case where the domain is the open unit ball. These include cluster set considerations of the induced radial…
Stancu–Schurer–Kantorovich operators based on q-integers
2015
The goal of this paper is to introduce and study q analogue of Stancu-Schurer-Kantorovich operators. A convergence theorem using the well known Bohman-Korovkin criterion is proven and the rate of convergence involving the modulus of continuity is established. The estimate of the rate of convergence by means of the Lipshitz function is considered. Furthermore, we obtained a Voronovskaja type result for these operators. Also, we investigate the statistical approximation properties of these operators using Korovkin type statistical approximation theorem.
About Graph Complements
2020
Summary This article formalizes different variants of the complement graph in the Mizar system [3], based on the formalization of graphs in [6].
Padding and the expressive power of existential second-order logics
1998
Padding techniques are well-known from Computational Complexity Theory. Here, an analogous concept is considered in the context of existential second-order logics. Informally, a graph H is a padded version of a graph G, if H consists of an isomorphic copy of G and some isolated vertices. A set A of graphs is called weakly expressible by a formula ϕ in the presence of padding, if ϕ is able to distinguish between (sufficiently) padded versions of graphs from A and padded versions of graphs that are not in A.
Reordering Method and Hierarchies for Quantum and Classical Ordered Binary Decision Diagrams
2017
We consider Quantum OBDD model. It is restricted version of read-once Quantum Branching Programs, with respect to “width” complexity. It is known that maximal complexity gap between deterministic and quantum model is exponential. But there are few examples of such functions. We present method (called “reordering”), which allows to build Boolean function g from Boolean Function f, such that if for f we have gap between quantum and deterministic OBDD complexity for natural order of variables, then we have almost the same gap for function g, but for any order. Using it we construct the total function REQ which deterministic OBDD complexity is \(2^{\varOmega (n/log n)}\) and present quantum OBD…