11
views
0
recommends
+1 Recommend
0 collections
    0
    shares
      • Record: found
      • Abstract: found
      • Article: found
      Is Open Access

      \(h\)-Adic Polynomials and Partial Fraction Decomposition of Proper Rational Functions over \(\mathbb{R}\) or \(\mathbb{C}\)

      ,
      International Journal of Mathematics and Mathematical Sciences
      Hindawi Limited

      Read this article at

      Bookmark
          There is no author summary for this article yet. Authors can add summaries to their articles on ScienceOpen to make them more accessible to a non-specialist audience.

          Abstract

          The partial fraction decomposition technique is very useful in many areas including mathematics and engineering. In this paper we present a new and simple method on the partial fraction decomposition of proper rational functions which have completely factored denominators over R or C . The method is based on a recursive computation of the h -adic polynomial in commutative algebra which is a generalization of the Taylor polynomial. Since its computation requires only simple algebraic operations, it does not require a computer algebra system to be programmed.

          Related collections

          Most cited references3

          • Record: found
          • Abstract: not found
          • Book: not found

          Polynomial and Matrix Computations

            Bookmark
            • Record: found
            • Abstract: not found
            • Article: not found

            Fast Algorithms for Partial Fraction Decomposition

              Bookmark
              • Record: found
              • Abstract: found
              • Article: found
              Is Open Access

              Efficient Recursive Methods for Partial Fraction Expansion of General Rational Functions

              Partial fraction expansion (pfe) is a classic technique used in many fields of pure or applied mathematics. The paper focuses on the pfe of general rational functions in both factorized and expanded form. Novel, simple, and recursive formulas for the computation of residues and residual polynomial coefficients are derived. The proposed pfe methods require only simple pure-algebraic operations in the whole computation process. They do not involve derivatives when tackling proper functions and require no polynomial division when dealing with improper functions. The methods are efficient and very easy to apply for both computer and manual calculation. Various numerical experiments confirm that the proposed methods can achieve quite desirable accuracy even for pfe of rational functions with multiple high-order poles or some tricky ill-conditioned poles.
                Bookmark

                Author and article information

                Journal
                International Journal of Mathematics and Mathematical Sciences
                International Journal of Mathematics and Mathematical Sciences
                Hindawi Limited
                0161-1712
                1687-0425
                2018
                2018
                : 2018
                :
                : 1-6
                Article
                10.1155/2018/7495964
                51d398e5-c88f-40ba-802d-4efac3732d51
                © 2018

                http://creativecommons.org/licenses/by/4.0/

                History

                Comments

                Comment on this article