In this paper we deal with the problem of stabilization of uncertain systems in the presence of input constraint. First algebraic conditions are derived for input-to-state stability of linear system with saturated linear feedback of low dimension. Then a recursive design procedure is derived for robust stabilization of block upper triangular nonlinear systems with feedforward structure.

It is shown that there are infinitely many formulas to calculate multiplicities of weights participating in irreducible representations of AN Lie algebras. On contrary to the recursive character of Kostant and Freudenthal multiplicity formulas, they provide us systems of linear algebraic equations with N-dependent polinomial coefficients. These polinomial coefficients are in fact related with p...

A parallel version of the Algebraic Recursive Multilevel Solver (ARMS) is developed for distributed computing environments. The method adopts the general framework of distributed sparse matrices and relies on solving the resulting distributed Schur complement system. Numerical experiments are presented which compare these approaches on regularly and irregularly structured problems.

We provide an algebraic description of subtypes and the way they propagate through recursive functions. By abstracting from the concrete domain of functions or relations we obtain a framework which is independent of strict or non-strict, deterministic or non-deterministic semantics. Applications include efficiency increasing simplification of recursions as well as proofs about recursions by noe...

A high temperature expansion is employed to map some complex anisotropic nonhermitian three dimensional Ising models with algebraic long range interactions into a solvable two dimensional variant. Some solutions are presented. This framework further allows for some very simple general observations. It will be seen that the absence of a “phase interference” effect plays an important role in high...

We describe a new quantifier elimination algorithm for real closed fields based on Thom encoding and sign determination. The complexity of this algorithm is elementary recursive and its proof of correctness is completely algebraic. In particular, the notion of connected components of semialgebraic sets is not used.

The paper determines the algebraic and logic structure of the multiset semantics of the core patterns of SPARQL. We prove that the fragment formed by AND, UNION, OPTIONAL, FILTER, MINUS and SELECT corresponds precisely to both, the intuitive multiset relational algebra (projection, selection, natural join, arithmetic union and except), and the multiset non-recursive Datalog with safe negation.

Modern communication, control, avionic, and radar systems require the use of computationally intensive algebraic operations for real-time high throughput filtering, estimation, tracking, direction-of-arrival, and localization purposes. In this overview paper, we first review some basic systolic array (SA) concept, then SA algorithms for digital filtering, recursive least-squares, QR decompositi...

Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . ti 1. Preliminarv detinitilms and results . . . . . . . . . . . . . . . . . . . . . . . . . Algebraic characterizations of the unwind property .................. A structure with the unwind property for every iterative (but not every recursive 1 program . The truth-table property ............................. Struc...