Complexity of factorization and GCD computation for linear ordinary differential operators

zbMATH Open0780.65039MaRDI QIDQ684956

Dima Grigoriev

Publication date: 15 September 1993

Published in: Journal of Soviet Mathematics (Search for Journal in Brave)

zbMATH Keywords

complexityalgorithmfundamental solutionsgreatest common divisorfactorizationirreducible operatorsrational coefficientslinear ordinary differential operators

Mathematics Subject Classification ID

General theory of ordinary differential operators (47E05) Linear ordinary differential equations and systems (34A30) Numerical methods for initial value problems involving ordinary differential equations (65L05)

This page was built for publication: Complexity of factorization and GCD computation for linear ordinary differential operators

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