Сибирский федеральный университет

Тип публикации: доклад, тезисы доклада, статья из сборника материалов конференций

Год издания: 1996

Ключевые слова: Algorithms, Combinatorial mathematics, Differential equations, Parameter estimation, Problem solving, Topology, Factorizations, Linear ordinary differential operator (LODO), Mathematical operators

Аннотация: We discuss the problem of exhaustive enumeration of all possible factorizations for a given linear ordinary differential operator. A theoretical investigation of topological and combinatorial obstacles to uniform description of factors which include arbitrary parameters and a complete algorithm for enumeration of all (discrete and parameterized) factorizations are given.

Журнал: Proceedings of the International Symposium on Symbolic and Algebraic Computation, ISSAC

Номера страниц: 226-231

• Tsarev S.P. (Krasnoyarsk State Pedagogical Univ, Krasnoyarsk, Russian Federation)

• Scopus
• Ядро РИНЦ (eLIBRARY.RU)