Factorization in categories of systems of linear partial differential equations

Simple item page
dc.creatorTsarev, S. P.
dc.date2008-01-09
dc.date.accessioned2026-07-07T08:53:28Z
dc.date.available2026-07-07T08:53:28Z
dc.descriptionWe start with elementary algebraic theory of factorization of linear ordinary differential equations developed in the period 1880-1930. After exposing these classical results we sketch more sophisticated algorithmic approaches developed in the last 20 years. The main part of this paper is devoted to modern generalizations of the notion of factorization to the case of systems of linear partial differential equations and their relation with explicit solvability of nonlinear partial differential equations based on some constructions from the theory of abelian categories.
dc.descriptionLaTeX, 23 pages
dc.identifierhttps://arxiv.org/abs/0801.1341
dc.identifierhttp://arxiv.org/abs/0801.1341
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/145632
dc.subjectSymbolic Computation
dc.titleFactorization in categories of systems of linear partial differential equations
dc.typetext

Files

Collections

arXiv