The complexity of formal resolution of linear partial differential equations

DOI10.1007/3-540-60114-7_31MaRDI QIDQ4352814zbMATH OpenFDO

Authors Brahim Sadik

Publication date 28 January 1998

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-60114-7_31

zbMATH Keywords

algebraic differential equationscomplexitydifferential algebradifferential Gröbner basesdifferential idealRitt's algorithmunsolvability

Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15) Differential algebra (12H05) Geometric theory, characteristics, transformations in context of PDEs (35A30) Linear higher-order PDEs (35G05) Symbolic computation and algebraic computation (68W30)

Recommendations

• scientific article; zbMATH DE number 16652
• scientific article; zbMATH DE number 4216963
• Decision problems for differential equations
• Algebraic theory of linear systems: a survey

Cited in

(9)

• Complexity of solution of linear systems in rings of differential operators
• On polyhedral resolvability of a system of linear differential equations
• Effective bounds for the consistency of differential equations
• Bit-complexity of solving systems of linear evolutionary partial differential equations
• Partial algorithms for satellite unknowns determination
• Weak Bézout inequality for D-modules
• Complexity estimates for two uncoupling algorithms
• Bounds for Elimination of Unknowns in Systems of Differential-Algebraic Equations
• New effective differential Nullstellensatz

This page was built for publication: The complexity of formal resolution of linear partial differential equations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4352814)