نتایج جستجو برای: system of complex bilinear equations

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

Journal: :Journal of Physics A: Mathematical and General 1994

Journal: :Studies in Applied Mathematics 2021

In this paper, the Fokas-Lenells equations are investigated via bilinear approach. We bilinearize unreduced system, derive double Wronskian solutions, and then, by means of a reduction technique we obtain variety solutions reduced equations. This enables us to have full profile classical nonlocal Some obtained illustrated based on asymptotic analysis. As notable new result, equation, which rela...

Journal: :Journées équations aux dérivées partielles 1999

2003
Ülle Kotta Sven Nõmm Alan S. I. Zinober

This paper studies the realizability property of bilinear input-output (i/o) models in the classical state space form. Constraints on the parameters of the bilinear i/o model are suggested that lead to realizable models. The complete list of 2nd and 3rd order realizable inputoutput bilinear models together with the corresponding state equations is given. In the general case some subclasses of r...

Journal: :international journal of industrial mathematics 0
k. jaikumar department of mathematics, dharmapuram adhinam arts college, dharmapuram, mayiladuthurai, tamilnadu, india-609001. s. sunantha department of mathematics, vivekananda arts and science college for women, thenpathi, nsb nagar, sirkali, tamilnadu, india-609111.

the sst decomposition method for solving system of linear equations make it possible to obtain the values of roots of the system with the specified accuracy as the limit of the sequence of some vectors. in this topic we are going to consider vectors as fuzzy vectors. we have considered a numerical example and tried to find out solution vector x in fuzzified form using method of sst decomposition.

Journal: :EPL (Europhysics Letters) 2010

2012
Masayuki Abe Kristiyan Haralambiev Miyako Ohkubo

We investigate commitment schemes whose messages, keys, commitments, and decommitments are elements of bilinear groups, and whose openings are verified by pairing product equations. Such commitments facilitate efficient zero-knowledge proofs of knowledge of a correct opening. We show two lower bounds on such schemes: a commitment cannot be shorter than the message and verifying the opening in a...

Journal: :journal of membrane science and research 0
neil thomas stacey university of the witwatersrand diane hildebrandt university of south africa david glasser university of south africa mark peters university of south africa

comnode classification within membrane residue curves (m-rcms) currently hinges on lyapunov’s theorem and therefore the computation of mathematically complex eigenvalues. this paper presents an alternative criterion for the classification of nodes within m-rcms based on the total membrane flux at node compositions. this paper demonstrates that for a system exhibiting simple permeation behaviour...

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

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