Representation for the radical of a finitely generated differential ideal
ISSAC '95 Proceedings of the 1995 international symposium on Symbolic and algebraic computation
Existence and uniqueness theorems for formal power series solutions of analytic differential systems
ISSAC '99 Proceedings of the 1999 international symposium on Symbolic and algebraic computation
Algorithm 795: PHCpack: a general-purpose solver for polynomial systems by homotopy continuation
ACM Transactions on Mathematical Software (TOMS)
A probabilistic algorithm to test local algebraic observability in polynomial time
Journal of Symbolic Computation - Computer algebra: Selected papers from ISSAC 2001
Completion to involution and semidiscretisations
Applied Numerical Mathematics
Rankings of derivatives for elimination algorithms and formal solvability of analytic partial differential equations
Algorithms and implementations for differential elimination
Algorithms and implementations for differential elimination
Overdetermined Elliptic Systems
Foundations of Computational Mathematics
Symbolic-numeric computation of implicit riquier bases for PDE
Proceedings of the 2007 international symposium on Symbolic and algebraic computation
Computational complexity of numerical solutions of initial value problems for differential algebraic equations
Finding points on real solution components and applications to differential polynomial systems
Proceedings of the 38th international symposium on International symposium on symbolic and algebraic computation
| Hi-index | 0.00 |
Complicated nonlinear systems of pde with constraints (called pdae) arise frequently in applications. Missing constraints arising by prolongation (differentiation) of the pdae need to be determined to consistently initialize and stabilize their numerical solution. In this article we review a fast prolongation method, a development of (explicit) symbolic Riquier Bases, suitable for such numerical applications. Our symbolic-numeric method to determine Riquier Bases in implicit form, without the unstable eliminations of the exact approaches, applies to square systems which are dominated by pure derivatives in one of the independent variables. The method is successful provided the prolongations with respect to a single dominant independent variable have a block structure which is uncovered by Linear Programming and certain Jacobians are nonsingular when evaluated at points on the zero sets defined by the functions of the pdae. For polynomially nonlinear pdae, homotopy continuation methods from Numerical Algebraic Geometry can be used to compute approximations of the points. Our method generalizes Pryce's method for dae to pdae. Given a dominant independent time variable, for an initial value problem for a system of pdae we show that its semi-discretization is also naturally amenable to our symbolic-numeric approach. In particular, if our method can be successfully applied to such a system of pdae, yielding an implicit Riquier Basis, then under modest conditions, the semi-discretized system of dae is also an implicit Riquier Basis.