The previously developed Gauss pseudospectral method is extended to the case of nonlinear infinite-horizon optimal control problems. First, the semi-infinite domain t ∈ [0,+∞) is transformed to the domain τ = [−1,+1). The first-order optimality conditions of NLP obtained from the pseudospectral discretization are then presented. These optimality conditions are related to the KKT multipliers of ...

This paper describes the applications of the method of fundamental solutions (MFS) as a mesh-free numerical method for the Stokes’ first and second problems which prevail in the semi-infinite domain with constant and oscillatory velocity at the boundary in the fluid-mechanics benchmark problems. The time-dependent fundamental solutions for the semi-infinite problems are used directly to obtain ...

The infinite grid is the Cayley graph of Z × Z with the usual generators. In this paper, the Ihara zeta function for the infinite grid is computed using elliptic integrals and theta functions. The zeta function of the grid extends to an analytic, multivalued function which satisfies a functional equation. The set of singularities in its domain is finite. The grid zeta function is the first comp...

Weak omega algebra and demonic refinement algebra are two ways of describing systems with finite and infinite iteration. We show that these independently introduced kinds of algebras can actually be defined in terms of each other. By defining modal operators on the underlying weak semiring, that result directly gives a demonic refinement algebra of commands. This yields models in which extensio...

Many important tasks can be cast as weighted relational satisfiability problems. Propositionalizing relational theories and making inferences with them using SAT algorithms has proven effective in many cases. However, these approaches require that all objects in a domain be known in advance. Many domains, from language understanding to machine vision, involve reasoning about objects that are no...

In the infinite Post Correspondence Problem an instance (h, g) consists of two morphisms h and g, and the problem is to determine whether or not there exists an infinite word α such that h(α) = g(α). In the general case this problem was shown to be undecidable by K. Ruohonen (1985). Recently, it was proved that the infinite PCP is undecidable already when the domain alphabet of the morphisms co...