نتایج جستجو برای: bilinear mappings

تعداد نتایج: 29936  

Journal: :Applied Mathematics and Computation 2012
Wen-Xiu Ma Yi Zhang Yaning Tang Junyi Tu

We explore when Hirota bilinear equations possess linear subspaces of solutions. First, we establish a sufficient and necessary criterion for the existence of linear subspaces of exponential traveling wave solutions to Hirota bilinear equations. Second, we show that multivariate polynomials whose zeros form a vector space can generate the desired Hirota bilinear equations with given linear subs...

Journal: :AIP Advances 2023

This study presents fundamental theorems, lemmas, and mapping definitions. There are three types of mappings: binary operators, compatible mappings, sequentially continuous mappings. The symbols used to represent fuzzy metric spaces intuitive. Icons were also prescribe a shared, linked fixed point in intuitionistic space for two mappings that satisfy ?-contractive conditions. To accomplish this...

Journal: :bulletin of the iranian mathematical society 0
husain piri department of mathematics, bonab higher education complex hamid vaezi faculty of mathematical sciences university of tabriz, tabriz, iran

begin{abstract} in this paper, we introduce an iterative method for amenable semigroup of non expansive mappings and infinite family of non expansive mappings in the frame work of hilbert spaces. we prove the strong convergence of the proposed iterative algorithm to the unique solution of a variational inequality, which is the optimality condition for a minimization problem. the results present...

Journal: :bulletin of the iranian mathematical society 0
a. farajzadeh department of mathematics‎, ‎razi‎ ‎university‎, ‎kermanshah‎, ‎67149‎, ‎iran. a. kaewcharoen department of mathematics‎, ‎faculty of science‎, ‎naresuan university‎, ‎phitsanulok 65000‎, ‎thailand. s. plubtieng department of mathematics‎, ‎faculty of science‎, ‎naresuan university‎, ‎phitsanulok 65000‎, ‎thailand.

‎we prove the existence of ppf dependent coincidence points for a pair of single-valued and multi-valued mappings satisfying generalized contractive conditions in banach spaces‎. ‎furthermore, the ppf dependent fixed point and ppf dependent common fixed point theorems for multi-valued mappings are proved.

2015
Minh Q. Phan Francesco Vicario Richard W. Longman Raimondo Betti

When excited by an input consisting of a number of discrete levels, a bilinear system becomes a linear time-varying system whose dynamics switches from one linear subsystem to another depending on the input level. This paper describes an identification method that uses the concept of a superstate of a linear switching system as a superstate of the bilinear system. In a superspace method, these ...

2003
Guizhi Liu Ping Li

A new generalized predictive control algorithm for a kind of input-output bilinear system is proposed in the paper (BGPC). The algorithm combines bilinear and linear terms of I/O bilinear system, and constitutes an ARIMA model analogous to linear systems. Using optimization predictive information fully, the algorithm carries out multi-step predictions by recursive approximation. The heavy compu...

2005

We transfer the lower semi-continuity of Siegel disks with fixed Brjuno type rotation numbers to geometric limits. Here, we restrict to Lavaurs maps associated to quadratic polynomials with a parabolic fixed point.

2003
STEPHEN W. SEMMES MARIUS DABIJA

In this paper we consider diffeomorphisms of C? of the special form F(z, W) = (w, --z + ~G(w)). For such maps the origin is a parabolic fixed point. Under certain hypotheses on G we prove the existence of a domain R c @ with 0 E aR and of invariant complex cnrves 20 = f(t) and zv = g(z), z E R, for F-l and F, such that Fhn(z,f(z)) t 0 and F”(z,g(z)) + 0 as n + co.

Journal: :Transactions of the American Mathematical Society 1979

2007
Young Whan Lee Byung Mun Choi A. Saxena B. Soh

In this paper, we propose a new blind group identification protocol and a hidden group signature protocol as its application. These protocols involve many provers and one verifier such that (1) the statement of all the provers are proved simultaneously, (2) and also all the provers using computationally limited devices (e.g. smart cards) have no need of computing the bilinear pairings, (3) but ...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید