Results 261 to 270 of about 11,944 (302)

Decomposition Theorems for Conditional Sign-Solvability and Sign-Solvability of General Systems

SIAM Journal on Matrix Analysis and Applications, 2000
The authors study decomposition theorems for conditional sign-solvability and sign-solvability of general systems. In Section 2 they give terminology, notation, and standing assumptions, and then, in Section 3 and 4, develop the decomposition of conditional sign-solvability and ordinary sign-solvability, respectively.
Shawn Cokus, Victor Klee
openaire   +3 more sources

Some of the next articles are maybe not open access.

Related searches:

Reachability Analysis for Solvable Dynamical Systems

IEEE Transactions on Automatic Control, 2018
The reachability problem is one of the most important issues in the verification of hybrid systems. But unfortunately the reachable sets for most of hybrid systems are not computable. In the literature, only some special families of linear vector fields are proved with decidable reachability problem, let alone nonlinear ones.
Ting Gan, Mingshuai Chen, Yangjia Li
exaly   +2 more sources

Continuum spin system as an exactly solvable dynamical system

Physics Letters, Section A: General, Atomic and Solid State Physics, 1977
The continuum limit of a one-dimensional classical spins with nearest neighbour Heisenberg interaction is shown to be an exactly solvable system and that its dynamics describable by the nonlinear Schrodinger equation.
M Lakshmanan
exaly   +2 more sources

The solvability of a system of nonlinear equations

Izvestiya Vysshikh Uchebnykh Zavedenii. Matematika, 2021
It is proved: if $\phi(\tau,\xi)$ is a scalar continuous real function of arguments $\tau\in [a_{(n-1)},\ b_{(n-1)}]\subset R^{n-1},$
openaire   +1 more source

Solvability of Some Statistical Mechanical Systems

Physical Review Letters, 1996
Summary: We describe a numerical procedure that clearly indicates whether or not a given statistical mechanical system is solvable (in the sense of being expressible in terms of \(D\)-finite functions). If the system is not solvable in this sense, any solution that exists must be expressible in terms of functions that possess a natural boundary.
Guttmann, A. J., Enting, I. G.
openaire   +3 more sources

Periodic descriptor systems: solvability and conditionability

IEEE Transactions on Automatic Control, 1999
Summary: The authors consider discrete-time linear periodic descriptor systems and study the concepts of solvability and conditionability, introduced by Luenberger. They prove that solvability is equivalent to conditionability, just as in the time-invariant case.
Jayaramanan Sreedhar, Paul Van Dooren
openaire   +2 more sources

Solvable approximations of control systems

The 23rd IEEE Conference on Decision and Control, 1984
The paper is concerned with the construction of affine systems in the Crouch canonical form, defined on vector spaces, which approximate locally the input-output behaviour of a given smooth affine system. A similar problem of approximation by bilinear systems has been considered first by \textit{A. J. Krener} [SIAM J.
openaire   +2 more sources

A class of solvable dynamical systems

Physica D: Nonlinear Phenomena, 1986
A class of integrable coupled nonlinear ordinary differential equations is introduced. The technique is to consider first the linear evolution in time of n quantities, \(\psi_ m(t)\), \(m=0,1,2,...,n-1\), defined through the function \(\psi (x,t)=\sum^{n-1}_{m=0}\psi_ m(t)x^ m\) satisfying a second order linear partial differential equation. Then a set
openaire   +3 more sources

Feasibility-Solvability Theorem for a Generalized System

Journal of Optimization Theory and Applications, 2009
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
R. Hu, Y. P. Fang
openaire   +2 more sources