Results 231 to 240 of about 114,098 (264)
Some of the next articles are maybe not open access.

Error Bounds for Quadratic Systems

2000
In this paper we consider the problem of estimating the distance from a given point to the solution set of a quadratic inequality system. We show, among other things, that a local error bound of order 1/2 holds for a system defined by linear inequalities and a single (nonconvex) quadratic equality.
Luo, Z-Q, Sturm, J.F.
openaire   +2 more sources

OSCILLATIONS AND CHAOS IN SIMPLE QUADRATIC SYSTEMS

International Journal of Bifurcation and Chaos, 2008
This paper is concerned with the study of third order quadratic and autonomous systems and the interest is oriented to the stable periodic oscillations. From the "jerk" equation model, the classes of minimal complexity presenting a Hopf bifurcation are derived and their local characterization is carried out by means of a suitable harmonic balance ...
INNOCENTI, GIACOMO   +2 more
openaire   +3 more sources

Quadratic dynamical systems

Proceedings., 33rd Annual Symposium on Foundations of Computer Science, 1992
The paper promotes the study of computational aspects, primarily the convergence rate, of nonlinear dynamical systems from a combinatorial perspective. The authors identify the class of symmetric quadratic systems. Such systems have been widely used to model phenomena in the natural sciences, and also provide an appropriate framework for the study of ...
Y. Rabinovich, A. Sinclair, A. Wigderson
openaire   +1 more source

On completeness of quadratic systems

Nonlinear Analysis: Theory, Methods & Applications, 2011
A non-autonomous differential equation \(y'=f(t,y)\), \(y\in{\mathbb R}^k\), is called complete if every solution exists for all \(t\in{\mathbb R}\). This paper studies the completeness of non-autonomous quadratic systems of the form \(y'=f_0(t)+f_1(t)y+f_2(t,y)\), \(y\in{\mathbb R}^k\), where \(f_0(t)\) is a column vector, \(f_1(t)\) is a \(k\times k\)
Gingold, Harry, Solomon, Daniel
openaire   +2 more sources

Quadratic Newton Iteration for Systems with Multiplicity

Foundations of Computational Mathematics, 2002
The author proposes an efficient iterator with quadratic convergence that generalizes Newton iterator for multiple roots. It is based on a \(m\)-adic topology where the ideal \(m\) can be chosen generic enough. Compared to the Newton iterator the proposed iterator introduces a small overhead that grows with the square of the multiplicity of the root.
openaire   +1 more source

One-Dimensional Quadratic Chaotic System and Splicing Model for Image Encryption

Electronics (Switzerland), 2023
Donglin Zhu, Zhu Donglin
exaly  

Linear-Quadratic Systems

1997
Linear systems with a quadratic performance criterion attract the attention of many investigations for the following reasons: they describe many actual phenomena adequately enough; on the other hand, the corresponding optimal control problems, as a rule, can be completely solved analytically.
openaire   +1 more source

Home - About - Disclaimer - Privacy