Abstract

We develop a new algorithm for computing rational solutions of partial pseudo-linear systems. The algorithm uses a recursive process based on the computation of rational solutions for a sole pseudo-linear system. Using the general setting of pseudo-linear algebra, we revisit the computation of rational solutions for a pseudo-linear system. In particular, we provide a unified and efficient approach for computing a universal denominator. All the algorithms are implemented in Maple.

Full Text
Published version (Free)

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 call