Search results for "nonlinear"
showing 10 items of 3684 documents
When is the Haar measure a Pietsch measure for nonlinear mappings?
2012
We show that, as in the linear case, the normalized Haar measure on a compact topological group $G$ is a Pietsch measure for nonlinear summing mappings on closed translation invariant subspaces of $C(G)$. This answers a question posed to the authors by J. Diestel. We also show that our result applies to several well-studied classes of nonlinear summing mappings. In the final section some problems are proposed.
Random analysis of geometrically non-linear FE modelled structures under seismic actions
1990
Abstract In the framework of the finite element (FE) method, by using the “total Lagrangian approach”, the stochastic analysis of geometrically non-linear structures subjected to seismic inputs is performed. For this purpose the equations of motion are written with the non-linear contribution in an explicit representation, as pseudo-forces, and with the ground motion modelled as a filtered non-stationary white noise Gaussian process, using a Tajimi-Kanai-like filter. Then equations for the moments of the response are obtained by extending the classical Ito's rule to vectors of random processes. The equations of motion, and the equations for moments, obtained here, show a perfect formal simi…
QUASI *-ALGEBRAS OF OPERATORS AND THEIR APPLICATIONS
1995
The main facts of the theory of quasi*-algebras of operators acting in a rigged Hilbert space are reviewed. The particular case where the rigged Hilbert space is generated by a self-adjoint operator in Hilbert space is examined in more details. A series of applications to quantum theories are discussed.
A homotopy fixed point theorem in 0-complete partial metric space
2015
We generalize a result of Feng and Liu, on multi-valued contractive mappings, for studying the relationship between fixed point sets and homotopy fixed point sets. The presented results are discussed in the generalized setting of 0-complete partial metric spaces. An example and a nonlinear alternative of Leray-Schauder type are given to support our theorems.
The pianigiani-yorke measure for topological markov chains
1997
We prove the existence of a Pianigiani-Yorke measure for a Markovian factor of a topological Markov chain. This measure induces a Gibbs measure in the limit set. The proof uses the contraction properties of the Ruelle-Perron-Frobenius operator.
Fixed point results on metric and partial metric spaces via simulation functions
2015
We prove existence and uniqueness of fixed point, by using a simulation function and a lower semi-continuous function in the setting of metric space. As consequences of this study, we deduce several related fixed point results, in metric and partial metric spaces. An example is given to support the new theory.
Summability and estimates for polynomials and multilinear mappings
2008
Abstract In this paper we extend and generalize several known estimates for homogeneous polynomials and multilinear mappings on Banach spaces. Applying the theory of absolutely summing nonlinear mappings, we prove that estimates which are known for mappings on l p spaces in fact hold true for mappings on arbitrary Banach spaces.
Language Recognition Power and Succinctness of Affine Automata
2016
In this work we study a non-linear generalization based on affine transformations of probabilistic and quantum automata proposed recently by Diaz-Caro and Yakaryilmaz [6] referred as affine automata. First, we present efficient simulations of probabilistic and quantum automata by means of affine automata which allows us to characterize the class of exclusive stochastic languages. Then, we initiate a study on the succintness of affine automata. In particular, we show that an infinite family of unary regular languages can be recognized by 2-state affine automata, whereas the number of states of any quantum and probabilistic automata cannot be bounded. Finally, we present the characterization …
Quantum Pushdown Automata
2000
Quantum finite automata, as well as quantum pushdown automata were first introduced by C. Moore, J. P. Crutchfield [13]. In this paper we introduce the notion of quantum pushdown automata (QPA) in a non-equivalent way, including unitarity criteria, by using the definition of quantum finite automata of [11]. It is established that the unitarity criteria of QPA are not equivalent to the corresponding unitarity criteria of quantum Turing machines [4]. We show that QPA can recognize every regular language. Finally we present some simple languages recognized by QPA, two of them are not recognizable by deterministic pushdown automata and one seems to be not recognizable by probabilistic pushdown …
One Alternation Can Be More Powerful Than Randomization in Small and Fast Two-Way Finite Automata
2013
We show a family of languages that can be recognized by a family of linear-size alternating one-way finite automata with one alternation but cannot be recognized by any family of polynomial-size bounded-error two-way probabilistic finite automata with the expected runtime bounded by a polynomial. In terms of finite automata complexity theory this means that neither 1Σ2 nor 1Π2 is contained in 2P2.