Results 11  20
of
170,703
Iterative Solution of Multiple Linear Systems: Theory, . . .
 in Advances in Parallel and Vector Processing for Structural Mechanics: Proc. Second Int'l. Conf. Computational Structures Technology, B.H.V. Topping and
, 1994
"... We are interested in iterative algorithms that lend themselves to highlevel parallel computation. One example is the solution of very large and sparse linear systems with multiple righthand sides. We report on some recent work on this topic and present new results on the parallel solution of this ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
We are interested in iterative algorithms that lend themselves to highlevel parallel computation. One example is the solution of very large and sparse linear systems with multiple righthand sides. We report on some recent work on this topic and present new results on the parallel solution
ON THE CARLESON MEASURE CRITERION IN LINEAR SYSTEMS THEORY
, 804
"... Abstract. In Ho, Russell [15], and Weiss [33], a Carleson measure criterion for admissibility of onedimensional input elements with respect to diagonal semigroups is given. We extend their results from the Hilbert space situation X = ℓ2 and L 2 –admissibility to the more general situation of L p –a ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
–admissibility on ℓq–spaces. In case of analytic diagonal semigroups we present a new result that does not rely on Laplace transform methods. A comparison of both criteria leads to result of L p –admissibility for reciprocal systems in the sense of Curtain [5].
Computer Simplification of Formulas in Linear Systems Theory
"... Abstract — Currently, the three most popular commercial computer algebra systems are Mathematica, Maple and MACSYMA. These systems provide a wide variety of symbolic computation facilities for commutative algebra and contain implementations of powerful algorithms in that domain. The Gröbner Basis Al ..."
Abstract
 Add to MetaCart
Algorithm, for example, is an important tool used in computation with commutative algebras and in solving systems of polynomial equations. On the other hand, most of the computation involved in linear control theory is performed on matrices, and these do not commute. A typical issue of IEEE TAC is full
A linear system theory for systems subject to synchronization and saturation constraints
 Proceedings of the first European Control Conference
, 1991
"... Abstract A linear system theory is developped for a class of continuous and discrete Systems subject to Synchronization and Saturations that we call S 3. This class provides a generalization of a particular class of timed discrete event systems which can be modeled as event graphs. The development i ..."
Abstract

Cited by 8 (1 self)
 Add to MetaCart
Abstract A linear system theory is developped for a class of continuous and discrete Systems subject to Synchronization and Saturations that we call S 3. This class provides a generalization of a particular class of timed discrete event systems which can be modeled as event graphs. The development
Longitudinal data analysis using generalized linear models”.
 Biometrika,
, 1986
"... SUMMARY This paper proposes an extension of generalized linear models to the analysis of longitudinal data. We introduce a class of estimating equations that give consistent estimates of the regression parameters and of their variance under mild assumptions about the time dependence. The estimating ..."
Abstract

Cited by 1526 (8 self)
 Add to MetaCart
SUMMARY This paper proposes an extension of generalized linear models to the analysis of longitudinal data. We introduce a class of estimating equations that give consistent estimates of the regression parameters and of their variance under mild assumptions about the time dependence
An almost ideal demand system.
 American Economic Review,
, 1980
"... Ever since Richard Stone (1954) first estimated a system of demand equations derived explicitly from consumer theory, there has been a continuing search for alternative specifications and functional forms. Many models have been proposed, but perhaps the most important in current use, apart from the ..."
Abstract

Cited by 636 (0 self)
 Add to MetaCart
Ever since Richard Stone (1954) first estimated a system of demand equations derived explicitly from consumer theory, there has been a continuing search for alternative specifications and functional forms. Many models have been proposed, but perhaps the most important in current use, apart from
The Generalized Eigenstructure Problem in Linear System Theory
"... HROUGHOUT this paper we use the following notaT t i o n and conventions. Uppercase is used for matrices and lowercase for vectors and both are defined over the field of complex numbers 02 unless otherwise stated. We use AT and A * for the transpose and conjugate transpose of A and diag{A,, A,,. , A ..."
Abstract
 Add to MetaCart
of A; AX is the image of X under A. X + Y and X@Y are the sum and direct sum, respectively, of the spaces X and Y. The orthogonal complement of X based on the natural inner product in a given coordinate system, is denoted by X I. An invariant subspace X of A satisfies AX C X where c denotes
Pointsto Analysis in Almost Linear Time
, 1996
"... We present an interprocedural flowinsensitive pointsto analysis based on type inference methods with an almost linear time cost complexity. To our knowledge, this is the asymptotically fastest nontrivial interprocedural pointsto analysis algorithm yet described. The algorithm is based on a nons ..."
Abstract

Cited by 595 (3 self)
 Add to MetaCart
We present an interprocedural flowinsensitive pointsto analysis based on type inference methods with an almost linear time cost complexity. To our knowledge, this is the asymptotically fastest nontrivial interprocedural pointsto analysis algorithm yet described. The algorithm is based on a non
A theory of timed automata
, 1999
"... Model checking is emerging as a practical tool for automated debugging of complex reactive systems such as embedded controllers and network protocols (see [23] for a survey). Traditional techniques for model checking do not admit an explicit modeling of time, and are thus, unsuitable for analysis of ..."
Abstract

Cited by 2651 (32 self)
 Add to MetaCart
and logic, and much progress has been made in developing verification algorithms, heuristics, and tools. This paper provides a survey of the theory of timed automata, and their role in specification and verification of realtime systems.
Algebraic Graph Theory
, 2011
"... Algebraic graph theory comprises both the study of algebraic objects arising in connection with graphs, for example, automorphism groups of graphs along with the use of algebraic tools to establish interesting properties of combinatorial objects. One of the oldest themes in the area is the investiga ..."
Abstract

Cited by 892 (13 self)
 Add to MetaCart
for determining just how large is actually possible; this theory rests on Delsarte’s thesis [4], which showed how to use schemes to translate the problem into a question that be solved by linear programming.
Results 11  20
of
170,703