Bases for Projective modules in An(k)

Let $A_n(k)$ be the Weyl algebra, with $k$ a field of characteristic zero. It is known that every projective finitely generated left module is free or isomorphic to a left ideal. Let $M$ be a left submodule of a free module. In this paper we give an algorithm to compute the projective dimension of $M$. If $M$ is projective and \rk(M) \ge 2 we give a procedure to find a basis.Ministerio de Ciencia y Tecnología (Spain) BFM2001-3164, FQM-813Junta de Andalucía FQM-81

A constructive study of the module structure of rings of partial differential operators

The purpose of this paper is to develop constructive versions of Stafford's theorems on the module structure of Weyl algebras A n (k) (i.e., the rings of partial differential operators with polynomial coefficients) over a base field k of characteristic zero. More generally, based on results of Stafford and Coutinho-Holland, we develop constructive versions of Stafford's theorems for very simple domains D. The algorithmization is based on the fact that certain inhomogeneous quadratic equations admit solutions in a very simple domain. We show how to explicitly compute a unimodular element of a finitely generated left D-module of rank at least two. This result is used to constructively decompose any finitely generated left D-module into a direct sum of a free left D-module and a left D-module of rank at most one. If the latter is torsion-free, then we explicitly show that it is isomorphic to a left ideal of D which can be generated by two elements. Then, we give an algorithm which reduces the number of generators of a finitely presented left D-module with module of relations of rank at least two. In particular, any finitely generated torsion left D-module can be generated by two elements and is the homomorphic image of a projective ideal whose construction is explicitly given. Moreover, a non-torsion but non-free left D-module of rank r can be generated by r+1 elements but no fewer. These results are implemented in the Stafford package for D=A n (k) and their system-theoretical interpretations are given within a D-module approach. Finally, we prove that the above results also hold for the ring of ordinary differential operators with either formal power series or locally convergent power series coefficients and, using a result of Caro-Levcovitz, also for the ring of partial differential operators with coefficients in the field of fractions of the ring of formal power series or of the ring of locally convergent power series. © 2014 Springer Science+Business Media

Computational visualization for critical thinking

This paper looks back at historical precedents for how computational systems and ideas have been visualized as a means of access to and engagement with a broader audience, and to develop a new more tangible language to address abstraction. These precedents share a subversive ground in using a visual language to provoke new ways of engaging with about complex ideas. Two new approaches to visualizing algorithmic systems are proposed for the emerging context of algorithmic ethics in society, looking at prototypical algorithms in computer vision and machine learning systems, to think through the meaning created by algorithmic structure and process. The aim is to use visual design to provoke new kinds of thinking and criticality that can offer opportunities to address algorithms in their increasingly more politicized role today. These new approaches are developed from an arts research perspective to support critical thinking and arts knowledge through creative coding and interactive design

Optimal Uncertainty Quantification

We propose a rigorous framework for Uncertainty Quantification (UQ) in which the UQ objectives and the assumptions/information set are brought to the forefront. This framework, which we call \emph{Optimal Uncertainty Quantification} (OUQ), is based on the observation that, given a set of assumptions and information about the problem, there exist optimal bounds on uncertainties: these are obtained as values of well-defined optimization problems corresponding to extremizing probabilities of failure, or of deviations, subject to the constraints imposed by the scenarios compatible with the assumptions and information. In particular, this framework does not implicitly impose inappropriate assumptions, nor does it repudiate relevant information. Although OUQ optimization problems are extremely large, we show that under general conditions they have finite-dimensional reductions. As an application, we develop \emph{Optimal Concentration Inequalities} (OCI) of Hoeffding and McDiarmid type. Surprisingly, these results show that uncertainties in input parameters, which propagate to output uncertainties in the classical sensitivity analysis paradigm, may fail to do so if the transfer functions (or probability distributions) are imperfectly known. We show how, for hierarchical structures, this phenomenon may lead to the non-propagation of uncertainties or information across scales. In addition, a general algorithmic framework is developed for OUQ and is tested on the Caltech surrogate model for hypervelocity impact and on the seismic safety assessment of truss structures, suggesting the feasibility of the framework for important complex systems. The introduction of this paper provides both an overview of the paper and a self-contained mini-tutorial about basic concepts and issues of UQ.Comment: 90 pages. Accepted for publication in SIAM Review (Expository Research Papers). See SIAM Review for higher quality figure

Exact linear modeling using Ore algebras

Linear exact modeling is a problem coming from system identification: Given a set of observed trajectories, the goal is find a model (usually, a system of partial differential and/or difference equations) that explains the data as precisely as possible. The case of operators with constant coefficients is well studied and known in the systems theoretic literature, whereas the operators with varying coefficients were addressed only recently. This question can be tackled either using Gr\"obner bases for modules over Ore algebras or by following the ideas from differential algebra and computing in commutative rings. In this paper, we present algorithmic methods to compute "most powerful unfalsified models" (MPUM) and their counterparts with variable coefficients (VMPUM) for polynomial and polynomial-exponential signals. We also study the structural properties of the resulting models, discuss computer algebraic techniques behind algorithms and provide several examples

Recent progress in an algebraic analysis approach to linear systems

This paper addresses systems of linear functional equations from an algebraic point of view. We give an introduction to and an overview of recent work by a small group of people including the author of this article on effective methods which determine structural properties of such systems. We focus on parametrizability of the behavior, i.e., the set of solutions in an appropriate signal space, which is equivalent to controllability in many control-theoretic situations. Flatness of the linear system corresponds to the existence of an injective parametrization. Using an algebraic analysis approach, we associate with a linear system a module over a ring of operators. For systems of linear partial differential equations we choose a ring of differential operators, for multidimensional discrete linear systems a ring of shift operators, for linear differential time-delay systems a combination of those, etc. Rings of these kinds are Ore algebras, which admit Janet basis or Gröbner basis computations. Module theory and homological algebra can then be applied effectively to study a linear system via its system module, the interpretation depending on the duality between equations and solutions. In particular, the problem of computing bases of finitely generated free modules (i.e., of computing flat outputs for linear systems) is addressed for different kinds of algebras of operators, e.g., the Weyl algebras. Some work on computer algebra packages, which have been developed in this context, is summarized