Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
article

Geometric completion of differential systems using numeric-symbolic continuation

Published: 02 June 2002 Publication History
  • Get Citation Alerts
  • Abstract

    Symbolic algorithms using a finite number of exact differentiations and eliminations are able to reduce over and under-determined systems of polynomially nonlinear differential equations to involutive form. The output involutive form enables the identification of consistent initial values, and eases the application of exact or numerical integration methods.Motivated to avoid expression swell of pure symbolic approaches and with the desire to handle systems with approximate coefficients, we propose the use of homotopy continuation methods to perform the differential-elimination process on such non-square systems. Examples such as the classic index 3 Pendulum illustrate the new procedure. Our approach uses slicing by random linear subspaces to intersect its jet components in finitely many points. Generation of enough generic points enables irreducible jet components of the differential system to be interpolated.

    References

    [1]
    E.L. Allgower and K. Georg. Numerical path following. In Scientific Computing (Part 2), edited by P.G. Ciarlet and J.L. Lions, pages 3-203. Volume 5 of Handbook of Numerical Analysis, North-Holland, 1997.
    [2]
    U.M. Ascher and L.R. Petzold. Computer Methods for Ordinary Differential Equations and Differential-Algebraic Equations. SIAM, 1998.
    [3]
    T. Arponen. The complete form of a differential algebraic equation. Helsinki Univ. of Tech. Inst. of Math. Research Rep. Number A438, 2001. Available at http://www.math.hut.fi/reports/
    [4]
    F. Boulier, D. Lazard, F. Ollivier, and M. Petitot. Representation for the radical of a finitely generated differential ideal. Proc. ISSAC 1995. ACM Press. 158-166, 1995.
    [5]
    S.L. Campbell and C.W. Gear. The index of general nonlinear DAEs. Numer. Math. 72: 173-196, 1995.
    [6]
    R.M. Corless, A. Galligo, I.S. Kotsireas, and S.M. Watt. A symbolic-geometric algorithm for factoring multivariate Polynomials. Proc. ISSAC 2002, to appear.
    [7]
    G. Corliss, C. Faure, A. Griewank, L. Hascoët, and U. Naumann (eds.) Automatic Differentiation 2000: From Simulation to Optimization. Springer, New York, 2001.
    [8]
    D. Cox, J. Little, and D. O'Shea. Ideals, Varieties, and Algorithms. Springer, 1996 (2nd Edition).
    [9]
    M. Giusti and J. Heintz. Kronecker's smart, little black boxes. In Foundations of Computational Mathematics, edited by R.A. DeVore, A. Iserles, and E. Süli. Volume 284 of the London Mathematical Society Lecture Note Series, Cambridge University Press, 2001.
    [10]
    M. Hausdorf and W.M. Seiler. Perturbation versus differentiation indices. In Computer Algebra in Scientific Computing---CASC'01, edited by V.G. Ganzha, E. W. Mayr and E. V. Vorozhtsov, pages 323-337. (Springer, Berlin) 2001.
    [11]
    J. Heintz, T. Krick, S. Puddu, J. Sabia, and A. Waissbein. Deformation techniques for efficient polynomial equation solving. J. Complexity 16(1): 70-109, 2000.
    [12]
    E. Hubert. Factorization free decomposition algorithms in differential algebra. J. Symbolic Computation 29: 641-662, 2000.
    [13]
    C. Lanczos. Applied Analysis. Prentice Hall, 1956.
    [14]
    G. Lecerf. Une alternative aux méthodes de réécriture pour la résolution des systèmes algébriques. Thèse de doctorat de l'École polytechnique, 2001.
    [15]
    G. Le Vey. Some remarks on solvability and various indices for implicit differential equations. Numer. Algorithms 19: 127-145, 1998.
    [16]
    T.Y. Li. Numerical solution of multivariate polynomial systems by homotopy continuation methods. Acta Numerica 6: 399-436, 1997.
    [17]
    E. Mansfield. Differential Gröbner Bases. Ph.D. thesis, Univ. of Sydney, 1991.
    [18]
    J.F. Pommaret. Systems of Partial Differential Equations and Lie Pseudogroups. Gordon and Breach Science Publishers, Inc. 1978.
    [19]
    F. Pritchard and W. Sit. On initial value problems for ordinary DAEs. To appear in J. Symbolic Computation.
    [20]
    M.P. Quéré and G. Villard. An algorithm for the reduction of linear DAE. Proc. ISSAC 1995. ACM Press. 223-231, 1995.
    [21]
    G.J. Reid, A.D. Wittkopf and A. Boulton. Reduction of systems of nonlinear partial differential equations to simplified involutive forms. Eur. J. of Appl. Math. 7: 604-635.
    [22]
    G.J. Reid, P. Lin, and A.D. Wittkopf. Differential elimination-completion algorithms for DAE and PDAE. Studies in Applied Mathematics 106(1): 1-45, 2001.
    [23]
    P.J. Rabier and W.C. Rheinboldt. A geometric treatment of implicit differential-algebraic equations. Journal of Differential Equations 109: 110-146, 1994.
    [24]
    S. Reich. Beitrag zur Theorie der Algebrodifferentialgleichungen. Ph.D. dissertation in Engineering, T.U. Dresden. 1989.
    [25]
    C. Rust, G.J. Reid, and A.D. Wittkopf. Existence and uniqueness theorems for formal power series solutions of analytic differential systems. Proc. ISSAC 1999. ACM Press. 105-112, 1999.
    [26]
    A. Sedoglavic. A probabilistic algorithm to test local algebraic observability in polynomial time. Proc. ISSAC 2001. ACM Press. 309-316, 2001.
    [27]
    W.M. Seiler. Analysis and application of the formal theory of partial differential equations. Ph.D. thesis, Lancaster University, 1994.
    [28]
    W.M. Seiler. Involution and constrained dynamics II: the Faddeev-Jackiw approach. J. Phys. A. 28:7315-7331, 1995.
    [29]
    W.M. Seiler. Indices and solvability for general systems of differential equations. In Computer algebra in scientific computing---CASC'99, edited by V.G. Ganzha, E. W. Mayr and E. V. Vorozhtsov, pages 365-385. (Springer, Berlin) 1999.
    [30]
    W.M. Seiler and R.W. Tucker. Involution and constrained dynamics I: the Dirac approach. J. Phys. A. 28:4431-4451, 1995.
    [31]
    M. Shub and S. Smale. Complexity of Bezout's theorem V: Polynomial time. Theoretical Computer Science 133(1):141-164, 1994.
    [32]
    A.J. Sommese and J. Verschelde. Numerical homotopies to compute generic points on positive dimensional algebraic sets. J. Complexity 16(3):572-602, 2000.
    [33]
    A.J. Sommese, J. Verschelde, and C.W. Wampler. Numerical decomposition of the solution sets of polynomial systems into irreducible components. SIAM J. Numer. Anal. 38(6):2022-2046, 2001.
    [34]
    A.J. Sommese, J. Verschelde, and C.W. Wampler. Numerical irreducible decomposition using projections from points on the components. In Symbolic Computation: Solving Equations in Algebra, Geometry, and Engineering, Volume 286 of Contemporary Mathematics, edited by E.L. Green, S. Hoşten, R.C. Laubenbacher, and V. Powers, pages 37-51. AMS 2001.
    [35]
    A.J. Sommese, J. Verschelde, and C.W. Wampler. Using monodromy to decompose solution sets of polynomial systems into irreducible components. In Application of Algebraic Geometry to Coding Theory, Physics and Computation, edited by C. Ciliberto, F. Hirzebruch, R. Miranda, and M. Teicher, 297-315, 2001. Proceedings of a NATO Conference, February 25 - March 1, 2001, Eilat, Israel. Kluwer Academic Publishers.
    [36]
    A.J. Sommese, J. Verschelde, and C.W. Wampler. Symmetric functions applied to decomposing solution sets of polynomial systems. Accepted for publication in SIAM J. Numer. Anal.
    [37]
    A.J. Sommese, J. Verschelde, and C.W. Wampler. Numerical irreducible decomposition using PHCpack. To appear in Mathematics and Visualization, edited by M. Joswig and N. Takayama. Springer-Verlag.
    [38]
    A.J. Sommese, J. Verschelde, and C.W. Wampler. A method for tracking singular paths with application to the numerical irreducible decomposition. In Algebraic Geometry, a Volume in Memory of Paolo Francia, edited by M.C. Beltrametti, F. Catanese, C. Ciliberto, A. Lanteri, C. Pedrini. W. de Gruyter, to appear.
    [39]
    A.J. Sommese, J. Verschelde, and C.W. Wampler. Advances in polynomial continuation for solving problems in kinematics. In Proc. ASME Design Engineering Technical Conf. (CDROM), Paper DETC2002/MECH34254. Montreal, Quebec, Sept. 29-Oct. 2, 2002.
    [40]
    A.J. Sommese and C.W. Wampler. Numerical algebraic geometry. In The Mathematics of Numerical Analysis, Volume 32 of Lectures in Applied Mathematics, edited by J. Renegar, M. Shub, and S. Smale, 749-763, 1996. Proceedings of the AMS-SIAM Summer Seminar in Applied Mathematics, Park City, Utah, July 17-August 11, 1995, Park City, Utah.
    [41]
    G. Thomas. Symbolic computation of the index of quasilinear differential-algebraic equations. Proc. ISSAC 1996. ACM Press. 196-203, 1996.
    [42]
    J. Tuomela and T. Arponen. On the numerical solution of involutive ordinary differential systems. IMA J. Numer. Anal. 20: 561-599, 2000.
    [43]
    J. Verschelde. Algorithm 795: PHCpack: A general-purpose solver for polynomial systems by homotopy continuation. ACM Transactions on Mathematical Software 25(2): 251-276, 1999. Software available at http://www.math.uic.edu/~jan.
    [44]
    J. Visconti. Numerical Solution of Differential Algebraic Equations, Global Error Estimation and Symbolic Index Reduction. Ph.D. Thesis. Laboratoire de Modélisation et Calcul. Grenoble. 1999.
    [45]
    A. Wittkopf and G.J. Reid. Fast differential elimination in C: The CDiffElim environment. Computer Physics Communications, 139: 192-217, 2001.

    Cited By

    View all
    • (2009)Solving polynomial systems via symbolic-numeric reduction to geometric involutive formJournal of Symbolic Computation10.1016/j.jsc.2007.10.01344:3(280-291)Online publication date: 1-Mar-2009
    • (2009)Towards Geometric Completion of Differential Systems by PointsApproximate Commutative Algebra10.1007/978-3-211-99314-9_3(79-97)Online publication date: 21-Aug-2009
    • (2007)Symbolic-numeric computation of implicit riquier bases for PDEProceedings of the 2007 international symposium on Symbolic and algebraic computation10.1145/1277548.1277599(377-386)Online publication date: 29-Jul-2007
    • Show More Cited By

    Index Terms

    1. Geometric completion of differential systems using numeric-symbolic continuation
            Index terms have been assigned to the content through auto-classification.

            Recommendations

            Comments

            Information & Contributors

            Information

            Published In

            cover image ACM SIGSAM Bulletin
            ACM SIGSAM Bulletin  Volume 36, Issue 2
            June 2002
            30 pages
            ISSN:0163-5824
            DOI:10.1145/581316
            Issue’s Table of Contents

            Publisher

            Association for Computing Machinery

            New York, NY, United States

            Publication History

            Published: 02 June 2002
            Published in SIGSAM Volume 36, Issue 2

            Check for updates

            Qualifiers

            • Article

            Contributors

            Other Metrics

            Bibliometrics & Citations

            Bibliometrics

            Article Metrics

            • Downloads (Last 12 months)1
            • Downloads (Last 6 weeks)0

            Other Metrics

            Citations

            Cited By

            View all
            • (2009)Solving polynomial systems via symbolic-numeric reduction to geometric involutive formJournal of Symbolic Computation10.1016/j.jsc.2007.10.01344:3(280-291)Online publication date: 1-Mar-2009
            • (2009)Towards Geometric Completion of Differential Systems by PointsApproximate Commutative Algebra10.1007/978-3-211-99314-9_3(79-97)Online publication date: 21-Aug-2009
            • (2007)Symbolic-numeric computation of implicit riquier bases for PDEProceedings of the 2007 international symposium on Symbolic and algebraic computation10.1145/1277548.1277599(377-386)Online publication date: 29-Jul-2007
            • (2006)Application of numerical algebraic geometry and numerical linear algebra to PDEProceedings of the 2006 international symposium on Symbolic and algebraic computation10.1145/1145768.1145824(345-352)Online publication date: 9-Jul-2006
            • (2005)Symbolic-numeric completion of differential systems by homotopy continuationProceedings of the 2005 international symposium on Symbolic and algebraic computation10.1145/1073884.1073922(269-276)Online publication date: 24-Jul-2005
            • (2004)Hybrid method for solving new pose estimation equation systemProceedings of the 6th international conference on Computer Algebra and Geometric Algebra with Applications10.1007/11499251_5(44-55)Online publication date: 19-May-2004
            • (2003)A complete symbolic-numeric linear method for camera pose determinationProceedings of the 2003 international symposium on Symbolic and algebraic computation10.1145/860854.860900(215-223)Online publication date: 3-Aug-2003
            • (2003)Fast computation of discrete invariants associated to a differential rational mappingJournal of Symbolic Computation10.1016/S0747-7171(03)00091-936:3-4(473-499)Online publication date: 1-Sep-2003

            View Options

            Get Access

            Login options

            View options

            PDF

            View or Download as a PDF file.

            PDF

            eReader

            View online with eReader.

            eReader

            Media

            Figures

            Other

            Tables

            Share

            Share

            Share this Publication link

            Share on social media