Robbiano / Abbott Approximate Commutative Algebra

1. Auflage 2009
ISBN: 978-3-211-99314-9
Verlag: Springer Wien
Format: PDF
Kopierschutz: 1 - PDF Watermark

E-Book, Englisch, 227 Seiten, eBook

Reihe: Texts and Monographs in Symbolic Computation

Approximate Commutative Algebra is an emerging field of research which endeavours to bridge the gap between traditional exact Computational Commutative Algebra and approximate numerical computation. The last 50 years have seen enormous progress in the realm of exact Computational Commutative Algebra, and given the importance of polynomials in scientific modelling, it is very natural to want to extend these ideas to handle approximate, empirical data deriving from physical measurements of phenomena in the real world. In this volume nine contributions from established researchers describe various approaches to tackling a variety of problems arising in Approximate Commutative Algebra.

Zielgruppe

Research

Autoren/Hrsg.

Robbiano, Lorenzo

Abbott, John

Inhaltsverzeichnis

From Oil Fields to Hilbert Schemes.- Numerical Decomposition of the Rank-Deficiency Set of a Matrix of Multivariate Polynomials.- Towards Geometric Completion of Differential Systems by Points.- Geometric Involutive Bases and Applications to Approximate Commutative Algebra.- Regularization and Matrix Computation in Numerical Polynomial Algebra.- Ideal Interpolation: Translations to and from Algebraic Geometry.- An Introduction to Regression and Errors in Variables from an Algebraic Viewpoint.- ApCoA = Embedding Commutative Algebra into Analysis.- Exact Certification in Global Polynomial Optimization Via Rationalizing Sums-Of-Squares.

Leseproben

Chapter 3 Towards Geometric Completion of Differential Systems by Points (p. 79-80)

Wenyuan Wu, Greg Reid and Oleg Golubitsky

Abstract Numerical Algebraic Geometry represents the irreducible components of algebraic varieties over C by certain points on their components. Such witness points are efficiently approximated by Numerical Homotopy Continuation methods, as the intersection of random linear varieties with the components. We outline challenges and progress for extending such ideas to systems of differential polynomials, where prolongation (differentiation) of the equations is required to yield existence criteria for their formal (power series) solutions. For numerical stability we marry Numerical Geometric Methods with the Geometric Prolongation Methods of Cartan and Kuranishi from the classical (jet) geometry of differential equations. Several new ideas are described in this article, yielding witness point versions of fundamental operations in Jet geometry which depend on embedding Jet Space (the arena of traditional differential algebra) into a larger space (that includes as a subset its tangent bundle). The first new idea is to replace differentiation (prolongation) of equations by geometric lifting of witness Jet points. In this process, witness Jet points and the tangent spaces of a jet variety at these points, which characterize prolongations, are computed by the tools of Numerical Algebraic Geometry and Numerical Linear Algebra. Unlike other approaches our geometric lifting technique can characterize projections without constructing an explicit algebraic equational representation.We first embed a given system in a larger space. Then using a construction of Bates et al., appropriate random linear slices cut out points, characterizing singular solutions of the differential system.

3.1 Introduction

3.1.1 Historical Background

Exact commutative algebra is concerned with commutative rings and their associated modules, rings and ideals. It is a foundation for algebraic geometry for polynomial rings amongst other areas. In our case, commutative algebra is a fundamental constituent of differential algebra for differential polynomial rings. Our paper is part of a collection that focuses on the rapidly evolving theory and algorithms for approximate generalizations of commutative algebra. The generalizations are nontrivial and promise to dramatically widen the scope and applications of the area of traditional exact commutative algebra.

Although the study of systems of differential polynomials (i.e. polynomially nonlinear PDE) is more complicated than algebraic systems of polynomials, historically key algorithmic concepts in commutative algebra, often arose initially for PDE. For example, differential elimination methods, arose first in the late 1800’s. In particular the classical methods of Riquier 1910 [18] and Tresse 1894 [30] for reducing systems of PDE to certain passive forms can in hindsight be regarded to implicitly contain versions of Buchberger’s Algorithm. However, the full potency and development of the theory had to await Buchberger’s work 1965 [5]. Indeed there is a well known isomorphism between polynomials and constant coefficient linear homogeneous PDE, which may be interpreted as mapping indeterminates to differential operators. Thus multiplication by a monomial maps to differentiation and reduction maps to elimination. Hence the Gröbner Basis algorithm is equivalent to a differential elimination method for such linear PDE. Further the Hilbert Function, gives the degree of generality of formal power series solutions of such PDE under this mapping.