Computation of determinants of rational functions seems to be out of thought in computer algebra so far. We first show that representing the rational function by the sum of partial fractions is absolutely necessary in the computation. We then propose a very simple technique for efficient computation: replace every distinct denominator of the rational functions in the input matrix by the inverse of an independent variable, and recover the denominators after computing the deter-minant as a polynomial. Some experiments show that the technique speeds up the computation by 3 ∼ 6 times for the samples tested.
In this paper we present the new algorithm to calculate determinants of nth order using Salihu’s met...
AbstractIn this paper, we give an algorithm for directly finding the denominator values of rational ...
We present two algorithms on sparse rational interpolation. The first is the interpolation algorithm...
AbstractNine methods for expressing a proper rational function in terms of partial fractions are pre...
Algorithms for symbolic partial fraction decomposition and indefinite integration of rational functi...
We improve upon the method of Zhu and Zhu [A method for directly finding the denominator values of r...
AbstractWe improve upon the method of Zhu and Zhu [A method for directly finding the denominator val...
summary:Numerical operations on and among rational matrices are traditionally handled by direct mani...
We consider the problem of computing the determinant of a matrix of polynomials. Four algorithms are...
Abstract: In this paper, we will discuss a new method of integrating certain types of rational func...
<F4.793e+05> We prove a new combinatorial characterization of the<F3.928e+05> determi-&...
The calculation of a square matrix determinant is a typical matrix algebra operation which, if appli...
We present two algorithms for interpolating sparse rational functions. The first is the interpolatio...
AbstractSymmetrical determinantal formulas for the numerator and denominator of an ordinary rational...
AbstractWe review, modify, and combine together several numerical and algebraic techniques in order ...
In this paper we present the new algorithm to calculate determinants of nth order using Salihu’s met...
AbstractIn this paper, we give an algorithm for directly finding the denominator values of rational ...
We present two algorithms on sparse rational interpolation. The first is the interpolation algorithm...
AbstractNine methods for expressing a proper rational function in terms of partial fractions are pre...
Algorithms for symbolic partial fraction decomposition and indefinite integration of rational functi...
We improve upon the method of Zhu and Zhu [A method for directly finding the denominator values of r...
AbstractWe improve upon the method of Zhu and Zhu [A method for directly finding the denominator val...
summary:Numerical operations on and among rational matrices are traditionally handled by direct mani...
We consider the problem of computing the determinant of a matrix of polynomials. Four algorithms are...
Abstract: In this paper, we will discuss a new method of integrating certain types of rational func...
<F4.793e+05> We prove a new combinatorial characterization of the<F3.928e+05> determi-&...
The calculation of a square matrix determinant is a typical matrix algebra operation which, if appli...
We present two algorithms for interpolating sparse rational functions. The first is the interpolatio...
AbstractSymmetrical determinantal formulas for the numerator and denominator of an ordinary rational...
AbstractWe review, modify, and combine together several numerical and algebraic techniques in order ...
In this paper we present the new algorithm to calculate determinants of nth order using Salihu’s met...
AbstractIn this paper, we give an algorithm for directly finding the denominator values of rational ...
We present two algorithms on sparse rational interpolation. The first is the interpolation algorithm...