Abstract
It is well known that if the leading matrix of a linear ordinary differential or difference system is nonsingular, then the determinant of this matrix contains some useful information on solutions of the system. We investigate a kind of non-arithmetic complexity of known algorithms for transforming a matrix of scalar operators to an equivalent matrix which has non-singular frontal, or, leading matrix. In the algorithms under consideration, the differentiation in the differential case and the shift in the difference case play a significant role. We give some analysis of the complexity measured as the number of differentiations or, resp., shifts in the worst case. We not only offer estimates of the complexity written using the O -notation, but we also show that some estimates are sharp and can not be improved.
Sign-in/Register to access full text options 
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.
