Abstract
In the paper, construction of algorithms for factoring linear partial differential operators is studied. New theoretical concepts--obstacle and ring of obstacles--are introduced. These are invariants and posses other interesting properties. A theorem on unique factorization extension starting from some moment, which is important from the standpoint of construction of such algorithms, is proved. Obstacles in the case of the second and third degrees are found.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
