Implicit Riquier bases for PDAE and their semi-discretizations
type: Item
instance of: scholarly article
title: Implicit Riquier bases for PDAE and their semi-discretizations
zbMATH Open document ID: 1170.65075
author: Wenyuan Wu
author: Greg Reid
author: Silvana Ilie
published in: Journal of Symbolic Computation
publication date: 2009-06-18T00:00:00Z
review text: Systems of nonlinear partial differential equations with constraints (called PDAEs or partial differential algebraic equations) arise frequently in applications. Missing constraints appearing by prolongation of the corresponding PDAE have to be determined to initialize in a consistent way and to stabilize its numerical solution. In this paper, a symbolic-numeric approach to computing Riquier bases is discussed, which can be applied to the approximate solution of an initial boundary value problem defined by a certain class of PDAEs. The new procedure determines Riquier bases in implicit form, without the unstable eliminations which are common to other exact approaches, and can be applied to square systems of analytic PDAEs dominated by pure derivatives in one independent variable. When a discretization method is applied to the PDAE (i.e., finite differences or finite elements), one ends up with a differential algebraic equation (DAE) to which one of the many existing numerical solvers can be applied. In this sense, the methods developed in this paper provide a bridge between DAEs and PDAEs techniques. In fact, an interesting question posed (but not answered) in the paper is whether the structure analysis of the resulting DAE agrees with the structure analysis of the original PDAE. If this were the case, the discretization step and structure analysis may commute, and thus a very efficient approach would be to apply first the fast prolongation method developed here to the PDAE and then discretize the prolonged PDAE to yield a DAE system without hidden constraints.
reviewed by: Fernando Casas
Mathematics Subject Classification ID: 65M20
Mathematics Subject Classification ID: 35F25
Mathematics Subject Classification ID: 68W30
Mathematics Subject Classification ID: 35R10
Mathematics Subject Classification ID: 34A09
Mathematics Subject Classification ID: 65L80
Mathematics Subject Classification ID: 65M12
Mathematics Subject Classification ID: 65M06
Mathematics Subject Classification ID: 65M60
zbMATH DE Number: 5566496
zbMATH Keywords: partial differential algebraic equations
zbMATH Keywords: Riquier bases
zbMATH Keywords: method of lines
zbMATH Keywords: semi-discretization
zbMATH Keywords: differential algebraic equations
zbMATH Keywords: stabilization
zbMATH Keywords: symbolic-numeric approach
zbMATH Keywords: initial boundary value problem
zbMATH Keywords: finite differences
zbMATH Keywords: finite elements
describes a project that uses: PHCpack
describes a project that uses: ObservabilityTest
MaRDI profile type: Publication
full work available at URL: j.jsc.2008.04.020
OpenAlex ID: W2136692263
cites work: Algorithms in real algebraic geometry
cites work: Q4227290
cites work: Q5515607
cites work: Q4425662
cites work: Numerical solutions of index-1 differential algebraic equations can be computed in polynomial time
cites work: Q5680222
cites work: Overdetermined elliptic systems
cites work: Simplifying numerical solution of constrained PDE systems through involutive completion
cites work: A simple structural analysis method for DAEs
cites work: Differential Elimination–Completion Algorithms for DAE and PDAE
cites work: A probabilistic algorithm to test local algebraic observability in polynomial time
cites work: Completion to involution and semidiscretisations
cites work: The Numerical Solution of Systems of Polynomials Arising in Engineering and Science
cites work: Adaptive method of lines
cites work: Algorithm 795
cites work: Q5301695
DOI: 10.1016/J.JSC.2008.04.020
description: scientific article; zbMATH DE number 5566496