Results 271 to 280 of about 853,608 (316)
Some of the next articles are maybe not open access.
The equivalence ofB-stability andA-stability
BIT, 1984It is well known that linear and nonlinear stability concepts are equivalent for linear multistep methods in their one-leg formulation. This result is extended to Runge-Kutta methods. In particular, it is shown here that given an irreducible rational function R(z) whose degrees of numerator and denominator are at most s which has order of approximation
Hairer, Ernst, Tuerke, H.
openaire +2 more sources
Arithmetic tests forA-stability,A[α]-stability, and stiff-stability
BIT, 1978Arithmetic tests forA-stability,A[α]-stability, and stiff-stability are presented as special cases of a general stability test for numerical integration methods. The test evolves from extracted properties of the characteristic polynomial (in two variables) of the numerical method applied to the prototype scalar ordinary differential equation
Bickart, T. A., Jury, E. I.
openaire +1 more source
Stability and stabilization of implicit systems
Proceedings of the 39th IEEE Conference on Decision and Control (Cat. No.00CH37187), 2002This paper is concerned with stability and stabilization of implicit systems. Stability criteria are provided in terms of the Kronecker form, Lyapunov equation and inequality and conditions on extended rank and invertibility of the system pencil. Then stabilization of implicit systems via interconnection is considered based on the notion of initial ...
openaire +1 more source
Combinatorics, Probability and Computing, 2009
A d-simplex is a collection of d + 1 sets such that every d of them has non-empty intersection and the intersection of all of them is empty. Fix k ≥ d + 2 ≥ 3 and let be a family of k-element subsets of an n-element set that contains no d-simplex. We prove that if $|\cG| \geq (1 - o(1))\binom{n-1 }{k-1}$, then there is a vertex x of such that the ...
Dhruv Mubayi, Reshma Ramadurai
openaire +1 more source
A d-simplex is a collection of d + 1 sets such that every d of them has non-empty intersection and the intersection of all of them is empty. Fix k ≥ d + 2 ≥ 3 and let be a family of k-element subsets of an n-element set that contains no d-simplex. We prove that if $|\cG| \geq (1 - o(1))\binom{n-1 }{k-1}$, then there is a vertex x of such that the ...
Dhruv Mubayi, Reshma Ramadurai
openaire +1 more source
Proceedings of the Fifth Israeli Symposium on Theory of Computing and Systems, 1997
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yehuda Afek, Shlomi Dolev
openaire +1 more source
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yehuda Afek, Shlomi Dolev
openaire +1 more source
Stability and stabilization of delay differential systems
Automatica, 1996This paper considers the stability and stabilization of the following linear systems with delay \[ \dot y(t)= A_0y(t) +\sum^p_{i=1} A_iy (t-\tau_i) +EW(t), \quad t\geq t_0, \] under bounded additive disturbance. Conditions for respecting linear constraints and for asymptotic stability are obtained from a characterization of positive invariance ...
Jean-Claude Hennet, Sophie Tarbouriech
openaire +2 more sources
TEACHING STABILITY AND ROBUST STABILITY
IFAC Proceedings Volumes, 1994Abstract The aim of this paper is to demonstrate that, in teaching stability theory for linear systems, there are two basic mathematical foundations which can be used: The principal of the argument and Lyapunov theory, according to the presentation of the system in the operator or time-domain, respectively.
openaire +1 more source
The equivalence of algebraic stability andAN-stability
BIT, 1987Let C be a general linear integration method. The author proves that an irreducible AN-stable method C is algebraically stable (for definitions of these concepts see the author [ibid. 27, 182-189 (1987; Zbl 0623.65074)]. This generalizes previous results about Runge-Kutta methods and one-leg methods. A number of useful miscellaneous results from theory
openaire +1 more source
A-Stability and Stochastic Mean-Square Stability
BIT Numerical Mathematics, 2000The author considers the mean-square stability of the stochastic differential equation for the test problem with multiplicative noise proposed by \textit{Y. Saito} and \textit{T. Mitsui} [SIAM J. Appl. Math. 56, No. 5, 1400-1423 (1996; Zbl 0869.60053)]. It quantifies precisely the point where unconditional stability is lost.
openaire +4 more sources
Stability and stabilization of biocatalysts
Trends in Biotechnology, 1999F J, Plou, A, Ballesteros
openaire +2 more sources