| M. Jirstrand, "Nonlinear Control System Design by Quantifier Elimination, " J. Symb. Comput., vol. 24, no. 2, pp. 137--152, 1997. |
....is at least four) Therefore, unless P=NP) any method guaranteed to obtain the right answer in every possible instance will have unacceptable behavior for a problem with a large number of variables. This is the main drawback of theoretically powerful methodologies such as quantifier elimination [31, 47]. If we want to avoid the inherent complexity problems related with the exact solution, the question arises: are there any conditions, that can be tested in polynomial time, to guarantee global positivity of a function As we will shortly see, one such condition is given by the existence of a sum ....
M. Jirstrand. Nonlinear control system design by quantifier elimination. J. Symbolic Computation, 24:137--152, 1997.
.... McCallum, 1988) Other algorithmic approaches are described in (Renegar, 1992; Weispfenning, 1998; Dolzmann and Sturm, 1997; Gonz alez Vega, 1998) Many applications, especially in mechanical engineering and in numerical analysis (see (Liska and Steinberg, 1993; G onzalez L opez and Recio, 1993; Jirstrand, 1997)) lead to QE problems with trigonometric functions involved. The general first order theory of the real numbers with sine and cosine is undecidable: since the zeroes of the sine function are precisely the integral multiples of , one can find diophantine arithmetic within it, which is undecidable ....
Jirstrand, M. (1997). Nonlinear control system design by quantifier elimination. Journal of Symbolic Computation, 24:137--152.
.... a number of researchers have used Symbolic Reachability Computation for Families of Linear Vector Fields 3 quantifier elimination in testing stability of linear systems (Hong et al. 1997) robust feedback control (Dorato et al. 1997) and trajectory tracking of nonlinear control systems (Jirstrand, 1997). However, the problem of computing the exact reachable set of linear vector fields had not been addressed. The outline of this paper is as follows: In Section 2 we review the relevant notions from mathematical logic and model theory that will be used throughout the paper. In Section 3 we use ....
Jirstrand, M. (1997). Nonlinear control system design by quantifier elimination. Journal of Symbolic Computation, 24(2):137--152.
No context found.
M. Jirstrand. Nonlinear control system design by quantifier elimination. In IMACS Conference on Applications of Computer Algebra, Linz, Austria, July 1996. 1
No context found.
M. Jirstrand. Nonlinear control system design by quantifier elimination. Technical Report LiTH-ISY-R-1897, Dept. of Electrical Engineering, Linkoping University, S-581 83 Linkoping, Sweden, September 1996.
No context found.
M. Jirstrand, "Nonlinear Control System Design by Quantifier Elimination, " J. Symb. Comput., vol. 24, no. 2, pp. 137--152, 1997.
No context found.
Jirstrand, M., 1997. Nonlinear control system design by quantifier elimination. Journal of Symbolic Computation 24, 137--152.
No context found.
M. Jirstrand. Nonlinear control system design by quantifier elimination. J. Symbolic Computation, 24:137--152, 1997.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC