Maximum entropy inverse optimal control (MaxEnt IOC) is an effective means of discovering the underlying cost function of demonstrated agent’s activity. To enable inference in large state spaces, we introduce an approximate MaxEnt IOC procedure to address the fundamental computational bottleneck stemming from calculating the partition function via dynamic programming. Approximate MaxEnt IOC is ...

There is an increasing interest in using sparse approximate inverses as preconditioners for Krylov subspace iterative methods. Recent studies of Grote and Huckle [21] and Chow and Saad [11] also show that sparse approximate inverse preconditioner can be effective for a variety of matrices, e.g. Harwell-Boeing collections. Nonetheless a drawback is that it requires rapid decay of the inverse ent...

In the present paper, the concepts of module (uniform) approximate amenability and contractibility of Banach algebras that are modules over another Banach algebra, are introduced. The general theory is developed and some hereditary properties are given. In analogy with the Banach algebraic approximate amenability, it is shown that module approximate amenability and contractibility are the same ...

While decomposing graphs in simpler items greatly helps to design more efficient algorithms, some classes of graphs can not be handled using the classical techniques. We show here that a graph having enough symmetries can be factored into simpler blocks through a standard morphism and that the inverse process may be formalized as a pullback rewriting system.

Abstract This paper studies fully discrete finite element approximations to the Navier–Stokes equations using inf-sup stable elements and grad-div stabilization. For time integration, two implicit–explicit second-order backward differentiation formulae (BDF2) schemes are applied. In both, Laplacian is implicit while nonlinear term explicit, in first one, semiimplicit, second one. The stabilizat...