Proceedings of the 2010 International Symposium on Symbolic and Algebraic Computation
ISSAC 2010 25-28 July 2010, Munich Germany
Stephen M. Watt, Editor
The Association for Computing Machinery 2 Penn Plaza, Suite 701 New York, New York 10121-0701 ACM COPYRIGHT NOTICE. Copyright © 2010 by the Association for Computing Machinery, Inc. Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, to republish, to post on servers, or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from Publications Dept., ACM, Inc., fax +1 (212) 869-0481, or
[email protected]. For other copying of articles that carry a code at the bottom of the first or last page, copying is permitted provided that the per-copy fee indicated in the code is paid through the Copyright Clearance Center, 222 Rosewood Drive, Danvers, MA 01923, +1-978-750-8400, +1-978-750-4470 (fax).
Notice to Past Authors of ACM-Published Articles ACM intends to create a complete electronic archive of all articles and/or other material previously published by ACM. If you have written a work that was previously published by ACM in any journal or conference proceedings prior to 1978, or any SIG Newsletter at any time, and you do NOT want this work to appear in the ACM Digital Library, please inform
[email protected], stating the title of the work, the author(s), and where and when published.
ACM ISBN: 978-1-4503-0150-3
ii
Foreword The International Symposium on Symbolic and Algebraic Computation is the premier conference spanning all areas of research in symbolic mathematical computing. The series has a long history, established in 1966 and operating under the ISSAC name since 1988. This year’s meeting is the 35th occurrence and is held at the Technische Universit¨at M¨ unchen. With a subject that has been so thoroughly studied for half a century some might ask whether the main questions have been answered and whether any important challenges remain. Nothing could be farther from the present exciting state of affairs! A quick glance through these proceedings will reveal a subject that is more vibrant than ever. In some ways, we are today experiencing a golden age in symbolic computing: On one hand, we are studying a wider range of mathematical problems and we have deeper algorithmic insight into the central questions than ever before. On the other hand, the scale and nature of computing hardware that is widely available make asymptotically fast and parallel algorithms of immediate practical interest. Not only are these computational problems very interesting in their own right, their solution has a significant practical impact, affecting the millions of users of free and commercial computer algebra packages. Surely there has never been a more interesting time in symbolic mathematical computation. ISSAC 2010 brings together a good number of the world’s most active researchers in the area for a period of four days. As has become our tradition, the meeting features invited presentations, tutorials, contributed research papers, software presentations and a poster session for works in progress. In this way, the participants are able to keep up with a broad range of areas and to present work at different stages of maturity. The invited presentations touch both on central topics in computer algebra and highly relevant nearby areas: Evelyne Hubert: Algebraic Invariants and their Differential Algebras Siegfried M. Rump: Verification Methods: Rigorous Results using Floating-Point Arithmetic Ashish Tiwari: Theory of Reals for Verification and Synthesis of Hybrid Dynamical Systems We are grateful that these distinguished speakers have agreed to speak at our meeting. The ISSAC tutorials have always been popular. They are intended to make new areas accessible to students and practitioners in other areas of the field. This year we are fortunate to have tutorials by three truly talented expositors: Moulay A. Barkatou: Symbolic Methods for Solving Systems of Linear Ordinary Differential Equations J¨ urgen Gerhard: Asymptotically Fast Algorithms for Modern Computer Algebra Sergey P. Tsarev: Transformation and Factorization of Partial Differential Systems with Applications to Stochastic Systems At ISSAC 2010, in a departure from the usual practice, the tutorials carry no registration fee. We are eager to see what effect this has.
iii
As usual, the main body of the conference consists of contributed research papers. A call for papers was circulated one year prior to the meeting, inviting contributions in all areas of computer algebra and symbolic mathematical computation. These included: Algorithmic aspects: exact and symbolic linear, polynomial and differential algebra; symbolicnumeric, homotopy, perturbation and series methods; computational geometry, group theory and number theory; summation, recurrence equations, integration, solution of ode & pde; symbolic methods in other areas of pure and applied mathematics; theoretical and practical aspects, including general algorithms, techniques for important special cases, complexity analyses of algebraic algorithms and algebraic complexity; Software aspects: design of packages and systems; data representation; software analysis; considerations for modern hardware, e.g., current memory and storage technologies, high performance systems and mobile devices; user interface issues, including collaborative computing and new methods for input and manipulation; interfaces and use with systems for, e.g., document processing, digital libraries, courseware, simulation and optimization, automated theorem proving, computer aided design and automatic differentiation; Application aspects: applications that stretch the current limits of computer algebra algorithms or systems, use computer algebra in new areas or new ways or apply it in situations with broad impact. In response, 110 submissions were received and considered. These were reviewed by members of the Program Committee and a wide range of external reviewers. In all, 349 reviews were obtained and every paper received between 3 and 5 reviews. PC members could neither participate in nor see the discussions relating to papers with which they had conflicts of interest. Following the PC deliberations, 45 contributed research papers were accepted for presentation at the conference and inclusion in these proceedings. These proceedings present the contributed research papers in the order of presentation. They are grouped loosely by topic in a manner that fits the conference schedule. Other presentation groupings might provide somewhat more scientific coherence, but could not be accommodated for practical reasons. Running a meeting such as ISSAC consumes the efforts of many people. We would like to express our gratitude to all those who have contributed. We first thank the invited speakers and tutorial presenters for agreeing to participate. We thank the authors of the research papers for contributing their work. We are extremely grateful to the members of the PC and the army of external reviewers for their careful work on a tight schedule. We thank Andrei Voronkov for his assistance with EasyChair, Peter Horn for designing the cover and Vadim Mazalov for his substantial assistance in preparing these proceedings. We especially thank the entire local organizing team who have worked hard to make this conference enjoyable and productive. Finally, on behalf of our entire community, we thank the Deutsche Forschungsgemeinschaft and Maplesoft for their generous financial support.
Wolfram Koepf General Chair
Stephen M. Watt Program Committee Chair
June 24, 2010
iv
Ernst W. Mayr Local Arrangements Chair
Table of Contents
Invited Presentations Algebraic Invariants and Their Differential Algebras . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1 Evelyne Hubert Verification Methods: Rigorous Results using Floating-Point Arithmetic . . . . . . . . . . . . . 3 Siegfried M. Rump Theory of Reals for Verification and Synthesis of Hybrid Dynamical Systems . . . . . . . . 5 Ashish Tiwari
Tutorials Symbolic Methods for Solving Systems of Linear Ordinary Differential Equations . . . 7 Moulay A. Barkatou Asymptotically Fast Algorithms for Modern Computer Algebra. . . . . . . . . . . . . . . . . . . . . . . .9 J¨ urgen Gerhard Transformation and Factorization of Partial Differential Systems: Applications to Stochastic Systems . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 11 S. P. Tsarev
Contributed Papers Gr¨ obner Bases A New Incremental Algorithm for Computing Groebner Bases . . . . . . . . . . . . . . . . . . . . . . . 13 Shuhong Gao, Yinhua Guan and Frank Volny Degree Bounds for Gr¨ obner Bases of Low-Dimensional Polynomial Ideals . . . . . . . . . . . 21 Ernst W. Mayr and Stephan Ritscher A New Algorithm for Computing Comprehensive Gr¨ obner Systems . . . . . . . . . . . . . . . . . . 29 Deepak Kapur, Yao Sun and Dingkang Wang
Differential Equations Finding all Bessel Type Solutions for Linear Differential Equations with Rational Function Coefficients. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .37 Mark van Hoeij and Quan Yuan Simultaneously Row- and Column-Reduced Higher-Order Linear Differential Systems . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 45 Moulay Barkatou, Carole El Bacha and Eckhard Pfl¨ ugel Consistency of Finite Difference Approximations for Linear PDE Systems and Its Algorithmic Verification . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 53 Vladimir Gerdt and Daniel Robertz v
CAD and Quantifiers Computation with Semialgebraic Sets Represented by Cylindrical Algebraic Formulas . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 61 Adam Strzebo´ nski Black-Box/White-Box simplification and Applications to Quantifier Elimination . . . . 69 Christopher Brown and Adam Strzebo´ nski Parametric Quantified SAT Solving. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 77 Thomas Sturm and Christoph Zengler
Differential Algebra I A Method for Semi-Rectifying Algebraic and Differential Systems using Scaling Type Lie Point Symmetries with Linear Algebra . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 85 ¨ upl¨ Fran¸cois Lemaire and Aslı Urg¨ u Absolute Factoring of Non-holonomic Ideals in the Plane . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 93 Dima Grigoriev and Fritz Schwarz Algorithms for Bernstein-Sato Polynomials and Multiplier Ideals . . . . . . . . . . . . . . . . . . . . . 99 Christine Berkesch and Anton Leykin
Polynomial Algebra Global Optimization of Polynomials Using Generalized Critical Values and Sums of Squares . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 107 Feng Guo, Mohab Safey El Din and Lihong Zhi A Slice Algorithm for Corners and Hilbert-Poincar´ e Series of Monomial Ideals . . . . 115 Bjarke Hammersholt Roune Composition Collisions and Projective Polynomials. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .123 Joachim von zur Gathen, Mark Giesbrecht and Konstantin Ziegler Decomposition of Multivariate Polynomials . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 131 Jean-Charles Faug`ere, Joachim von zur Gathen and Ludovic Perret
Seminumerical Techniques NumGfun: a Package for Numerical and Analytic Computation with D-finite Functions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 139 Marc Mezzarobba Chebyshev Interpolation Polynomial-Based Tools for Rigorous Computing . . . . . . . . . 147 Nicolas Brisebarre and Mioara Jolde¸s Blind Image Deconvolution via Fast Approximate GCD . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 155 Zijia Li, Zhengfeng Yang and Lihong Zhi Polynomial Integration on Regions Defined by a Triangle and a Conic . . . . . . . . . . . . . . 163 David Sevilla and Daniel Wachsmuth
vi
Geometry Computing the Singularities of Rational Space Curves . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 171 Xiaoran Shi and Falai Chen Solving Schubert Problems with Littlewood-Richardson Homotopies . . . . . . . . . . . . . . . . 179 Frank Sottile, Ravi Vakil and Jan Verschelde Triangular Decomposition of Semi-Algebraic Systems . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 187 Changbo Chen, James H. Davenport, John P. May, Marc Moreno Maza, Bican Xia and Rong Xiao
Differential Algebra II When Can We Detect that a P-Finite Sequence is Positive? . . . . . . . . . . . . . . . . . . . . . . . . . . 195 Manuel Kauers and Veronika Pillwein Complexity of Creative Telescoping for Bivariate Rational Functions . . . . . . . . . . . . . . . . 203 Alin Bostan, Shaoshi Chen, Fr´ed´eric Chyzak and Ziming Li Partial Denominator Bounds for Partial Linear Difference Equations. . . . . . . . . . . . . . . .211 Manuel Kauers and Carsten Schneider
Polynomial Roots and Solving Real and Complex Polynomial Root-finding with Eigen-Solving and Preprocessing . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 219 Victor Y. Pan and Ai-Long Zheng Computing the Radius of Positive Semidefiniteness of a Multivariate Real Polynomial via a Dual of Seidenberg’s Method . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 227 Sharon Hutton, Erich Kaltofen and Lihong Zhi Random Polynomials and Expected Complexity of Bisection Methods for Real Solving . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 235 Ioannis Z. Emiris, Andr´e Galligo and Elias Tsigaridas The DMM bound: Multivariate (Aggregate) Separation Bounds . . . . . . . . . . . . . . . . . . . . . 243 Ioannis Z. Emiris, Bernard Mourrain and Elias Tsigaridas
Theory and Applications Solving Bezout-Like Polynomial Equations for the Design of Interpolatory Subdivision Schemes . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 251 Costanza Conti, Luca Gemignani and Lucia Romani Computing Loci of Rank Defects of Linear Matrices using Gr¨ obner Bases and Applications to Cryptology . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 257 Jean-Charles Faug`ere, Mohab Safey El Din and Pierre-Jean Spaenlehauer Output-Sensitive Decoding for Redundant Residue Systems . . . . . . . . . . . . . . . . . . . . . . . . . . 265 Majid Khonji, Cl´ement Pernet, Jean-Louis Roch, Thomas Roche and Thomas Stalinski
vii
Linear Algebra A Strassen-Like Matrix Multiplication Suited for Squaring and Higher Power Computation . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 273 Marco Bodrato Computing Specified Generators of Structured Matrix Inverses . . . . . . . . . . . . . . . . . . . . . . 281 Claude-Pierre Jeannerod and Christophe Mouilleron Yet Another Block Lanczos Algorithm: How to Simplify the Computation and Reduce Reliance on Preconditioners in the Small Field Case . . . . . . . . . . . . . . . . . . . . . . . . . 289 Wayne Eberly
Linear Recurrences and Difference Equations Liouvillian Solutions of Irreducible Second Order Linear Difference Equations . . . . . 297 Mark van Hoeij and Giles Levy Solving Recurrence Relations using Local Invariants . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 303 Yongjae Cha, Mark van Hoeij and Giles Levy On Some Decidable and Undecidable Problems Related to q-Difference Equations with Parameters . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 311 Sergei Abramov
Arithmetic Iterative Toom-Cook Methods for Very Unbalanced Long Integer Multiplication . . 319 Alberto Zanoni An In-Place Truncated Fourier Transform and Applications to Polynomial Multiplication . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 325 David Harvey and Daniel S. Roche Randomized NP-Completeness for for p-adic Rational Roots of Sparse Polynomials in One Variable . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 331 Mart´ın Avenda˜ no, Ashraf Ibrahim, J. Maurice Rojas and Korben Rusek
Software Systems Easy Composition of Symbolic Computation Software: A New Lingua Franca for Symbolic Computation . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 339 Kevin Hammond, Peter Horn, Alexander Konovalov, Steve Linton, Dan Roozemond, Abdallah Al Zain and Phil Trinder Symbolic Integration At Compile Time in Finite Element Methods . . . . . . . . . . . . . . . . . 347 Karl Rupp Fast Multiplication of Large Permutations for Disk, Flash Memory and RAM . . . . . 355 Vlad Slavici, Xin Dong, Daniel Kunkle and Gene Cooperman Author Index . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 363
viii
ISSAC 2010 Organization ISSAC Steering Committee André Galligo (Chair) Elkedagmar Heinrich Elizabeth Mansfield Michael Monagan Yosuke Sato Franz Winkler
Université de Nice, France Fachgruppe Computeralgebra SIGSAM Simon Fraser University, Canada JSSAC RISC Linz, Austria
Conference Organizing Committee General Chair Program Committee Chair Local Arrangements Chair Poster Committee Chair Software Exhibits Chair Tutorials Chair Publicity Chair Treasurer
Wolfram Koepf Stephen M. Watt Ernst W. Mayr Ilias Kotsireas Michael Monagan Sergei Abramov Peter Horn Thomas Hahn
Kassel, Germany London, Ontario, Canada München, Germany Waterloo, Ontario, Canada Vancouver, Canada Moscow, Russia Kassel, Germany München, Germany
Program Committee Moulay Barkatou Alin Bostan Chris Brown James Davenport Jean-Guillaume Dumas Wayne Eberly Bettina Eick Jean-Charles Faugère Michael Kohlhase Laura Kovács Ziming Li Elizabeth Mansfield B. David Saunders Éric Schost Ekaterina Shemyakova Thomas Sturm Carlo Traverso Stephen Watt (Chair) Kazuhiro Yokoyama Lihong Zhi
Université de Limoges, France INRIA, France US Naval Academy, USA University of Bath, UK Université Joseph Fourier, France University of Calgary, Canada TU Braunschweig, Germany UPMC and INRIA, France Jacobs University, Germany Vienna University of Technology, Austria Chinese Academy of Sciences, China University of Kent, UK University of Delaware, USA University of Western Ontario, Canada RISC-Linz, Austria Universidad de Cantabria, Spain Università di Pisa, Italy University of Western Ontario, Canada Rikkyo University, Japan Chinese Academy of Sciences, China
ix
Poster Committee Ilias Kotsireas (Chair) Markus Rosenkranz Yosuke Sato Eva Zerz
Wilfrid Laurier University, Canada University of Kent, Great Britain Tokyo University of Science, Japan RWTH Aachen, Germany
External Reviewers John Abbott Sergei Abramov Victor Adamchik Martin Albrecht Dhavide Aruliah David H. Bailey Jean-Claude Bajard Peter Baumgartner Alexandre Benoit Dario A. Bini Paola Boito Sylvie Boldo Delphine Boucher Russell Bradford Michael Brickenstein Massimo Caboara Bob Caviness Bruce Char Howard Cheng Jin-San Cheng Frédéric Chyzak Thomas Cluzeau Svetlana Cojocaru Gene Cooperman Robert Corless Carlos D'Andrea Xavier Dahan Mike Dewar Daouda Diatta Philippe Elbaz-Vincent M'hammed El Kahoui Ioannis Z. Emiris William Farmer Claudia Fassino Sándor Fekete Ruyong Feng Laurent Fousse Josep Freixas Anne Frühbis-Krüger
Mitsushi Fujimoto André Galligo Xiao-Shan Gao Mickaël Gastineau Joachim von zur Gathen Thierry Gautier Keith Geddes Patrizia Gianni Mark Giesbrecht Pascal Giorgi Laureano Gonzalez-Vega Iavn Graham Kevin Hammond William Hart David Harvey Mark van Hoeij Jerome Hoffman Derek Holt Max Horn Qing-Hu Hou Evelyne Hubert Alexander Hulpke Hiroyuki Ichihara Claude-Pierre Jeannerod Tudor Jebelean David Jeffrey Jeremy Johnson Françoise Jung Erich Kaltofen Chandra Kambhamettu Deepak Kapur Manuel Kauers Achim Kehrein Denis Khmelnov Alexander Kholosha Kinji Kimura Simon King Jürgen Klüners Wolfram Koepf x
Alexander Konovalov Ilias Kotsireas Christoph Koutschan Werner Krandick Heinz Kredel Martin Kreuzer Alexander Kruppa Benoit Lacelle Christoph Lange Aless Lasaruk Daniel Lazard Wen-Shin Lee Bas Lemmens Viktor Levandovskyy Anton Leykin Guiqing Li Daniel Lichtblau Steve Linton Austin Lobo Florian Lonsing Salvador Lucas Frank Lübeck Montserrat Manubens Mircea Marin John P. May Scott McCallum Guy McCusker Guillaume Melquiond Marc Mezzarobba Johannes Middeke Maurice Mignotte Yasuhiko Minamide Niels Möller Michael Monagan Antonio Montes Teo Mora Marc Moreno Maza Guillaume Moroz Bernard Mourrain
Mircea Mustata Katsusuke Nabeshima Kosaku Nagasaka George Nakos Winfried Neun Masayuki Noro Eamonn O'Brien Takeshi Ogita François Ollivier Takeshi Osoekawa Alexey Ovchinnikov Victor Y. Pan Maura Paterson Clément Pernet Ludovic Perret John Perry Marko Petkovšek Veronika Pillwein Mihai Prunescu González Pérez Florian Rabe Silviu Radu Stefan Ratschan Greg Reid Guénaël Renault Nathalie Revol Lorenzo Robbiano Jean-Louis Roch Enric Rodríguez Carbonell J. Maurice Rojas
Markus Rosenkranz Fabrice Rouillier Olivier Ruatta Rosario Rubio Mohab Safey El Din Massimiliano Sala Bruno Salvy Yosuke Sato Peter Scheiblechner Carsten Schneider Hans Schönemann Wolfgang Schreiner Johann Schuster Fritz Schwarz Markus Schweighofer Robin Scott Werner M. Seiler Hiroshi Sekigawa Vikram Sharma Takafumi Shibuta Naoyuki Shinohara Kiyoshi Shirayanagi Igor Shparlinski Michael F. Singer Mate Soos Volker Sorge Eduardo Sáenz-de-Cabezón Allan Steel Doru Stefanescu Damien Stehlé
xi
Arne Storjohann Adam Strzeboński Masaaki Sugihara Hui Sun Ágnes Szántó Akira Terui Thorsten Theobald Emmanuel Thomé Ashish Tiwari Maria-Laura Torrente Philippe Trébuchet Elias Tsigaridas William J. Turner Róbert Vajda Xiaoshen Wang Jacques-Arthur Weil Volker Weispfenning Thomas Wolf Bican Xia Zhengfeng Yang Chee Yap Liang Ye Alberto Zanoni Doron Zeilberger Zhonggang Zeng Mingbo Zhang Yang Zhang Jun Zhao Eugene Zima
xii
ISSAC 2010 is organized by
Gesellschaft für Informatik
Fachgruppe Computeralgebra
Technische Universität München
in cooperation with
Association for Computing Machinery
Special Interest Group in Symbolic and Algebraic Manipulation
supported by
Deutsche Forschungsgemeinschaft
sponsored by
Maplesoft, Waterloo, Canada xiii
xiv
Algebraic Invariants and Their Differential Algebras Evelyne Hubert INRIA Méditerranée Sophia Antipolis, France
[email protected]
ABSTRACT
constructions are often local and the use of the implicit function theorem is not considered a problem. To bring those ideas to algorithms there is first a need for firm algebraic foundations. Those algebraic foundations are what we want to review in this talk, covering the content of [8, 12, 13, 14, 10, 11]. On one hand, the restricted question of the finite generation of differential invariants was addressed by [31, 18, 19, Categories and Subject Descriptors 20, 25], in the more general case of pseudo-groups - see also I.1.4 [Computing Methodologies]: Symbolic and Alge[29, 26] for Lie groups. braic ManipulationApplications; J.2 [Computer ApplicaIn differential geometry equivalence problems are diverse tions]: Physical Sciences and EngineeringMathematics and though their resolutions often take their roots in the work statistics[Differential Geometry]; I.4.7.1 [Computing Method- of Elie Cartan [2]. Separating invariants are exhibited by a ologies]: Image Processing and Computer VisionFeature normalization procedure within the structure equations on Measurement[Invariants] the Maurer-Cartan forms [3, 5, 6, 15, 16] We shall call them the Maurer-Cartan invariants. General Terms In their reinterpretation of Cartan’s moving frame, Fels Theory and Olver [4] addressed equivalence problems as well as finite generation, with applications beyond geometry [27, 22]. Keywords Normalized invariants, which are obtained as the normalizaSymmetry, Algebraic invariants, Differential Invariants, Movtion of the coordinate function on the space, are the focus ing frame, Differential Algebra, Differential Elimination there. Our initial motivation resided in the symmetry reduction with a view towards differential elimination. The pioneering 1. MOTIVATION AND BACKGROUND work of E. Mansfield [21] proved the adequacy of the tools A great variety of group actions arise in mathematics, provided by the reinterpretation of the moving frame method physics, science and engineering and their invariants, whether by M. Fels and P. Olver [4] and yet left many open problems. algebraic or differential, are commonly used for classification and solving equivalence problems, or symmetry reduction. Equivalence problems essentially relies on determining sepa2. PRESENTATION rating invariants, i.e. functions whose values distinguish the We characterize three different sets of generating differorbits from one another. Symmetry reduction postulates ential invariants together with their syzygies and rewriting that invariants are the best coordinates in which to think a algorithms. For the normalized invariants the syzygies can problem. Here a generating set of invariants is needed, so be constructed based on the recurrence formulae [10]. For as to rewrite the problem in terms of those. For any further the edge invariants, introduced in [28] and generalized in computational use one also requires to know the syzygies, [10], the syzygies can then be deduced by differential elimthat is, relationships among those generating invariants. ination [8]. It is then a rather simple and yet significant Contrary to the algebraic theory of invariants, the theoobservation we made that the geometry meaningful Maurerretical support for the differential invariants we concentrate Cartan invariants be generating [11]. This is of importance on belongs to differential geometry and analysis. There, the in the subject of evolution of curves and how it relates to integrable systems [1, 23, 24]. Their syzygies naturally emerge from the structure equations of the group [11]. The algebraic characterization of normalized invariants Permission to make digital or hard copies of all or part of this work for [13] entails an algorithm to compute and manipulate them personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies explicitly [12]. We can then determine the other generating bear this notice and the full citation on the first page. To copy otherwise, to sets explicitly. But this is not needed for the rewriting. republish, to post on servers or to redistribute to lists, requires prior specific The rewriting algorithms are all based on the trivial rewritpermission and/or a fee. ing for the normalized invariants together with the relationISSAC 2010, 25–28 July 2010, Munich, Germany. ship between invariant derivations and invariantization, two Copyright 2010 ACM 978-1-4503-0150-3/10/0007 ...$10.00. We review the algebraic foundations we developed to work with differential invariants of finite dimensional group actions. Those support the algorithms we introduced to operate symmetry reduction with a view towards differential elimination.
1
key concepts introduced in [4] and revisited in [13, 10]. Beside their geometrical significance, the use of Maurer-Cartan invariants at that stage avoids the introduction of denominators. We formalize the notion of syzygies through the introduction of the algebra of monotone derivatives. Along the lines of [8], this algebra is equipped with derivations that are defined inductively so as to encode their nontrivial commutation rules. The type of differential algebra introduced at this stage was shown to be a natural generalization of classical differential algebra [30, 17]. In the polynomial case, it is indeed endowed with an effective differential elimination theory that has been implemented [7, 8]. Let us point out that, while computing explicitly some (differential) invariants requires the knowledge of the action, only the knowledge of the infinitesimal generators of the action is needed for the determination of a generating set, the rewriting in terms of those and construction of the syzygies. Provided the action is given by rational functions, which covers most of encountered cases in the literature, the whole approach is algorithmic and implemented [9]. There is nonetheless one more input that is needed: a choice of cross-section. Though this can be chosen with a lot of freedom, in theory, practice shows that some are better than others. Strategy or theoretical understanding for the choice of the proper cross-section is an open problem.
3.
[13]
[14]
[15]
[16]
[17]
[18]
[19]
REFERENCES
[20]
[1] A. Calini, T. Ivey, and G. Mar´ı-Beffa. Remarks on KdV-type flows on star-shaped curves. Phys. D, 238(8):788–797, 2009. [2] E. Cartan. La m´ethode du rep`ere mobile, la th´eorie des groupes continus, et les espaces g´en´eralis´es, volume 5 of Expos´es de G´eom´etrie. Hermann, Paris, 1935. [3] J. Clelland. Lecture notes from the MSRI workshop on Lie groups and the method of moving frames. http://math.colorado.edu/~jnc/MSRI.html, 1999. [4] M. Fels and P. J. Olver. Moving coframes. II. Regularization and theoretical foundations. Acta Appl. Math., 55(2):127–208, 1999. [5] R. B. Gardner. The method of equivalence and its applications. SIAM, Philadelphia, 1989. [6] P. A. Griffiths. On Cartan’s method of Lie groups as applied to uniqueness and existence questions in differential geometry. Duke Math. J., 41:775–814, 1974. [7] E. Hubert. diffalg: extension to non commuting derivations. INRIA, Sophia Antipolis, 2005. www.inria.fr/cafe/Evelyne.Hubert/diffalg. [8] E. Hubert. Differential algebra for derivations with nontrivial commutation rules. Journal of Pure and Applied Algebra, 200(1-2):163–190, 2005. [9] E. Hubert. The maple package aida - Algebraic Invariants and their Differential Algebras. INRIA, 2007. http://www.inria.fr/cafe/Evelyne.Hubert/aida. [10] E. Hubert. Differential invariants of a Lie group action: syzygies on a generating set. Journal of Symbolic Computation, 44(3):382–416, 2009. [11] E. Hubert. Generation properties of Maurer-Cartan invariants. Preprint http://hal.inria.fr/inria-00194528, 2010. [12] E. Hubert and I. A. Kogan. Rational invariants of a
[21]
[22]
[23]
[24]
[25]
[26] [27]
[28]
[29] [30]
[31]
2
group action. Construction and rewriting. Journal of Symbolic Computation, 42(1-2):203–217, 2007. E. Hubert and I. A. Kogan. Smooth and algebraic invariants of a group action. Local and global constructions. Foundations of Computational Mathematics, 7(4), 2007. E. Hubert and P. J. Olver. Differential invariants of conformal and projective surfaces. Symmetry Integrability and Geometry: Methods and Applications, 3(097), 2007. T. A. Ivey and J. M. Landsberg. Cartan for beginners: differential geometry via moving frames and exterior differential systems, volume 61 of Graduate Studies in Mathematics. American Mathematical Society, Providence, RI, 2003. G. R. Jensen. Higher order contact of submanifolds of homogeneous spaces. Springer-Verlag, Berlin, 1977. Lecture Notes in Mathematics, Vol. 610. E. R. Kolchin. Differential Algebra and Algebraic Groups, volume 54 of Pure and Applied Mathematics. Academic Press, 1973. A. Kumpera. Invariants diff´erentiels d’un pseudogroupe de Lie. In Lecture Notes in Math., Vol. 392. Springer, Berlin, 1974. A. Kumpera. Invariants diff´erentiels d’un pseudogroupe de Lie. I. J. Differential Geometry, 10(2):289–345, 1975. A. Kumpera. Invariants diff´erentiels d’un pseudogroupe de Lie. II. J. Differential Geometry, 10(3):347–416, 1975. E. L. Mansfield. Algorithms for symmetric differential systems. Foundations of Computational Mathematics, 1(4):335–383, 2001. E. L. Mansfield. A practical guide to the invariant calculus. Number 26 in Cambridge Monographs on Applied and Computational Mathematics. Cambridge University Press, 2010. G. Mar´ı Beffa. Projective-type differential invariants and geometric curve evolutions of KdV-type in flat homogeneous manifolds. Annales de l’Institut Fourier (Grenoble), 58(4):1295–1335, 2008. G. Mar´ı Beffa. Hamiltonian evolution of curves in classical affine geometries. Physica D. Nonlinear Phenomena, 238(1):100–115, 2009. J. Mu˜ noz, F. J. Muriel, and J. Rodr´ıguez. On the finiteness of differential invariants. J. Math. Anal. Appl., 284(1):266–282, 2003. P. J. Olver. Equivalence, Invariants and Symmetry. Cambridge University Press, 1995. P. J. Olver. Moving frames: a brief survey. In Symmetry and perturbation theory (Cala Gonone, 2001), pages 143–150. World Sci. Publishing 2001. P. J. Olver. Generating differential invariants. Journal of Mathematical Analysis and Applications, 333:450–471, 2007. L. V. Ovsiannikov. Group analysis of differential equations. Academic Press Inc., New York, 1982. J. F. Ritt. Differential Algebra, volume XXXIII of Colloquium publications. American Mathematical Society, 1950. http://www.ams.org/online_bks. A. Tresse. Sur les invariants des groupes continus de transformations. Acta Mathematica, 18:1–88, 1894.
Verification Methods : Rigorous Results using Floating-Point Arithmetic Siegfried M. Rump Institute for Reliable Computing Hamburg University of Technology Schwarzenbergstraße 95, 21071 Hamburg, Germany and Visiting Professor at Waseda University Faculty of Science and Engineering 3–4–1 Okubo, Shinjuku-ku, Tokyo 169–8555, Japan
[email protected] Categories and Subject Descriptors
ing challenge to the dynamical system community, and was included by Smale in his list of problems for the new millennium. The proof uses computer estimates with rigorous bounds based on higher dimensional interval arithmetics.” Sahinidis and Tawaralani (2005) received the 2006 BealeOrchard-Hays Prize for their package BARON which (citation) “incorporates techniques from automatic differentiation, interval arithmetic, and other areas to yield an automatic, modular, and relatively efficient solver for the very difficult area of global optimization”. A main goal of this talk is to introduce the principles of how to design verification algorithms, and how these principles differ from those for traditional numerical algorithms. We begin with a brief discussion of the working tools of verification methods, in particular floating-point and interval arithmetic. In particular the development and limits of verification methods for finite dimensional problems are discussed in some detail; problems include dense systems of linear equations, sparse linear systems, systems of nonlinear equations, semi-definite programming and other special linear and nonlinear problems including M-matrices, simple and multiple roots of polynomials, bounds for simple and multiple eigenvalues or clusters, and quadrature. We mention that automatic differentiation tools to compute the range of gradients, Hessians, Taylor coefficients, and slopes are necessary. If time permits, verification methods for continuous problems, namely two-point boundary value problems and semilinear elliptic boundary value problems are presented. Throughout the talk, a number of examples of the wrong use of interval operations are given. In the past such examples contributed to the dubious reputation of interval arithmetic, whereas they are, in fact, just a misuse. Some algorithms are presented in executable Matlab/INTLAB-code. INTLAB, the Matlab toolbox for reliable computing and free for academic use, is developed and written by Rump (1999). It was, for example, used by Bornemann, Laurie, Wagon, and Waldvogel (2004) in the solution of half of the problems of the 10 × 10-digit challenge by Trefethen (2002).
F2.2.1 [Numerical Algorithms and Problems]
General Terms Verification
ABSTRACT The classical mathematical proof is performed by pencil and paper. However, there are many ways in which computers may be used in a mathematical proof. But “proofs by computers” or even the use of computers in the course of a proof are not so readily accepted (the December 2008 issue of the Notices of the American Mathematical Society is devoted to formal proofs by computers). In this talk we discuss how verification methods may assist in achieving a mathematically rigorous result. In particular we emphasize how floating-point arithmetic is used. The goal of verification methods is ambitious: For a given problem it is proved, with the aid of a computer, that there exists a (unique) solution within computed bounds. The methods are constructive, and the results are rigorous in every respect. Verification methods apply to data with tolerances as well. Rigorous results are the main goal in computer algebra. However, verification methods use solely floating-point arithmetic, so that the total computational effort is not too far from that of a purely (approximate) numerical method. Nontrivial problems have been solved using verification methods. For example: Tucker (1999) received the 2004 EMS prize awarded by the European Mathematical Society for (citation) “giving a rigorous proof that the Lorenz attractor exists for the parameter values provided by Lorenz. This was a long stand-
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. To copy otherwise, to republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. ISSAC 2010, 25–28 July 2010, Munich, Germany. Copyright 2010 ACM 978-1-4503-0150-3/10/0007 ...$10.00.
3
References F. Bornemann, D. Laurie, S. Wagon, and J. Waldvogel. The SIAM 100-Digit Challenge—A Study in High-Accuracy Numerical Computing. SIAM, Philadelphia, 2004. S.M. Rump. INTLAB - INTerval LABoratory. In Tibor Csendes, editor, Developments in Reliable Computing, pages 77–104. Kluwer Academic Publishers, Dordrecht, 1999a. URL http://www.ti3.tu-harburg.de/ rump/intlab/index.html. N.V. Sahinidis and M. Tawaralani. A polyhedral branchand-cut approach to global optimization. Math. Programming, B103:225–249, 2005. L. N. Trefethen. The SIAM 100-Dollar, 100-Digit Challenge. SIAM-NEWS, 35(6):2, 2002. http://www.siam. org/siamnews/06-02/challengedigits.pdf. W. Tucker. The Lorenz attractor exists. C. R. Acad. Sci., Paris, S´er. I, Math., 328(12):1197–1202, 1999.
4
Theory of Reals for Verification and Synthesis of Hybrid Dynamical Systems Ashish Tiwari
∗
SRI International 333 Ravenswood Ave. Menlo Park, CA
[email protected]
Categories and Subject Descriptors
dynamical systems, and hybrid systems. Hybrid dynamical systems is a popular formalism for modeling a large class of complex systems, including control systems, embedded systems, robotic systems, and biological systems. There are several different approaches for performing verification of a hybrid dynamical system, but almost all approaches rely on algorithms for reasoning in the theory of reals. Tarski [5] showed that the first-order theory of the reals is decidable [5]. However, Tarski’s procedure has hyperexponential complexity, and hence, a more efficient algorithm, based on “cylindrical algebraic decomposition” (CAD), was proposed by Collins [1]. The original CAD algorithm was further refined and optimized over the years by several authors, and it has been implemented in an impressive tool called QEPCAD [2]. It has also been argued that, for the theory of reals, algorithms with better theoretical complexity may not necessarily perform better in practice. Since the problem of reasoning on nonlinear constraints is inherently hard, there is a need for discovering and implementing procedures that best match the requirements of a particular application. The verification application alluded to above generates nonlinear constraints of mainly two different forms: ∀~x : φ(~ x) and ∃~a : ∀~ u : φ(~a, ~ u), where ~ x and ~a denote a sequence of variables and φ(~ x) denotes a formula in the theory of reals over the variables ~ x. The number of variables can be large and a procedure should be able to handle at least 20 to 30 variables to be useful. Another requirement is that the procedure should not fail and should always terminate. While not a strict requirement, incrementality in handling of the constraints is a useful attribute in verification applications. However, our application also provides some flexibilities that can be favorably used to design more practical procedures for reasoning over nonlinear constraints. A crucial flexibility provided by the verification application is that it is “incompleteness-tolerant”, that is, it can still use incomplete, but sound, procedures. Even though the formulas φ are invariably large, not all parts of the formula are relevant for proving (or disproving) its validity. Recently, we have proposed a procedure for detecting unsatisfiability of a conjunction of polynomial equations and inequalities that is favorably suited for our particular application. The procedure is based on Gr¨ obner basis computation. It can be seen as a generalization of the Simplex procedure for linear arithmetic to the case of nonlinear arithmetic. The procedure works in two steps. In the first step, all inequalities are converted into equations by introducing new variables. After applying the first step, we get a con-
I.1.2 [Symbolic and Algebraic Manipulation]: Algorithms—Algebraic algorithms; I.2.3 [Artificial Intelligence]: Deduction and Theorem Proving—Inference engines
General Terms Verification, Algorithms
Keywords Hybrid Dynamical Systems, Theory of Reals
ABSTRACT Real numbers are used to model all physical processes around us. The temperature of a room, the speed of a car, the angle of attack of an airplane, protein concentration in a cell, blood glucose concentration in a human, and the amount of chemical in a tank are a few of the countless quantities that arise in science and engineering and that are modeled using real-valued variables. Many of these physical quantities are now being controlled by embedded software running on some hardware platform. The resulting systems could possibly be communicating and coordinating with other such systems and reacting actively to changes in their environment. The net result is a complex cyber-physical system. Several such systems operate in safety-critical domains, such as transportation and health care, where failures can potentially cause a lot of financial as well as human life loss. Formal verification and synthesis are both indispensable components of any methodology for designing and efficiently developing safe cyber-physical systems. Mathematically, a cyber-physical system is a dynamical system – a system that evolves or changes over time. Dynamical systems are modeled using many different formalisms, such as, discrete state transition systems, continuous-time ∗Supported in part by NSF grants CNS-0720721 and CSR0917398 and NASA grant NNX08AB95A.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. To copy otherwise, to republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. ISSAC 2010, 25–28 July 2010, Munich, Germany. Copyright 2010 ACM 978-1-4503-0150-3/10/0007 ...$10.00.
5
junction of equations (and some disequations of the form u 6= 0, where u is a new variable) and we have to decide its satisfiability. Let us denote the new set of equations as P = 0, where P is a set of polynomials. In the second step, we search for a positive definite polynomial in the ideal of P . If we successfully find a positive definite polynomial in the ideal of P , then we can conclude that the original formula was unsatisfiable. For finding a positive definite polynomial in an ideal, we use Gr¨ obner basis computation under different term orderings. The observation here is that members of an ideal that are minimal (in the ordering) appear explicitly in the Gr¨ obner basis (constructed using that ordering). The refutational completeness of the procedure is a consequence of the Positivstellansatz theorem from real algebraic geometry [6]. There are several other efforts in building practical procedures for reasoning with nonlinear constraints. One popular approach is based on detecting if a polynomial is a sumof-squares (positive definite) using semi-definite programming [4, 3]. This suggests the natural idea of combining procedures based on numerical calculations and symbolic reasoning to obtain practical and scalable solvers for nonlinear arithmetic.
1.
REFERENCES
[1] G. E. Collins. Quantifier elimination for the elementary theory of real closed fields by cylindrical algebraic decomposition. In Proc. 2nd GI Conf. Automata Theory and Formal Languages, volume 33 of LNCS, pages 134–183. Springer, 1975. [2] H. Hong and C. Brown. Quantifier elimination procedure by cylindrical algebraic decomposition. www.usna.edu/Users/cs/qepcad/B/QEPCAD.html. [3] P. A. Parrilo. Semidefinite programming relaxations for semialgebraic problems. Mathematical Programming Ser. B, 96(2):293–320, 2003. [4] S. Prajna, A. Papachristodoulou, and P. A. Parrilo. SOSTOOLS: Sum of Square Optimization Toolbox, 2002. http://www.cds.caltech.edu/sostools. [5] A. Tarski. A Decision Method for Elementary Algebra and Geometry. University of California Press, 1948. Second edition. [6] A. Tiwari. An algebraic approach for the unsatisfiability of nonlinear constraints. In Computer Science Logic, 14th Annual Conf., CSL 2005, volume 3634 of LNCS, pages 248–262. Springer, 2005.
6
Symbolic Methods for Solving Systems of Linear Ordinary Differential Equations Moulay A. Barkatou University of Limoges; CNRS XLIM/DMI UMR 6172 87060 Limoges, France
[email protected] ABSTRACT
toring a given differential system. The last part of the tutorial will present some recent developments including algorithms for solving directly systems of higher order differential equations, algorithms for differential systems in positive characteristic and formal reduction of pfaffian systems.
The main purpose of this tutorial is to present and explain symbolic methods for studying systems of linear ordinary differential equations with emphasis on direct methods and their implementation in computer algebra systems.
2.
Categories and Subject Descriptors
[1] S. A. Abramov, M. Bronstein, D. E. Khmelnov. On Regular and Logarithmic Solutions of Ordinary Linear Differential Systems. CASC 2005: 1-12. [2] D.G. Babbitt, V.S. Varadarajan. Formal reduction of meromorphic differential equations: a group theoretic view. Pacific Journal of Mathematics, 109(1), 1-80, 1983. [3] W. Balser. Formal power series and linear systems of meromorphic ordinary differential equations, Springer-Verlag (2000). [4] W. Balser, W. B. Jurkat, D. A. Lutz. A General Theory of Invariants for Meromorphic Differential Equations; Part I, Formal Invariants, Funkcialaj ekvacioj 22, (1979), 197-221. [5] M. A. Barkatou. An algorithm for computing a companion block diagonal form for a system of linear differential equations, AAECC 4 (1993), 185-195. [6] M. A. Barkatou. A Rational Version of Moser’s Algorithm. ISSAC 1995: 297-302. [7] M. A. Barkatou. An algorithm to compute the exponential part of a formal fundamental matrix solution of a linear differential system, AAECC, 8-1 (1997) 1-23. [8] M. A. Barkatou. On Rational Solutions of Systems of Linear Differential Equations. Journal of Symbolic Computation 28, 547–567, 1999. [9] M. A. Barkatou. On super-irreducible forms of linear differential systems with rational function coefficients. Journal of Computational and Applied Mathematics, 162(1):1–15, 2004. [10] M. A. Barkatou. Factoring systems of linear functional equations using eigenrings. I. S. Kotsireas and E. V. Zima, editors, Latest Advances in Symbolic Algorithms, pages 22–42. World Scientific, 2007. [11] M. A. Barkatou, E. Pfl¨ ugel. An algorithm computing the regular formal solutions of a system of linear differential equations. Journal of Symbolic Computation, 28:569–588, 1999.
I.1.2 [Symbolic and Algebraic Manipulation]: Algorithms
General Terms Algorithms
Keywords Computer Algebra, Linear Systems of Differential Equations, Reduction Algorithms, Singularities, Formal Solutions, Closedform Solutions
1.
REFERENCES
INTRODUCTION
Whether one is interested in global problems (finding closed form solutions, testing reducibility, computing properties of the differential Galois group) or in local problems (computing formal invariants or formal solutions) of linear differential scalar equations or systems, one has to develop and use appropriate tools for local analysis the purpose of which is to describe the behavior of the solutions near a point x0 without knowing these solutions in advance. After introducing the basic tools of local analysis we present the state of the art of existing algorithms and programs for solving the main local problems such as determining the type of a given singularity, computing the rank of a singularity, computing the Newton polygon and Newton polynomials at a given singularity, finding formal solutions, etc. Next we explain how by piecing together the local information around the different singularities one can solve some global problems such as finding rational solutions, exponential solutions, fac-
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. To copy otherwise, to republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. ISSAC 2010, 25–28 July 2010, Munich, Germany. Copyright 2010 ACM 978-1-4503-0150-3/10/0007 ...$10.00.
7
[12] M. A. Barkatou, N. Le Roux. Rank reduction of a class of pfaffian systems in two variables. ISSAC 2006: 204-211. [13] M. A. Barkatou, E. Pfl¨ ugel. On the Moser- and super-reduction algorithms of systems of linear differential equations and their complexity. J. Symbolic Computation, 44(8):1017-1036, 2009. [14] M. A. Barkatou, E. Pfl¨ ugel. Computing super-irreducible forms of systems of linear differential equations via moser-reduction: a new approach. ISSAC 2007: 1-8. [15] M. A. Barkatou, E. Pfl¨ ugel. On the Equivalence Problem of Linear Differential Systems and Its Application for Factoring Completely Reducible Systems. ISSAC 1998: 268-275. [16] M. A. Barkatou, E. Pfl¨ ugel. The ISOLDE package, a SourceForge Open Source project, http://isolde.sourceforge.net. [17] M. A. Barkatou, T. Cluzeau, C. El Bacha. Algorithms for regular solutions of higher-order linear differential systems. ISSAC 2009: 7-14. [18] M. A. Barkatou, T. Cluzeau, J.-A. Weil. Factoring partial differential systems in positive characteristic. Differential Equations and Symbolic Computations (DESC) Book, Editor D. Wang, Birkh¨ auser, 2005. [19] T. Cluzeau. Factorization of differential systems in characteristic p. In: Proceedings of ISSAC’03. ACM, New York, NY, USA, pp. 58–65. [20] T. Cluzeau. Algorithmique modulaire des ´equations diff´erentielles lin´eaires. Th`ese de l’universit´e de Limoges, Septembre 2004. [21] G. Chen. An algorithm for computing the formal solutions of differential systems in the neighborhood of an irregular singular point. ISSAC’90, pp. 231-235. [22] R. C. Churchill, J. J. Kovacic. Cyclic vectors, Differential Algebra and related topics. World Sci. Publishing (2002), 191-218. [23] F. T. Cope. Formal solutions of irregular differential equations, Part II, Amer. J. Math. 58 (1936), 130-140. [24] E. A. Coddington, N. Levinson. Theory of Ordinary Differential Equations, Mc Graw-Hill Book Company, INC New York (1955) [25] E. Corel. Algorithmic computation of exponents for linear differential systems. From combinatorics to dynamical systems, 17–61, IRMA Lect. Math. Theor. Phys., 3, de Gruyter, Berlin, 2003. [26] V. Dietrich. Zur Reduktion von linearen Differentialgleichungssystemen. Math. Ann. 237, (1978) 79–95. [27] A. Hilali, A. Wazner. Formes super-irr´eductibles des syst`emes diff´erentiels lin´eaires. Numerische Mathematik, 50:429-449, 1987. [28] A. H. M. Levelt. Stabilizing differential operators: a method for computing invariants at irregular singularities , CADE (1991) Comput. Math. and Appl., M. Singer Editor, Academic Press Ltd, 181-128. [29] M. Loday-Richaud. Solutions formelles des syst`emes diff´erentiels lin´eaires m´eromorphes et
[30]
[31] [32]
[33]
[34]
[35]
[36]
[37]
[38]
[39]
[40]
[41]
[42]
8
sommation. Exposition. Math. 13 (1995), no. 2-3, 116–162. D. A. Lutz, R. Sch¨ afke. On the identification and stability of formal invariants for singular differential equations. Linear Algebra and its Applications 72, (1985) 1-46. J. Moser. The order of a singularity in Fuchs’ theory, Math. Z. 72, (1960), 379–398. E. Pfl¨ ugel. An Algorithm for Computing Exponential Solutions of First Order Linear Differential Systems. ISSAC 1997: 164-17. E. Pfl¨ ugel. Effective formal reduction of linear differential systems. Appl. Alg. Eng. Comm. Comp. 10 (2), (2000) 153–187. M. van der Put and M. F. Singer. Galois Theory of Linear Differential Equations Grundlehren der mathematischen Wissenschaften, vol. 328, Springer, 2003. R. Sommeling. Characteristic classes for irregular singularities. PhD thesis, University of Nijmegen, 1993. L. Sauvage. Sur les solutions r´eguli`eres d’un syst`eme d’´equations diff´erentielles, Ann. Sc. ENS 3, (1886), 391-404. Y. Sibuya, Linear differential equations in the complex domain: problems of analytic continuation, Translated from Japanese by the author, Translations of Mathematical Monographs 82, A.M.S. (1990). H. L. Turrittin. Convergent solutions for ordinnary linear homogeneous differential equations in the neighborhood of an irregular singular point, Acta Math. 93, (1955), 27-66 V. S. Varadarajan. Linear meromorphic differential equations: a modern point of view. Bull. Amer. Math. Soc. (N.S.) 33 (1996), no. 1, 1–42. E. Wagenf¨ uhrer. On the Computation of Formal Fundamental Solutions of Linear Differential Equations at a Singular Point. Analysis,. 9: 389–405, 1989. E. Wagenf¨ uhrer. Formal series solutions of singular systems of linear differential equations and singular matrix pencils. J. Fac. Sci. Univ. Tokyo Sect. IA Math. 36 (1989), no. 3, 681–702. W. Wasow. Asymptotic expansions for ordinary differential equations, Interscience, New York, (1965); reprint R.E. Krieger Publishing Co, inc. (1976).
Asymptotically Fast Algorithms for Modern Computer Algebra Jürgen Gerhard Maplesoft Waterloo, Ontario, Canada
[email protected] ABSTRACT
An abundance of higher-level computational problems for polynomials, including but not limited to division [11], evaluation and interpolation [1], greatest common divisors [13], factorization [15], symbolic integration [5] and symbolic summation [6] can be reduced to polynomial multiplication, and any speedup in the underlying basic polynomial arithmetic immediately translates into a speedup of about the same order of magnitude for these advanced algorithms as well. The techniques for fast symbolic computation have some of their roots in numerical analysis (fast Fourier transform, Newton iteration) and computer science (e.g., divide-andconquer, work balancing). A somewhat unique ingredient in computer algebra, however, is the omnipresent and powerful scheme of modular algorithms. The techniques mentioned above work well not only for polynomial arithmetic, but can be extended (with some notable exceptions) to integer arithmetic as well [9], and often the same or similar techniques apply or can be used in linear algebra [12]. Optimizations make asymptotically fast algorithms practical and powerful. Determining the break-even points between classical and fast algorithms for hybrid schemes can be challenging and platform dependent. The Golden Rules of Sch¨ onhage et al [8] for the development of fast algorithms apply, notably:
The solution of computational tasks from the “real world” requires high performance computations. Not limited to mathematical computing, asymptotically fast algorithms have become one of the major contributing factors in this area. Based on [4], the tutorial will give an introduction to the beauty and elegance of modern computer algebra.
Categories and Subject Descriptors I.1.2 [Symbolic and Algebraic Manipulation]: Algorithms; F.2.1 [Analysis of Algorithms and Problem Complexity]: Numerical Algorithms and Problems—computations on polynomials; G.4 [Mathematics of Computing]: Mathematical Software—algorithm design and analysis, efficiency
General Terms Theory
Keywords fast algorithms, computer algebra
1.
INTRODUCTION
• Do care about the size of O(1)!
Mathematical software has long advanced beyond its academic nursery and has become a standard tool in industrial design and analysis practice. The size of industrial problems made it necessary not just for numerical computation packages but also for computer algebra systems to increase their performance. More and more symbolic computation systems and packages, such as GMP [14], Magma [2], Maple [7], and NTL [10], now feature implementations of asymptotically fast algorithms that scale almost linearly with the input size.
2.
• Do not waste a factor of two! • Don’t forget the algorithms in object design! • Clean results by approximate methods is sometimes much faster!
3.
REFERENCES
[1] A. Borodin and I. Munro. The Computational Complexity of Algebraic and Numeric Problems, volume 1 of Theory of computation series. American Elsevier Publishing Company, New York, 1975. [2] J. J. Cannon and W. Bosma, editors. Handbook of Magma Functions, Edition 2.13. 2006. magma.maths.usyd.edu.au. [3] J. W. Cooley and J. W. Tukey. An algorithm for the machine calculation of complex Fourier series. Mathematics of Computation, 19:297–301, 1965. [4] J. von zur Gathen and J. Gerhard. Modern Computer Algebra. Cambridge University Press, 2nd edition, 2003.
FAST ALGORITHMS
At the heart of asymptotically fast polynomial arithmetic lies fast multiplication, e.g., by the fast Fourier transform [3].
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. To copy otherwise, to republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. ISSAC 2010, 25–28 July 2010, Munich, Germany. Copyright 2010 ACM 978-1-4503-0150-3/10/0007 ...$10.00.
9
[5] J. Gerhard. Fast modular algorithms for squarefree factorization and Hermite integration. Applicable Algebra in Engineering, Communication and Computing, 11(3):203–226, 2001. [6] J. Gerhard. Modular Algorithms in Symbolic Summation and Symbolic Integration, volume 3218 of Lecture Notes in Computer Science. Springer Verlag, 2004. [7] Maplesoft. Maple – Math & Engineering Software. www.maplesoft.com/products/Maple/index.aspx. [8] A. Sch¨ onhage, A. F. W. Grotefeld, and E. Vetter. Fast Algorithms – A Multitape Turing Machine Implementation. BI Wissenschaftsverlag, Mannheim, 1994. [9] A. Sch¨ onhage and V. Strassen. Schnelle Multiplikation großer Zahlen. Computing, 7:281–292, 1971. [10] V. Shoup. NTL: A library for doing number theory. www.shoup.net/ntl. [11] M. Sieveking. An algorithm for division of powerseries. Computing, 10:153–156, 1972. [12] V. Strassen. Gaussian elimination is not optimal. Numerische Mathematik, 13:354–356, 1969. [13] V. Strassen. The computational complexity of continued fractions. SIAM Journal on Computing, 12(1):1–27, 1983. [14] Various authors. The GNU multiple precision arithmetic library. www.gmplib.org. [15] H. Zassenhaus. On Hensel factorization, I. Journal of Number Theory, 1:291–311, 1969.
10
Transformation and Factorization of Partial Differential Systems: Applications to Stochastic Systems S.P. Tsarev Siberian Federal University Svobodnyi avenue, 79 660041, Krasnoyarsk, Russia
[email protected] ABSTRACT Factorization of linear ordinary differential operators with variable coefficients is one of the well-known methods used for solution of the corresponding differential equations. Factorization of linear partial differential operators is a much more complicated problem. An appropriate modification of the “naive” definition of factorization gives rise to a bunch of new methods of closed-form solution of a single linear partial differential equation or a system of such equations. This approach is naturally related to differential transformations— another popular method of solution of differential equations.
operators does not enjoy good algebraic properties and in general is not related to existence of a complete closed-form solution. In this tutorial we present the old but still fruitful Laplace cascade method for solution of a class of linear partial differential equations as well as a number of its latest modifications and generalizations. We explain an important and nontrivial link to a generalized notion of factorization of LDPOs proposed recently [9, 11]. An application [3] to solution of an interesting system of linear partial differential equations describing the behavior of a simple nonlinear stochastic ordinary differential equation will be described.
Categories and Subject Descriptors
2.
G.0 [Mathematics of Computing]: GENERAL
ALGEBRAIC THEORIES OF FACTORIZATION FOR LODOS AND LPDOS
One of the basic algebraic results in the theory of factorzation of LODOs was obtained in the beginning of the 20th century:
General Terms Theory
Theorem 1 (E. Landau [5]). Any two different decompositions of a given LODO L into products of irreducible LODOs L = P1 · · · · · Pk = P 1 · · · · · P p have the same number of factors (k = p) and the factors have equal orders (after a transposition).
Keywords Integration of partial differential equations, factorization
1.
INTRODUCTION Unfortunately simple examples (see e.g. [9]) show that for LPDOs this nice theorem does not hold. An algebraic explanation lies in the fact that the (noncommutative) ring of LODOs has only principal left and right ideals, i.e. every its ideal is generated by one LODO; for the ring of LPDOs this is no longer true—in fact already the ring of commutative multivariate polynomials does not have this property, although the latter is a unique factorization domain. This implies that one should develop an alternative algebraic definition of factorization capable of providing an analogue of Landau theorem and integrating into a unified framework different methods of reduction of the order of linear partial differential equations with various classical transformations, such as Laplace and Moutard transformations (see [2]). A number of partial algorithms for closed-form solution of systems of linear partial differential equations are known, starting with the almost forgotten old results [7, 8]. These and different modern results [1, 4, 10, 12] may serve as a hint for existence of a unified view. An algebraic approach to the problem was proposed in [9, 11]. An adequate algebraic structure suitable to serve as a basis for unification of all known partial results will be exposed.
Factorization of polynomials is a popular topic in lecture courses presenting modern algorithms of computer algebra. Factorization of linear ordinary differential operators with variable coefficients (LODOs) is less known but is an important method used for solution of the corresponding differential equations. Now we have a complete (although highly complex) algorithm for factorization of an arbitrary LODO with rational functions as coefficients. A number of important old [5, 6] and new results in this field are summarized in [13]. Theory of factorization of linear partial differential operators (LPDOs) is even less popular due to a simple fact: a “naive” definition of factorization of a given LPDO L as its representation as a composition L = L1 ◦ L2 of lower-order
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. To copy otherwise, to republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. ISSAC 2010, 25–28 July 2010, Munich, Germany. Copyright 2010 ACM 978-1-4503-0150-3/10/0007 ...$10.00.
11
3.
ACKNOWLEDGMENTS
This research was partially supported by the RFBR Grant 09-01-00762-a.
4.
REFERENCES
[1] C. Athorne. A Z2 × R3 Toda system. Phys. Lett. A, 206:162–166, 1995. [2] G. Darboux. Le¸cons sur la th´eorie g´en´erale des surfaces et les applications g´eom´etriques du calcul infinit´esimal. T. 2. Gauthier-Villars, 1889. [3] E.I. Ganzha, V.M. Loginov, S.P. Tsarev. Exact solutions of hyperbolic systems of kinetic equations. Application to Verhulst model with random perturbation. Mathematics of Computation, 1(3):459–472, 2008. e-print http://www.arxiv.org/, math.AP/0612793. [4] D. Grigoriev, F. Schwarz. Factoring and solving linear partial differential equations, Computing, 73:179–197, 2004. ¨ [5] E. Landau. Uber irreduzible Differentialgleichungen. J. f¨ ur die reine und angewandte Mathematik 124:115–120, 1902. ¨ [6] A. Loewy. Uber reduzible lineare homogene Differentialgleichungen, Math. Annalen 56:549–584, 1903. [7] J.Le Roux. Extensions de la m´ethode de Laplace aux ´equations lin´eaires aux deriv´ees partielles d’ordre sup´erieur au second. Bull. Soc. Math. France, 27:237–262, 1899. A digitized copy is obtainable from http://www.numdam.org/ [8] L. Petr´en. Extension de la m´ethode de Laplace aux P Pn ∂ i+1 z ∂iz ´equations n−1 i=0 A1i ∂x∂y i + i=0 A0i ∂y i = 0. Lund Univ. Arsskrift, 7(3):1–166, 1911. [9] S.P. Tsarev. Factorization of linear partial differential operators and Darboux integrability of nonlinear PDEs. SIGSAM Bulletin 32(4):21–28, 1998. E-print http://www.arxiv.org/ cs.SC/9811002. [10] S.P. Tsarev. Generalized Laplace Transformations and Integration of Hyperbolic Systems of Linear Partial Differential Equations. Proc. ISSAC’2005, ACM Press. 2005. P. 325–331; also e-print cs.SC/0501030 at http://www.archiv.org/. [11] S.P. Tsarev. Factorization of Linear Differential Operators and Systems. In: Algebraic Theory of Differential Equations (Eds. M. A. H. MacCallum, A. V. Mikhailov), London Mathematical Society Lecture Note Series (No. 357), CUP, 2008, p. 111-131. Also E-print: http://arxiv.org/abs/0801.1341 [12] Ziming Li, F. Schwarz, S.P. Tsarev. Factoring systems of linear PDEs with finite-dimensional solution spaces. J. Symbolic Computation 36:443–471, 2003. [13] M. van der Put, M.F. Singer. Galois Theory of Linear Differential Equations, Grundlehren der Mathematischen Wissenschaften, v. 328, Springer, 2003.
12
A New Incremental Algorithm for Computing Groebner Bases Shuhong Gao
∗†
Dept. of Math. Sciences Clemson University Clemson, SC 29634-0975
[email protected]
Yinhua Guan
Frank Volny IV
Dept. of Math. Sciences Clemson University Clemson, SC 29634-0975
Dept. of Math. Sciences Clemson University Clemson, SC 29634-0975
[email protected]
[email protected]
ABSTRACT
1.
In this paper, we present a new algorithm for computing Gr¨ obner bases. Our algorithm is incremental in the same fashion as F5 and F5C. At a typical step, one is given a Gr¨ obner basis G for an ideal I and any polynomial g, and it is desired to compute a Gr¨ obner basis for the new ideal hI, gi, obtained from I by joining g. Let (I : g) denote the colon ideal of I divided by g. Our algorithm computes Gr¨ obner bases for hI, gi and (I : g) simultaneously. In previous algorithms, S-polynomials that reduce to zero are useless, in fact, F5 tries to avoid such reductions as much as possible. In our algorithm, however, these “useless” S-polynomials give elements in (I : g) and are useful in speeding up the subsequent computations. Computer experiments on some benchmark examples indicate that our algorithm is much more efficient (two to ten times faster) than F5 and F5C.
In Buchberger’s algorithm (1965, [1, 2, 3]), one has to reduce many “useless” S-polynomials (i.e. those that reduce to 0 via long division), and each reduction is time consuming. Faug`ere (1999, [9]) introduced a reduction method (F4) that can efficiently reduce many polynomials simultaneously; see also Joux and Vtse (2010, [11]) for a recent variant of F4. Lazard (1983, [13]) pointed out the connection between a Gr¨ obner basis and linear algebra, that is, a Gr¨ obner basis can be computed by Gauss elimination of Macaulay matrices (1902, [14]). This idea is implemented as XL type algorithms by Courtois et al. (2000,[5]), Ding et al. (2008, [7]), Mohammed et al. (2008–2009, [15, 16]), and Buchman et al. (2010, [4]). The linear algebra approach can be viewed as a fast reduction method. The main problem with these approaches is that the memory usage grows very quickly, and in practice the computation for even a small problem can not be done simply due to memory running out. Faug`ere (2002, [10]) introduced the idea of signatures and rewriting rules that can detect many useless S-polynomials hence saving a significant amount of time that would be used in reducing them. By computer experiments, Faug`ere showed that his algorithm F5 is many times faster than previous algorithms. However, F5 seems difficult to both understand and implement. Eder and Perry (2009, [8]) simplified some of the steps in F5 and gave a variant called F5C which is almost always faster than F5. We should note that Sun and Wang (2009, [17]) also give a new proof and some improvement for F5. Our main purpose of the current paper is to present a new algorithm that is both simpler and more efficient than F5 and F5C. Our algorithm is incremental just like F5 and F5C. Let F be any field and R = F[x1 , · · · , xn ]. Fix an arbitrary monomial order on R. At a typical iterative step, a Gr¨ obner basis G for an ideal I in R is already computed, and it is desired to compute a Gr¨ obner basis for the new ideal hI, gi for a given polynomial g ∈ R. In F5, the basis G may not be reduced, thus containing many redundant polynomials. F5C is the same as F5 except that G is replaced by a reduced Gr¨ obner basis in the next iterative step. Our algorithm will use a reduced Gr¨ obner basis G as in F5C, but the crucial difference is that we introduce a so-called “super topreduction” to detect “useless” polynomials. Furthermore, if there happens to be a polynomial that reduces to 0, it will be used to detect more “useless” polynomials. Hence reduction to 0 in our algorithm is not “useless” at all. In fact, it gives
Categories and Subject Descriptors I.1.2 [Symbolic and Algebraic Manipulation]: Algorithms—Algebraic Algorithms; F.2.1 [Analysis of Algorithms and Problem Complexity]: Numerical Algorithms and Problems—Computations on Polynomials
General Terms Algorithms
Keywords Gr¨ obner basis, Buchberger’s Algorithm, Colon ideal, F5 Algorithm ∗The three authors were partially supported by National Science Foundation under grants DMS-0302549 and CCF0830481, and National Security Agency under grant H9823008-1-0030. †We would also like to thank the referees for their very helpful comments and suggestions.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. To copy otherwise, to republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. ISSAC 2010, 25–28 July 2010, Munich, Germany. Copyright 2010 ACM 978-1-4503-0150-3/10/0007 ...$10.00.
13
INTRODUCTION
that is, B(I) consists of all the monomials that are not reducible by LM(I).1 Then B(I) is a linear basis for R/I over F. We assume the monomials in B(I) are ordered in increasing order, that is, xαi ≺ xαj whenever i < j. Please note that when I is not 0-dimensional, N is ∞ and it is possible that there are infinitely many monomials between some two monomials in B(I) (especially for lex order). The following proof is for an arbitrary ideal I. Suppose α1 x h1 (x) xα2 h2 (x) (3) .. · g ≡ .. (mod G) . . xαN hN (x)
us a polynomial in the colon ideal (I : g) = {u ∈ R : ug ∈ I}.
(1)
It is of independent interest to have an efficient algorithm for computing Gr¨ obner bases for colon ideals of the form (I : g), as it is a routine repeatedly used in primary decomposition, especially in separating components of different dimensions. In Section 2, we shall present a relation between the Gr¨ obner bases of hI, gi and (I : g). This is based on the exact sequence of R-modules: 0 −→ R/(I : g) −→ R/I −→ R/hI, gi −→ 0 where the second morphism is defined by multiplication by g, which is injective by the definition in (1), and the third is the canonical morphism. The exactness of the sequence implies that dimF (R/I) = dimF (R/hI, gi) + dimF (R/(I : g)).
= α1
(4)
αN
where hi ∈ spanF (x , . . . , x ), 1 ≤ i ≤ N , that is, each hi is the normal form of xαi · g mod G, and A ∈ FN ×N is a matrix with the ith row representing the coefficients of hi , 1 ≤ i ≤ N. Note the matrix A in (4) has an important property that is useful for finding points (or solutions) of the algebraic variety defined by the ideal I. In fact, when I is zero-dimensional, the eigenvalues of A correspond to the values of the polynomial g when evaluated at the points in the variety of I (and the corresponding eigenvectors are determined by the points alone, independent of g); for more details see Chapter 2 in [6]. Now apply the following row operations to both sides of (3) (equivalently (4)):
(2)
For an arbitrary ideal I, we show in Section 2 how to compute F-linear bases for all of these vector spaces from a given Gr¨ obner basis for I. In particular, we have the following result. Theorem. Suppose I is a zero-dimensional ideal in R = F[x1 , · · · , xn ]. Let N = dimF (R/I) (which is equal to the number of common solutions of I over the algebraic closure of F, counting multiplicities). Then, given a Gr¨ obner basis for I (under any monomial order) and a polynomial g ∈ R, Gr¨ obner bases for hI, gi and (I : g) can be computed deterministically using O((nN )3 ) operations in F. The time complexity claimed by the theorem is of interest only when N is small compared to n (say N = nO(1) ). For when N is large or ∞, we introduce an enhanced algorithm in Section 3. We shall define regular top-reductions and super top-reductions, as well as J-polynomials and J-signatures for any pair of polynomials. A J-polynomial means the joint of two polynomials, which is different from an S-polynomial but plays a similar role. Our algorithm is very similar to Buchberger’s algorithm, where we replace S-polynomials by J-polynomials and “reduction” by “regular top-reduction”. There are, however, two new features: (a) a super topreduction is introduced to detect a useless J-polynomial, and (b) each reduction to zero gives a polynomial in (I : g) and is subsequently used in detecting future useless J-polynomials. We have implemented the resulting algorithm in Singular. In Section 4, we present some comparisons with F5 and F5C. Our computer experiments on several benchmark examples show that the new algorithm is more efficient, often two to ten times faster than F5 and F5C.
2.
A(xα1 , xα2 , . . . , xαN )T ,
(R1) for 1 ≤ i < j ≤ N and a ∈ F, subtract from the j th row by the ith row multiplied by a (i.e. Aj := Aj − aAi ), (R2) for a ∈ F with a 6= 0, multiply the ith row by a. This means that we only apply row operations downward as one would perform Gauss elimination (to equation (4)) to get a triangular matrix. For example, suppose xβ is the leading monomial of h1 (x). We can use h1 (x) to eliminate the term xβ in all hj (x), 2 ≤ j ≤ N . In fact, we only need to eliminate it if it’s the leading term. Then continue with the leading monomial of the resulting h2 (x) and so on. Since a monomial order is a well ordering, there is no infinite decreasing sequence of monomials, hence each hi (x) needs only be reduced by finitely many rows above it (even if there are infinitely many rows about the row of hi (x)). Therefore, using downward row operations, the right hand side of (3) can be transformed into a quasi-triangular form, say u1 (x) v1 (x) u2 (x) v2 (x) (5) .. · g ≡ .. (mod G), . . uN (x) vN (x)
THEORY
We give a computational proof for the correspondence of linear bases for the equation (1) and the theorem mentioned in the previous section. The proof itself is more important than the theorem for our algorithm presented in the next section. Let I be an arbitrary ideal in R = F[x1 , . . . , xn ] and g any polynomial in R. Suppose we know a Gr¨ obner basis G for I with respect to some monomial order ≺. Then we can find the standard monomial basis for R/I:
where ui (x) and vi (x) are in spanF (xα1 , . . . , xαN ), and for each 1 ≤ i, j ≤ N with vi (x) 6= 0 and vj (x) 6= 0, we have LM(vi (x)) 6= LM(vj (x)), i.e. the nonzero rows of the right hand side have distinct leading monomials. Since row operations are downward only, and the B(I) are written in increasing order, we have that each ui (x) is monic 1 We say that a polynomial f is reducible by a set of polynomials G if LM(f ) is divisible by LM(g) for some g ∈ G.
B(I) = {xα1 = 1, xα2 , . . . , xαN } ,
14
and
and αi
LM(ui (x)) = x , 1 ≤ i ≤ N.
f ·g ≡w·g ≡
Let
N X
ci vi (x)
(mod G).
i=1
G0
=
G ∪ {ui (x) : 1 ≤ i ≤ N with vi (x) = 0}, and
G1
=
G ∪ {vi (x) : 1 ≤ i ≤ N }.
As f ∈ (I : g), we have f · g ∈ I, so f · g ≡ 0 (mod G). P This implies that N i=1 ci vi (x) = 0, hence ci = 0 whenever vi (x) 6= 0, as the nonzero vi (x)’s have distinct leading monomials. Thus X ci ui (x) (mod G). (9) f ≡ w(x) ≡
Certainly, G1 ⊆ hI, gi and G0 ⊆ (I : g) (as ui (x) · g ∈ I whenever vi (x) = 0). We prove the following: (a) G0 is a Gr¨ obner basis for (I : g), and
ui ∈G0
This implies that f can be reduced to 0 by G0 via long division. Therefore, G0 is a Gr¨ obner basis for (I : g). For (b), for any f ∈ hI, gi, there exists w(x) of the form (6) such that
(b) G1 is a Gr¨ obner basis for hI, gi. Since (5) is obtained from (3) by downward row operations, there is an upper triangular nonsingular matrix M ∈ FN ×N (with each row containing only finitely many nonzero entries) such that
f ≡ w(x) · g By (8),
(u1 (x), . . . , uN (x))T = M (xα1 , . . . , xαN )T , and
f ≡ w(x) · g ≡ T
T
wi xαi , wi ∈ F,
(6)
i=1
=
(c1 , . . . , cN )(u1 (x), . . . , uN (x))T ,
N X
ci ui (x),
(11)
Recall that LM(uj (x)) = xαj , 1 ≤ j ≤ N . For each 1 ≤ j ≤ N , if vj (x) = 0, then uj (x) ∈ G0 , so xαj 6∈ B(I : g). If vj (x) 6= 0, we claim that there is no f ∈ (I : g) such that LM(f ) = xαj . Suppose otherwise. Then f ≡ w(x) (mod G) for some w(x) as in (6) and LM(w(x)) = LM(f ) = xαj . By (9), xαj must be equal to the leading monomial of some ui (x) ∈ G0 , hence uj (x) ∈ G0 . This contradicts the assumption that vj (x) 6= 0. Hence (11) holds. Next we claim that
i.e. w(x) =
(mod G). (10)
B(I : g) ⊆ B(I) = {xα1 , . . . , xαN }.
Note that the vector (c1 , . . . , cN ) contains only finitely many nonzero entries, as it is a linear combination of finitely many rows of M −1 . Then we have (w1 , . . . , wN )M −1 M (xα1 , . . . , xαN )T
ci vi (x)
vi (x)6=0
Since I ⊆ (I : g), we have
(c1 , . . . , cN ) = (w1 , . . . , wN )M −1 ∈ FN .
=
X
B(I : g) = {xαj : 1 ≤ j ≤ N and vj (x) 6= 0}.
where there are only finitely many nonzero wi ’s. Let
w(x)
ci vi (x) =
Hence f can be reduced to 0 by G ∪ {vi (x) : 1 ≤ i ≤ N } via long division. This shows that G1 is a Gr¨ obner basis for hI, gi. Now we explicitly describe B(I : g) and B(hI, gi), the standard monomial bases for R/(I : g) and R/hI, gi, respectively. We first show that
Even though N could be infinite, M does have an inverse M −1 with each row containing only finitely many nonzero entries. For any w(x) ∈ R/I, we can write it as N X
N X i=1
(v1 (x), . . . , vN (x)) = M (h1 (x), . . . , hN (x)) .
w(x) =
(mod G).
(7)
i=1
B(hI, gi) = B(I) \ {LM(vi (x)) : 1 ≤ i ≤ N }.
and w(x) · g
=
(w1 , . . . , wN )(xα1 , . . . , xαN )T · g
≡
(w1 , . . . , wN )M −1 M (h1 (x), . . . , hN (x))T
=
(c1 , . . . , cN )(v1 (x), . . . , vN (x))T ,
This holds, as the equation (10) implies that the leading monomial of any f ∈ hI, gi is either divisible by LM(G) or equal to some LM(vi (x)), where vi (x) 6= 0, 1 ≤ i ≤ N . Now back to the proof of the theorem. The equation (2) follows from the equations (11) and (12), as the leading monomials of the nonzero vi (x) are distinct and are contained in B(I). When I is zero-dimensional, the normal forms hi (x) in (3) can be computed in time cubic in nN , say by using the border basis technique [12], and Gauss elimination also needs cubic time. Hence the claimed time complexity follows. Finally, we make a few observations concerning the above proof. They will be the basis for our algorithm below.
i.e. w(x) · g ≡
N X
ci vi (x)
(mod G).
(8)
i=1
For (a), to prove that G0 is a Gr¨ obner basis for (I : g), it suffices to show that each f ∈ (I : g) can be reduced to zero by G0 via long division. Indeed, for any f ∈ (I : g), since G is a Gr¨ obner basis, f can be reduced by G to some w(x) as in (6). Then, by (7) and (8), we have f ≡ w(x) ≡
N X
ci ui (x)
(12)
• LM(ui (x)) = xαi , so ui is not divisible by LM(G), for all 1 ≤ i ≤ N . The monomial xαi is an index for the corresponding row in (3), which will be called a signature.
(mod G),
i=1
15
• For any i with vi (x) 6= 0, LM(ui (x)) is not divisible by LM(G0 ). This follows from (11).
A top-reduction is called regular if it is not super. The signature is preserved by regular top-reductions, but not by super top-reductions. In our algorithm, we only perform regular top-reductions. We also keep all the u monic (or 0 for trivial solutions). Hence, for each regular top-reduction of (u1 , v1 ) by (u2 , v2 ) where u1 and u2 are monic, we perform the following steps:
• In the process of computing the Gr¨ obner bases, whenever we get some u · g ≡ 0 (mod G), we add u to G0 . So we never need to consider any u0 such that LT(u0 ) is divisible by LT(u). • Both G0 and G1 have many redundant polynomials. We do not want to store most of them.
(v1 ) • u := u1 − ctu2 , and v := v1 − ctv2 where t = LM LM(v2 ) and c = LC(v1 )/LC(v2 );
We need to decide which rows to store and how to perform row operations while many rows are missing. In the next section, we shall introduce regular top-reductions to emulate the row operations above and super top-reductions to detect rows that need not be stored.
3.
• if LM(u1 ) = tLM(u2 ) then u := u/(1 − c) and v := v/(1 − c); • u := Normal(u, G) and v := Normal(v, G), the normal forms of u and v modulo G.
ALGORITHM
Note that, if LM(u1 ) = tLM(u2 ) and c = 1, then (u1 , v1 ) is super top-reducible by (u2 , v2 ). We never perform super topreductions in our algorithm. In the case that (u1 , v1 ) is not regular top-reducible by other pairs known but is super topreducible, we discard the pair (u1 , v1 ), which corresponds to a row in the equation (5) that needs not be stored (in this case v1 is redundant in G1 ). Now we introduce a new concept of so-called J-pair for any two pairs of polynomials. Initially, we have the trivial solution pairs in (14) and the pair
Our algorithm computes a Gr¨ obner basis for (I : g) in the process of computing a Gr¨ obner basis for hI, gi. The Gr¨ obner basis for (I : g) is stored in the list H in the algorithm described in figure 1. If one does not need a Gr¨ obner basis for (I : g), one is free to retain only the leading monomials of H. This improves efficiency when only the Gr¨ obner basis for hI, gi is required. We provide Singular code for this version at http://www.math.clemson.edu/∼sgao/code/g2v.sing. Let R = F[x1 , · · · , xn ] with any fixed monomial order ≺ as above. Let G = {f1 , f2 , . . . , fm } be any given Gr¨ obner basis for I and let g ∈ R. Consider all pairs (u, v) ∈ R2 satisfying ug ≡ v
(mod G).
(1, v),
We find new solution pairs that are not top-reducible by the known pairs, hence must be stored. For any monomial t, consider the pair t(1, v). If t(1, v) is not top-reducible by any (0, f ) where f ∈ G, then t(1, v) mod G is super top-reducible by (1, v), hence we don’t need to store this pair. However, if t(1, v) top-reducible by some (0, f ) where f ∈ G, then the new pair after reduction by (0, f ) may not be top-reducible by (1, v) any more, hence it must be stored. This means we find the smallest monomial t so that the pair t(1, v) is topreducible by some (0, f ). This can happen only if tLM(v) is divisible by LM(f ) for some f ∈ G. Hence t should be such that tLM(v) = lcm(LM(v), LM(f )). We consider all these t given by f ∈ G. More generally, suppose we have computed a list of solution pairs
(13)
Certainly, G ⊂ hI, gi and G ⊂ (I : g). That is, we have the trivial solutions (f1 , 0), (f2 , 0), . . . , (fm , 0) and (0, f1 ), (0, f2 ), . . . , (0, fm ).
(14)
The first nontrivial solution for (13) is (1, g). We need to introduce a few concepts before proceeding. For any pair (u, v) ∈ R2 , LM(u) is called the signature of (u, v). We make the convention that LM(0) = 0. Our definition of signature is similar in purpose to that of Faug`ere [10]. To simulate the row operation (R1), we introduce the concept of regular top-reduction. Our regular top-reduction is similar to the top-reduction used by Faug`ere [10], but our use of super top-reduction below seems to be new. We say that (u1 , v1 ) is top-reducible by (u2 , v2 ) if
(u1 , v1 ), (u2 , v2 ), . . . , (uk , vk ),
(15)
including the pairs in (14). We consider all pairs t(ui , vi ), 1 ≤ i ≤ k, that may be top-reducible by some pair in (15). The t must come from lcm(LM(vi ), LM(vj )) for some j 6= i. This leads us to the concept of a joint pair from any two pairs as defined below. Let (u1 , v1 ) and (u2 , v2 ) be two pairs of polynomials with v1 and v2 both nonzero. Let
(i) LM(v2 ) | LM(v1 ), and LM(v1 ) . (ii) LM(tu2 ) LM(u1 ) where t = LM (v2 ) The corresponding top-reduction is then (u1 , v1 ) − ct(u2 , v2 ) ≡ (u1 − ctu2 , v1 − ctv2 )
where v = Normal(g, G), assuming v 6= 0.
(mod G),
lcm(LM(v1 ), LM(v2 )) = t,
t1 =
t , LM(v1 )
t2 =
t . LM(v2 )
where c = LC(v1 )/LC(v2 ). The effect of a top-reduction is that the leading monomial in the v-part is canceled. A top-reduction is called super, if
Find max(t1 LM(u1 ), t2 LM(u2 )), say equal to ti LM(ui ). Then
LM(u1 − ctu2 ) ≺ LM(u1 ),
• ti LM(ui ) is called the J-signature of the two pairs;
that is, the leading monomial in the u-part is also canceled. A super top-reduction happens when LM(tu2 ) = LM(u1 ) and
• ti vi is called the J-polynomial of the two pairs; • ti (ui , vi ) = (ti ui , ti vi ) is called the J-pair of the two pairs;
LC(v1 ) LC(u1 ) = . LC(u2 ) LC(v2 ) 16
Test Case (#generators) Katsura5 (22) Katsura6 (41) Katsura7 (74) Katsura8 (143) Schrans-Troost (128) F633 (76) Cyclic6 (99) Cyclic7 (443)
where J means “joint”. In comparison, the S-polynomial of v1 and v2 is t1 v1 − (c1 /c2 )t2 v2 where ci = LC(vi ). Hence our J-polynomials are related to S-polynomials. Notice that the J-signature of (u1 , v1 ) and (u2 , v2 ) is the same as the signature of the J-pair of (u1 , v1 ) and (u2 , v2 ). The basic idea of our algorithm is as follows. Initially, we have the pair (1, g) mod G and the trivial pairs in (14). From these pairs, we form all J-pairs and store them in a list JP. Then take the smallest J-pair from JP and repeatedly perform regular top-reductions until it is no longer regular top-reducible. If the v part of the resulting pair is zero, then the u part is a polynomial in (I : g), and we store this polynomial. If the v part is nonzero, then we check if the resulting J-pair is super top-reducible. If so, then we discard this J-pair; otherwise, we add this pair to the current Gr¨ obner basis and form new J-pairs and add them to JP. Repeat this process for each pair in JP. The algorithm is described more precisely in Figure 1 below. In the algorithm, we include two options: in first option we only keep the leading monomials of u’s and there is no need to update u’s in each regular top-reduction, so we compute a Gr¨ obner basis for LM(I : g); in the second option, we actually update u in each regular top-reduction as specified above, so we compute a Gr¨ obner basis for (I : g). It can be proved that, when JP is empty, LM(H) is a Gr¨ obner basis for LM(I : g) and V is a Gr¨ obner basis for hI, gi, which may not be minimal. Also, for each solution (u, v) to (13), we have either LM(u) is reducible by H, or (u, v) can be top-reduced to (0, 0) by (U, V ) (using both regular and super top-reductions). The proof of the algorithm will be included elsewhere for a more general version of this algorithm that needs not be incremental. It should be remarked that in our algorithm we always pick the J-pair with minimal signature to reduce. This is to emulate the downward row operations of the matrix. The algorithm may not work if one uses another strategy, say picking J-pairs with minimal total degree in the v part.
4.
F5 1.48 2.79 30.27 290.97 1180.08 30.93 28.44 4591.20
Test Case (#generators) Katsura5 (22) Katsura6 (41) Katsura7 (74) Katsura8 (143) Schrans-Troost (128) F633 (76) Cyclic6 (99) Cyclic7 (443)
F5C 0.93 2.34 22.76 177.74 299.65 29.87 22.06 2284.05
F5/G2 V 4.11 7.54 6.52 9.74 55.30 15.01 5.03 6.27
G2 V 0.36 0.37 4.64 29.88 21.34 2.06 5.65 732.33
F5C/G2 V 2.58 6.32 4.91 5.95 14.04 14.50 3.90 3.12
Table 1: Run-times in seconds and ratios of runtimes for various test cases in Singular 3.1.0.6 on an Intel Core 2 Quad 2.66 GHz. The #generators refers to a reduced Gr¨ obner basis.
5. Count of normal forms computed. The run-times and ratios of run-times are presented in Table 1. One can see that, for these examples, our algorithm is two to ten times faster than F5 and F5C. F5, F5C and our algorithm G2 V are all incremental. That is, given a list of polynomials g1 , . . . , gm , a Gr¨ obner basis is computed for hg1 , g2 , . . . , gi i for i = 1, 2, . . . , m. Hence, in each iteration, all three algorithms are given a polynomial g ∈ R and a Gr¨ obner basis G for some ideal I, and they compute a Gr¨ obner basis for hI, gi. The computed Gr¨ obner basis is not necessarily reduced, and any redundant polynomials in the basis will result in extra S-polynomials or J-polynomials to be reduced. Fewer generators at any given time means that fewer S-polynomials or J-polynomials need to be considered. F5 uses G as it was computed, so may not be reduced, however, F5C and our algorithm always replace G by a reduced Gr¨ obner basis. Table 2 lists the number of polynomials in the Gr¨ obner bases that were output by each algorithm on the last iteration of each example. Computation time is not the only limiting factor in a Gr¨ obner basis computation. Storage requirements also limit computation. Table 3 lists the maximum amount of memory each algorithm needed in the processing of examples. Again, we cannot make generalizations from the memory results because this is only one possible implementation of each algorithm in one possible CAS. The last two criteria were also measured, but the results were not nearly as interesting. Each algorithm outperformed the other (and usually not by much) in nearly half the examples. In conclusion, we presented a precise relationship among the degrees of the ideals I, hI, gi and (I : g), and a connection between the Gr¨ obner bases of hI, gi and (I : g). This allowed us to design a new algorithm, which is conceptually simpler and yet more efficient than F5 and F5C.
COMPARISONS AND CONCLUSIONS
In order to determine how our algorithm compared to, say F5 and F5C, we computed Gr¨ obner basis for various benchmark examples as provided in [8]. We used the examples and algorithm implementation for F5 and F5C provided by the URL in [8] which was all implemented in the Singular computer algebra system. Our implementation was meant to mirror the F5C implementation in terms of code structure and Singular kernel calls. For example, both implementations use the procedure “reduce” to compute normal form of a polynomial modulo a Gr¨ obner basis. Reasonable differences were unavoidable though. For example, F5C uses Quicksort while G2 V performs one step of a Mergesort in the function “insertPairs”. All examples considered were over the field of 7583 elements with the graded reverse lexicographic ordering. In addition to the usual wall clock times, several other measures of performance were considered, namely 1. Wall clock time (from a single run), 2. Extraneous generators, 3. Memory usage, 4. Count of J-pairs or S-pairs reduced, and
17
Input: Output: Variables:
Step 0.
Step 1. Step 2. Step 3a. Step 3b. Step 3c.
Step 4. Return:
G = [f1 , f2 , . . . , fm ], a Gr¨ obner basis for an ideal I, and g a polynomial. A Gr¨ obner basis for hI, gi, and a Gr¨ obner basis for LM(I : g) or for (I : g). U a list of monomials for LM(u) or of polynomials for u; V a list of polynomials for v; H a list for LM(u) or u so that u ∈ (I : g) found so far, JP a list of pairs (t, i), where t is a monomial so that t(ui , vi ) is the J-pair of (ui , vi ) and (uj , vj ) for some j 6= i. We shall refer (t, i) as the J-pair of (ui , vi ) and (uj , vj ). U = [0, . . . , 0] with length m, and V = [f1 , . . . , fm ] (so that (ui , vi ) = (0, fi ), 1 ≤ i ≤ m); H = [LM(f1 ), LM(f2 ), . . . , LM(fm )] or H = [f1 , f2 , . . . , fm ]; Compute v = Normal(g, G); If v = 0, then append 1 to H and return V and H (stop the algorithm); else append 1 to U and v to V ; JP = [ ], an empty list; For each 1 ≤ i ≤ m, compute the J-pair of the two pairs (um+1 , vm+1 ) = (1, v) and (ui , vi ) = (0, fi ), such a J-pair must be of the form (ti , m + 1), insert (ti , m + 1) into JP whenever ti is not reducible by H. (store only one J-pair for each distinct J-signature). Take a minimal (in signature) pair (t, i) from JP , and delete it from JP . Reduce the pair t(ui , vi ) repeatedly by the pairs in (U, V ), using regular topreductions, say to get (u, v), which is not regular top-reducible. If v = 0, then append LM(u) or u to H and delete every J-pair (t, `) in JP whose signature tLM(u` ) is divisible by LM(u). If v 6= 0 and (u, v) is super top-reducible by some pair (uj , vj ) in (U, V ), then discard the pair (t, i). Otherwise, append u to U and v to V , form new J-pairs of (u, v) and (uj , vj ), 1 ≤ j ≤ #U − 1, and insert into JP all such J-pairs whose signature are not reducible by H (store only one J-pair for each distinct J-signature). While JP is not empty, go to step 1. V and H. Figure 1: Algorithm
Test Case (#generators) Katsura5 (22) Katsura6 (41) Katsura7 (74) Katsura8 (143) Schrans-Troost (128) F633 (76) Cyclic6 (99) Cyclic7 (443)
F5 61 74 185 423 643 237 202 1227
F5C 44 65 163 367 399 217 183 1006
G2 V 63 52 170 335 189 115 146 658
Test Case (#generators) Katsura5 (22) Katsura6 (41) Katsura7 (74) Katsura8 (143) Schrans-Troost (128) F633 (76) Cyclic6 (99) Cyclic7 (443)
F5 1359 1955 8280 40578 130318 3144 2749 48208
F5C 828 1409 4600 20232 50566 2720 2280 23292
G2 V 1255 1254 5369 20252 32517 2824 1789 24596
Table 3: The maximum amount of memory (in KiB) Singular 3.1.0.6 used from startup to the conclusion of the Gr¨ obner basis computation. Memory amounts obtained with “memory(2);”.
Table 2: The number of generators in the Gr¨ obner basis in the last iteration but before computing a reduced Gr¨ obner basis. Of course, F5 never computes the reduced Gr¨ obner basis.
18
5.
REFERENCES
(ICISC 2009), Dec. 2009, Seoul, Korea. (To be published in LNCS by Springer). [16] M. S. E. Mohamed, W. S. A. E. Mohamed, J. Ding, J. Buchmann, “MXL2: Solving Polynomial Equations over GF(2) Using an Improved Mutant Strategy,” PQCrypto 2008: 203-215, LNCS 5299, Springer 2008 [17] Y. Sun and D.K. Wang, “A New Proof of the F5 Algorithm,” preprint 2009. http://www.mmrc.iss.ac.cn/pub/mm28.pdf/06F5Proof.pdf
[1] B. Buchberger, Ein Algorithmus zum Auffinden der Basiselemente des Restklassenringes nach einem nulldimensionalen Polynomideal, PhD thesis, Innsbruck, 1965. [2] B. Buchberger, “A Criterion for Detecting Unnecessary Reductions in the Construction of Gr¨ obner Basis,” In Proc. EUROSAM 79 (1979), vol. 72 of Lect. Notes in Comp. Sci., Springer Verlag, 3–21. [3] B. Buchberger, “Gr¨ obner Bases : an Algorithmic Method in Polynomial Ideal Theory,” In Recent trends in multidimensional system theory, Ed. Bose, 1985. [4] J. Buchmann, D. Cabarcas, J. Ding, M. S. E. Mohamed, “Flexible Partial Enlargement to Accelerate Grobner Basis Computation over F2,” AFRICACRYPT 2010, May 03-06, 2010, Stellenbosch, South Africa, to be published in LNCS by Springer [5] N. Courtois, A. Klimov, J. Patarin, and A. Shamir, “Efficient Algorithms for Solving Overdefined Systems of Multivariate Polynomial Equations,” in Proceedings of International Conference on the Theory and Application of Cryptographic Techniques (EUROCRYPT), volume 1807 of Lecture Notes in Computer Science, pages 392–407, Bruges, Belgium, May 2000. Springer. [6] D. Cox, J. Little and D. O’Shea, Using algebraic geometry, Graduate Texts in Mathematics, 185. Springer-Verlag, New York, 1998. [7] J. Ding, J. Buchmann, M. S. E. Mohamed, W. S. A. M. Mohamed, R. Weinmann, “Mutant XL,” First International Conference on Symbolic Computation and Cryptography, SCC 2008 [8] C. Eder and J. Perry, “F5C: a variant of Faug`ere’s F5 algorithm with reduced Gr¨ obner bases,” arXiv: 0906.2967v5, July 2009. `re, “A new efficient algorithm for [9] J.-C. Fauge computing Gr¨ obner bases (F4),” Effective methods in algebraic geometry (Saint-Malo, 1998), J. Pure Appl. Algebra 139 (1999), no. 1-3, 61–88. `re, “A new efficient algorithm for [10] J.-C. Fauge computing Gr¨ obner bases without reduction to zero (F5),” Proceedings of the 2002 International Symposium on Symbolic and Algebraic Computation, 75–83 (electronic), ACM, New York, 2002. [11] A. Joux and V. Vitse, “A variant of the F4 algorithm,” preprint 2010. http://eprint.iacr.org/2010/158. [12] A. Kehrein and M. Kreuzer, “Computation of Border Bases,” J. Pure Appl. Algebra 205 (2006), 279–295. [13] D. Lazard, “Gaussian Elimination and Resolution of Systems of Algebraic Equations,” in Proc. EUROCAL 83 (1983), vol. 162 of Lect. Notes in Comp. Sci, 146–157. [14] F. Macaulay, “Some formulae in elimination,” Proceedings of London Mathematical Society (1902), 3–38. [15] M. S. E. Mohamed, D. D. Cabarcas, J. Ding, J. Buchmann and S. Bulygin, “MXL3: An efficient algorithm for computing Groebner bases of zero-dimensional ideals,” the 12th International Conference on Information Security and Cryptology
19
Degree Bounds for Gröbner Bases of Low-Dimensional Polynomial Ideals Ernst W. Mayr
Stephan Ritscher
Technische Universität München Boltzmannstr. 3 D-85748 Garching
Technische Universität München Boltzmannstr. 3 D-85748 Garching
[email protected]
[email protected]
ABSTRACT
bounds for the degrees of polynomials in the Gr¨ obner basis means also knowing the complexity of its calculation. In [13] and [14] it was shown that, in the worst case, the degree of polynomials in a Gr¨ obner basis is at least doubly exponential in the number of indeterminates of the polynomial ring. [1], [7], and [14] provide a doubly exponential upper degree bound as explained in the introduction of [5]. [5] gives a combinatorial proof of an improved upper bound. For zero-dimensional ideals, the bounds are smaller by a magnitude. The well-known theorem of B´ezout (cf. [16]) immediately implies a singly exponential upper degree bound. For graded monomial orderings the degrees are even bounded polynomially, as proved in [12]. Both bounds are exact, and the examples providing lower bounds are folklore (cf. [14]). This suggests that also ideals with small non-zero dimension permit better degree bounds than in the general case. Furthermore, in [9] an ideal membership test was provided with space complexity exponential only in the dimension of the ideal. This result anticipated a degree bound of the form shown in this paper. The remainder of the paper is organized as follows. In the second section notation for polynomial ideals and Gr¨ obner bases will be fixed. We do not give proofs or comprehensive explanations. For a detailed introduction and accompanying proofs we refer to the literature. The third chapter contains the main result of this paper, the upper degree bound depending on the ideal dimension. Since the proof uses cone decompositions as defined by Dub´e in [5], we first review these techniques. Then we explain how to adapt this approach to get a dependency on the ideal dimension and derive the upper degree bound. Finally we demonstrate how to use the results from [13] and [14] to obtain a lower bound of similar form.
Let K[X] be a ring of multivariate polynomials with coefficients in a field K, and let f1 , . . . , fs be polynomials with maximal total degree d which generate an ideal I of dimension r. Then, for every admissible ordering, the total degree of polynomials in a Gr¨ obner basis for I is bounded by 2r 2 12 dn−r + d . This is proved using the cone decompositions introduced by Dub´e in [5]. Also, a lower bound of similar form is given.
Categories and Subject Descriptors I.1.1 [Symbolic and Algebraic Manipulation]: Expressions and Their Representation—Representations (general and polynomial); G.2.1 [Dicrete Mathematics]: Combinatorics—Counting problems
General Terms Theory
Keywords multivariate polynomial, Gr¨ obner basis, polynomial ideal, ideal dimension, complexity
1.
INTRODUCTION
Gr¨ obner bases are a very powerful tool in computer algebra which was introduced by Buchberger [2]. Many problems that can be formulated in the language of polynomials can be easily solved once a Gr¨ obner basis has been computed. This is because Gr¨ obner bases allow quick ideal consistency checks, ideal membership tests, and ideal equality tests, among others. Unfortunately, the computation of a Gr¨ obner basis can be very expensive. The problem is exponential space complete, which was shown in [13] and [11]. Interestingly, both the upper and the lower bound are obtained by considering polynomials of high degree in the ideal. So knowing good
Credits We wish to thank the referees for their detailed feedback. Particular thanks are due to one of them for showing how to tighten our bound.
2.
NOTATION
In this chapter, we define the notation that will be used throughout the paper. For a more detailed introduction to polynomial algebra, the reader may consult [3] and [4].
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. To copy otherwise, to republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. ISSAC 2010, 25–28 July 2010, Munich, Germany. Copyright 2010 ACM 978-1-4503-0150-3/10/0007 ...$10.00.
2.1
Polynomial Ideals
Consider the ring K[X] of polynomials in the variables X = {x1 , . . . , xn }. The (total) degree of a monomial is deg(xe11 · · · xenn ) = e1 + . . . + en . A polynomial is called
21
homogeneous if all its monomials have the same degree. Every polynomial f 6= 0 permits a unique representation f = f0 + . . . + fd , fd 6= 0, with fk being homogeneous of degree k, the so-called homogeneous components of f . The homogenization of f with respect to a new variable xn+1 is defined by hf = xdn+1 f0 + xd−1 n+1 f1 + . . . + fd . A set S ⊂ K[X] is called homogeneous if for every polynomial f ∈ S also its homogeneous components fk are elements of S. Throughout the paper we assume some arbitrary but fixed admissible monomial ordering (cf. [5], §2.1). Therefore we won’t keep track of it in the notation. The largest monomial occuring in a polynomial f is called leading monomial and denoted by LM(f ). Ps hf1 , . . . , fs i denotes the ideal i=1 ai fi : ai ∈ K[X] generated by F = {f1 , . . . , fs }. G is a Gr¨ obner basis of the ideal I if hGi = I and hLM(G)i = hLM(I)i. nf I (f ) denotes the normal form of f , which, for a fixed monomial ordering, is the unique irreducible polynomial fulfilling nf I (f ) ≡ f mod I. The set of all normal forms is denoted by NI . Since the normal forms are unique, we have the direct sum K[X] = I ⊕ NI . For details see [5], §2.1. Unless stated differently, we will consider an ideal I generated by homogeneous polynomials f1 , . . . , fs with degrees d1 ≥ . . . ≥ ds .
A nice, well-known property of regular sequences is that their Hilbert polynomial only depends on the degrees of the polynomials and the number of indeterminates. Proposition 2.1. Let (g1 , . . . , gt ) with gk ∈ K[X] be a homogeneous regular sequence with degrees d1 ≥ . . . ≥ dt and J = hg1 , . . . , gt i. Then NJ ∼ = K[X]/J have (for any term ordering) a Hilbert function which only depends on n, t, and d1 , . . . , dt . The Hilbert function and the Hilbert polynomial are equal for z > d1 + . . . + dt − n. Proof. See [10], §5.2B and §5.4B. We are given now an ideal I of dimension r and want to embed a regular sequence which is as long as possible. It turns out that the length of this sequence is always n − r. Proposition 2.2 (cf. Schmid 1995). Let K be an infinite field and I ( K[X] an ideal generated by homogeneous polynomials f1 , . . . , fs with degrees d1 ≥ . . . ≥ ds and dim(I) ≤ r. Then there are a permutation σ of {1, . . . , s} and homogeneous ak,i ∈ K[X] such that gk =
s X
ak,i fi
i=σ(k)
2.2
Hilbert Functions
for k = 1, . . . , n − r form a regular sequence of homogeneous polynomials, and deg(gk ) = dσ(k) .
Let T ⊂ K[X] be homogeneous and Tz = {f ∈ T : f homogeneous with deg(f ) = z or f = 0} the homogeneous polynomials of T of degree z. Then the Hilbert function of T is defined as
Proof. See [15], Lemma 2.2. It’s an extension to the homogeneous case. Since in the ring K[X] any permutation of a regular sequence is regular, one can choose σ = id.
ϕT (z) = dimK (Tz ),
3.
i.e. the vector space dimension of Tz over the field K. It easily follows from the dimension theorem for direct sums that
3.1
It is well-known that, for large values of z, the Hilbert functions ϕI (z) and ϕNI (z) of a homogeneous ideal I and its normal forms NI are polynomials. These polynomials, known as Hilbert polynomials, will be denoted by ϕI (z) and ϕNI (z), respectively.
Ideal Dimension
The dimension of an homogeneous ideal can be defined in many equivalent ways (cf. [3], §9). The following definition turns out to be the most suitable for our purpose. dim(I) = deg(ϕNI ) + 1 with deg(0) = −1. We add 1 to the degree in order to obtain the affine instead of the projective dimension. This simplifies the presentation which is inherently affine. Since we will have to deal with ideal dimensions and vector space dimensions, we will write dim(I) for the former and dimK (I) for the latter in order to avoid confusion.
2.4
Cone Decompositions
The upper degree bound presented in this paper is based on the concept of cone decompositions introduced in [5]. This section will summarize the results that will be used leaving out the proofs which can be found in the original paper [5]. For a homogeneous polynomial h and a set of variables U ⊂ X, the corresponding cone is denoted by C = C(h, U ) = hK[U ]. For succinctness, by the degree of a cone C we mean the degree of its apex, i.e., deg(C) = deg(h). Similarly, we call the cardinality of U the dimension of the cone, i.e. dim(C) = #U . Note that h and U are uniquely determined by C as a set. Since we will not describe algorithms as in [5], we don’t need to talk about pairs of h and U as a representation of the cone. One of the most important reasons for working with cones is that their Hilbert functions can be easily calculated. For a cone C of dimension 0, we have ( 0 for z 6= deg(C) ϕC (z) = , 1 for z = deg(C)
ϕS⊕T (z) = ϕS (z) + ϕT (z).
2.3
UPPER DEGREE BOUND
for cones of dimension greater than zero ( 0 for z < deg(C) ϕC (z) = . z−deg(C)+dim(C)−1 for z ≥ deg(C) dim(C)−1
Regular Sequences
A sequence (g1 , . . . , gt ) with gk ∈ K[X] is called regular sequence (cf. [6]) if • gk is a nonzerodivisor in K[X]/hg1 , . . . , gk−1 i, for all 1 ≤ k ≤ t, and
Since we can handle the Hilbert functions of direct sums, we want to express the spaces we deal with as direct sums of cones.
• K[X] 6= hg1 , . . . , gt i.
22
´ 1990). Let T be a vector space Definition 3.1 (Dube Ll and T = i=1 Ci a direct decomposition into cones Ci . Then we call P = {Ci : i = 1, . . . , l} a cone decomposition of T . We will use the notation deg(P ) = max{deg(C) : C ∈ P }.
The next step in [5] is a worst case construction. The question that arises is: How large can the degrees of the cones in Q and thus the degrees in the Gr¨ obner basis be? We know that a k-standard cone decomposition P contains at least one cone in each degree between k and the maximal degree. So in the worst case there would be exactly one cone in each degree.
Obviously ϕT (z) =
X
´ 1990). A k-standard cone deDefinition 3.5 (Dube composition P is k-exact if deg(C) = 6 deg(C 0 ) for all C 6= C0 ∈ P +.
ϕC (z).
C∈P
In a slight abuse of notation we also write ϕP (z) for ϕT (z) (respectively ϕP (z) for ϕT (z)) if P is a cone decomposition of T . Our final interest will not be the Hilbert function of a cone decomposition but its Hilbert polynomial. Therefore we define P + = {C ∈ P : dim(C) > 0}, the subset of cones with dimension greater 0. One can easily check that the polynomial part of zero-dimensional cones is 0. Therefore X ϕP (z) = ϕP + (z) = ϕC (z).
Since k-exact cone decompositions are also k-standard, the cones of higher degrees have lower dimensions, i.e., C, C 0 ∈ P, deg(C) > deg(C 0 ) implies dim(C) ≤ dim(C 0 ). Since one can split a cone into a cone of dimension 0 and same degree and cones of higher degrees, one can refine a kstandard cone decomposition such that it becomes k-exact. Dub´e gives an algorithmic proof herefore. ´ 1990). Every k-standard cone deLemma 3.6 (Dube composition P may be refined into a k-exact cone decomposition P 0 with deg(P ) ≤ deg(P 0 ) and deg(P + ) ≤ deg(P 0+ ). Proof. See [5], Lemma 6.3.
C∈P +
Here ϕC (z) = =
z − deg(C) + dim(C) − 1 dim(C) − 1
!
A nice side effect of this worst case construction is that we can easily calculate the Hilbert polynomial of an exact cone decomposition P of some space T . Herefore we need the following notion.
(z − deg(C) + dim(C) − 1) · · · (z − deg(C) + 1) . (dim(C) − 1) · · · 1
´ 1990). Let P be a k-exact cone Definition 3.7 (Dube decomposition. If P + = ∅, let k = 0. Then the Macaulay constants of P are defined as
We want to consider cone decompositions whose Hilbert polynomial has a nice representation which is interlinked with the maximal degree of a reduced Gr¨ obner basis. The first step towards this is the following definition.
ai = max{k, deg(C) + 1 : C ∈ P + , dim(C) ≥ i} for i = 0, . . . , n + 1.
´ 1990). A cone decomposition P Definition 3.2 (Dube is k-standard for some k ∈ N if
Note that the definition looks slightly different from the one given in [5], but is equivalent to it. This definition implies max{k, deg(P + )} = a0 ≥ . . . ≥ an ≥ an+1 = k. Now ! ai −1 n X X z−c+i−1 ϕT (z) = . i−1 i=1 c=a
• C ∈ P + implies deg(C) ≥ k and • for all C ∈ P + and for all k ≤ d ≤ deg(C), there exists a cone C (d) ∈ P with degree d and dimension at least dim(C).
i+1
Some lengthy calculations in [5] finally yield ´ 1990). Given a k-exact decomposiLemma 3.8 (Dube tion P of some space T , the Hilbert polynomial of T is given by ! ! n X z−k+n z − ai + i − 1 ϕT (z) = −1− . (1) i n i=1
Note that P is k-standard for all k if and only if P + = ∅. Otherwise it can be k-standard for at most one k, namely the minimal degree of the cones in P + . Furthermore, the union of k-standard decompositions is k-standard, again. ´ 1990). Every k-standard cone deLemma 3.3 (Dube composition P may be refined into a (k + 1)-standard cone decomposition P 0 with deg(P ) ≤ deg(P 0 ) and deg(P + ) ≤ deg(P 0+ ).
The Macaulay constants (except a0 ) may be deduced from Hilbert polynomial and thus depend only on ϕT and not on the chosen decomposition. Proof. See [5], Lemma 7.1.
Proof. See [5], Lemma 3.1.
We are going to apply this result to an ideal generated by an exact sequence.
Dub´e was able to construct such cone decompositions for the set of normal forms of an ideal.
Corollary 3.9. If P is a k-exact decomposition of NJ for an ideal J generated by a homogeneous regular sequence g1 , . . . , gt of degrees d1 , . . . , dt . Then the Macaulay constants (except a0 ) depend only on n, t, and d1 , . . . , dt , and neither on the chosen monomial ordering nor on the generators of J. Proof. This is a direct consequence of Proposition 2.1 and Lemma 3.8.
´ 1990). For any homogeneous Proposition 3.4 (Dube ideal I ⊂ K[X] and any monomial ordering ≺, there is a 0standard cone decomposition Q of NI such that deg(Q) + 1 is an upper bound on the degrees of polynomials required in a Gr¨ obner basis of I. Proof. See [5], Theorem 4.11.
23
3.2
A New Decomposition
3.3, Q, Q1 , . . . , Qs can be refined into d1 -standard cone decompositions Q0 , Q01 , . . . , Q0s . Since
In order to bound the Macaulay constants of a homogeneous ideal I = hf1 , . . . , fs i, Dub´e uses the direct decompositions
K[X] = J ⊕ the union
and I = hf1 i ⊕
P 0 = Q0 ∪ Q01 ∪ . . . ∪ Q0s fi · Nhf1 ,...,fi−1 i:fi ,
is a d1 -standard cone decomposition of NJ . By Lemma 3.6, this can be refined to a d1 -exact cone decomposition P of NJ with maximal degree deg(Q) ≤ deg(P ). Thus the maximal degree of cones in P is also an upper bound on the Gr¨ obner basis degree.
i=2
where H : g = {f : f g ∈ H} is a special case of the ideal quotient. The Hilbert functions of K[X] and hf1 i are easily determined, and for all other summands one can calculate exact cone decompositions using the theory explained in the previous section. In Dub´e’s construction, the Macaulay constants achieve their worst case bound in the zero-dimensional case. Therefore we are going to use a slightly different decomposition. So let I be an r-dimensional ideal generated by homogeneous polynomials f1 , . . . , fs with degrees d1 ≥ . . . ≥ ds . According to Proposition 2.2, there is a regular sequence g1 , . . . , gn−r ∈ I with deg(gk ) = dk . First we prove a decomposition along the lines of Dub´e, but starting from J = hg1 , . . . , gn−r i instead of hf1 i.
All Macaulay constants of a cone decomposition P of NJ except a0 = deg(P ) are determined by the Hilbert polynomial. But, because of Proposition 3.4 and 3.11, deg(P ) is what we are actually interested in. Thus we want to bound a0 using the other Macaulay constants which can be determined from the Hilbert polynomial (Corollary 3.9). Lemma 3.12. Let J be the ideal generated by the regular sequence g1 , . . . , gn−r with degrees d1 , . . . , dn−r , P be a cone decomposition of NJ and a0 , . . . , an+1 the corresponding Macaulay constants. Then
Lemma 3.10. With the stated hypotheses, I=J⊕
s M
nf J (fi ) · NJi :nf J (fi )
a0 ≤ max{a1 , d1 + . . . + dn−r − n}. Proof. Consider
(2)
K[X] = J ⊕
i=1
with Jk = hg1 , . . . , gn−r , f1 , . . . , fk−1 i.
k M
M
C.
C∈P
We know that the Hilbert functions (Hilbert polynomials) of the left hand and the right hand side agree. Furthermore, for z large enough (by Proposition 2.1, z > d1 + . . . + dn−r − n suffices) ϕK[X] (z) = ϕK[X] (z) and ϕJ (z) = ϕJ (z). This yields for a1 ≤ z < a0 :
Proof. To prove this, we inductively show Jk+1 = J ⊕
nf J (fi ) · NJi :nf J (fi ) ⊕ NI ,
i=1
K[X] = I ⊕ NI s M
s M
nf J (fi ) · NJi :nf J (fi )
i=1
for k = 0, . . . , s − 1. The equality I = Js then yields the stated result. The ”⊃”-inclusion is clear since fj , gj ∈ I. For the other inclusion, the case k = 0 is trivial. So assume k > 0. Let f ∈ Jk+1 and thus f = f 0 + a · fk = (f 0 + a · (fk − nf J (fk ))) + a · nf J (fk ) with f 0 , a · (fk − nf J (fk )) ∈ Jk . We rewrite
#{C ∈ P : dim(C) = 0, deg(C) = z} = ϕP (z) − ϕP (z) = (ϕK[X] (z) − ϕJ (z)) − (ϕK[X] (z) − ϕJ (z)) = 0 Thus there are no cones with degree greater or equal max{a1 , d1 + . . . + dn−r − n} which implies the statement.
a = (a − nf Jk :nf J (fk ) (a)) + nf Jk :nf J (fk ) (a),
As a consequence of Proposition 3.11, Corollary 3.9 and Lemma 3.12, we can choose a nice ideal J for the further considerations - independent of I.
which yields a · nf J (fk ) ∈ (Jk : nf J (fk )) · nf J (fk ) + NJk :nf J (fk ) · nf J (fk ).
Corollary 3.13. Let Q be a 0-standard cone decomposition of NI for some ideal I and some fixed admissible monomial ordering. If I has dimension r and is generated by homogeneous polynomials f1 , . . . , fs of degrees d1 ≥ . . . ≥ ds , then
Since (Jk : nf J (fk )) · nf J (fk ) ⊂ Jk , we get f ∈ Jk + nf J (fk ) · NJk :nf J (fk ) and inductively Jk+1 of the stated form. It remains to show that the sum is direct. But this is clear since Jk ∩ nf J (fk ) · NJk :nf J (fk ) ⊂ Jk ∩ NJk = {0}.
deg(Q) ≤ max{deg(P + ), d1 + . . . + dn−r − n} whereDP is a d1 -exact cone E decomposition of NJ and J is the dn−r d1 ideal xr+1 , . . . , xn .
Now we are going to construct cone decompositions for the parts of (2).
Proof. By Proposition 3.11, we can extend a 0-standard cone decomposition Q of NI to an d1 -exact cone decomposition P 0 of NJ 0 with deg(Q) ≤ deg(P 0 ) for J 0 ⊂ I being generated by a homogeneous regular sequence of length n − r and degrees d1 , . . . , dn−r . By Lemma 3.12, deg(P 0 ) = a0 can be bounded by deg(P 0+ ) = a1 . By Corollary 3.9, the Macaulay constants ak of P 0 (except a0 ) only depend on
Proposition 3.11. With the stated hypotheses, any 0standard decomposition Q of NI may be completed into a d1 standard decomposition P of NJ such that deg(Q) ≤ deg(P ). Proof. By Proposition 3.4, we can construct 0-standard cone decompositions Qk of NJk :nf J (fk ) . Then fk · Qk are dk standard cone decompositions of fk · NJk :nf J (fk ) . By Lemma
24
E D d 1 , . . . , xnn−r n, n − r, and d1 , . . . , dn−r . The ideal J = xdr+1 is obviously a r-dimensional ideal generated by a homogeneous regular sequence with the same degrees. Thus a d1 exact cone decomposition of NJ (which exists by Proposition 3.4) has the same Macaulay constants (except a0 ) and thus deg(P 0+ ) = deg(P + ).
Proof. The key is to look at the Hilbert polynomials. We easily see that, for a monomial basis {t1 , . . . , tl } of Tk , Tk ⊗ K[x1 , . . . , xk ] = t1 K[x1 , . . . , xk ] ⊕ . . . ⊕ tl K[x1 , . . . , xk ] and ! l X z − deg(ti ) + k − 1 . ϕTk ⊗K[x1 ,...,xk ] (z) = k−1 i=1
Example 3.14. Before we continue the proof and bound the Macaulay constants in the next section, we want to illustrate that the Macaulay constants are independent of the ideals I and J. We will work in the ring K[x1 , x2 , x3 ] for this example,
i.e., n = 3. First we consider the very simple ideal I = x21 (i.e., d1 = 2), which has dimension r = 2, and the regular sequence g1 = x21 . Using the concepts of this section and the algorithms from [5], implemented in Singular [8], we obtain an exact cone decomposition P of Nhg1 i . Due to its size we only list the cones of positive dimension: P + = C(x22 , {x2 , x3 }), C(x1 x22 , {x2 , x3 }, C(x2 x33 , {x3 }), C(x53 , {x3 }), C(x1 x2 x43 , {x3 }), C(x1 x63 , {x3 })
Now we do the same for I 0 = x21 − x1 x2 , x1 x2 + x1 x3 and 0 2 the regular sequence g1 = x1 − x2 x3 . P 0+ = C(x22 , {x2 , x3 }), C(x1 x22 + x1 x2 x3 , {x2 , x3 }),
On the other hand, the Hilbert polynomial of the cone decomposition Pk is ! X z − deg(C) + dim(C) − 1 . ϕPk (z) = dim(C) − 1 C∈P k
Since Pk is a cone decomposition of Tk ⊗ K[x1 , . . . , xk ], we have ϕTk ⊗K[x1 ,...,xk ] (z) = ϕPk (z). Now compare the coefficients of z k−1 of both polynomials. Since Pk only contains cones of dimension at most k, this yields l X i=1
Lemma 3.17. ar = d1 · · · dn−r + d1 . Now we construct a d1 -exact cone decomposition with a special form. This allow us to bound the further Macaulay constants.
a0 = 8, a1 = 8, a2 = 4, a3 = 2.
Macaulay Constants
Lemma 3.18.D There exist a dE 1 -exact cone decomposition d 1 , . . . , xnn−r ) and subspaces Tk of NJ P of NJ (J = xdr+1
By Corollary 3.13, it suffices to bound the Macaulay constantDa1 of a d1 -exact cone decomposition of NJ for the ideal E dn−r d1 J = xr+1 , . . . , xn , which will be fixed for the remainder of this section. The special shape of this ideal allows to dramatically simplify the corresponding proof in Dub´e’s paper which does not make any assumption on the ideal, except that it is generated by monomials. Nevertheless the bound we will obtain applies to any ideal by preceding corollary. From r = dim(J) = deg(ϕJ )+1, one immediately deduces:
such that P≤k = {C ∈ P : dim(C) ≤ k} is a cone decomposition of Tk ⊗ K[x1 , . . . , xk ] and Tk ⊂ K[xk+1 , . . . , xn ] has a monomial basis for all k = 1, . . . , r. Furthermore ak ≤ 12 a2k+1 for k = 1, . . . , r − 1. Proof. We construct P inductively. Let P>k = {C ∈ P : dim(C) > k} and consider k = r. Since P cannot contain cones with dimension greater than r, P>r = ∅ and P≤r is a cone decomposition of NJ = Tr ⊗ K[x1 , . . . , xr ] with the monomial basis given in (3). Now we assume that all cones of P>k have been constructed and that we already chose Tk such that M NJ = Tk ⊗ K[x1 , . . . , xk ] ⊕ C.
Lemma 3.15. an = . . . = ar+1 = d1 . In order to determine the remaining Macaulay constants, we have to determine NJ . For the ideal J we chose, this is
C∈P>k
NJ = Tr ⊗ K[x1 , . . . , xr ],
We want to construct P≤k inductively such that it is a cone decomposition of Tk ⊗ K[x1 , . . . , xk ]. By Lemma 3.16, P must contain exactly dimK (Tk ) cones of dimension k. P>k is already constructed, so that an , . . . , ak+1 are fixed. Since P shall be d1 -exact, the cones of dimension k must have the degrees ak+1 , ak+1 + 1, ak+1 + 2, . . .. Let {t1 , . . . , tl } be a monomial basis of Tk with deg(t1 ) ≤ . . . ≤ deg(tl ). Then we choose
where the vector space Tr is given by Tr = spanK {m ∈ K[xr+1 , . . . , xn ] : m monomial, d
C∈P dim(C)=k
1 (k − 1)!
Looking at the explicit formula (3) for Tr , one obtains dim(Tr ) = d1 · · · dn−r and thus:
Both P and P 0 are exact cone decompositions with the same parameters n, r, d1 and thus - as expected - have the same Macaulay constants:
xi i−r - m for i = r + 1, . . . , n
X
and thus #{C ∈ P : dim(C) = k} = l = dimK (Tk ).
C(x2 x33 , {x3 }), C(x53 , {x3 }), C(x1 x53 , {x3 }), C(x1 x2 x53 + x1 x63 , {x3 })
3.3
1 = (k − 1)!
o
(3)
and A ⊗ B denotes the tensor product of A and B, i.e., the vector space generated by {ab : a ∈ A, b ∈ B}. we need the following observation:
a
Ci = ti xkk+1
Lemma 3.16. Any cone decomposition Pk of a vector space Tk ⊗ K[x1 , . . . , xk ], Tk generated by monomials, has exactly dimK (Tk ) cones of dimension k.
+i−deg(ti )−1
K[x1 , . . . , xk ] with i = 1, . . . , l
as cones of dimension k. It is easy to see that deg(Ci ) = ak+1 + i − 1 and dim(Ci ) = k. Thus we do not violate
25
the definition of exact cone decompositions. Since Tk ⊂ K[xk+1 , . . . , xn ], furthermore
However our bound bridges the gap to the case of zerodimensional ideals. It is well-known that the Gr¨ obner basis of I in this case can be at most the vector space dimension of K[X]/I, which is bounded by d1 · · · dn according to the theorem of B´ezout. Our bound (though not proved for r = 0) specializes to d1 · · · dn + d1 which is close to the perfect bound. For 0 < r < n − 1 the bound is new to the best knowledge of the authors.
Tk ⊗ K[x1 , . . . , xk ] = C1 ⊕ . . . ⊕ Cl ⊕ (Tk−1 ⊗ K[x1 , . . . , xk−1 ]) with Tk−1 = spanK {ti xek : i = 1, . . . , l, e = 0, . . . , ak+1 + i − deg(ti ) − 2} ⊂ K[xk , . . . , xn ]. Inductively, this yields
4.
NJ = (Tk−1 ⊗ K[x1 , . . . , xk−1 ]) ⊕
M C∈P>k−1
So it only remains to bound ak−1 . ak−1 − ak = dimK (Tk−1 ) =
l X
(ak+1 + i − deg(ti ) − 1)
i=1
≤
l X
(ak+1 + i − 1) = lak+1 +
i=1
1 l(l − 1) 2
With l = dimK (Tk ) = ak − ak+1 , we get by induction ak−1 ≤ ak + (ak − ak+1 )ak+1 +
1 (ak − ak+1 )(ak − ak+1 − 1) 2
Proposition 4.1 (Mayr, Meyer 1982). There is a family of ideals Jn ⊂ K[X] with n = 14(k + 1), k ∈ N, of polynomials in n variables of degree bounded by d such that each Gr¨ obner basis with respect to a graded monomial ordering contains a polynomial of degree at least ( n −1) 1 2 14 d + 4. 2
1 2 ak − a2k+1 + ak + ak+1 2 1 1 1 a2k − a2k+1 + a2k+1 + ak+1 ≤ a2k ≤ 2 2 2
=
Corollary 3.19. ak ≤ 2 for k = 1, . . . , r.
1 2
(d1 · · · dn−r + d1 )
LOWER DEGREE BOUND
Finally we want to give a lower bound of similar form. Mayr, Meyer [13] and M¨ oller, Mora [14] gave a lower bound for H-bases.
An H-basis of an ideal
I is an ideal basis H such that {hdeg(h) : h ∈ H} = {fdeg(f ) : f ∈ I} (here hdeg(h) and fdeg(f ) are the homogeneous components of highest degree). Consider a graded monomial ordering, i.e. deg(m) < deg(m0 ) implies m ≺ m0 for all monomials m, m0 . Then it is easy to see that any Gr¨ obner basis with respect to ≺ is also an Hbasis. So we can reformulate the result as follows.
C.
We are going to embed this ideal in a larger ring as follows. Define
2r−k
Jr,n = hJr , xr+1 , . . . , xn i ⊂ K[X]. Obviously dim(Jr,n ) < r.
Finally we remember that a1 bounds the Gr¨ obner basis degree and state our main theorem.
Theorem 4.2. There is a family of ideals Jr,n ⊂ K[X] with r = 14(k+1) ≤ n, k ∈ N of polynomials in n variables of degree bounded by d with dimension less than r such that each Gr¨ obner basis with respect to a graded monomial ordering
Theorem 3.20. Let I = hf1 , . . . , fs i be an ideal in the ring K[X] = K[x1 , . . . , xn ] generated by homogeneous polynomials of degrees d1 ≥ . . . ≥ ds . Then for any admissible ordering ≺, the degree required in a Gr¨ obner basis for I with 2r−1 , where respect to ≺ is bounded by 2 12 (d1 · · · dn−r + d1 ) r > 0 is the (affine) dimension of I.
contains a polynomial of degree at least
r −1
1 2 14 d 2
+ 4.
1 The constant 14 in the exponent could be improved by applying the techniques of [14] to the improved construction in [17]. Furthermore it would be interesting to give a nontrivial upper bound on the dimension of the ideals Jn (resp. Jr,n ). To the best of the authors’ knowledge, only the lower 3 n + 12 (cf. [14]) is known. bound dim(Jn ) ≥ 14
Proof. Corollary 3.19 gives a bound on a1 . Since this bound is greater than d1 + . . . + dn−r − n, Corollary 3.13 and Proposition 3.4 finish the proof. Just like Dub´e, we can lift this result to non-homogeneous ideals by introducing an additional homogenization variable xn+1 . This implies
5.
REFERENCES
[1] D. Bayer. The division algorithm and the Hilbert scheme. 1982. [2] B. Buchberger. Ein Algorithmus zum Auffinden der Basiselemente des Restklassenringes nach einem nulldimensionalen Polynomideal. PhD thesis, Universit¨ at Innsbruck, 1965. [3] D. Cox, J. Little, and D. O’Shea. Ideals, Varieties, and Algorithms. Springer New York, 1992. [4] D. Cox, J. Little, and D. O’Shea. Using Algebraic Geometry. Springer Verlag, 2005. [5] T. Dub´e. The Structure of Polynomial Ideals and Gr¨ obner Bases. SIAM Journal on Computing, 19:750, 1990.
Corollary 3.21. Let I = hf1 , . . . , fs i be an ideal in the ring K[X] = K[x1 , . . . , xn ] generated by arbitrary polynomials of degrees d1 ≥ . . . ≥ ds . Then for any admissible ordering ≺, the degree required in a Gr¨ obner basis for I with 2r respect to ≺ is bounded by 2 12 d1 · · · dn−r + d1 , where r is the dimension of I. If we consider an arbitrary non-trivial ideal, its dimension r is at most n − 1. For r = n − 1, the bound given in this 2 2n−2 d paper simplifies to 2 21 + d1 . This is exactly Dub´e’s bound in [5], Theorem 8.2.
26
[6] D. Eisenbud. Commutative algebra with a view toward algebraic geometry. Springer, 1995. [7] M. Giusti. Some effectivity problems in polynomial ideal theory. In Eurosam, volume 84, pages 159–171. Springer, 1984. [8] G.-M. Greuel, G. Pfister, and H. Sch¨ onemann. Singular 3.1.0 — A computer algebra system for polynomial computations. 2009. http://www.singular.uni-kl.de. [9] M. Kratzer. Computing the dimension of a polynomial ideal and membership in low-dimensional ideals. Bachelor’s thesis, Technische Universit¨ at M¨ unchen, 2008. [10] M. Kreuzer and L. Robbiano. Computational commutative algebra 2. 2005. [11] K. K¨ uhnle and E. Mayr. Exponential space computation of Gr¨ obner bases. In Proceedings of the 1996 international symposium on Symbolic and algebraic computation, pages 63–71. ACM New York, NY, USA, 1996. [12] D. Lazard. Gr¨ obner bases, Gaussian elimination and resolution of systems of algebraic equations. In Proc. EUROCAL, volume 83, pages 146–156. Springer, 1983. [13] E. Mayr and A. Meyer. The complexity of the word problems for commutative semigroups and polynomial ideals. Advances in Mathematics, 46(3):305–329, 1982. [14] H. M¨ oller and F. Mora. Upper and Lower Bounds for the Degree of Groebner Bases. Springer-Verlag London, UK, 1984. [15] J. Schmid. On the affine Bezout inequality. manuscripta mathematica, 88(1):225–232, 1995. [16] I. Shafarevich. Basic Algebraic Geometry. Springer-Verlag, 1994. [17] C. Yap. A new lower bound construction for commutative Thue systems with applications. J. Symbolic Comput, 12(1), 1991.
27
A New Algorithm for Computing Comprehensive Gröbner Systems ∗ Deepak Kapur
Yao Sun
Dingkang Wang
Dept. of Computer Science University of New Mexico Albuquerque, NM, USA
Key Laboratory of Mathematics Mechanization Academy of Mathematics and Systems Science, CAS Beijing, China
Key Laboratory of Mathematics Mechanization Academy of Mathematics and Systems Science, CAS Beijing, China
[email protected]
[email protected]
[email protected]
ABSTRACT
Categories and Subject Descriptors
A new algorithm for computing a comprehensive Gr¨ obner system of a parametric polynomial ideal over k[U ][X] is presented. This algorithm generates fewer branches (segments) compared to Suzuki and Sato’s algorithm as well as Nabeshima’s algorithm, resulting in considerable efficiency. As a result, the algorithm is able to compute comprehensive Gr¨ obner systems of parametric polynomial ideals arising from applications which have been beyond the reach of other well known algorithms. The starting point of the new algorithm is Weispfenning’s algorithm with a key insight by Suzuki and Sato who proposed computing first a Gr¨ obner basis of an ideal over k[U, X] before performing any branches based on parametric constraints. Based on Kalkbrener’s results about stability and specialization of Gr¨ obner basis of ideals, the proposed algorithm exploits the result that along any branch in a tree corresponding to a comprehensive Gr¨ obner system, it is only necessary to consider one polynomial for each nondivisible leading power product in k(U )[X] with the condition that the product of their leading coefficients is not 0; other branches correspond to the cases where this product is 0. In addition, for dealing with a disequality parametric constraint, a probabilistic check is employed for radical membership test of an ideal of parametric constraints. This is in contrast to a general expensive check based on Rabinovitch’s trick using a new variable as in Nabeshima’s algorithm. The proposed algorithm has been implemented in Magma and experimented with a number of examples from different applications. Its performance (vis a vie number of branches and execution timings) has been compared with the Suzuki-Sato’s algorithm and Nabeshima’s speed-up algorithm. The algorithm has been successfully used to solve the famous P3P problem from computer vision.
I.1.2 [Symbolic and Algebraic Manipulation]
General Terms Algorithms
Keywords Gr¨ obner basis, comprehensive Gr¨ obner system, radical ideal membership, probabilistic check.
1.
INTRODUCTION
A new algorithm for computing a comprehensive Gr¨ obner system (CGS), as defined by Weispfenning [18] for parametric ideals (see also [7] where a related concept of parametric Gr¨ obner system was introduced) is proposed. The main advantage of the proposed algorithm is that it generates fewer branches (segments) compared to other related algorithms; as a result, the algorithm is able to compute comprehensive Gr¨ obner systems for many problems from different application domains which could not be done previously. In the rest of this section, we provide some motivations for comprehensive Gr¨ obner systems and approaches used for computing them. Many engineering problems are parameterized and have to be repeatedly solved for different values of parameters [4]. A case in point is the problem of finding solutions of a parameterized polynomial system. One is interested in finding for what parameter values, the polynomial system has a common solution; more specifically, if there are solutions, one is also interested in finding out the structure of the solution space (finitely many, infinitely many, in which their dimension, etc.). One recent application of comprehensive Gr¨ obner systems is in automated geometry theorem proving [2] and automated geometry theorem discovery [11]. In the former, the goal is to consider all possible cases arising from an ambiguous problem formulation to determine whether the conjecture is generic enough to be valid in all cases, or certain cases have to be ruled out. In the latter, one is interested in identifying different relationship among geometric entities for different parameter values. Another recent application is in the automatic generation of loop invariants and inductive assertions of programs operating on numbers using quantifier elimination methods as proposed in [8]. The main idea is to hypothesize invariants/assertions to have a template like structure (such as a polynomial in which
∗The first author is supported by the National Science Foundation award CCF-0729097 and the last two authors are supported by NSFC 10971217, 10771206 60821002/F02.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. To copy otherwise, to republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. ISSAC 2010, 25–28 July 2010, Munich, Germany. Copyright 2010 ACM 978-1-4503-0150-3/10/0007 ...$10.00.
29
the degree of every variable is ≤ 2, or a polynomial with a predetermined support), in which the presence/coefficient of a power product is parameterized. Verification conditions from the program are then generated which are formulas involving parameterized polynomial equations. The objective is to generate conditions on parameters which make these verification conditions to be valid. See [8] for more details. Let k be a field, R be the polynomial ring k[U ] in the parameters U = {u1 , · · · , um }, and R[X] be the polynomial ring over the parameter ring R in the variables X = {x1 , · · · , xn } and X ∩ U = ∅, i.e., X and U are disjoint sets. Given a polynomial set F ⊂ R[X], we are interested in identifying conditions on parameters U such that the solution structure of the specialized polynomial system F for the values of U satisfying these conditions is different from other parameter values. One way to do this is to compute a comprehensive Gr¨ obner system as introduced by Weispfenning, which is a finite set of triples of the form (Ei , Ni , Gi ), where Ei , Ni are finite sets of polynomials in k[U ] and σ(Gi ) is a Gr¨ obner basis of σ(F ), for every specialization σ such that for every ei ∈ Ei , ei vanishes and for at least one ni ∈ Ni , ni does not vanish; we will say that in that case σ satisfies the parametric constraints. Furthermore, for every specialization, there is at least one triple whose parametric constraints satisfy it. We will call each triple as a branch (also called a segment) in a comprehensive Gr¨ obner system. In 1992, Weispfenning [18] gave an algorithm for computing a comprehensive Gr¨ obner system but it suffered from the problem of too many branches, many of which leading to the Gr¨ obner basis {1}.1 Since then, many improvements have been made to improve these algorithms to make them useful for different applications; see [10, 14, 15, 9]. A major breakthrough was an algorithm proposed by Suzuki and Sato [16] (henceforth called the SS algorithm) in which they showed how traditional implementations of Gr¨ obner basis algorithms for polynomial rings over a field could be exploited for computing a comprehensive Gr¨ obner basis system. The main idea of the SS algorithm is to compute a Gr¨ obner basis G from the parametric ideal basis in k[U, X] using the block ordering in which U X. In case G has polynomials purely in the parameters U , there are branches corresponding to each such polynomial being not equal to 0 in which case the Gr¨ obner basis is {1} for the specialization. For the branch when all these polynomials are 0, the Gr¨ obner basis is G minus these polynomials under the additional condition that the leading coefficient of each polynomial is nonzero. In addition, there are branches corresponding to the cases when each of these leading coefficients is 0. Nabeshima’s speed-up algorithm [12] improves upon the SS algorithm by using the fact that (i) for every leading power product, only one coefficient needs to be made nonzero, and (ii) Rabinovitch’s trick of introducing a new variable can be used to make that polynomial monic. Nabeshima reported that these tricks led to fewer branches of the SSalgorithm for most examples. The algorithm proposed in this paper uses ideas from the construction proposed by Weispfenning[19] for computing a canonical comprehensive Gr¨ obner basis of a parametric ideal as the starting point. The proposed algorithm integrates the ideas about essential and inessential specializations from Weispfenning’s construction with the key insight
in the Suzuki-Sato (SS) algorithm based on Kalkbrener’s results about specialization of ideals and stability of their Gr¨ obner bases. First, let G be the the reduced Gr¨ obner basis of a parametric ideal hF i ⊂ k[U, X] w.r.t. ≺X,U , and let Gr = G ∩ k[U ], the polynomials in parameters only in G. A noncomparable set Gm , which is defined in section 4, is extracted from G\Gr , consisting only of polynomials with nondivisible powerproducts in X in G. Let h be the product of the leading coefficients of the polynomials in Gm . (Gr , {h}, Gm ) is one of the branches of the comprehensive Gr¨ obner system of F . Based on case analysis over the leading coefficients of the polynomials in Gm , it is possible to compute the remaining branches of a comprehensive Gr¨ obner system. For computing a Gr¨ obner basis for specializations along many branches, it is useful to perform radical membership check of a parametric constraint in an ideal of other parametric constraints for checking consistency. Instead of using Rabinovitch’s trick of introducing a new variable for radical membership check as proposed in Nabeshima’s speed-up version of the SS algorithm, we have developed a collection of useful heuristics for this check based on case analysis on whether the ideal whose radical membership is being checked, is 0-dimensional or not. In case of a positive dimensional ideal, a probabilistic check is employed after randomly specializing the independent variables of the ideal. The general check is performed as a last resort. The paper is organized as follows. Section 2 gives notations and definitions used. Section 3 briefly reviews the Suzuki-Sato algorithm. Section 4 is the discussion of the key insights needed for the proposed algorithm; the new algorithm is presented there as well. Section 5 discusses heuristics for checking radical membership of an ideal. Section 6 illustrates the proposed algorithm on a simple example. Empirical data and comparison with the SS-algorithm and Nabeshima’s speed-up algorithm are presented in Section 7. Concluding remarks follow in Section 8.
2.
NOTATIONS AND DEFINITIONS
Let k be a field, R be the polynomial ring k[U ] in the parameters U = {u1 , · · · , um }, and R[X] be the polynomial ring over R in the variables X = {x1 , · · · , xn } and X∩U = ∅. Let P P (X), P P (U ) and P P (U, X) be the sets of power products of X, U and U ∪ X respectively. ≺X,U is an admissible block term order on P P (U, X) such that U X. ≺X and ≺U is the restriction of ≺X,U on P P (X) and P P (U ), respectively. For a polynomial f ∈ R[X] = k[U ][X], the leading power product, leading coefficient and leading monomial of f w.r.t. the order ≺X are denoted by lppX (f ), lcX (f ) and lmX (f ) respectively. Since f can also be regarded as an element of k[U, X], in this case, the leading power product, leading coefficient and leading monomial of f w.r.t. the order ≺X,U are denoted by lppX,U (f ), lcX,U (f ) and lmX,U (f ) respectively. Given a field L, a specialization of R is a homomorphism σ : R −→ L. In this paper, we assume L to be the algebraic closure of k, and consider the specializations induced by the elements in Lm . That is, for a ¯ ∈ Lm , the induced homomorphism σa¯ is denoted as σa¯ : f −→ f (¯ a), f ∈ R. Every specialization σ : R −→ L extends canonically to a homomorphism σ : R[X] −→ L[X] by applying σ coefficient-wise.
1 Kapur’s algorithm for parametric Gr¨ obner bases suffered from similar weaknesses.
Definition 2.1. Let F be a subset of R[X], A1 , · · · , Al
30
be algebraically constructible subsets of Lm and G1 , · · · , Gl be subsets of R[X], and S be a subset of Lm such that S ⊆ A1 ∪ · · · ∪ Al . A finite set G = {(A1 , G1 ), · · · , (Al , Gl )} is called a comprehensive Gr¨ obner system on S for F if σa¯ (Gi ) is a Gr¨ obner basis of the ideal hσa¯ (F )i ⊂ L[X] for a ¯ ∈ Ai and i = 1, · · · , l. Each (Ai , Gi ) is called a branch of G. If S = Lm , G is called a comprehensive Gr¨ obner system for F .
an efficient implementation of a Gr¨ obner basis algorithm over a polynomial ring over a field. It has very good performance since it can take advantage of well-known fast implementations for computing Gr¨ obner bases. The algorithm however suffers from certain weaknesses. The algorithm does not check whether V (G ∩ R) \ V (h) is empty; as a result, many redundant/unnecessary branches may be produced. In [16], an improved version of the algorithm is reported which removes redundant branches. To reduce the number of branches generated from the SS algorithm, Nabeshima proposed a speed-up algorithm in [12]. The main idea of that algorithm is to exploit disequality parametric constraints for simplification. For every leading power product in G \ R that is a nontrivial multiple of any other leading product in it, a branch is generated by asserting its leading coefficient hi to be nonzero. The corresponding polynomial is made monic using Rabinovitch’s trick of introducing a new variable to handle the disequality hi 6= 0, and the Gr¨ obner basis computation is performed again, simplifying polynomials whose leading power products are multiples, including their parametric coefficients.
Definition 2.2. A comprehensive Gr¨ obner system G = {(A1 , G1 ), · · · , (Al , Gl )} on S for F is said to be minimal if for every i = 1, · · · , l, (i) for each g ∈ Gi , σa¯ (lcX (g)) 6= 0 for any a ¯ ∈ Ai , (ii) σa¯ (Gi ) is a minimal Gr¨ obner basis of the ideal hσa¯ (F )i ⊂ L[X] for a ¯ ∈ Ai , and (iii) Ai 6= ∅, and furthermore, for each i, j = 1 · · · l, Ai ∩ Aj = ∅ whenever i 6= j. For an F ⊂ R = k[U ], the variety defined by F in Lm is denoted by V (F ). In this paper, the constructible set Ai always has the form: Ai = V (Ei ) \ V (Ni ) where Ei , Ni are subsets of k[U ]. If Ai = V (Ei ) \ V (Ni ) is empty, the branch (Ai , Gi ) is redundant. Definition 2.3. For E, N ⊂ R = k[U ], a pair (E, N ) is called a parametric constraint. A parametric constraint (E, N ) is said to be consistent if the set V (E) \ V (N ) is not empty. Otherwise, (E, N ) is called inconsistent.
4.
We present below a new algorithm for computing a comprehensive Gr¨ obner system which avoids unnecessary branches in the SS algorithm. This is done using the radical ideal membership check for parametric constraints asserted to be nonzero. Heuristics are employed to do this check; when these heuristics fail, as exhibited by Table 2 in Section 7 on experimental results, only then the general check is performed by introducing a new variable, since this check is very inefficient because of the extra variable. Further, all parametric constraints leading to the specialized Gr¨ obner basis being 1 are output as a single branch, leading to a compactified output. Another major improvement of the proposed algorithm is that along any other branch for which the specialized Gr¨ obner basis is different from 1, exactly one polynomial from G \ R per minimal leading power product is selected. This is based on a generalization of Kalkbrener’s Theorem 3.1. All these results are integrated into the proposed algorithm, resulting in considerable efficiency over the SS algorithm and Nabeshima’s improved algorithm by avoiding expensive Gr¨ obner basis computations along most branches. The proposed algorithm is based on the following theorem. The definitions below are used in the theorem.
It is easy to see that the consistency of (E, N ) can be checked by ensuring that at least one f ∈ N is not in the radical of hEi.
3.
THE PROPOSED ALGORITHM
THE SUZUKI-SATO ALGORITHM
In this section, we briefly review the key ideas of the Suzuki-Sato algorithm [16]. The following two lemmas serve as the basis of the SS algorithm. The first lemma is a corollary of the Theorem 3.1 given by Kalkbrener in [6]. Lemma 3.1. Let G be a Gr¨ obner basis of the ideal hF i ⊂ k[U, X] w.r.t. the order ≺X,U . For any a ¯ ∈ Lm , let G1 = {g ∈ G|σa¯ (lcX (g)) 6= 0}. Then σa¯ (G1 ) = {σa¯ (g)|g ∈ G1 } is a Gr¨ obner bases of hσa¯ (F )i in L[X] w.r.t. ≺X if and only if σa¯ (g) reduces to 0 modulo σa¯ (G1 ) for every g ∈ G. The next lemma, which follows from the first lemma, plays the key role in the design of the SS algorithm. Lemma 3.2. Let G be a Gr¨ obner basis of the ideal hF i ⊂ k[U, X] w.r.t. the order ≺X,U . If σa¯ (lcX (g)) 6= 0 for each g ∈ G \ (G ∩ R), then σa¯ (G) is a Gr¨ obner basis of hσa¯ (F )i in L[X] w.r.t. ≺X for any a ¯ ∈ V (G ∩ R).
Definition 4.1. Given a set G of polynomials which are a subset of k[U, X] and an admissible block order with U X, let Noncomparable(G) be a subset, called F , of G such that (i) for every polynomial g ∈ G, there is some polynomial f ∈ F such that lppX (g) is a multiple of lppX (f ) and (ii) for any two distinct f1 , f2 ∈ F , neither lppX (f1 ) is a multiple of lppX (f2 ) nor lppX (f2 ) is a multiple of lppX (f1 ).
The main idea of the SS algorithm is to first compute a reduced Gr¨ obner basis, say G, of hF i ⊂ k[U, X] w.r.t. ≺X,U , which is also a Gr¨ obner basis of the ideal hF i ⊂ k[U ][X] w.r.t. ≺X . Let {h1 , · · · , hl } = {lcX (g) | g ∈ G \ R} ⊂ R. By the above lemma, (G ∩ k[U ], V (h1 ) ∪ · · · ∪ V (hl ), G) forms a branch of the comprehensive Gr¨ obner system for F . That is, for any a ¯ ∈ V (G ∩ k[U ]) \ (V (h1 ) ∪ · · · ∪ V (hl )), σa¯ (G) is a Gr¨ obner basis of hσa¯ (F )i in L[X] w.r.t. ≺X . To compute other branches corresponding to the specialization a ¯ ∈ V (h1 ) ∪ · · · ∪ V (hl ), Lemma 3.2 is used for each F ∪ {hi }, the above steps are repeated. Since hi ∈ / hF i, the algorithm terminates in finitely many steps. As stated earlier, this algorithm can be easily implemented in most of the computer algebra systems already supporting
It is easy to see that hlppX (Noncomparable(G)i = hlppX (G)i. The following simple example shows that Noncomparable(G) may not be unique. Let G = {ax2 − y, ay 2 − 1, ax − 1, (a + 1)x − y, (a + 1)y − a} ⊂ Q[a, x, y], with the lexicographic order on terms with a < y < x. Then F = {ax − 1, (a + 1)y − a} and F 0 = {(a + 1)x − y, (a + 1)y − a} are both Noncomparable(G). It is easy to verify hlppX (F )i = hlppX (F 0 )i = hlppX (G)i = hx, yi.
31
where c is a nonzero constant in L and spolyX (gj , gk ) ∈ k[U ][X] is the s-polynomial of gj and gk w.r.t. X. Assume G \ G1 = {gs+1 , · · · , gl }. Since G is a Gr¨ obner basis of hGi ⊂ k[U, X] and spolyX (gj , gk ) ∈ hGi ⊂ k[U, X], there exist h1 , · · · , hl ∈ k[U, X] such that
Definition 4.2. Given F ⊂ k[U, X] and p ∈ k[U, X], p is said to be divisible by F if there exists an f ∈ F such that some power product in X of p is divisible by lppX (f ). Theorem 4.3. Let G be a Gr¨ obner basis of the ideal hF i ⊂ k[U, X] w.r.t. an admissible block order with U X. Let Gr =QG ∩ k[U ] and Gm = Noncomparable(G \ Gr ). Denote h = g∈Gm lcX (g) ∈ k[U ]. If σ is a specialization from k[U ] to L such that σ(g) = 0 for g ∈ Gr and σ(h) 6= 0, then σ(Gm ) is a Gr¨ obner basis of hσ(F )i in L[X] w.r.t. ≺X .
spolyX (gj , gk ) = h1 g1 + · · · + hl gl , where lcm(lppX (gj ), lppX (gk )) lppX (hi gi ) for i = 1, · · · , l. Substitute back to (2), then obtain: spoly(σ(gj ), σ(gk )) = c(σ(h1 )σ(g1 ) + · · · + σ(hl )σ(gl )), (3)
Proof. Consider any p ∈ G \ (Gr ∪ Gm ); p is divisible by Gm . p can be transformed by multiplying it with the leading coefficients of polynomials in Gm and then reduced using Gm , and then this process can be repeated on the result. Let r be the remainder of p w.r.t. Gm in X obtained by multiplying p by the leading coefficient of g ∈ Gm such that r does not have any power product that is a multiple of any of the leading power products of polynomials in Gm (r could be different depending upon the order in which different polynomials in Gm are used to transform p). Thus, (lcX (g1 ))
α1
αs
· · · (lcX (gs ))
p = q1 g1 + · · · + qs gs + r,
where lcm(lppX (σ(gj )), lppX (σ(gk ))) = lcm(lppX (gj ), lppX (gk )) lppX (hi gi ) lppX (σ(hi ))lppX (gi ) for i = 1, · · · , l. The next step is to use the hypothesis that for each p ∈ G \ G1 , there exist p1 , · · · , ps ∈ L[X] such that: σ(p) = p1 σ(g1 ) + · · ·+ps σ(gs ), where lppX (p) lppX (pi σ(gi )) for i = 1, · · · , s. Substitute these representations back to (3), we get spoly(σ(gj ), σ(gk )) = p01 σ(g1 ) + · · · + p0s σ(gs ),
L[X] and lcm(lppX (σ(gj )), lppX (σ(gk ))) = 1, · · · , s. In fact, (4) is a t-representation of spoly(σ(gj ), σ(gk )) with t ≺ lcm(lppX (σ(gj )), lppX (σ(gk ))). Therefore, by the theory of t-representations, σ(G1 ) is a Gr¨ obner basis. The lemma is proved.
(1)
where gi ∈ Gm , qi ∈ k[U, X] for i = 1, · · · , s, r ∈ k[U, X] such that no power product of r in X is a multiple of any of the leading power products of Gm . Since p ∈ hF i, r ∈ hF i. Since G is a Gr¨ obner basis of hF i in k[U, X], r reduces to 0 by G. However, r is reduced (in normal form) w.r.t Gm in X (and hence reduced w.r.t G\Gr in X also, by the definition of Gm ); so r reduces to 0 by Gr only and further no new power products in X can be introduced during the simplification of r by Gr . So r ∈ hGr i ⊂ k[U, X]. Additionally, lppX (p) lppX (qi gi ) since lcX (gi ) ∈ k[U ]. Let c = (lcX (g1 ))α1 · · · (lcX (gs ))αs . Apply σ to the both sides of (1), then we have:
4.1
σ(c)σ(p) = σ(q1 )σ(g1 ) + · · · + σ(qs )σ(gs ) + σ(r). Since σ(h) 6= 0 by assumption, σ(lcX (g)) 6= 0 for g ∈ Gm ; σ(g) = 0 for g ∈ Gr which implies that σ(r) = 0. Notice 0 6= σ(c) ∈ L and lppX (p) lppX (qi gi ), using the following lemma, σ(Gm ) is a Gr¨ obner basis of hσ(G)i = hσ(F )i. In the above theorem, if Gr = ∅, then Gm is actually a Gr¨ obner basis of the ideal hF i ⊂ k(U )[X]. We assume that the reader is familiar with the concept of t-representations which is often used to determine if a set of polynomials is a Gr¨ obner basis; for details, consult [1]. Lemma 4.4. Let G be a Gr¨ obner basis of hGi ⊂ k[U, X] w.r.t. an admissible block order with U X. Let G1 = {g1 , · · · , gs } ⊂ G and σ be a specialization from k[U ] to L such that σ(lcX (gi )) 6= 0 for i = 1, · · · , s. If for each p ∈ G \ G1 , there exist p1 , · · · , ps ∈ L[X] such that: σ(p) = p1 σ(g1 ) + · · · + ps σ(gs ), where lppX (p) lppX (pi σ(gi )) for i = 1, · · · , s, then σ(G1 ) is a Gr¨ obner basis of hσ(G)i in L[X] w.r.t. ≺X . Proof. By the hypothesis, it is easy to check σ(G) ⊂ hσ(G1 )i and hence σ(G1 ) is a basis of hσ(G)i. So it remains to show σ(G1 ) is a Gr¨ obner basis. For each gj , gk ∈ G1 , we compute the s-polynomial of σ(gj ) and σ(gk ) in L[X]. Since σ(lcX (gj )) 6= 0 and σ(lcX (gk )) 6= 0, we have spoly(σ(gj ), σ(gk )) = cσ(spolyX (gj , gk )),
(4)
where p01 , · · · , p0s ∈ lppX (p0i σ(gi )) for i
(2)
32
Algorithm
We are now ready to give the algorithm for computing a minimal comprehensive Gr¨ obner system. Its proof of correctness uses Theorem 4.3. Its termination can be proved in a way similar to the SS algorithm presented in [16]. In order to keep the presentation simple so that the correctness and termination of the algorithm are evident, we have deliberately avoided tricks and optimizations such as factoring h below. All the tricks suggested in the SS algorithm can be used here as well. In fact, our implementation incorporates fully these optimizations. Algorithm PGBMain Input: (E, N, F ): E, N , finite subsets of k[U ]; F , a finite subset of k[U, X]. Output: a finite set of 3-tuples (Ei , Ni , Gi ) such that {(V (Ei ) \ V (Ni ), Gi )} constitute a minimal comprehensive Gr¨ obner system of F on V (E) \ V (N ). begin if V (E) \ V (N ) = ∅ then return ∅ end if G← ReducedGr¨ obnerBasis(F ∪ E, ≺X,U ) if 1 ∈ G then return {(E, N, {1})} end if Gr ←G ∩ k[U ] # V (Gr ) ⊂ V (E) if (V (E) \ V (Gr )) \ V (N ) = ∅ then PGB←∅ else PGB←{(E, Gr ∧ N, {1})} end if if V (Gr ) \ V (N ) = ∅ then return PGB; else Gm ← Noncomparable(G \ Gr ) {h1 , · · · , hs }←{lcX (g) : g ∈ Gm } h←lcm{h1 , · · · , hs }; if (V (Gr ) \ V (N )) \ V (h) 6= ∅ then PGB←PGB ∪ {(Gr , N ∧ {h}, Gm )} end if PGB←PGB ∪ PGBMain(Gr ∪ {h1 }, N, G \ Gr )∪ PGBMain(Gr ∪ {h2 }, N ∧ {h1 }, G \ Gr )∪ PGBMain(Gr ∪ {h3 }, N ∧ {h1 h2 }, G \ Gr )∪ ······
PGBMain(Gr ∪ {hs }, N ∧ {h1 · · · hs−1 }, G \ Gr ) return PGB
membership check is complete, i.e., it decides whether f is in the radical ideal of E or not. In case E is of positive dimension, then roughly, independent variables are assigned randomly, hopefully, resulting in a 0-dimensional ideal, for which the radical membership check can be done. However, this heuristic is not complete. If this heuristic cannot determine whether (E, {f }) is inconsistent, then another heuristic k is employed that checks whether f 2 is in the ideal of E for a suitably small value of k.
end if end In the above algorithm, A ∧ B = {f g|f ∈ A, g ∈ B}. Checking whether V (A) \ V (B) is empty, is equivalent to the inconsistency of the parametric constraint (A, B). Similarly checking whether (V (A) \ V (B)) \ V (C) = V (A) \ (V (B) ∪ V (C)) is empty, is equivalent to checking whether (A, B ∧ C) is inconsistent. The next section focuses on how the consistency check of a parametric constraint is performed. As should be evident, a branch is never generated for the case when (Ei , Ni ) is inconsistent. Further, the constructible sets are disjoint by construction. More importantly, branching is done only based on the leading coefficients of Gm = Noncomparable(G\Gr ), instead of the whole G\Gr . As a result, the number of branches generated by the above algorithm is strictly smaller than that of the branches in the SS algorithm. In addition, efficient heuristics are employed to perform the consistency check; as a last resort only when other heuristics do not work, we introduce a new variable to do the consistency check. In fact, this general check is rarely performed as confirmed by experimental data discussed in Section 7. Because of these optimizations, the proposed algorithm has a much better performance than the SS algorithm as well as Nabeshima’s speed-up algorithm, as experimentally shown in Section 7. As shown in [16], a comprehensive Gr¨ obner basis can be computed by adapting the above algorithm for computing a comprehensive Gr¨ obner system by using a new variable. The same technique can be applied to the above algorithm as well for computing a comprehensive Gr¨ obner basis.
5.
5.1
Ideal(E) is 0-dimensional
For the case when E is 0-dimensional, linear algebra techniques can be used to check the radical membership in E. The main idea is to compute the characteristic polynomial of the linear map associated with f , which can be efficiently done using a Gr¨ obner basis of E. Let A = k[U ]/hEi. Consider the map induced by f ∈ k[U ]: mf : A −→ A, [g] 7−→ [f g], where g ∈ k[U ] and [g] is its equivalence class in A. See [3, 17] for the proofs of the following lemmas. Lemma 5.1. Assume that the map mf is defined as above. Then, (1) mf is the zero map exactly when f ∈ hEi. (2) For a univariate polynomial q over k, mq(f ) = q(mf ). (3) pf (f ) ∈ hEi, where pf is the characteristic polynomial of mf . Lemma 5.2. Let pf ∈ k[λ] be the characteristic polynomial of mf . Then for α ∈ L, the following statements are equivalent. (1) α is a root of the equation pf (λ) = 0. (2) α is a value of the function f on V (E). Using these lemmas, we have:
CONSISTENCY OF PARAMETRIC CONSTRAINTS
Proposition 5.3. Let pf ∈ k[λ] be the characteristic polynomial of mf and d = deg(pf ).p (1) pf = λd if and only if f ∈ hEi. (2) pf = q and λ - q if and only if there exists g ∈ k[U ] such that gf ≡ 1 mod hEi. d0 0 (3) pp only if f = λ q, where 0 < d < pd and λ - q if and p / hEi such that f g ∈ hEi. f∈ / hEi and there exists g ∈
As should be evident from the above description of the algorithm, there are two main computational steps which are being repeatedly performed: (i) Gr¨ obner basis computations, and (ii) checking consistency of parametric constraints. As stated above, a parametric constraint (E, N ), E, N ⊂ k[U ] is inconsistent if and only if for each f ∈ N , f is in the radical ideal of hEi. This section discusses heuristics we have integrated into the implementation of the algorithm for the check whether (E, {f }) is inconsistent. In this section, we always assume that E itself is a Gr¨ obner basis. p A general method to check whether f ∈ hEi is to introduce a new variable y and compute the Gr¨ obner basis Gy of hE ∪ {f y − 1}i ⊂ k[U, y] p for any admissible monomial order. If Gy = {1}, then f ∈ hEi and (E, {f }) is inconsistent. Otherwise, (E, {f }) is consistent. However, this method can be, in general, very expensive partly because of introduction of a new variable. Consequently, this method is used only as a last resort when other heuristics fail. The first heuristic is to check whether f is in the ideal generated by E; since in the algorithm, a Gr¨ obner basis of E is already available, the normal form of f is computed; if it is 0, then f is in the ideal of E implying that (E, {f }) is inconsistent. This heuristic turns out to be quite effective as shown from experimental results in Section 7. Otherwise, different heuristics are used depending upon whether E is 0-dimensional or not. In case E is 0-dimensional, the method discussed in the next subsection for the radical
d Proof. (1) ⇒) If pf = λp , then pf (f ) = f d ∈phEi by lemma 5.1, which shows f ∈ hEi. ⇐) Since f ∈ hEi, 0 is the sole value of the function f on V (E). By lemma 5.2, pf = λ d . (2) ⇒) If pf = q and λ - q, then there exist a, b ∈ k[λ] such that aλ + bpf = 1. Substitute λ by f . Then obtain a(f )f + b(f )pf (f ) = 1. pf (f ) ∈ hEi shows a(f )f ≡ 1 mod hEi. ⇐) If there exists g ∈ k[U ] such that gf ≡ 1 mod hEi, then all the values of the function f on V (f ) are not 0, which means the roots of pf (λ) = 0 are not 0 as well by the above lemma. So λ - pf . 0 (3) ⇒) If pf = λd q, where 0 < d0 < d and λ - q, then we p d0 have f ∈ / hEi by (1). By p lemma 5.1, pf (f ) = f q(f ) ∈ hEi, and hence, f q(f ) ∈ hEi. It remains to show / p q(f ) ∈ p hEi. We prove this by contradict. If q(f ) ∈ hEi, then there exists an integer c > 0 such that q c (f ) ∈ hEi, which implies mqc (f ) = q c (mf ) = 0. Thus, q c is a multiple of the minimal polynomial of mf and hence all the irreducible c factors of pf should be factors contradicts pof q . But thisp with λ - q. ⇐) Since f, g ∈ / hEi and f g ∈ hEi, both
33
graded monomial order ≺U ; f , a polynomial in k[U ]. Output: true (consistent) or false . begin V ← independent variables of hlppU (E)i α← ¯ a random element in kl spE← Gr¨ obnerBasis(E|V =α¯ , ≺U ) if hspEi is zero dimension in k[U \ V ] then if Zero-DimCheck(spE, f |V =α¯ ) =true then return true end if end if ; return false end In the above algorithm, we only need to compute the Gr¨ obner basis of hEV =α¯ i which is usually zero dimensional and has fewer variables. So CCheck is more efficient than the general method which needs to compute the Gr¨ obner basis of hE ∪ {f y − 1}i whose dimension is positive. If CCheck(E, {f }) returns true, then (E, {f }) is consistent. However, if CCheck(E, {f }) returns false, it need not be the case that (E, {f }) is inconsistent. k The following simple heuristic ICheck checks whether f 2 is in the ideal generated by E by repeatedly squaring the i normal form of f 2 in an efficient way. Algorithm ICheck Input: (E, {f }): E is the Gr¨ obner basis of hEi w.r.t. ≺U ; f , a polynomial in k[U ]. Output: true (inconsistent) or false . begin loops← an integer given in advance p←f for i from 1 to loops do {m1 , · · · , ml }← monomials of p s←0 for m ∈ {m1 , · · · , ml } do s←s+NormalForm(p · m, E) end for if s = 0 then return true end if p←s end for return false end Clearly, if ICheck(E, {f }) returns true, then (E, {f }) is inconsistent.
f and g are nonzero functions on V (E), but f g is a zero function on V (E). This implies that f vanishes on some but 0 not all points of V (E). By lemma 5.2, pf = λd q, where 0 0 < d < d and λ - q. For the case (2) of proposition 5.3, clearly V (E) \ V (f ) = V (E) holds. For the case (3), it is easy to check V (E) \ V (f ) = V (E ∪ {q(f )}) by Lemma 5.2. So the parametric constraint (E, {f }) is equivalent to (E ∪ {q(f )}, {1}), which converts the disequality constraint into equality constraint. Both (2) and (3) will speed up the implementation of the new algorithm. If E is zero-dimensional, then k[U ]/hEi is a finite vector space and the characteristic polynomial of mf can be generated in [3]. Since in our algorithm, E itself is a Gr¨ obner basis, the complexity of doing radical membership check is of polynomial time, which is much more efficient than the general method based on Rabinovitch’s trick. The following algorithm is based on the above theory: Algorithm Zero-DimCheck Input: (E, {f }): E is the Gr¨ obner basis of the zero dimensional ideal hEi; f , a polynomial in k[U ]. Output: true (consistent) or false (inconsistent). begin pf ← characteristic polynomial of mf defined on k[U ]/hEi d←deg(pf ) if pf 6= λd then return true else return false end if end
5.2
Ideal(E) is of positive dimension
We discuss two heuristics, CCheck and ICheck, for radical membership check; neither one is complete. A subset V of U is independent modulo the ideal I if k[V ]∩ I = {0}. An independent subset of U is maximal if there is no independent subset containing V properly. The following proposition is well-known. Proposition 5.4. Let I ⊂ k[U ] be an ideal and ≺U be a graded order on k[U ]. If k[V ] ∩ lppU (I) = ∅, then k[V ] ∩ I = ∅. Furthermore, the maximal independent subset modulo lppU (I) is also a maximal independent subset modulo I. A maximal independent subset modulo the monomial ideal of hEi can be easily computed; the above proposition thus provides a method to compute the maximal independent subset modulo an ideal. The following theorem is obvious, so the proof is omitted.
5.3
Theorem 5.5. Let hEi ⊂ k[U ] with positive dimension, V be a maximal independent subset modulo hEi, and α ¯ be l an / p element in k where pl is the cardinality of V . If f |V =α¯ ∈ hE|V =α¯ i, then f ∈ / hEi i.e. (E, {f }) is consistent.
Putting All Together
The above discussed checks are done in the following order for checking the consistency of a parametric constraint (E, {f }). First check whether f is in the ideal of E; this check can be easily done by computing the normal form of f using a Gr¨ obner basis of E which is readily available. If yes, then the constraint is inconsistent. If no, then depending upon the dimension of the ideal of E, either Zero-DimCheck or CCheck is performed. If E is 0-dimensional, then the check is complete in that it decides whether the constraint is consistent or not. If E is of positive dimension then if CCheck returns true, the constraint is consistent; otherwise, ICheck is performed. If ICheck succeeds, then the constraint is inconsistent. Finally, the general check is performed by computing a Gr¨ obner basis of E ∪ {f y − 1 = 0}, where y is a new variable different from U .
Since V is a maximal independent subset modulo hEi, the ideal hEi becomes a zero dimensional ideal in k[U \ V ] with probability 1 by setting V to a value in kl randomly when the characteristic of k is 0. In this case, we can use the technique p provided in the last subsection to check if f |V =α¯ ∈ / hE|V =α¯ i. If (E|V =α¯ , f |V =α¯ ) is consistent, then (E, {f }) is consistent. This gives an algorithm for checking p the consistence of (E, {f }). When f ∈ / hEi, this algorithm can detect it efficiently. Algorithm CCheck Input: (E, {f }): E is the Gr¨ obner basis of hEi w.r.t. a
34
6.
A SIMPLE EXAMPLE
famous P3P problem for pose-estimation from computer vision, which is investigated by Gao et al [5] using the characteristic set method; see the polynomial system below. We have compared our implementation with the implementations of Suzuki and Sato’s algorithm as well as Nabeshima’s speed-up version as available in the PGB (ver20090915) package implemented in Asir/Risa system. We have picked examples F3, F5, F6 and F8 from [12] and the examples E4 and E5 from [11]; many other examples can be solved in essentially no time. To get more complex examples, we modified problems from the F5, F6 and F8 in [12] slightly, and they are labeled as S1, S2 and S3. The polynomials for S1, S2, S3 and P3P are given below: S1 = {ax2 y+bx2 +y 3 , ax2 y+bxy+cy 2 , ay 3 +bx2 y+cxy}, X = {x, y}, U = {a, b, c}; S2 = {x4 + abx3 + bcx2 + cdx + da, 4x3 + 3abx2 + 2bcx + cd}, X = {x}, U = {a, b, c, d}; S3 = {ax2 + byz + c, cw2 + by + z, (x − z)2 + (y − w)2 , 2dxw − 2byz}, X = {x, y, z, w}, U = {a, b, c, d}; P 3P = {(1 − a)y 2 − ax2 − py + arxy + 1, (1 − b)x2 − by 2 − qx + brxy + 1}, X = {x, y}, U = {p, q, r, a, b}.
The proposed algorithm is illustrated on an example. Example 6.1. Let F = {ax − b, by − a, cx2 − y, cy 2 − x} ⊂ Q[a, b, c][x, y], with the block order ≺X,U , {a, b, c} {x, y}; within each block, ≺X and ≺U are graded reverse lexicographic orders with y < x and c < b < a, respectively. (1) We have E = ∅, N = {1}: the parametric constraint (E, N ) is consistent. The reduced Gr¨ obner basis of hF i w.r.t. ≺X,U is G = {x3 − y 3 , cx2 − y, ay 2 − bc, cy 2 − x, ax − b, bx − acy, a2 y−b2 c, by−a, a6 −b6 , a3 c−b3 , b3 c−a3 , ac2 −a, bc2 −b}; Gr = G∩Q[a, b, c] = {a6 −b6 , a3 c−b3 , b3 c−a3 , ac2 −a, bc2 −b}. It is easy to see that (E, Gr ) and (E, Gr ∧ N ) are consistent. This leads to the trivial branch of the comprehensive Gr¨ obner system for F : (∅, Gr , {1}). (2) G \ Gr = {x3 − y 3 , cx2 − y, ay 2 − bc, cy 2 − x, ax − b, bx − acy, a2 y − b2 c, by − a}; Gm = Noncomparable(G \ Gr ) = {bx − acy, by − a}. Further, h = lcm{lcX (bx − acy), lcX (by − a)} = b. This results in another branch of the comprehensive Gr¨ obner system for F corresponding to the case when all polynomials in Gr are 0 and b 6= 0: (Gr , {b}, Gm ). Notice that (Gr , {b}) is consistent, which is detected using the ZeroDimCheck. (3) The next case to consider is when b = 0. The Gr¨ obner basis of Gr ∪ {b} is {a3 , ac2 − a, b}. This is the input E 0 in the recursive call of PGBMain, with the other input being N 0 = {1} and F 0 = G \ Gr . It is easy to see that (E 0 , N 0 ) is consistent. The reduced Gr¨ obner basis for F 0 ∪ E 0 is: G0 = {x3 − y 3 , cx2 − y, cy 2 − x, a, b} of which G0r = {a, b}. It is easy to check the parametric constraint (E 0 , G0r ) is inconsistent: the check for a being in the radical ideal of E 0 is confirmed by Icheck; b is in the ideal of E 0 . So no branch is generated from this case. G0m = N oncomparable(G0 \ G0r ) = {cx2 − y, cy 2 − x} and 0 h = lcm{lcX (cx2 − y), lcX (cy 2 − x)} = c. This results in another branch: (G0r , {c}, G0m ). (4) For the case when h0 = c = 0, E 00 = {a, b, c} is the Gr¨ obner basis of G0r ∪ {c} and N 00 = {1}, F 00 = {x3 − y 3 , cx2 − y, cy 2 − x}. The Gr¨ obner basis for F 00 ∪ E 00 is 00 00 G = {x, y, a, b, c}. Then Gr = {a, b, c} and G00m = {x, y}. Since h00 = lcm{lcX (x), lcX (y)} = 1, this gives another branch: (G00r , {1}, G00m ). As h00 = 1, no other branches are created and the algorithm terminates. The result is a comprehensive Gr¨ obner system for F :
Example F3
F5
F6
F8
E4
E5
S1
{1}, if a6 − b6 6= 0 or a3 c − b3 6= 0 or b3 c −a3 6= 0 or ac2 − a 6= 0 or bc2 − b 6= 0, {bx − acy, by − a}, if a6 − b6 = a3 c − b3 = b3 c − a3 = ac2 − a = bc2 − b = 0 and b 6= 0, 2 2 {cx − y, cy − x} if a = b = 0 and c 6= 0, {x, y} if a = b = c = 0.
7.
IMPLEMENTATION AND COMPARATIVE PERFORMANCE
The proposed algorithm is implemented in the system Magma and has been experimented with a number of examples from different application domains including geometry theorem proving and computer vision. Since the algorithm is able to avoid most unnecessary branches and computations, it is efficient and can compute comprehensive Gr¨ obner systems for most problems in a few seconds. In particular, we have been successful in completely solving the
S2
S3
P3P
Table Algorithm pgbM Suzuki-Sato Nabeshima pgbM Suzuki-Sato Nabeshima pgbM Suzuki-Sato Nabeshima pgbM Suzuki-Sato Nabeshima pgbM Suzuki-Sato Nabeshima pgbM Suzuki-Sato Nabeshima pgbM Suzuki-Sato Nabeshima pgbM Suzuki-Sato Nabeshima pgbM Suzuki-Sato Nabeshima pgbM Suzuki-Sato Nabeshima
1: Timings Sys. Br. Magma 6 Risa/Asir 31 Risa/Asir 22 Magma 8 Risa/Asir 11 Risa/Asir 54 Magma 8 Risa/Asir 875 Risa/Asir 17 Magma 18 Risa/Asir − Risa/Asir − Magma 9 Risa/Asir 15 Risa/Asir 24 Magma 38 Risa/Asir 98 Risa/Asir 102 Magma 29 Risa/Asir − Risa/Asir − Magma 15 Risa/Asir − Risa/Asir 49 Magma 30 Risa/Asir − Risa/Asir − Magma 42 Risa/Asir − Risa/Asir −
time(sec.) 0.016 0.5148 0.8268 0.016 0.0156 16.04 0.078 35.97 0.078 0.140 > 1h > 1h 0.016 0.0468 0.7644 0.546 24.09 12.53 3.167 > 1h > 1h 1.420 > 1h 5.413 3.182 > 1h > 39m Error 6.256 > 1h > 28m Error
In the above table, the algorithm pgbM is the proposed algorithm; the algorithm cgs1 stands for the Suzuki-Sato’s algorithm, and the algorithm cgs con1 stands for the Nabeshima’s algorithm from Nabeshima’s PGB package [13] were used. All the timings in the table are obtained on Core2 Duo3.0 with 4GB Memory running WinVista64. As is evident from Table 1, the proposed algorithm gen-
35
9.
erates fewer branches. This is why our algorithm has better performance than the others. An efficient check for the consistency of parametric constraints is critical for the performance of the proposed algorithm. The role of various checks discussed in Section 5 has been investigated in detail. This is reported in Table 2 below, where Tri, 0-dim, C, I, and Gen stand, respectively, for the trivial check, Zero-DimCheck, the CCheck, ICheck, and the general method. Table 2: Info about various consistence checks Exp Tri. 0-dim pos-dim Gen. Total C. I. F3 Num 10 2 3 0 0 15 ≈ % 67% 13% 20% 0% 0% F5 Num 22 0 10 0 0 32 ≈ % 69% 0% 31% 0% 0% F6 Num 22 0 7 8 1 38 ≈ % 58% 0% 18% 21% 3% F8 Num 47 0 29 0 0 76 ≈ % 62% 0% 38% 0% 0% E4 Num 10 7 3 0 0 20 ≈ % 50% 35% 15% 0% 0% E5 Num 67 10 55 0 6 138 ≈ % 49% 7% 40% 0% 4% S1 Num 115 21 36 0 11 183 ≈ % 63% 11% 20% 0% 6% S2 Num 36 0 27 6 0 69 ≈ % 52% 0% 39% 9% 0% S3 Num 110 9 45 1 0 165 ≈ % 67% 5% 27% 1% 0% P3P Num 144 4 63 3 13 227 ≈ % 63% 2% 28% 1% 6% About 61% of the consistency check is settled by the trivial check that a polynomial is in the ideal; about the remaining 36% of the consistency check is resolved by the ZeroDimCheck, CCheck and ICheck. The general method for checking consistency using Rabinovitch’s trick of introducing a new variable is rarely used (almost 3%). We believe that this is one of the main reasons why our proposed algorithm has a vastly improved performance over Nabeshima’s speed-up algorithm which relies on using the general check for the consistency of the parametric constraints.
8.
REFERENCES
[1] Becker, T. and Weispfenning, V. (1993). Gr¨ obner Bases, A Computational Approach to Commutative Algebra. Springer-Verlag. ISBN 0-387-97971-9. [2] Chen, X.F., Li, P., Lin, L., Wang, D.K.(2005) Proving geometric theorems by partitioned-parametric Gr¨ obner bases. In: Hong, H., Wang, D. (eds.) ADG 2004. LNAI, vol. 3763, 34-44. Springer. [3] Cox, D., Little, J., O’Shea, D. (2004). Using Algebraic Geometry. New York, Springer. 2nd edition. ISBN 0-387-20706-6. [4] Donald, B., Kapur, D., and Mundy, J.L.(eds.) (1992). Symbolic and Numerical Computation for Artificial Intelligence. Academic Press. [5] Gao, X.S., Hou, X., Tang, J. and Chen, H. (2003). Complete Solution Classification for the Perspective-Three-Point Problem, IEEE Tran. on PAMI, 930-943, 25(8). [6] Kalkbrener, K. (1997). On the stability of Gr¨ obner bases under specialization, J. Symb. Comp. 24, 1, 51-58. [7] Kapur, D.(1995). An approach to solving systems of parametric polynomial equations. In: Saraswat, Van Hentenryck (eds.) Principles and Practice of Constraint Programming, MIT Press, Cambridge. [8] Kapur, D.(2006). A Quantifier Elimination based Heuristic for Automatically Generating Inductive Assertions for Programs, J. of Systems Science and Complexity, Vol. 19, No. 3, 307-330. [9] Manubens, M. and Montes, A. (2006). Improving DISPGB Algorithm Using the Discriminant Ideal, J. Symb. Comp., 41, 1245-1263. [10] Montes, A. (2002). A new algorithm for discussing Gr¨ obner basis with parameters, J. Symb. Comp. 33, 1-2, 183-208. [11] Montes, A., Recio, T.(2007). Automatic discovery of geometry theorems using minimal canonical comprehensive Gr¨ obner systems. ADG 2006, LNAI 4869, Springer, 113-138. [12] Nabeshima, K.(2007) A Speed-Up of the Algorithm for Computing Comprehensive Gr¨ obner Systems. In Brown, C., editor, ISSAC2007, 299-306. [13] Nabeshima, K.(2007) PGB: A Package for Computing Parametric Gr¨ obner Bases and Related Objects. Conference posters of ISSAC 2007, 104-105. [14] Suzuki, A. and Sato, Y. (2002). An alternative approach to Comprehensive Gr¨ obner bases. In Mora, T., editor, ISSAC2002, 255-261. [15] Suzuki, A. and Sato, Y. (2004) Comprehensive Gr¨ obner Bases via ACGB. In Tran, Q-N.,editor, ACA2004, 65-73. [16] Suzuki, A. and Sato, Y. (2006) A Simple Algorithm to compute Comprehensive Gr¨ obner Bases using Gr¨ obner bases. In ISSAC2006, 326-331. [17] Wang, D.K. and Sun, Y. (2009) An Efficient Algorithm for Factoring Polynomials over Algebraic Extension Field. arXiv:0907.2300v1. [18] Weispfenning, V. (1992). Comprehensive Gr¨ obner bases, J. Symb. Comp. 14, 1-29. [19] Weisphenning, V. (2003). Canonical Comprehensive Gr¨ obner bases, J. Symb. Comp. 36, 669-683.
CONCLUDING REMARKS
A new algorithm for computing a comprehensive Gr¨ obner system has been proposed using ideas from Kalkbrener, Weispfenning, Suzuki and Sato. Preliminary experiments suggest that the algorithm is far superior in practice in comparison to Suzuki and Sato’s algorithm as well as Nabeshima’s speed-up version vis a vis the number of branches generated as well as execution speed. Particularly, we are able to do examples such as the famous P3P problem from computer vision, which have been found extremely difficult to solve using most symbolic computation algorithms. We believe that the proposed algorithm can be further improved. We are exploring conditions under which the radical membership ideal check is unwarranted and additional ideas to make this check more efficient whenever it is needed. We also plan to compare our implementation with other implementations of comprehensive Gr¨ obner system algorithms.
36
Finding All Bessel Type Solutions for Linear Differential Equations with Rational Function Coefficients Mark van Hoeij∗& Quan Yuan Florida State University, Tallahassee, FL 32306-3027, USA
[email protected] &
[email protected]
ABSTRACT
The reason this almost-complete algorithm is not complete is the following: If Bν (f ) satisfies a second order linear differential equation with rational function coefficients, then either: f ∈ C(x), or (square root case): f 6∈ C(x) but f 2 ∈ C(x). However, only the f ∈ C(x) case was handled in [6, 7], the square-root case was listed in the conclusion of [7] as a task for future work. This meant that [6, 7] is not yet a complete solver for 0 F1 and 1 F1 type solutions. In this paper, we treat the square-root case for Bessel functions. The combination of this paper with the treatment of Kummer/Whittaker functions in [6] is then a complete algorithm to find 0 F1 and 1 F1 type solutions whenever they exist2 . The reason why the square-root case was not yet treated in [7] will be explained in the next two paragraphs. If f is a rational function f = A/B, then from the generalized exponents at the irregular singularities, we can compute B, as well as deg(A) linear equations for the coefficients of A, see [7], or see [6] which contains more details and examples. Since a polynomial A of degree deg(A) has deg(A) + 1 coefficients, this meant that only one more equation was needed to reconstruct A, and in each of the various cases in [6, 7] there was a way to compute such an equation. In the square-root case, we can not write f as a quotient of polynomials, but we can write f 2 = A/B. The same method as in [6, 7] will still produce B, and linear equations for the coefficients of A. The number of linear equations for the coefficients of A is still the same as it was in the f ∈ C(x) case. Unfortunately, by squaring f to make it a rational function, we doubled the degree of A, but we do not get more linear equations, which means that in the square-root case the number of linear equations is only 12 deg(A) (plus an additional ≥ 0 equations coming from regular singularities). So in the worst case, the number of equations is only half of the degree of A. This is why the square-root case was not solved in [7] but only mentioned as a future task. Our approach is as follows: One can rewrite A = CA1 Ad2 where A1 can be computed from the regular singularities, but A2 can not. The problem is that while the degree of A2 is only d1 times the degree of A/A1 , the linear equations on the coefficients of A translate into polynomial equations (with degree d) for the coefficients of A2 . Solving systems of polynomial equations can take too much CPU time. However, we discovered that with some modifications, one
A linear differential equation with rational function coefficients has a Bessel type solution when it is solvable in terms of Bν (f ), Bν+1 (f ). For second order equations, with rational function coefficients, f must be a rational function or the square root of a rational function. An algorithm was given by Debeerst, van Hoeij, and Koepf, that can compute Bessel type solutions if and only if f is a rational function. In this paper we extend this work to the square root case, resulting in a complete algorithm to find all Bessel type solutions.
Categories and Subject Descriptors G.4 [Mathematical Software]: Algorithm design and analysis; I.1.2 [Symbolic and Algebraic Manipulation]: Algorithms—Algebraic algorithms
General Terms Algorithms
1.
INTRODUCTION
Let a0 , a1 , a2 ∈ C(x) and let L = a2 ∂ 2 + a1 ∂ + a0 be a differential operator of order two. The corresponding differential equation is L(y) = 0, i.e. a2 y 00 + a1 y 0 + a0 y = 0. Let Bν (x) denote one of the Bessel functions (one of Bessel I, J, K, or Y functions). The question studied in [6, 7] is the following: Given L, decide if there exists a rational function f ∈ C(x) such that L has a solution y that can be expressed1 in terms of Bν (f ). If so, then find f , ν, and the corresponding solutions of L. The same problem was also solved for Kummer/Whittaker functions, see [6]. This means that for second order L, with rational function coefficients, there is an almost-complete algorithm in [6] to decide if L(y) = 0 is solvable in terms of 0 F1 or 1 F1 functions, and if so, to find the solutions. ∗
Supported by NSF grant 0728853 using sums, products, differentiation, and exponential integrals (see Definition 2) 1
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. To copy otherwise, to republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. ISSAC 2010, 25–28 July 2010, Munich, Germany. Copyright 2010 ACM 978-1-4503-0150-3/10/0007 ...$10.00.
2 Other 0 F1 and 1 F1 type functions can be rewritten in terms of Bessel, or Kummer/Whittaker functions. For instance, Airy type functions form a subclass of Bessel type functions (provided that the square-root case is treated!)
37
√ After a change of variables y(x) → y( x), we get a new √ operator LB = x2 ∂ 2 +x∂− 14 (x+ν 2 ), which is still in Q(x)[∂]. Let CV(L, f ) denote the operator obtained from L by change of variables x 7→ f . For any differential field extension K of Q(x), if ν 2 ∈ CK , and if f 2 ∈ K, then CV(LB√, f ) ∈ K[∂] since this operator can can be written as CV(LB , f 2 ). The converse is also true:
can actually obtain linear equations for the coefficients of A2 . This means that we only need to solve linear systems. The result is an efficient algorithm that can handle complicated inputs. An implementation is available online at http://www.math.fsu.edu/∼qyuan.
2.
PRELIMINARIES
2.1
Differential Operators
Lemma 1. Let K be a differential field extension of Q(x), let f, ν be elements of a differential field extension of K, and ν be constant. Then
We let K[∂] be the ring of differential operators with coefficients in a differential field K. Let CK be constants, CK be an algebraic closure of CK . Usually, we have K = CK (x) and CK is a finite extension of Q. We call p ∈ CK ∪ {∞} a singularity of the differential operator L ∈ K[∂], if p = ∞ or p is a zero of the leading coefficient of L or p is a pole of a coefficient of L. If p is not a singularity, p is regular. We say y is a solution of L, if L(y) = 0. The vector space of solutions is denoted as V (L). If p is regular, express P∞ we can i all solutions around p as power series i=0 bi tp where tp denotes the local parameter which is tp = x1 if p = ∞ and tp = x − p, otherwise.
2.2
CV(LB , f ) ∈ K[∂] ⇐⇒ f 2 ∈ K and ν 2 ∈ CK . Proof. It remains to prove =⇒. Let ν be a constant, monic(L) be the differential operator divided by the leading coefficient of L, and M := monic(CV(LB , f )) = ∂ 2 + a1 ∂ + a0 We have to prove a0 , a1 ∈ K =⇒ f 2 , ν 2 ∈ K and so we assume√a0 , a1 ∈ K. Let g = f 2 . By computing M = monic(CV(LB , g)) we find
Formal Solutions and Generalized Exponents
a1 = −ld(ld(g)), a0 =
1 −m
Definition 1. We say e ∈ C[tp
]is a generalized expo R e dtp S, S ∈ Rm , nent of L at p if L has a solution exp tp 1
where ld denotes the logarithmic derivative, ld(a) = a0 /a. Let
1
and S ∈ / tpm Rm , where m ∈ Z and Rm = C[[tpm ]][log(tp )]
a2 := ld(ld(a0 ) + 2a1 ) + ld(a0 ) + 3a1 ,
If e ∈ C we just get a solution xe S, in this case e is called an exponent. If the solution involves a logarithm, we call it a logarithmic solution. If m = 1, then e is unramified, otherwise it is ramified.
a3 := −4a0 /a22 , a4 := a3 (2a1 + ld(a0 )) which are in K since a0 , a1 ∈ K. Direct substitution shows that a2 = ld(g), a3 = g + ν 2 , and a4 = g 0 . Hence g = a4 /a2 ∈ K and ν 2 = a3 − g ∈ K.
Remark 1. Since we only consider second order differential operators, m in the definition can be only 1 or 2.
2.4
If the order of L is n, then at every point p, counting with multiplicity, there aren generalized exponents e1 , e2 , ..., en , R ei and the solutions exp dt S , i = 1, ..., n are a basis of p i tp
Transformations
Definition 2. A transformation between two differential operators L1 and L2 is an onto map from solution space V (L1 ) to V (L2 ). For an order 2 operator L1 ∈ K[∂], there are three types of transformations for which the resulting L2 is again in K[∂] with order 2. They are (notation as in [6, 7]):
solution space V (L). If p is regular, then the generalized exponents of L at p are 0, 1, ..., n−1. One can compute generalized exponents with the Maple command DEtools[gen exp].
2.3
−1 (g + ν 2 )ld(g)2 4
Bessel Functions
(i) change of variables: y(x) R → y(f (x)), f (x) ∈ K \ CK . (ii) exp-product: y → exp( r dx) · y, r ∈ K. (iii) gauge transformation: y → r0 y + r1 y 0 , r0 , r1 ∈ K.
Bessel functions are the solutions of the operators LB1 = x2 ∂ 2 +x∂+(x2 −ν 2 ) and LB2 = x2 ∂ 2 +x∂−(x2 +ν 2 ). The two linearly independent solutions Jν (x) and Yν (x) of LB1 are called Bessel functions of first and second kind, respectively. Similarly the solutions Iν (x) and Kν (x) of LB2 are called the modified Bessel functions of first and second kind. Let Bν (x) refer to one of the Bessel functions. When ν is half integer, LB1 and LB2 are reducible. One can get the solutions by factoring the operators. We will exclude this case from this paper. The change of variables x → ix sends V (LB1 ) to V (LB2 ) and vice versa. Since our algorithm will deal with change of variables, as well as two other transformations (see Section 2.4), we only need one of LB1 , LB2 . We choose LB2 and denote LB := LB2 . LB has only two singularities, 0 and ∞. The generalized 1 exponents are ±ν at 0 and ±t−1 ∞ + 2 at ∞.
We denote them by −→C , −→E , −→G respectively. We can switch the order of −→E and −→G [6]. So we will denote L1 −→EG L2 if some combination of (ii) and (iii) sends L1 to L2 . Likewise we denote L1 −→CEG L2 if some combination of (i), (ii), (iii) sends L1 to L2 . Remark 2. The relation −→EG is an equivalence relation. But −→C is not. Definition 3. We say L1 ∈ K[∂] is projectively equivalent to L2 if and only if L1 −→EG L2 . Lemma 2. (Lemma 3 in [7]) If L1 −→CEG L2 , then there exist an operator M ∈ K[∂] such that L1 −→C M −→EG L2 .
38
√
(ii) p is a pole of f with pole order mp ∈ 12 Z+ such that f = P∞ i i=−mp fi tp , if and only if p ∈ Sirr and ∆(M, p) = P i 2 i<0 ifi tp .
We can apply Lemma 2 to L1 = LB and L2 which is the operator L we want to solve. If M is known (i.e if the change of variables x → f is known), then the map from V (M ) to V (L) can be√computed with existing algorithms [1], [6]. That means LB −→CEG L can be computed if we can find the change of variables. The goal of this paper is to solve differential√ equations in terms of Bessel functions. This means: if LB −→CEG L, then solve L.
If p ∈ Sreg , then ∆(L, p) ≡ ∆(M, p) mod Z which means that we can compute 2mp ν mod Z. P 1 If p ∈ Sirr , then ∆(L, p) ≡ ∆(M, p) mod m Z. Then i<0 fi tip can be computed from ∆(L, p) by dividing coefficients by 2i (the congruence only affects the t0p -term of ∆, but that term is not used when p ∈ Sirr ). Proof. We can use the same proof in [6].
Main problem: Let CK be a field, CK ⊆ C, and let K = CK (x). Let L ∈ K[∂] be irreducible and of order 2. The question we will solve in this paper is the following: Does there exist an operator M ∈ K[∂] such that
i Definition 5. Let f = Σ∞ i=N ai x , N ∈ Z, aN 6= 0. We say that we have a k-term truncated power series for f when the coefficient of xN , ..., xN +k−1 are known.
1. L is projectively equivalent to M , and √
Remark 3. If a k-term truncated series for f is known, then we can compute a k-term truncated series for f 2 .
g
2. LB −→C M for some g ∈ K and some constant ν.
According to Theorem 1 (ii), from ∆(M, p), we can get a dmp e-term truncated series of f at p. In [7], f was assumed to be in K, in which case the truncated series is exactly the polar part of f at p. But in this paper, we have to compute g = f 2 ∈ K. Theorem 1 (ii) gives us the polar part of f , i.e. a truncated series for f . We square it to obtain a truncated series of g. But this truncated series for g has dmp e terms (the same number of terms as the one for f , see Remark 3). So it is only half (rounded up) of the polar part of g. For instance, if f has a pole of order 3 at x = 0, from ∆(L, p) we i can obtain a truncated series Σ−1 i=−3 ai x of f at 0. Squaring this series, we can get the coefficients of x−6 , x−5 , x−4 of g, but not more. So we have:
If so, find g, ν and solve L. √ g f Note that LB −→C M is the same as LB −→C M , where 2 f = g ∈ K. The reason we use the second form is because we can then use the same notation as in [6] [7].
3.
THE CHANGE OF VARIABLES
3.1
The Exponent Difference
To recover f in the transformation −→C , we need some information about f and this information should be invariant under projective equivalence. Since the order of L is 2, we have two exponents e1 , e2 at a point p. We consider the exponent difference ∆(L, p) = ±(e1 − e2 ). One can verify 1 that ∆ modulo m Z is invariant under projective equivalence [6] (Here m is as in Section 2.2). We use a ± sign because we don’t know the order of the generalized exponents. We also define:
f
Corollary 1. If LB −→C M −→EG L and g = f 2 then we have: (i) if p ∈ Sreg then p is a zero of g. (ii) p ∈ Sirr if and only if p is a pole of g. We can also get a dmp e-term truncated series of g from ∆(L, p), where mp is the pole order of f .
Definition 4. A singularity p of L ∈ K[∂] is called:
3.2
(i) apparent singularity if and only if ∆(L, p) ∈ Z and L is not logarithmic at p. This is equivalent to saying that L has a basis of solutions y1 , y2 for which y1 /y2 is analytic at p. (ii) regular singularity if and only if ∆(L, p) ∈ C \ Z or L is logarithmic at p.
The Parameter ν
The exponent difference is also associated with the Bessel parameter ν. As in [6], we have: √
Theorem 2. If LB −→CEG L, then (i) if Sreg = ∅ then ν ∈ Q \ Z. The following hold for any p ∈ Sreg :
−1
(iii) irregular singularity if and only if ∆(L, p) ∈ C[tp 2 ] \ C
(ii) L logarithmic at p if and only if ν ∈ Z. (iii) if L is not logarithmic at p and ∆(L, p) ∈ Q then ν ∈ Q \ Z. (iv) ∆(L, p) ∈ CK \ Q if and only if ν ∈ CK \ Q. (v) ∆(L, p) ∈ / CK if and only if ν ∈ / CK .
we also denote the set of regular singularities and irregular singularities by Sreg and Sirr . Note: Apparent singularities are neither in Sreg nor Sirr . The main work in this paper is to construct a finite set of candidates for (f, ν) from the ∆(L, p). Let g = f 2 ∈ K. If g has a root resp. pole at p of order k ∈ N, then we say that f has a root resp. pole at p of order mp := k2 .
We will divide our algorithm into different cases by different situations in Theorem 2. We call (ii) logarithmic case. (i) and (iii) rational case, and (iv) and (v) irrational case. We also have easy case which will be defined later. For the logarithmic case, we have
f
Theorem 1. Let K = CK (x), and LB −→C M −→EG L, where f 2 ∈ K. Note: L is the input to our algorithm, and f and M are to be computed.
Remark 4. If any p ∈ Sreg is logarithmic then by Theorem 2 (ii), ν ∈ Z, then by again Theorem 2 (ii), we have every p ∈ Sreg must be logarithmic. If not, then L has no Bessel type solutions. Also by the fact C(x)Bν (x)+C(x)Bν0 (x) is invariant under ν → ν + 1 and ν → 1 − ν, for the logarithmic case, we can let ν = 0.
(i) if p is a zero of f with multiplicity mp ∈ 21 Z+ , then p is an apparent singularity or p ∈ Sreg , and ∆(M, p) = 2mp ν.
39
Lemma 6. Assume p ∈ CK , if p ∈ Sreg , we will get one linear equation for the coefficients of A. If p ∈ Sirr with mp as pole order of ∆(L, p), we will get dmp e linear equations.
For the rational case: C(x)Bν0 (x)
Remark 5. Since C(x)Bν (x) + is invariant under ν → ν + 1 and ν → 1 − ν, if ν ∈ Q then we can just focus on ν ∈ [0, 21 ]. If ν = 21 the operator will be reducible, it is easy to solve the operator by factoring. So we just consider ν ∈ [0, 12 ).
Proof. According to Corollary 1 (i), if p ∈ Sreg , p is a zero of A. Then we will get a linear equation of {ai }i=0,...,dA by setting rem(A, x − p) = 0. In addition, for each p ∈ Sirr with with pole order mp , by Corollary 1 (ii) we will have a dmp e-term truncated series of g at p. Then we can get the truncated series of A = gB. On A the other hand, we can rewrite A = Σdi=0 ai xi as a truncated series at p (by Taylor or Laurent series). Since the terms in a Taylor series or Laurent series depend linearly on the coefficients of A, by comparing the coefficients, each term will give a linear equation of ai .
We will give a method to find a finite list of candidates for ν and f later. If we fix f , then we have: Lemma 3. Let Z be the set of all zeroes of f , for p ∈ Z let mp be the multiplicity at p. (i) If ∆(L, p) ∈ CK , then let ∆(L, p) + i Np0 := | 0 ≤ i ≤ 2mp − 1, i ∈ Z 2mp
Example 1.
We can make the rational part of each element in Np0 belong to [0, 21 ]. Let the new set be Np . Then ν ∈ N := ∩p∈Sreg Np . √ (ii) If ∆(L, p) ∈ / CK , we can write ∆(L, p) as a1√ k + a2 1 k where k ∈ CK and a1 , a2 ∈ CK . Then ν = a2m (if for p different p, we get different ν then there are no Bessel type solutions.)
L = ∂2 + −
1 28x4 − 89x3 + 105x2 − 59x + 16)(5x − 2)2 36 x2 (x − 1)2 (x − 2)6
and K = Q(x).3 Then we can compute Sreg = {0}, Sirr = −3 {2} and the truncated series of g at x = 2 is 6t−4 2 + 21t2 + 4 O(t−2 ), so B = (x − 2) and d = 4. We assume A = A 2 Σ4i=0 ai xi . Then rem(A, x) = a0 = 0 give us one linear equaA tion. And since we can rewrite B = (a0 + 2a1 + 4a2 + −4 −2 8a3 + 16a4 )t2 + (a1 + 4a2 + 12a3 + 32a4 )t−3 2 + O(t2 ). By comparing the coefficient of two truncated series, we can get 2 linear equations a0 + 2a1 + 4a2 + 8a3 + 16a4 = 6 and a1 + 4a2 + 12a3 + 32a4 = 21. For this example, we have 5 unknowns and we only have 3 linear equations. But we can still solve it (see Example 3).
Proof. The lemma follows from the fact that we know the number ∆(M, p) = 2mp ν mod Z, the fact that ν 2 ∈ CK , and the fact that C(x)Bν (x) + C(x)Bν0 (x) is invariant under ν → ν + 1 and ν → 1 − ν.
3.3
10x3 − 21x2 + 12x − 4 ∂ x(x − 1)(x − 2)(5x − 2)
Easy, Logarithmic and Irrational Cases
To retrieve f , we need enough linear equations. We asf sume LB −→C M −→EG L. We want to get information about f from L. Since f might not in K, but g = f 2 is in A K, we can assume g = B , A, B ∈ CK [x], B is monic and gcd(A, B) = 1. We want to get information about A, B from L. Since Maple can compute generalized exponents of L, we can compute the exponent difference at singularity p. Then by Corollary 1 we can get the set Sreg , which give us some zeroes of g, and Sirr , which give the truncated series at each p ∈ Sirr . The following two lemmas are true for all cases:
For p ∈ CK , p ∈ / CK , we have: Lemma 7. If p ∈ / CK , let l(x) be the minimal polynomial of p over CK . If p ∈ Sreg , we will have deg(l) linear equations. If p ∈ Sirr , we will have deg(l)·dmp e linear equations. Proof. If p ∈ Sreg , then p is a zero of g. Then all the conjugates in CK of p are zeroes of g. There are deg(l) conjugated zeroes and by setting rem(A, l(x)) = 0, we will get deg(l) linear equations with coefficient in CK . If p ∈ Sirr with mp as pole order of ∆(L, p), we can first consider it in the field CK (p). Then according to lemma 6 we will get P dmp e linear equations with coefficients in CK (p). Let c + n i=0 ci ai = 0 be such an equation, where {ai } are unknowns and {ci } are coefficients in CK (p). We can rewrite P the equation as deg(l)−1 ei pi = 0 where {ei } are linear funci=0 tions with coefficients in CK . Now p is algebraic over CK of degree deg(l), so 1, p, ..., pdeg(l)−1 are linearly independent over CK . Hence the ei are 0; we get deg(l) linear equations over CK . We can do this for each of the dmp e linear equations. Then we get deg(l) · dmp e equations. √ √ Example 2. Suppose 2 √∈ Sreg . If √2 ∈ CK , we get one equation by rem(A, x − 2) = 0. If 2 ∈ / CK , we get 2 two equations by rem(A, x − 2) = 0. √ Suppose 2 ∈ Sirr , and that one of the dm√2 e linear equa√ √ √ /√ CK , we tions is 3 + (1 − 2)a1 + (1 + 2)a2 = 0. If 2 ∈ can rewrite that equation as (3 + a1 + a2 ) + (a2 − a1 ) 2 = 0. Then we can get two equations {3+a1 +a2 = 0, a2 −a1 = 0}.
Lemma 4. We can retrieve B from Sirr . Proof. According to Theorem 1 (ii), if p ∈ Sirr then p is a pole of f . Let mp ∈ 12 Z+ be the pole order of ∆(M,Qp). g has a pole order 2mp . The Theorem implies B = p∈Sirr \{∞} (x − p)2mp . Lemma 5. Let deg(B) + 2m∞ if ∞ ∈ Sirr dA = deg(B) otherwise (i) If ∞ ∈ Sreg then deg(A) < dA ; (ii) if ∞ ∈ Sirr then deg(A) = dA ; (iii) otherwise deg(A) ≤ dA . A In all cases, we can write A = Σdi=0 ai xi , so we have dA + 1 unknowns.
Proof. According to Corollary 1 (i), if ∞ ∈ Sreg then we have deg(A) < deg(B). If ∞ ∈ Sirr with pole order m∞ , then deg(A) = deg(B) + 2m∞ (see Corollary 1 (ii)). If ∞ ∈ / Sirr then f does not have a pole at ∞, so that deg(A) ≤ deg(B).
3
40
the data is from examples at www.math.fsu.edu/∼qyuan
So far, we get at least #Sreg + 12 dA linear equations for the coefficients of A. If this number is greater than deg(A), then we can solve them and find A. We call this case the easy case. This case is very similar to the case in [7]. For the logarithmic case and irrational case, we have:
Lemma 11. We can choose C, such that the dth root of the coefficient of the initial term of the truncated series of A/(CA1 ) at p is in CK . Proof. If (CK ∪∞)∩Sirr = ∅, then extend CK so that it contains at least one element of Sirr . Choose p˜ ∈ (CK ∪∞)∩ Sirr . From ∆(L, p˜), we can compute a truncated series for
Lemma 8. In the logarithmic and the irrational case, we know all zeroes of A. In the irrational case, we know their multiplicities as well.
CA Ad
1 2 f2 = . From it, we can compute a truncated series B 2 for f B/A1 . Let C be the coefficient of the first term of this series, which will finish the proof (note that f 2 B/A1 = CAd2 ).
Proof. By Theorem 1 (i), a change of variables can transfer a regular singularity to an apparent singularity only if ν ∈ Q \ Z. So in the logarithmic and irrational cases, Sreg contains all zeroes. In the irrational case, for each p ∈ Sreg , let ap be the coefficient of the irrational part of the exponent difference. Then a there exists k, such that kΣp∈Sreg ap = dA . Then kp will give the multiplicity of p.
Now the only unknown part of A is A2 . We can assume Pdeg(A2 ) bi xi . Since deg(A2 ) ≤ d1 dA ≤ 31 dA , we have A2 = i=0 Lemma 12. For the rational case, we only need equations to recover A.
+1
We can not get the equations by the same methods as in Lemma 6 and [6, 7]. If we do so, the equations we get for {bi } will not be linear. The solution to this problem is as follows:
In the irrational case, there is only one unknown coefficient, the leading coefficient of A. But we have 21 dA linear equations, enough to get A. In the logarithmic case, we have to do a combinatorial search: try all possible combinations of multiplicities of zeroes of A. After that the only unknown is the leading coefficient of A. We have enough equations to find it. Once we get f , we can get a list of ν by Lemma 3 and Remark 4.
3.4
1 d 3 A
Theorem 3. In the rational case, for A = CA1 Ad2 , and Pdeg(A2 ) A2 = i=0 bi xi , for each p ∈ Sirr with mp as pole order of exponent difference, if p ∈ CK , we will get dmp e linear equations of {bi }. Proof. Since the exponent difference at p will give a A dmp e-term truncated series of g = B at x = p, we can also write B and CA1 as a series at p. Then we can get the dmp egB . We assume the series is term truncated series of Ad2 = CA 1 P −i c t where t is the local parameter at p. We p mp
Rational Case
The hardest case is the rational case. We will compute (see Lemma 9 and 10) a finite set of possible values for d = denom(ν). We notice that d > 2 because the case ν ∈ Z has already been treated (logarithmic case) and if ν ∈ 12 Z then
−2m
can rewrite the series as c2mp tp p S, where S is a power series with the initial term 1. Let S1/d be a power series with d first term 1 such that S1/d = S. Write S1/d = 1 + Σi>0 ai tip where a1 , ..., admp e−1 are computed by Hensel lifting. Let µd = {r | r ∈ CK , rd = 1}. By Lemma 11 there should be a dth root of c2mp in CK . Let c be such a root. Then for each
f
A . LB is reducible. Let LB −→C M −→EG L, g = f 2 = B Let p be a root of A and ∆(L, p) ≡ 2mp ν mod Z. If d | 2mp , change of variables x 7→ f will send p to an apparent singularity. This is hard because if p is apparent, then p ∈ / Sreg , which means that not all roots of A are known (not all roots of A are in Sreg ). But if a zero p of A becomes an apparent singularity, the multiplicity 2mp 4 must be a multiple of d. So we can rewrite A = CA1 Ad2 , where A1 , A2 ∈ CK [x] and C ∈ CK , A1 is monic and the roots of A1 are the known roots of A (the elements of Sreg ). For Sreg = ∅, we can let A1 = 1 and fix d by the following lemma [7]:
−2m /d
r ∈ µd , let Sr = ctp p rS1/d . Then Sr is a truncated segB ries at p whose dth power is the truncated series of CA at p. 1 Pdeg(A2 ) i Then we can also rewrite A2 = i=0 bi x as a truncated series at p. By comparing the coefficients of Sr and A2 , we will get dmp e linear equations. Doing this for every p ∈ Sirr provides enough linear equations to find A. Note that we have to try all combinations of r ∈ µd at every p ∈ Sirr .
Lemma 9. If Sreg = ∅, then d | dA .
Remark 6. If p ∈ / CK , we can use the results from Lemma 7 to get equations. So we can always obtain ≥ 21 dA linear equations, while b 13 dA c + 1 equations are sufficient. So we always get enough linear equations.
For Sreg 6= ∅, we have: Lemma 10. If Sreg 6= ∅, we can find a list of candidate pairs (d, A1 ) by solving an equation.
Remark 7. If we get a candidate (f, d), then {f } × { ad | gcd(a, d) = 1, 1 ≤ a < 12 d} is a list of candidates for (f, ν).
Proof. We assume N = #Sreg , Sreg = {p1 , ..., pN } and ∆(L, p) is the exponent difference at p. Let A1 = ΠN i=1 (x − pi )mpi , 1 ≤ mpi < d and dp = denom(∆(L, p)). For each point p ∈ Sreg , dp | d. So we have l | d where l := lcmp∈Sreg dp . So d can only be a multiple of l, and it must be ≤ dA . So there are bdA /lc possibilities for d. Once we fix d, then for each p ∈ Sirr we have ddp | mp . So solve P d ( N i=1 mpi ) + deg(A2 )d = dA , 1 ≤ mpi < d and dpi | mpi . It will give finitely many candidates for A1 .
To sum up, for all different cases, we have: Theorem 4. From ∆(L, p), we can always get a list of candidates for (f, ν). Proof. We always have at least #Sreg + 12 dA linear equations for the coefficients of A. But we may have enough equations (easy case), or only need either 1 (logarithmic case and irrational case) or 31 dA + 1 equations (rational case) to get g. By Remark 4, Remark 5 Remark 7 and Lemma 3, we can also get a finite list of ν.
4 If mp is multiplicity of f at p, then 2mp is multiplicity of A.
41
The theorem means that we can always find the change of variables. After that, we can compute the projective equivalence to complete the algorithm.
Now we will explain the detail how to retrieve f , ν in different cases.
Example 3. Continue with Example 1. We know Sreg = {0}, Sirr = {2} with the truncated series of g is ∆ = 6t−4 2 + −2 4 21t−3 2 + O(t2 ), B = (x − 2) and dA = 4. Lemma 6 did not provide sufficiently many equations. But for this case the only possible situation is A = CxA32 , and A2 = a0 +a1 x. The truncated series at x = 2 of CA32 is the series of ∆·(x−2)4 /x at 2, which is 3 + 9t2 + O(t22 ). So we can let C = 3. Then gB series of CA is S = 1 + 3t2 . Since K = Q(x), the only 3rd 1 root of 1 is 1. So the only possible truncated series which is 3rd root of S is 1 + t2 + O(t22 ). And comparing it with a0 + a1 x = a0 + 2a1 + a1 t2 , we get two linear equations a0 +2a1 = 1 and a1 = 1. Solve them we get a0 = −1, a1 = 1. 3 . So g = 3x(x−1) (x−2)4
In this case, we have enough linear equations from Lemma 6 to recover g. After that, we can use Lemma 3 to get ν. See Algorithm 2 for detail.
4.
4.1
Easy Case
Data: Sreg , Sirr with truncated series, B, dA Result: potential list of (f, ν) Find all linear equations described in Lemma 6; Solve linear equations to find f ; if there is no solution then output ∅ else Use Lemma 3 to get a list N of candidate ν’s end foreach ν ∈ N do Add (f, ν) to output list end Algorithm 2: Easy Case
THE ALGORITHM
The input of the algorithm is a differential operator L of order 2. We want to find solutions that can be represented in terms of Bessel functions, if such solutions exist. Otherwise the algorithm outputs ∅. Algorithm 1 gives the sketch.
4.2
Logarithmic Case
By Remark 4, we can let ν = 0. By Lemma 8, we know all the zeroes of g. We do not yet know the leading coefficient and the multiplicity of each zero. So we can try all combinations of possible multiplicities. Algorithm 3 will give the sketch.
Data: an irreducible differential operator L Result: solutions represented in terms of Bessel functions if they exist Find all singularities by factoring the leading coefficient of L over CK ; foreach Singularity p do compute the generalized exponents at p, then compute the exponent differences and then the truncated series of g end Get Sreg and Sirr according to the generalized exponent differences; Compute B, dA (Lemma 4 and 5) and the number of linear equations N (N ≥ #Sreg + 21 dA ) ; if N > dA then go to easy case else if L logarithmic at some p ∈ Sreg then go to logarithmic case else if there is p ∈ Sreg with ∆(L, p) ∈ / Q (i.e ν ∈ / Q) then go to irrational case else go to rational case end /* It will give us a list of candidates for (f, ν), where f is the function of the change of variables, and ν is the parameter of Bessel functions */ foreach (f, ν) in list of candidates do Compute an operator M(f,ν) such that
Data: Sreg , Sirr with truncated series, B, dA Result: list of (f, ν) if not every singularity p ∈ Sreg is logarithmic then output ∅ else Let ν = 0, A = aΠp∈Sreg (x − p)ap ; foreach {ap } such that Σp∈Sreg ap = dA do Use linear equations described in Lemma 6 to solve a ; if the solution exists then A Add ( B , 0) to output list end end end Algorithm 3: Logarithmic case
4.3
Irrational Case
In this case, by Lemma 8 we have all the zeroes with multiplicities of g. The only unknown part should be the leading coefficient. But we have at least one linear equations. Algorithm 4 gives the sketch.
f
Data: Sreg , Sirr with truncated series, B, dA Result: list of (f, ν) Use Lemma 8 find all zeroes and multiplicities; Use linear equations given by Lemma 6 to get the leading coefficient; Use Lemma 3 to get a list of candidates for ν’s; Add solutions to output list; Algorithm 4: Irrational case
LB −→C M(f,ν) ; Use algorithm described in [1] to compute whether M(f,ν) −→EG L and compute the transformation; if such transformation exists then Add the solution to Solutions List end end Output the solutions list; Algorithm 1: Main Algorithm
42
4.4
Rational Case
Example 5. Consider the operator:
This is the most complicated case. Let d = denom(ν) and f2 = g =
CA1 Ad 2 . B
15x4 − 30x3 + x2 + 8x − 4 ∂− x(x − 1)(15x3 − 10x2 + 9x − 4) 1 (30375x20 − 36x2 (15x3 − 10x2 + 9x − 4)(x − 1)2
L := ∂ 2 −
Algorithm 5 gives the sketch.
Data: Sreg , Sirr with truncated series, B, dA Result: list of (f, ν) if Sreg = ∅ then Let the list of candidates for d be the set of factors of dA ; Let A1 = 1; else Use Lemma 10 to get a list of candidates for d and A1 end foreach candidate (d, A1 ) do Fix C by Lemma 11; Use linear equations given by Theorem 3 to compute A2 ; If a solution exists, add {f } × { ad | gcd(a, d) = 1, 1 ≤ a < 12 d} to output list end Algorithm 5: Rational case
5.
212625x19 + 733050x18 − 170595x17 + 3034305x16 − 435055x15 + 5166936x14 − 5172228x13 + 4401369x12 − 3189159x11 + 1962738x10 − 1016622x9 + 434943x8 − 149229x7 + 38844x6 − 3933x5 − 4554x4 + 3789x3 − 1612x2 + 432x − 64). Step 1: The non-apparent singularities are ∞, 1, 0. Step 2: Sreg = {1, 0}, with the exponent difference 53 and 4 respectively. We also have Sirr = {∞} and the truncated 3 −14 −13 −12 series of g at x = ∞ is t−15 ∞ − 5t∞ + 13t∞ − 25t∞ + −11 −10 −9 −8 −7 38t∞ − 46t∞ + 46t∞ − 38t∞ + O(t∞ ). So B = 1 and dA = 15. Step 3: we can easily verify that this is a rational case. Since the exponent difference of at 0 and 1 both have denominator 3, so d is a multiple of 3. If d = 3 then A = Cx2 (x − 1)Ad2 or A = Cx(x − 1)2 Ad2 . If d = 6, then the multiplicity of both 1 and 0 should be a multiple of 63 = 2 then it will contradict with dA = 15. Similarly A = Cx3 (x − 1)3 A92 , A = Cx5 (x − 1)10 and A = Cx10 (x − 1)5 are candidates as well. Then we compute each candidate by the method in p Theorem 3. Finally, we get f = x4 (x − 1)5 (x2 + 1)3 and ν = 31 is the only remaining candidate .
EXAMPLES
This section will illustrate the algorithm with a few examples5 .
f
Step 4: Let LB −→C M . Now M is already equal to L. So the general solution is: p C1 I 1 ( x4 (x − 1)5 (x2 + 1)3 )+ 3 p C2 K 1 ( x4 (x − 1)5 (x2 + 1)3 )
Example 4. Let L = ∂ 2 + 2 − 10x + 4x2 − 4x4 . K = Q(x) Step 1: We get Sreg = ∅. Sirr = {∞} with the truncated −3 4 −4 series of g at x = ∞ is 94 t−6 ∞ − 3 t∞ + O(t∞ ). So dA = 6 and B=1. Step 2: It is the rational case with Sreg = ∅. So d ∈ {3, 6} and we can write A = CAd2 . If d = 3 then A = CA32 , A2 = a0 + a1 x + a2 x2 . Since B = 1, then the truncated series of gB is the same as g. So we can let C = 49 . Then −4 −6 2 the truncated series of A32 is t−6 ∞ +3t∞ = t∞ (1−3t∞ ). Since the only 3rd root of 1 in CK is 1, then the only 3rd root of 2 1−3t2∞ is 1−t2∞ . So by comparing coefficients of t−2 ∞ (1−t∞ ) −1 −2 2 and A2 = a0 + a1 t∞ + a2 t∞ , we can get A2 = x − 1 and then g = 94 (x2 − 1)3 . We can do this process for d = 6, in p this case, we have no solution. So we have ( 23 (x2 − 1)3 , 31 ) as the only possible candidate. f Step 3: We compute LB −→C M , and then the projective equivalence from M to L. Combining these transformations produces the following solutions of L:
3
6.
7.
2(2x4 + x3 − 3x2 + x + 2) 2p 2 √ (x − 1)3 ) I1 ( 2 3 3 x −1 2p 2 (x − 1)3 )) + 2(2x + 1)(x2 − 1)I 4 ( 3 3 2(2x4 + x3 − 3x2 + x + 2) 2p 2 √ + C2 ( (x − 1)3 ) K1 ( 3 3 x2 − 1 2p 2 − 2(2x + 1)(x2 − 1)K 4 ( (x − 1)3 )) 3 3 given
REFERENCES
[1] Barkatou, M. A., and Pfl¨ ugel, E. On the Equivalence Problem of Linear Differential Systems and its Application for Factoring Completely Reducible Systems. In ISSAC 1998, 268–275. [2] Bronstein, M. An improved algorithm for factoring linear ordinary differential operators. In ISSAC 1994, 336–340. [3] Bronstein, M., and Lafaille, S. Solutions of Linear Ordinary Differential Equations in Terms of Special Functions. In ISSAC 2002, 23–28.
C1 (
5 More examples are http://www.math.fsu.edu/∼qyuan
CONCLUSION
We developed an algorithm to solve second order differential equations in terms of Bessel functions. We extended the algorithm described in [7] which already solved the problem in the f ∈ C(x) case, but not in the square root case. We implemented the algorithm in Maple (available from http://www.math.fsu.edu/∼qyuan). A future task is to try to develop a similar algorithm to find 2 F1 type solutions.
at
43
[4] Chan, L., and Cheb-Terrab, E. S. Non-Liouvillian Solutions for Second Order Linear ODEs. In ISSAC 2004, 80–86. [5] Cluzeau, T., and van Hoeij, M. A Modular Algorithm to Compute the Exponential Solutions of a Linear Differential Operator. J. Symb. Comput. 38 (2004), 1043–1076. [6] Debeerst, R. Solving Differential Equations in Terms of Bessel Functions. Master’s thesis, Universit¨ at Kassel, 2007. [7] Debeerst, R, van Hoeij, M, and Koepf. W. Solving Differential Equations in Terms of Bessel Functions. In ISSAC 2008, 39–46 [8] Everitt, W. N., Smith, D. J., and van Hoeij, M. The Fourth-Order Type Linear Ordinary Differential Equations. arXiv:math/0603516 (2006). [9] van Hoeij, M. Factorization of Linear Differential Operators. PhD thesis, Universiteit Nijmegen, 1996. [10] van der Hoeven, J. Around the Numeric-Symbolic Computation of Differential Galois Groups. J. Symb. Comp. 42 (2007), 236–264. [11] van der Put, M., and Singer, M. F. Galois Theory of Linear Differential Equations, Springer, Berlin, 2003. [12] Willis, B. L. An Extensible Differential Equation Solver. SIGSAM Bulletin 35 (2001), 3–7.
44
Simultaneously Row- and Column-Reduced Higher-Order Linear Differential Systems Moulay A. Barkatou, Carole El Bacha
Eckhard Pflügel
University of Limoges; CNRS; XLIM UMR 6172, DMI 87060 Limoges, France
Faculty of CISM Kingston University Penrhyn Road Kingston upon Thames, Surrey KT1 2EE United Kingdom
{moulay.barkatou,carole.elbacha}@xlim.fr
[email protected]
ABSTRACT
where x is a complex variable, Ai (x) are m × n matrices of analytic functions and the right-hand side f (x) is a vector of analytic functions of size m. We are interested in the local analysis of such systems at the point x = 0, and therefore can suppose, without loss of generality, that the entries of Ai (x) and f (x) are formal power series. Such systems arise naturally in many applications of multi-body systems, models of electrical circuits, robotic modelling and mechanical systems (see [10, 14, 17] and the references therein). This paper will be mainly focused on algorithms that reduce such a system to an equivalent simpler one. In the first part, we study linear differential-algebraic equations of first-order (` = 1) of the form
In this paper, we investigate the local analysis of systems of linear differential-algebraic equations (DAEs) and secondorder linear differential systems. In the first part of the paper, we show how one can transform an input linear DAE into a reduced form that allows for the decoupling of the differential and algebraic components of the system. Classification of singularities of linear DAEs are defined and discussed. In the second part of the paper, we extend this approach to second-order linear differential systems and discuss two applications: the classification of singularities and the computation of regular solutions. The present paper is the first step towards a generalisation of the formal reduction of first-order ODEs to higher-order systems. Our algorithm has been implemented in the computer algebra system Maple as part of the ISOLDE package.
L(y) = A(x)y 0 (x) + B(x)y(x) = f (x).
The aim is to develop an algorithm which computes a system equivalent to (1) to which the classical theory of ordinary differential equations (ODEs) is applicable and the existence of solutions can be easily decided. Many works have been developed in this direction, see for example [8, 9, 15]. They consist, roughly speaking, in transforming (1) into a simpler differential system so that there exists a one-to-one correspondence between their respective solution sets. In [9], the authors have developed a numerical reduction algorithm for (1) with continuous matrix coefficients on a real closed interval under the assumption that the leading coefficient A and some other sub-matrices have constant rank on this interval. A symbolic method has been presented in [15, 16], improving that of [9], but the size of the system during execution of this algorithm might increase. An older algorithm has been proposed by Harris et al in [8] which reduces (1) to a sequence of first-order systems of ODEs and algebraic systems of lower sizes and some necessary conditions on the right hand side f (x). We shall review this algorithm in more details in Section 3. Traditionally, linear DAEs have been tackled using the notion of differential index introduced in [7] (a range of alternative index definitions exist as well, see for example [17]). Generally speaking, most authors try to extract the underlying ODE which, by definition, is an explicit ordinary differential system computed by differentiating (1) successively and then using only algebraic manipulations. In this paper however, motivated by the work of Harris et al, we use a different strategy: using the terminology of matrix differential operators we find a sequence of left- and righttransformations in order to compute a new operator that has a decoupled differential and algebraic system. Hence, the first contribution of the present paper is the develop-
Categories and Subject Descriptors I.1.2 [Symbolic and Algebraic Manipulation]: Algorithms
General Terms Algorithms
Keywords Computer Algebra, Systems of Linear Differential Equations, Reduction Algorithms, Singularities
1.
INTRODUCTION
We consider linear differential systems of the form L(y) =
` X
(1)
Ai (x)y (i) (x) = f (x)
i=0
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. To copy otherwise, to republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. ISSAC 2010, 25–28 July 2010, Munich, Germany. Copyright 2010 ACM 978-1-4503-0150-3/10/0007 ...$10.00.
45
• interchanging any two rows (columns respectively) of L.
ment of a new reduction algorithm that for L given by (1), ˜ of the form computes an operator L 2 11 3 ˜ 11 A˜ ∂ + B 0 0 ˜ = SLT = A∂ ˜ +B ˜=4 ˜ 22 0 5 L (2) 0 B 0 0 0
Definition 2.1. A square matrix differential operator S ∈ K((x))[∂]m×m is said to be invertible if there exists S˜ ∈ ˜ = S S˜ = Im . K((x))[∂]m×m such that SS
where ∂ = d , S and T are invertible matrix differential dx ˜ 22 are both operators (see Definition 2.1) and A˜11 and B ˜ invertible. Hence the DAE (1) is reduced to L(z) = f˜, where y = T (z) and f˜ = S(f ), which now can be written as two separate problems, possibly of lower size than (1):
An operator S ∈ K((x))[∂]m×m is invertible if and only if it can be expressed as a product of elementary operators (see [12]). ˜∈ Definition 2.2. Two matrix differential operators L, L K((x))[∂]m×n are said to be equivalent if there exist two invertible matrix differential operators S ∈ K((x))[∂]m×m and ˜ = SLT. T ∈ K((x))[∂]n×n such that L
˜ 11 z1 = f˜1 , 1. one being purely differential: A˜11 z10 + B ˜ 22 z2 = f˜2 , 2. and the other one being purely algebraic: B
When the entries of S and T in Definition 2.2 belong to K((x)), we say that (S, T ) is an algebraic transformation. Otherwise, we call it a differential transformation. Furthermore, transformations of the form (S, In ) and (Im , T ) will be referred to as left- and right-transformations respectively. ˜ Two differential systems L(y) = f and L(z) = f˜ are said ˜ are to be equivalent if the corresponding operators L and L equivalent and f˜ = S(f ), where S is given as in Definition 2.2. In this case, the unknowns y and z are related by y = T (z).
together with some necessary conditions on the right-hand side expressed by f˜3 = 0. Note that z3 , when it is present, can be chosen as an arbitrary function. Finally, we conclude this part by exploring the notion of singularities associated with system (1) (see also [16]). In the second part of the paper, we extend our approach to handle any higher-order differential system, but for clarity of exposition, we shall describe the reduction method only for second-order systems. As we shall see, the output operator has a very specific form that we shall call Two-Sided BlockPopov form since it is similar to the Popov form of Ore matrix polynomials (see [6]). The difference between these two forms is that the former is a square matrix operator obtained by performing elementary operations on rows and columns of the input operator, while the latter is, in general, rectangular computed by working on either rows or columns of the input operator but not on both of them at the same time.
2.
3.
REVIEW OF HARRIS’ ALGORITHM
In this section, we shall review the algorithm described in the paper [8] of Harris’ et al. The aim of our presentation is twofold: we would like to raise awareness of this algorithm, as we have not found references to it within the Computer Algebra community. Secondly, our description of the algorithm as a series of differential and algebraic left- and right-transformations of the input operator L = A∂ + B ∈ K[[x]][∂]m×n makes it easier to understand the method. This presentation also makes it particularly suitable for an implementation in a Computer Algebra System.
NOTATIONS AND TERMINOLOGY
Let K be a field of characteristic zero, K[[x]] the ring of formal power series in the variable x and K((x)) its field of fractions. For a matrix A ∈ K((x))m×n , 1 ≤ i ≤ m and 1 ≤ j ≤ n, we denote by RiA its ith row and by CjA its j th column. Moreover, we denote by In the identity matrix of size n, by diag(A11 , . . . , Ann ), where Aii are rectangular matrices, the block matrix the ith diagonal block entry of which is Aii and the other block entries are zero matrices, by ∂ the standard derivation d of K((x)) and by K((x))[∂]m×n dx the ring of m × n matrix differential operator with coefficients in K((x)). Recall that the multiplication in K((x))[∂] is defined as follows: for a ∈ K((x)), ∂a = ∂(a) + a∂ and we shall use sometimes the notation a0 instead of ∂(a). Let P L = `i=0 Ai (x)∂ i ∈ K((x))[∂]m×n with nonzero leading coefficient matrix A` (x). We then say that L is of order ` which we denote by ord(L) := `. An operator S ∈ K((x))[∂]m×m (T ∈ K((x))[∂]n×n respectively) is called elementary operator if the multiplication of L on the left by S (on the right by T respectively) consists in one of the following operations:
The following lemma is the key element of Harris’ algorithm. Lemma 3.1. For every matrix A ∈ K[[x]]m×n of rank r, there exist invertible matrices S ∈ K[[x]]m×m , T ∈ K[[x]]n×n and A˜ ∈ K[[x]]r×r such that » – A˜ 0 SAT = . 0 0 Proof. The proof is similar to that of [8, Lemma 1]. Remark 3.1. The matrices S, T and A˜ in the above lemma are not necessary invertible at x = 0. Furthermore, S and T may be chosen so that A˜ = xk Ir where k ∈ N. In what follows, for ease of presentation, we shall continue using the same symbols L, A, B etc. for the different steps of the algorithm whenever no confusion arises and we denote by r(L) the rank of the leading coefficient A of L, i.e. r(L) := rank A.
• multiplying a row (column respectively) of L by a nonzero element of K((x)),
3.1
Step 1: Normalisation
The first step of Harris’ algorithm is a normalisation step achieved by applying Lemma 3.1 to the leading coefficient A of L. Let S ∈ K[[x]]m×m and T ∈ K[[x]]n×n such that SAT = diag(xk Ir , 0) where k ∈ N and r = rank A. Thus, by
• adding to any row (column respectively) of L another row (column respectively) multiplied by an element of K((x))[∂],
46
the algebraic transformation (S, T ), we obtain the equivalent operator » k – x Ir ∂ + B11 B12 SLT = . (3) B21 B22
˜42 . Hence, the operator will eliminate all the blocks above B to consider now is » q – ˜ ˜ ¯ = x Ir−s ∂ + B11 B13 L ˜21 ˜23 B B
We shall call the form given by (3) a normalised form. After computing a normalised form, the algorithm proceeds to Step 2.
which is in normalised form, of smaller size than L and ¯ < r(L). The algorithm now proceeds recursively to r(L) Step 2.
3.2
Step 2: Algebraic Reduction
After successive applications of Steps 2 and 3, either the linear DAE (1) is reduced to a purely algebraic system together with some necessary conditions on the right-hand side or we reach a stage for which there is no algebraic system and we proceed to Step 4.
We assume that L is in normalised form as in the r.h.s. of (3). If B22 = 0, we go to Step 3. Otherwise, we apply Lemma 3.1 to B22 and we obtain S, T such that SB22 T = diag(0, B33 ) where B33 is an invertible matrix of size a > 0. Using the algebraic transformation (diag(Ir , S), diag(Ir , T )), the new operator can be written as 2 k 3 x Ir ∂ + B11 B12 B13 ˜=4 L (4) B21 0 0 5 ∈ K[[x]][∂]m×n . B31 0 B33
3.4
This latter operator can be further simplified using the algebraic transformation 3 2 31 02 −1 Ir Ir −B13 B33 5,4 5A @4 In−r−a Im−r−a −1 Ia −B33 B31 Ia eliminating B13 and B31 in (4). Finally, after multiplying the first row-block by an appropriate power of x, we obtain 2 q 3 » – ˜11 B ˜12 x Ir ∂ + B 0 L11 0 4 (5) B21 0 0 5 := 0 B33 0 0 B33
Is Im−r−s
3 Ib
7 7. 5
In−r−b ˜ −1 B ˜21 −B 24
˜ −1 (xq Ib ∂ + B ˜22 ) −B 24
Ib
ˆ
˜11 xq Ir−b ∂ + B
˜12 B
˜
¯ < r(L). which is of the form (6) but of smaller size and r(L) We repeat this step until we find an operator L of the form (6) for which B12 is either invertible or zero matrix, upon which the algorithm terminates. The system (6) can now be solved through either a differential or algebraic system, depending on whether B12 = 0 or B12 is invertible.
3 ˜13 B ˜23 7 B 7. 0 5 0
4.
A NEW REDUCTION ALGORITHM
Motivated by the work of Harris et al, we shall develop a new reduction algorithm which computes an operator of the form (2), equivalent to L = A∂ + B ∈ K[[x]][∂]m×n . This algorithm organises the steps of Harris’ algorithm in two main stages: treating the rows of L, and treating its columns. It uses a weaker version of Lemma 3.1 and is essentially based on the computation of left- and right-kernels of rectangular matrices. This is more efficient when implemented in a Computer Algebra System and suitable for a generalisation to higher-order systems.
˜ gives necessary conditions Note that the third row-block of L on the right-hand side of the DAE and the fourth results in ˜ on the left by an algebraic system. Multiplying L 2 3 −1 −xq
–
Ir−b
¯= L
=
Ir−s
0 0 ˜24 0 B
so we consider now
If B21 = 0, then we go to Step 4. Otherwise, we compute S, T ˜42 ) where B ˜42 is an invertible such that SB21 T = diag(0, B matrix of size s > 0. Write
6 S˜ = 6 4
˜12 B ˜22 x Ib ∂ + B q
˜ on the right by T˜ leads to an operator of the Multiplying L form – » q ˜ ˜ 0 ˜ T˜ = x Ir−b ∂ + B11 B12 0 L ˜24 , 0 0 0 B
Step 3: Differential Row-Reduction
diag(T −1 , S) L diag(T, In−r ) 2 q ˜12 ˜11 x Ir−s ∂ + B B q 6 ˜ ˜22 B21 x Is ∂ + B = 6 4 0 0 ˜42 0 B
˜ = S L diag(S −1 , T ) L » q ˜11 x Ir−b ∂ + B = ˜21 B
6 T˜ = 6 4
We can now assume that L is of the form – » q x Ir ∂ + B11 B12 ∈ K[[x]][∂]m×n . L= B21 0
˜ L
If B12 = 0, then we find a system of ODEs hence the algorithm is completed. Otherwise, let S, T such that SB12 T = ˜24 ) where B ˜24 is an invertible matrix of size b > 0. diag(0, B Consider the transformed operator
and define 2
where q ∈ N and L11 ∈ K[[x]][∂](m−a)×(n−a) . The operator L11 is in normalised form (3) with B22 = 0 and we proceed to the next step while the second diagonal block entry of the r.h.s of (5) gives an algebraic system in the new unknown. Note that in this step we have simplified Harris’ algorithm by combining Step I (ii) and (iii) in [8].
3.3
Step 4: Differential Column-Reduction
We can assume now that we have an operator of the form ˜ ˆ (6) L = xq Ir ∂ + B11 B12 .
˜12 B ˜ −B 42 ” “ −1 0 −1 ˜ ˜ ˜22 B ˜ −1 7 (B42 ) + B42 ∂ − B 42 7
5
Is
47
4.1
˜= where A˜11 is an invertible matrix of size q and denote B ˜ ij )i,j=1,2 := AT10 + BT1 . Hence, L is equivalent to (B » 11 – ˜ ˜ 11 B ˜ 12 B ˜ = LT1 = A ∂ + L (9) ˜ 21 ˜ 22 . B B
Row-Reduction
By means of an algebraic left-transformation, we can assume that » 11 – A A12 A= 0 0
The following lemma can be proved similarly to Lemma 4.1.
where A11 ∈ K[[x]]r×r and r = r(L) = rank A. Write B := (B ij )i,j=1,2 partitioned as in A. Hence, the operator to consider is of the form » 11 – A ∂ + B 11 A12 ∂ + B 12 L = A∂ + B = . (7) B 21 B 22
˜ of the Lemma 4.2. Given a matrix differential operator L form (9), we assume that » 11 – » 12 – ˜ 12 ˜ A˜ B ˜11 + rank B 22 . rank < rank A 22 ˜ ˜ 0 B B
Lemma 4.1. Given a matrix differential operator L of the form (7), assume that » 11 – A A12 rank < 21 22 B B ˆ 11 ˜ ˆ ˜ rank A (8) A12 + rank B 21 B 22 .
Then there exists a differential right-transformation T2 such ˜ 2 ) < r(L). ˜ that r(LT We repeat the application of Lemma 4.2 until we find an equivalent operator » 11 – ¯ ¯ 11 B ¯ 12 B ¯ = A∂ ¯ +B ¯= A ∂+ L 21 22 ¯ ¯ B B
Then there exists a differential left-transformation S such that r(SL) < r(L). Proof. Equation (8) is equivalent to say that there exists Pr Pm−r A B 1 ≤ i ≤ r such that RiA = k=1 αk Rk + j=1 βj Rr+j
¯ (r(L) ¯ ≤ q = r(L)) ˜ and has full where A¯11 is of size q × r(L) column rank verifying – » 12 – » 11 ¯ ¯ 12 A¯ B ¯11 + rank B 22 . = rank A rank 22 ¯ ¯ B 0 B
k6=i
where αk , βj ∈ K((x)) and at least one of the βj is nonzero. Let S be the differential left-transformation defined by the identity matrix of size m the ith row of which is replaced by ˆ ˜ −α1 · · · 1 · · · −αr −β1 ∂ · · · −βm−r ∂ ,
¯ by an algebraic right-transformation Finally, we multiply L » 12 – ¯ B to cancel all linearly dependent columns of ¯ 22 . B
where 1 comes at the ith position. Multiplying L on the left by S will replace the ith row of L by RiA ∂
+
RiB
−
r X
αk (RkA ∂
+
RkB )
−
m−r X
B βj (∂(Rr+j )
+
4.3
B Rr+j ∂)
After carrying out a series of row- and column-reductions until neither Lemma 4.1 nor Lemma 4.2 can be applied, the operator L given by (1) will be equivalent to 3 2 11 ˜ 12 0 ˜ 11 B » – A˜ ∂ + B ˜ ˜=4 ˜ 22 0 5 := L1 0 ˜ 21 L B B 0 0 0 0 0
j=1
k=1 k6=i
= RiB −
r X k=1 k6=i
αk RkB −
m−r X
B βj ∂(Rr+j ).
j=1
This means that we replace the ith P row of A by a zero row B B Pr and that of B by Ri − k=1 αk RkB − m−r j=1 βj ∂(Rr+j ), hence
˜ 1 is of size p × s and A˜11 is an invertible matrix of where L size d. Furthermore, we have – » 11 A˜ 0 (10) rank ˜ 21 B ˜ 22 = p B
k6=i
r(SL) < r(L). We repeat Lemma 4.1 until we find an equivalent operator » 11 – ˜ 12 ˜ ˜ 11 A˜12 ∂ + B B ˜ = A∂ ˜ +B ˜= A ∂+ L 21 22 ˜ ˜ B B ˆ 11 ˜ ˜ ≤ r(L)) and where A˜ A˜12 is of size q × n (q = r(L) has full row rank q with » 11 – A˜ A˜12 rank = 21 22 ˜ ˜ B B ˆ 11 ˜ ˆ 21 ˜ ˜ ˜ 22 . rank A˜ A˜12 + rank B B
and » rank
A˜11 0
˜ 12 B ˜ 22 B
– = s.
(11)
Since A˜11 is invertible, equation (10) (equation (11) respec˜ 22 has full row rank (full column rank tively) implies that B ˜ 22 is invertible and p = s. respectively). Consequently B ˜ 1 into a purely Now it is easy to decouple the operator L differential and purely algebraic system. Indeed, » – » – ˜ 12 (B ˜ 22 )−1 Id 0 Id −B ˜1 L ˜ 22 )−1 B ˜ 21 Ip−d = 0 Ip−d −(B » 11 – ˜ 11 − B ˜ 12 (B ˜ 22 )−1 B ˜ 21 A˜ ∂ + B 0 . 22 ˜ 0 B
The final sub-step of this row-reduction step consists in mul˜ by an algebraic left-transformation to eliminate tiplying L ˆ 21 ˜ ˜ ˜ 22 . all the linearly dependent rows of B B
4.2
Decoupling Differential and Algebraic Equations
Column-Reduction
Let ˆL be a matrix ˜ differential operator of the form (7) where A11 A12 is of size q × n and r(L) = q. Let T1 be an invertible matrix such that » 11 – A˜ 0 ˜ A := AT1 = , 0 0
Multiplying this latter system by a suitable power of x, we can assume that its entries belong to K[[x]][∂]. This leads to the following
48
4.4
Theorem 4.1. Given a linear DAE of the form (1), there exist two invertible operators S ∈ K((x))[∂]m×m and T ∈ K((x))[∂]n×n that transform (1) to a decoupled system of the form 3 2 11 32 3 2 ˜ 11 f˜1 A˜ ∂ + B 0 0 z1 ˜ ˜ 22 0 5 4 z2 5 = 4 f˜2 5 (12) L(z) =4 0 B z3 0 0 0 f˜3
Definition 4.1. For a homogeneous linear DAE of the form (1), the origin is called a regular singularity, if it is ˜ 11 z1 = 0 and a regular singularity of the ODE A˜11 z10 + B ˜ 22 ) = n where A˜11 , B ˜ 11 and B ˜ 22 are rank (A˜11 ) + rank (B given by (12). Otherwise, it is called an irregular singularity.
˜ ∈ K[[x]][∂]m×n , A˜11 and B ˜ 22 are both invertible, where L y = T (z) and f˜ = S(f ). Remark 4.1. If f˜3 = 0 in (12), then the system is said to be consistent and admits at least one solution. If more˜ 22 ) < n then z3 can be chosen as over rank (A˜11 ) + rank (B arbitrary function hence the dimension of the affine solution space of (12) is infinite.
Consequently, we are able to algorithmically decide whether a given homogeneous linear DAE is regular or irregular singular at x = 0 by applying our reduction algorithm in order to compute the decoupled system (12) and using techniques developed for the ODE case (e.g. computing a Moser˜ 11 z1 = 0). However, irreducible form [4, 13] of z10 + (A˜11 )−1 B it is currently an open problem how to algorithmically classify singularities without this decoupling.
˜ 22 in (12) by Remark 4.2. We could replace A˜11 and B identity matrices, but this adds computational overhead and is not necessarily required. For example, if one wants to com˜ ˜ is given by (12), pute regular solutions of L(z) = 0 where L the algorithm developed in [3] handles directly the system ˜ 11 z1 = 0 where A˜11 can be of arbitrary form. A˜11 z10 + B
5.
L(y) = A∂ 2 y + B∂y + Cy = f m×n
L(y) = A(x)y 0 + B(x)y = f (x) are given respectively by the matrices 3 3 2 −x 0 0 0 0 0 5 and 4 0 0 1 + x −x 5 0 0 −1 x 0
and f (x) is an arbitrary vector of size 3. Following the steps of our algorithm, we find 2 2 3 3 −x2 1 −7x − 2x − 2 3+ x 6 7 −2 − x + x S = 4 −2 − x + x3 0 5, 0 0
(13) m
where A, B, C ∈ K[[x]] (A 6= 0) and f ∈ K[[x]] . The first method that comes to mind is to transform (13) to a first-order linear DAE then to apply the procedure presented in Section 4. But, this is not very desirable since it increases the size of the system and can break the structure of the firstorder system. To circumvent that, we shall develop a method that handles directly linear second-order systems. The goal is to reduce (13) to an equivalent system of simpler form and possibly lower size using the same type of reductions as in the first-order case. As we shall see, this method will decouple (13) into an algebraic system and a square second-order DAE of lower size and full rank (see [5, Def 2.1]) having a specific form that we shall call Two-Sided Block-Popov form.
Example 4.1. We consider the linear DAE
0
GENERALISATION TO SECOND-ORDER SYSTEMS
In this section, we would like to generalise our approach to handle higher-order systems, but for reasons of clarity, we restrict our study to linear DAEs of second-order of the form
Remark 4.3. By carrying out further reductions on the ˜ given by (12), one can obtain a Jacobson form operator L (see [11]) of L given by (1). This latter form requires computing cyclic vectors and yields a scalar differential operator with very large coefficients especially when the systems have large size (see e.g. [1]). Hence, from an algorithmic point of view, it is better to manipulate the systems directly than to convert them to scalar differential equations.
where A(x) and B(x) 2 1 x 1 4 x2 2 + x 0 0 0 0
Application: Classification of Singularities
It is well known that, in the classical theory of ODEs (see e.g. [18]), a singularity is classified as regular or irregular. Our algorithm makes possible to extend this notion to linear DAEs since it reduces this problem to the ODE case.
Definition 5.1. Let L = (Lij )i,j=1,...,k be a square linear matrix differential operator of size n × n, where Lij ∈ P K[[x]][∂]ni ×nj and n = ki=1 ni . We say that L is in TwoSided Block-Popov form if, for every i ∈ {1, . . . , k} , we have
1
• ord(Lii ) > ord(Ljj ) if i < j, 2
−x
6 6 1 T =6 6 4 x 1
2+x −2 − x + x3 −x2 −2 − x + x3 1 0
0 0 x 1
−1
3 • ord(Lij ) < ord(Lii ) ∀j 6= i,
7 7 0 7 7 x∂ 5
• ord(Lji ) < ord(Lii ) ∀j 6= i, • the leading coefficient of Lii is invertible in K((x))ni ×ni .
∂
˜ = SLT is given by and the decoupled operator L 2 3 (−x3 + x + 2)∂ 0 0 0 ˜=4 L 0 x2 x3 − x − 2 0 5 . 0 −1 0 0
At the end of this section, we shall show how a second-order DAE in Two-Sided Block-Popov form can be transformed into a first-order system of ODEs. But first, we shall describe our reduction method which is based on successive applications of row- and column-reductions until we find an equivalent operator verifying some properties allowing the decoupling to take place.
Remark that this system is consistent for any right-hand side f (x).
49
5.1
˜ = A∂ ˜ 2 + B∂ ˜ +C ˜ is in norStep R.2. We assume that L malised row form and the operator – » 21 ˜ ∂+C ˜ 21 B ˜ 22 ∂ + C ˜ 22 B ˜ 23 ∂ + C ˜ 23 B 31 32 33 ˜ ˜ ˜ C C C
Row-Reduction
Let S1 ∈ K[[x]]
m×m
be an invertible matrix such that 2 11 3 A A12 A13 S1 A := 4 0 (14) 0 0 5 0 0 0 ˆ ˜ where A11 A12 A13 is of size r × n and rank r. Write ij S1 B := (B )i,j=1,...,3 partitioned as S1 A. Now, let S2 ∈ K[[x]](m−r)×(m−r) be an invertible matrix such that 2 11 3 B B 12 B 13 21 22 23 diag(Ir , S2 )S1 B := 4 B (15) B B 5 0 0 0 ˆ ˜ where B 21 B 22 B 23 is of size k × n and rank k and finally, write diag(Ir , S2 )S1 C = (C ij )i,j=1,...,3 partitioned as in (14) and (15). Consequently, by means of algebraic lefttransformations, L can be supposed to be of the form (13) where A and B are respectively given by (14) and (15). To refer to this form in the sequel, we shall call it a normalised row form and denote by r(L) := r, k(L) := k and by M(L) and N (L) respectively the matrices 3 2 11 – » 21 A A12 A13 22 23 4 B 21 B 22 B 23 5 and B 31 B 32 B 33 . C C C C 31 C 32 C 33
satisfies the assumption of Lemma 4.1. Then there exists ˜ < k(L) ˜ a differential left-transformation S such that k(S L) ˜ = r(L). ˜ and r(S L) ˆ = We repeat this until we obtain an equivalent operator L ˆ 2 + B∂ ˆ +C ˆ in normalised row form verifying A∂ ˆ 21 ˜ ˆ = rank B ˆ ˆ 22 B ˆ 23 rank N (L) B ˆ 31 ˜ ˆ ˆ 32 C ˆ 33 . (17) + rank C C ˆ verifies also equaBut this does not necessarily mean that L ˆ on the left by an tion (16). If this is the case, we multiply L transformation to annihilate all dependent rows of ˆalgebraic ˜ ˆ 31 C ˆ 32 C ˆ 33 and we are done. Otherwise, we go back C to Step R.1. Consequently, after successive applications of Steps R.1 and R.2, the number of differential equations of second-order or the total number of differential equations decrease. Hence it is assured that eventually we shall obtain ¯ in normalised row form for which an equivalent operator L equations (16) and (17) do hold.
5.2
Step R.1. We ˆ suppose that L˜ is in normalised row form and a row of A11 A12 A13 is a linear combination of ˜ ˆ the other rows of A11 A12 A13 and at least one row of N (L). Then, there exists a differential left-transformation S such that r(SL) < r(L). Indeed, let 1 ≤ i ≤ r = r(L) such that RiA +
r X j=1 j6=i
αj RjA +
k X
B βp Rp+r +
p=1
m−r−k X
Column-Reduction
By means of algebraic right-transformations applied on L given by (13), we can suppose that A and B are respectively of the form 2 11 3 2 11 3 A 0 0 B B 12 0 A := 4 A21 0 0 5 and B := 4 B 21 B 22 0 5 , A31 0 0 B 31 B 32 0 2 12 3 2 11 3 B A 21 where 4 A 5 (the matrix 4 B 22 5 respectively) is of size B 32 A31 m × r and rank r (of size m × s and rank s respectively). Write C := (C ij )i,j=1,...,3 of the same partition as A and B. The operator L of this form is said to be in normalised column form with which we associate r(L) := r, s(L) := s, 2 11 3 2 12 3 A B 12 C 13 B C 13 P(L) := 4 A21 B 22 C 23 5 and Q(L) := 4 B 22 C 23 5 . A31 B 32 C 33 B 32 C 33
C γs Rr+k+s = 0,
s=1
where αj , βp , γs ∈ K((x)) and βp , γs are not all zero. Define S as the identity matrix of size m the ith row of which is replaced by the row formed by the coefficients of the above linear combination in which we replace βp by βp ∂ for p = 1, . . . , k and γs by γs ∂ 2 for s = 1, . . . , m − r − k (S is similar to that in the proof of Lemma 4.1 but here we have also the terms γs ∂ 2 ). The multiplication of L on the left by S can be seen as follows:
Here we shall proceed in the same way as in row-reduction ¯ such that all the in order to find an equivalent operator L ¯ nonzero columns of P(L) are linearly independent.
• RiA is replaced by zero row, P P B • RiB is replaced by RiB + rj=1 αj RjB + kp=1 βp (∂(Rr+p )+ j6=i Pm−r−k C C Rr+p ) + 2 s=1 γs ∂(Rr+k+s ),
Step C.1. We suppose that2L is in3normalised column form A11 and a column of the matrix 4 A21 5 is a linear combination A31 of its other columns and at least one column of Q(L). Then, there exists a differential right-transformation T such that r(LT ) < r(L). Indeed, let 1 ≤ i ≤ r = r(L) s.t.
P P C • RiC is replaced by RiC + rj=1 αj RjC + kp=1 βp ∂(Rr+p )+ j6=i Pm−r−k 2 C γs ∂ (Rr+k+s ). s=1 Consequently, we have r(SL) < r(L) and k(SL) ≤ k(L) + 1. ˜= We repeat this step until we find an equivalent operator L 2 ˜ ˜ ˜ A∂ + B∂ + C in normalised row form verifying the equality ˆ ˜ ˜ = rank A˜11 A˜12 A˜13 + rank N (L), ˜ (16) rank M(L)
CiA +
r X j=1 j6=i
αj CjA +
s X p=1
B βp Cp+r +
n−r−s X
C γd Cr+s+d = 0,
d=1
where αj , βp , γd ∈ K((x)) and βp , γd are not all zero. Define T as the identity matrix of size n the ith column of which is
then we proceed to Step R.2.
50
Hence this algorithm returns an operator equivalent to L of the form » 11 – ˜ 0 ˜= L L 0 0
replaced by the column vector formed by the coefficients of the above linear combination in which we replace βp by βp ∂ for p = 1, . . . , s and γd by γd ∂ 2 for d = 1, . . . , n − r − s. The multiplication of L on the right by T can be seen as follows: • CiA is replaced by zero column; P • CiB is replaced by CiB + rj=1 (2∂(αj )CjA + αj CjB ) + j6=i Ps B C p=1 (∂(βp )Cr+p + βp Cr+p ); P • CiC is replaced by CiC + rj=1 (∂ 2 (αj )CjA + ∂(αj )CjB +
where ˜ 11 L
Consequently, we have r(LT ) < r(L) and s(LT ) ≤ s(L) + 1. We repeat this step until we find an equivalent operator ˜ = A∂ ˜ 2 + B∂ ˜ +C ˜ in normalised column form verifying L the equality
3 ˜ 13 C ˜ 23 5 , C ˜ C 33
have respectively full row rank and full column rank. Since A˜11 is invertible, this implies that the matrices 3 3 2 11 2 11 A˜ 0 0 A˜ 0 0 22 23 22 ˜ ˜ 5 ˜ 4 0 B C B 0 5 and 4 0 ˜ 33 ˜ 32 C ˜ 33 0 0 C 0 C
(18)
Then we proceed to Step C.2. ˜ = A∂ ˜ 2 + B∂ ˜ +C ˜ is in norStep C.2. We assume that L malised column form and the operator 3 2 12 ˜ ∂+C ˜ 12 C ˜ 13 B ˜ 22 ∂ + C ˜ 22 C ˜ 23 5 4 B 32 32 ˜ 33 ˜ ˜ C B ∂+C
have respectively full row rank and full column rank, hence ˜ 22 is invertible. In the same way, we show that C ˜ 33 is also B invertible. Consequently, by means of algebraic transforma˜ 21 , B ˜ 12 , C ˜ 31 , C ˜ 32 , C ˜ 13 tion, we can eliminate the matrices B 23 11 ˜ ˜ and C in L . Hence this latter operator is equivalent to ˆ C ˜ 33 ) where diag(L, – » 11 2 ˆ 12 ˆ 11 ∂ + C ˆ 11 C A˜ ∂ + B ˆ L := ˆ 21 ˜ 22 ∂ + C ˆ 22 C B
satisfies the assumptions of Lemma 4.2. Then there exists a ˜ ) < s(L) ˜ differential right-transformation T such that s(LT ˜ ) = r(L). ˜ and r(LT ˆ = We repeat this until we obtain an equivalent operator L ˆ 2 + B∂ ˆ +C ˆ in normalised column form verifying A∂ 2 13 3 2 12 3 ˆ ˆ C B ˆ = rank 4 B ˆ 23 5 . ˆ 22 5 + rank 4 C (19) rank Q(L) 32 ˆ 33 ˆ C B
is a square matrix differential operator of full rank and in Two-Sided Block-Popov form. We have hence shown the following theorem: Theorem 5.1. For every linear differential system of secondorder of the form (13), there exists two invertible operators S ∈ K((x))[∂]m×m and T ∈ K((x))[∂]n×n that trans˜ ˜ ∈ form (13) to the decoupled system L(z) = f˜ where L m×n K[[x]][∂] is of the form 2 11 2 3 ˜ 11 ∂ + C ˜ 11 ˜ 12 A˜ ∂ + B C 0 0 6 ˜ 21 ˜ 22 ∂ + C ˜ 22 C B 0 0 7 ˜ := 6 7, L 33 4 ˜ 0 0 C 0 5 0 0 0 0 (20) ˜ 22 and C ˜ 33 are invertible matrices, y = T (z) and f˜ = A˜11 , B S(f ).
ˆ may not verify equation (18) so we Note that here again L have to go back to Step C.1. Consequently, after number of iterations of Steps C.1 and C.2, we obtain an equivalent op¯ in normalised column form verifying equations (18) erator L ¯ on the right by an algebraic and (19). Finally, multiply L transformation to annihilate all dependent columns of the ¯ i3 )i=1,...,3 . sub-matrix (C
5.3
˜ 12 ∂ + C ˜ 12 B 22 ˜ ˜ B ∂ + C 22 ˜ 32 C
˜ 11 ) and P(L ˜ 11 ) given respectively A˜11 is invertible and M(L by 2 11 3 2 11 3 ˜ 12 C ˜ 13 A˜ 0 0 A˜ B 21 22 22 23 ˜ ˜ ˜ ˜ 5 4 B B 0 5 and 4 0 B C ˜ 31 C ˜ 32 C ˜ 33 ˜ 33 C 0 0 C
j6=i
αj CjC ).
˜ = rank A˜ + rank Q(L). ˜ rank P(L)
˜ 11 ∂ + C ˜ 11 A˜11 ∂ 2 + B 21 21 ˜ ˜ 4 = B ∂+C ˜ 31 C 2
Computing Two-Sided Block-Popov Forms
We start with an operator L of the form (13) with associated quantities r(L), k(L) and s(L) defined as above. In order to obtain an equivalent operator in Two-Sided BlockPopov form, we recursively apply to L a series of row- and column-reductions until the triplet (r(L), k(L), s(L)) becomes minimal in the sense of the lexicographic ordering. This algorithm terminates because at each step, this triplet decreases. Indeed, at each step of the algorithm, we either perform
5.4
Applications
In this section, we consider homogeneous second-order system of the form L(y) = A∂ 2 y + B∂y + Cy = 0,
• Step R.1. or Step C.1, in which case, r(L) will decrease (however the quantities k(L) or s(L) may increase), or
(21)
where 0 6= A ∈ K[[x]]m×n and B, C ∈ K[[x]]m×n . Theorem ˜ ˜ is given 5.1 shows that it is equivalent to L(z) = 0 where L by (20). Furthermore, the second-order DAE in Two-Sided Block-Popov form » 11 2 –» – ˜ 11 ∂ + C ˜ 11 ˜ 12 A˜ ∂ + B C z1 = 0 (22) ˜ 21 ˜ 22 ∂ + C ˜ 22 z2 C B
• Step R.2. in which case, r(L) remains unchanged and k(L) will decrease (s(L) may decrease), or • Step C.2. in which case, r(L) remains unchanged, k(L) cannot increase and s(L) will decrease.
51
can be converted into the first-order system of ODEs 02 3 2 31 2 3 I 0 −I 0 z1 ˜ 11 B ˜ 11 C ˜ 12 5A 4 z10 5 = 0. @4 5∂ + 4 C A˜11 ˜ 22 ˜ 21 ˜ 22 z2 B C 0 C (23) This will allow us to extend some notions known for the ODE to the DAE case.
5.4.1
[3]
[4]
Classification of singularities
Here again, we call the origin a regular singularity of (21) if it is for the first-order system given by (23) and rank (A˜11 )+ ˜ 22 ) + rank (C ˜ 33 ) = n where A˜11 , B ˜ 22 C ˜ 33 are given rank (B as in (20). Otherwise, it is called an irregular singularity.
5.4.2
[5]
[6]
Regular Solutions
˜ given by (20) satisfies Suppose that L ˜ 22 ) + rank (C ˜ 33 ) = n, rank (A˜11 ) + rank (B
[7]
which is equivalent to say that the dimension of the solution ˜ space of L(z) = 0 is finite. We are interested in computing a basis of the regular solution space of L(y) = 0. Recall that a regular solution is a solution of the form y = xλ0 w where ¯ w ∈ K[[x]][log ¯ ¯ denotes the algebraic cloλ0 ∈ K, x]n and K sure of K. To our knowledge, there is currently no method that directly handles systems of the form (21). Our algorithm reduces this problem to the computation of a basis of the regular solution space of the DAE in Two-Sided Block˜ 33 is invertible) which is Popov form given by (22) (since C equivalent to solve system (23). But there exists a direct and simpler method to solve (22). Indeed, let p(λ) denote the determinant of the following matrix polynomial » 11 – ˜ 11 (0)λ + C ˜ 11 (0) ˜ 12 (0) A˜ (0)(λ2 − λ) + B C 21 22 22 ˜ (0) ˜ (0)λ + C ˜ (0) . C B
[8]
[9]
[10]
[11]
[12]
The simplest situation is when p(λ) 6≡ 0. In this case, we can apply the algorithm described in [2] and show that the dimension of this space is exactly equal to deg(p(λ)). Hence, if we denote by δ and γ respectively the size of the matrices ˜ 22 , then the origin is a regular singularity of (21) A˜11 and B if and only if deg(p(λ)) = 2δ + γ which is equivalent to say ˜ 22 (0) are invertible. The other situation that A˜11 (0) and B (p(λ) ≡ 0) is currently being studied by us, in which the fact that (22) has full rank plays an important role.
6.
[13] [14]
[15]
CONCLUSION
In this paper, we have developped a new reduction algorithm that reduces a linear DAE to a decoupled differential and algebraic system. We have extended our approach to handle second-order systems. Our algorithm for first-order DAEs has been implemented in the Computer Algebra system Maple as a part of the ISOLDE Package. It seems to be efficient for small examples and is currently being tested and improved to obtain a better performance when handling systems of bigger size.
7.
[16]
[17]
[18]
REFERENCES
[1] M. Barkatou. On rational solutions of systems of linear differential equations. J. of Symbolic Computation, 28:547-567, 1999. [2] M. Barkatou, T. Cluzeau and C. El Bacha. Algorithms for regular solutions of higher-order linear differential
52
systems. In Proceedings of ISSAC’09, pages 7-14, Seoul, South Korea, 2009. ACM. M. Barkatou and E. Pfl¨ ugel. An algorithm computing the regular formal solutions of a system of linear differential equations. J. of Symbolic Computation, 28:569-587, 1999. M. Barkatou and E. Pfl¨ ugel. On the Moser- and super-reduction algorithms of systems of linear differential equations and their complexity. J. of Symbolic Computation, 44(8):1017-1036, 2009. B. Beckermann, H. Cheng and G. Labahn. Fraction-free row reduction of matrices of Ore polynomials. J. of Symbolic Computation, 41(5):513-543, 2006. P. Davies, H. Cheng and G. Labahn. Computing Popov form of general Ore polynomial matrices. In Milestones in Computer Algebra, pages 149-156, 2008. C. W. Gear. Differential-algebraic equation index transformation. SIAM J. Sci. Stat. Comput., 9(1):39-47, 1988. W. A. Harris, Y. Sibuya and L. Weinberg. A reduction algorithm for linear differential systems. Funkcialaj Ekvacioj, 11:59-67, 1968. P. Kunkel and V. Mehrmann. Canonical forms for linear differential-algebraic equations with variable coefficients. J. of Computational and Applied Mathematics, 56:225-251, 1994. V. Mehrmann and C. Shi. Transformation of higher order differential-algebraic systems to first order. Numerical Algorithms, 42:281-307, 2006. J. Middeke. A polynomial-time algorithm for the Jacobson form for matrices of differential operators. Tech. report no. 08-13 in RISC Report Series, 2008. M. Miyake. Remarks on the formulation of the Cauchy problem for general system of ordinary differential equations. Tˆ ohoku Math. J., 32:79-89, 1980. J. Moser. The order of a singularity in Fuchs’ theory. Math. Zeitschr., 72:379-398, 1960. A. Pantelous, A. Karageorgos and G. Kalogeropoulos. Power series solutions for linear higher order rectangular differential matrix control systems. In 17th Mediterranean Conference on Control and Automation, p. 330-335, Makedonia Palace, Thessaloniki, Greece, 2009. M. P. Qu´er´e and G. Villard. An algorithm for the reduction of linear DAE. In Proceedings of ISSAC’95, pages 223-231, New York, USA, 1995. ACM. M. P. Qu´er´e-Stuchlik. Algorithmique des faisceaux lin´eaires de matrices, Applications a ` la th´eorie des syst`emes lin´eaires et a ` la r´esolution d’´equations alg´ebro-diff´erentielles. PhD thesis, LMC-IMAG, 1996. S. Schulz. Four lectures on differential algebraic equations. Tech. Report 497, The University of Auckland, 2003. W. Wasow. Asymptotic expansions for ordinary differential equations. Robert E. Krieger Publ., 1967.
Consistency of Finite Difference Approximations for Linear PDE Systems and Its Algorithmic Verification Vladimir P.Gerdt
Daniel Robertz
Laboratory of Information Technologies, Joint Institute for Nuclear Research 141980 Dubna, Russia
Lehrstuhl B für Mathematik, RWTH Aachen University Templergraben 64, 52056 Aachen, Germany
[email protected]
[email protected]
ABSTRACT
PDEs the finite difference method1 is the oldest one and is based upon the application of a local Taylor expansion to approximate the differential equations by difference ones [1, 2] defined on the chosen computational grid. The difference equations that approximate differential equations in the system of PDEs form its finite difference approximation (FDA) which together with discrete approximation of initial or/and boundary conditions is called finite-difference scheme (FDS). A good FDA has to mimic or inherit the algebraic structure of a differential system. In particular it has to reproduce such fundamental properties of the continuous equations as symmetries and conservation laws [3, 4]. Provided with appropriate initial or/and boundary conditions in their discrete form, the main requirement to the FDS is its convergence. The last means that the numerical solution approaches to the true solution to the PDE system as the grid spacings go to zero. Further important properties of FDS are consistency and stability. The former means that the difference equations in FDA are reduced to the original PDEs when the grid spacings vanish,2 whereas the latter means that the error in the solution remains bounded under small perturbation in the numerical data. Consistency is necessary for convergence. In accordance to the Lax-Richtmyer equivalence theorem [1, 2] proved first for (scalar) linear PDEs and extended to some nonlinear equations [5], a consistent FDA to a PDE with the well-posed initial value (Cauchy) problem converges if and only if it is stable. Thus, the consistency check is an important step in analysis of difference schemes. In this paper for a FDA to a linear PDE system on uniform and orthogonal grids we suggest another concept of consistency called strong consistency (s-consistency) which means consistency of the set of all linear difference consequences of the FDA with the set of linear differential consequences of the PDE system. This concept improves the concept of equation-wise consistency (e-consistency) of a FDA with a PDE system and also admits an algorithmic check. This check is done via construction of a Gr¨ obner basis for the difference ideal generated by the FDA to linear differential polynomials in the PDE system. We show that every sconsistent FDA is e-consistent and the converse is not true. It means that an s-consistent FDA reproduces at the discrete level more algebraic properties of the PDE system than one which is e-consistent and s-inconsistent. For the algorithmic check of s-consistency we use the involutive algorithm [6, 7] which apart from the construction of a Gr¨ obner basis allows
In this paper we consider finite difference approximations for numerical solving of systems of partial differential equations of the form f1 = · · · = fp = 0, where F := {f1 , . . . , fp } is a set of linear partial differential polynomials over the field of rational functions with rational coefficients. For orthogonal and uniform solution grids we strengthen the generally accepted concept of equation-wise consistency (e-consistency) of the difference equations f˜1 = · · · = f˜p = 0 as approximation of the differential ones. Instead, we introduce a notion of consistency of the set of all linear consequences of the difference polynomial set F˜ := {f˜, . . . , f˜p } with the linear subset of the differential ideal hF i. The last consistency, which we call s-consistency (strong consistency), admits algorithmic verification via a Gr¨ obner basis of the difference ideal hF˜ i. Some related illustrative examples of finite difference approximations, including those which are e-consistent and s-inconsistent, are given.
Categories and Subject Descriptors I.1.2 [Symbolic and Algebraic Manipulation]: Algorithms; I.1.4 [Symbolic and Algebraic Manipulation]: Applications
General Terms Algorithms, Applications
Keywords Partial differential equations, Finite difference schemes, Consistency, Gr¨ obner basis, Involutive algorithm
1.
INTRODUCTION
Since, apart from very special cases, partial differential equations (PDEs) can only be solved numerically, the construction of their numerical solutions is a fundamental task in science and engineering. Among three classical numerical methods that are widely used for numerical solving of
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. To copy otherwise, to republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. ISSAC 2010, 25–28 July 2010, Munich, Germany. Copyright 2010 ACM 978-1-4503-0150-3/10/0007 ...$10.00.
1 The other two methods are the finite element method and the finite volume method. 2 In Section 3 we give a more precise definition of consistency.
53
the monoid generated by {σ1 , . . . , σn } to remove negative shifts in indices which may come out of expressions like (3) we obtain a FDA to (1) of the form
also to verify easily well-posedness of the initial value problem for an analytic system of PDEs [8, 9] as a prerequisite of convergence for its FDS. The structure of the paper is as follows. In Sect. 2 we shortly describe the mathematical objects with which we deal in the paper. In Sect. 3 for the uniform and orthogonal grids with equally spaced nodes we define s-consistency of a FDA to a system of PDEs and relate it with the underlying consistency properties of a difference Gr¨ obner basis of the ideal generated by the polynomials in the FDA. The algorithmic verification of s-consistency is presented in Sect. 4. Then we illustrate the concepts and methods of the paper by some examples (Sect. 5). In Sect. 6 we consider peculiarities of consistency for the grids with different spacings and conclude in Sect. 7.
2.
f˜1 = · · · = f˜p = 0,
PRELIMINARIES
F := {f1 , . . . , fp } ⊂ RL .
3.
the convergence being pointwise at each point x. Definition 1 allows to verify easily the consistency of f˜ with f by using the Taylor expansion of f˜ about a grid point which is non-singular for its coefficients. As a simple example consider the advection (or one-way wave) equation
(1)
f (u) = 0, f (u) := ux + νuy
ui+1,j = ui,j + hux + ui,j+1 = ui,j + huy +
(2)
(i)
2hj
+ O(h3 ) ,
This shows the consistency of (6) with (5). If one considers a system of PDEs and performs its equationwise discretization, as it is usually done in practice, then a natural generalization of Definition 1 to systems of equations is as follows.
(i)
(i)
+ O(h3 ) ,
h f (u) − f˜(u) = − (uxx + νuyy ) + O(h2 ) −−−→ 0 . h→0 2
uk1 ,...,kj +1,...,kn − uk1 ,...,kj ,...,kn
uk1 ,...,kj +1,...,kn − uk1 ,...,kj −1,...,kn
h2 u 2 xx h2 u 2 yy
and thus
or by the centered difference ∂xj u(i) =
(5)
ui,j+1 − ui,j ui+1,j − ui,j +ν . (6) f˜(u) := h h The Taylor expansion about the grid point (x = ih, y = jh) yields
where hj
(ν = const),
which is the simplest hyperbolic PDE. Its discretization by using the forward differences (2) for the derivatives gives
∂xj u(i) = ∆j (u(i) ) + O(hj ),
∆j (u(i) ) :=
CONSISTENCY
Here and in the next two sections we consider orthogonal and uniform grids with equisized mesh steps h1 = · · · = hn = h. First, we give the generally accepted definition [1, 2] of consistency of a single differential equation with its difference approximation. Definition 1. Given a PDE f = 0 and a FDA f˜ = 0, the FDA is said to be consistent with the PDE if for any smooth, i.e. sufficiently differentiable for the context, vector-function u(x) f (u) − f˜(u) → 0 as h → 0,
To approximate the differential system (1) by a difference one we shall use an orthogonal and uniform computational grid (mesh) as the set of points (k1 h1 , . . . , kn hn ) in Rn . Here h := (h1 , . . . , hn ) (hi > 0) is the tuple of mesh steps (grid spacings) and the integer-valued vector k := (k1 , . . . , kn ) ∈ Zn numerates the grid points. If the actual solution to the problem (1) is given by u(x) then its approximation in the grid node will be given by the grid (vector) function uk1 ,...,kn = u(k1 h1 , . . . , kn hn ). In the finite difference method derivatives in (1) are approximated by finite differences. This can be done in many ways. For example, the first-order derivative can be approximated by the forward difference
(i)
(4)
In [11] another approach to generation of FDA was suggested. It is based on the finite volume method and on difference elimination. That approach is algorithmic and for nonlinear equations it can construct FDAs that cannot be obtained by the straightforward substitution of finite differences for derivatives into the differential equations. An example of such approximation was constructed in [11] for the Falkovich-Karman differential equation describing transonic flow in gas dynamics. Whereas the underlying differential equation is quadratically nonlinear, the obtained difference approximation is cubically nonlinear. Due to this fact the corresponding FDS reveals better numerical behavior than known quadratically nonlinear schemes.
Let x := {x1 , . . . , xn } be the set of n real (independent) variables and K := Q(x) be the field of rational functions with rational coefficients. K is both a differential and a difference field [10], respectively, for the set {∂1 , . . . , ∂n } of derivation operators and the set {σ1 , . . . , σn } of the differences acting on the functions φ ∈ K as the right-shift operators σi ◦ φ(x1 , . . . , xn ) = φ(x1 , . . . , xi + hi , . . . , xn ). Here the shift parameters hi can take positive real values. We shall use the same notation K[u(1) , . . . , u(m) ] for both differential and difference polynomial rings over K and de˜ The differential (resp. difference) note them by R resp. R. indeterminates u(1) , . . . , u(m) will be considered for differential (resp. difference) equations as dependent variables, and sometimes we shall use also the vector notation u := (u(1) , . . . , u(m) ). The subset of the differential ring R containing linear polynomials will be denoted by RL , and the ˜ L. linear subset of the difference ring by R Hereafter we consider PDE systems of the form f1 = · · · = fp = 0,
˜L . F˜ := {f˜1 , . . . , f˜p } ⊂ R
Definition 2. Given a PDE system (1) and its difference approximation (4), we shall say that (4) is equation-wise consistent or e-consistent with (1) if every difference equation in (4) is consistent with the corresponding differential equation in (1).
+ O(h2j ) . (3)
By substituting finite differences for derivatives into system (1) and applying appropriate right-shift operators from
54
In fact, in the literature only e-consistency of FDA to systems of PDEs is considered. However e-consistency may not be satisfactory in view of inheritance of properties of the differential systems at the discrete level. We are now going to introduce another concept of consistency for difference approximations to PDE systems which strengthens Definition 2 and provides consistency of the (in˜ L of all linear difference consequences of finite) subset of R the discrete system (4) with the subset of RL of all linear differential consequences of the PDE system (1). To formulate the new concept we need the following definition.
The representation (10) guarantees that the highest ranking partial derivatives which occur in the leading order in h and come from different elements of the Gr¨ obner basis cannot cancel. Thereby, due to the condition (9), in the leading order in h, the Taylor expansion of f˜ will contain a finite sum of the form XX f := bµ ∂ µ ◦ g, bµ ∈ K , (12)
Definition 3. We shall say that a difference equation f˜(u) = 0 implies the differential equation f (u) = 0 and write f˜ f when the Taylor expansion about a grid point yields
˜ L be s-consistent with Corollary 1. Let a FDA F˜ ⊂ R a set F ⊂ RL , then
f˜(u) −−−→ f (u)hk + O(hk+1 ), k ∈ Z≥0 .
˜ as a grid Proof. Consider a difference polynomial q˜ ∈ R function. If one applies the Taylor expansion (11) of the shift operators about a grid point, then in the limit h → 0 this polynomial takes the form
h→0
g∈G µ
and hence f˜ f ∈ hF i ∩ RL . ˜ ⊂ hF˜ i ∩ R ˜ L , the converse is trivially true. Since G
∀˜ p ∈ hF˜ i ∃p ∈ hF i : p˜ p .
(7)
It is clear that in this terminology, Definition 1 means f˜ f . Now we give our main definition.
q˜ = hk q + O(hk+1 ),
Definition 4. Given a PDE system (1) and its difference approximation (4), we shall say that (4) is strongly consistent or s-consistent with (1) if ˜ L ∃f ∈ hF i ∩ RL : f˜ f . ∀f˜ ∈ hF˜ i ∩ R
k ∈ Z≥0 ,
where q ∈ R is a differential polynomial. If now we multiply both sides of the representation (10) by a polynomial q˜, apply a finite number of the shift operators σi to the product and apply the Taylor expansion about a grid point to the result, then in the leading order in h we obtain the differential polynomial which results from the linear differential polynomial of the form (12) by its multiplication by q and applying finitely many derivations ∂j . Clearly, before doing the Taylor expansion one can also multiply the r.h.s. in (10) and apply the shift operations to the product several times. Afterwards, the leading (in h) order of the expansion will yield the differential polynomial generated by elements in the differential polynomial set G that is implied by the Gr¨ obner basis of hF˜ i.
(8)
Comparing Definitions 2 and 4 one sees that s-consistency implies e-consistency. The converse is not true as shown by explicit examples in Sect. 5. The s-consistency admits an algorithmic verification which is based on the following statement. Theorem 1. A difference approximation (4) to a differential system (1) is s-consistent if and only if any reduced ˜⊂R ˜ L of the difference ideal hF˜ i satisfies Gr¨ obner basis G ˜ ∃g ∈ hF i ∩ RL : g˜ g . ∀˜ g∈G
(13)
(9)
If one uses a minimal difference involutive basis [7, 9], then the representation (10) is unique with operators σ µ being products of multiplicative differences. It should be also noted that the condition (8) does not exploit the equality card F = card F˜ of the cardinalities for sets of differential and difference equations as is assumed in Definition 2. The equality of cardinalities is not used in the proof of Theorem 1 either. Therefore, both Definition 4 and Theorem 1 are relevant to the case when the FDA has different number of equations than the PDE system.
˜ be a reProof. Let be a difference ranking [10] and G ˜ duced difference Gr¨ obner basis [10, 12] of hF i for this ranking satisfying the condition (9). Denote by G the set of differ˜ ential polynomials that are implied by the elements in G. ˜ ˜ ˜ Consider a linear difference polynomial f ∈ hF i ∩ RL and ˜ and as a its standard representation (cf. [13]) w.r.t. G finite sum of the form ( P P f˜ = g˜∈G˜ µ aµ σ µ ◦ g˜, aµ ∈ K , (10) ∀˜ g , µ : σ µ ◦ ld(˜ g ) ld(f˜) .
4.
Here ld(q) denotes the leader [10] of a difference polynomial q, and we use the multiindex notation
ALGORITHMIC CHECK
Given a finite set F ⊂ RL of linear differential polynomials ˜ L , one can algorithmically verify whether and its FDA F˜ ⊂ R ˜L F˜ is s-consistent with F . For a difference polynomial f˜ ∈ R its consistency (e-consistency) with a differential polynomial f ∈ RL , i.e. condition f˜ f , can be algorithmically verified by performing the Taylor expansion of f˜ in the grid spacing h. The condition g ∈ hF i ∩ RL can also be algorithmically verified by construction of a Gr¨ obner basis of the differential ideal hF i. The following algorithm verifies s-consistency of a finite ˜ L of linear difference polynomials as FDA to a set F˜ ⊂ R finite set F ⊂ RL of linear partial differential polynomials. The algorithm uses Janet bases [7, 8] for both differential
µ µ1 µn µ := (µ1 , . . . , µn ) ∈ Zn ≥0 , σ := σ1 ◦ · · · ◦ σn .
Choose now a grid point, nonsingular for the sum in (10), and consider its Taylor expansion (in grid spacing h) about this point. The shift operators σj (j = 1, . . . , n) which occur ˜ are expanded in the Taylor series in σ µ and in g˜ ∈ G X k k σj = h ∂j (11) k≥0
along with the shifted rational functions in the independent variables.
55
and difference ideals, though reduced Gr¨ obner bases or other involutive bases can also be used.
the reduced Gr¨ obner basis in the course of the Janet basis computation, that is, without performing extra reductions to produce the former from the latter. The algorithm JanetBasis has been implemented in Maple for differential and difference ideals in the form of the packages called Janet [14] and LDA (Linear Difference Algebra) [15]. Besides the main procedure, which computes involutive bases w.r.t. Janet or Janet-like division [16], commands that return the normal form of a linear differential or difference polynomial modulo an ideal and many tools for dealing with linear differential or difference operators are included; syzygies, Hilbert polynomials and series can be computed, and the set of standard monomials modulo an ideal (together with a Stanley decomposition) can be determined.
Algorithm: ConsistencyCheck (F, F˜ ) 1: 2: 3: 4: 5: 6: 7: 8: 9: 10: 11: 12: 13:
choose differential resp. difference ranking 1 , 2 J :=JanetBasis (F, 1 ) J˜ :=JanetBasis (F˜ , 2 ) S := true while J˜ 6= ∅ and S = true do choose g˜ ∈ J˜ J˜ := J˜ \ {˜ g} compute g such that g˜ g if NF J (g, J) 6= 0 then S := false fi od return S
5.
EXAMPLES
In this section we demonstrate the notion of strong consistency on some examples. The computations were carried out in a few seconds with the packages Janet and LDA in Maple 13 on an AMD Opteron machine. Alternatively, the Gr¨ obner package in Maple in connection with the Ore algebra package [12] can be used to get the same results. In the below examples difference approximations to the initial PDE systems are e-consistent by construction. We show, however, that s − consistency does not always hold for those approximations.
The subalgorithm JanetBasis invoked in lines 2 and 3 computes the differential and difference Janet basis, respectively. The subalgorithm NF J on line 9 computes the differential involutive normal form [8] of a linear differential polynomial g modulo J, and thereby checks whether g ∈ hJi ∩ RL . The subscript J indicates that the normal form is computed for Janet division. Correctness of the algorithm ConsistencyCheck follows from Theorem 1 and from the fact that the Janet bases are Gr¨ obner ones. Its termination is an obvious consequence of ˜ termination of the subalgorithms the finiteness of the set J, and the Taylor expansion step of line 8.
Example 1. Consider the overdetermined linear PDE system ux + yuz + u = 0,
uy + xuw = 0
(14)
for one unknown function u of four independent variables x, y, z, w. The minimal Janet basis J for the differential ideal in R generated by the left hand sides of (14) w.r.t. the degrevlex ranking with
Algorithm: JanetBasis (F, ) ˜ L ), a finite set; , a ranking Input: F ⊂ RL (resp. R Output: J, a Janet basis of hF i 1: choose f ∈ F with lowest ld(f ) w.r.t. 2: J := {f }; Q := F \ {f } 3: while Q 6= ∅ do 4: h := 0 5: while Q 6= ∅ and h = 0 do 6: choose q ∈ Q with lowest ld(q) w.r.t. 7: Q := Q \ {q