Related papers: Domains via approximation operators
In this article, we give a sequence of operators for producing an approximation result. The relation between the rate of approximation of sequence operators including Dunkl variant of exponential function with first and second-order modulus…
Operator learning has been highly successful for continuous mappings between infinite-dimensional spaces, such as PDE solution operators. However, many operators of interest-including differential operators-are discontinuous or set-valued,…
Given a set of matrices, modeled as samples of a matrix-valued function, we suggest a method to approximate the underline function using a product approximation operator. This operator extends known approximation methods by exploiting the…
We develop the theory of continuous and algebraic domains in constructive and predicative univalent foundations, building upon our earlier work on basic domain theory in this setting. That we work predicatively means that we do not assume…
A Cech closure space $(X,u)$ is a set $X$ with a (Cech) closure operator $u$ which need not be idempotent. Many properties which hold in topological spaces hold in Cech closure spaces as well. The notions of proper (splitting) and…
Domain theory has a long history of applications in theoretical computer science and mathematics. In this article, we explore the relation of domain theory to probability theory and stochastic processes. The goal is to establish a theory in…
In this work, we Extend Pawlak approximation spaces by topological spaces. Also, Rough Membership, equality and inclusion relations are extended using topological near open sets. In addition, new extended measures of accuracy and quality of…
We develop domain theory in constructive univalent foundations without Voevodsky's resizing axioms. In previous work in this direction, we constructed the Scott model of PCF and proved its computational adequacy, based on directed complete…
Recently, in order to broad the application and theoretical areas of rough sets and matroids, some authors have combined them from many different viewpoints, such as circuits, rank function, spanning sets and so on. In this paper, we…
We examine collective properties of closure operators on posets that are at least dcpos. The first theorem sets the tone of the paper: it tells how a set of preclosure maps on a dcpo determines the least closure operator above it, and…
It is well-known that in the logic of quantum mechanics disjunctions and conjunctions can be represented by joins and meets, respectively, in an orthomodular lattice provided their entries commute. This was the reason why J. Pykacz…
Algebraic operations are understood as topologiztion of algebra. They become an example of simplest convergence space. In our article the convergence is a arbitrary multivalued appointment. The continuity of some mapping between two…
Extending the notion of parallelism we introduce the concept of approximate parallelism in normed spaces and then substantially restrict ourselves to the setting of Hilbert space operators endowed with the operator norm. We present several…
In this paper, we study some properties of the closure operator in the Mac\'ias topology on infinite integral domains. Moreover, under certain conditions, we present topological proofs of the infiniteness of maximal ideals and…
This article introduces and studies the tight approximation property, a property of algebraic varieties defined over the function field of a complex or real curve that refines the weak approximation property (and the known cohomological…
While it is widely known that neural networks are universal approximators of continuous functions, a less known and perhaps more powerful result is that a neural network with a single hidden layer can approximate accurately any nonlinear…
In this paper, concepts of (topological) FS-approximation spaces are introduced. Representations of FS-domains and BF-domains via (topological) FS-approximation spaces are considered. It is proved that the collection of CF-closed sets in an…
A generalization of Scott's information systems~\cite{sco82} is presented that captures exactly all continuous domains. The global consistency predicate in Scott's definition is relativized. Now, for every atomic statement, there is a…
We analyse parallel overlapping Schwarz domain decomposition methods for the Helmholtz equation, where the subdomain problems satisfy first-order absorbing (impedance) transmission conditions, and exchange of information between subdomains…
In analogy to the situation for continuous lattices which were introduced by Dana Scott as precisely the injective T$_0$ spaces via the (nowadays called) Scott topology, we study those metric spaces which correspond to injective T$_0$…