Systems of linear equations with dense univariate polynomial coefficients

Authors:
Stanley Cabay;Bart Domzy
Affiliations:
Univ. of Alberta, Edmonton, Alta., Canada;Univ. of Waterloo, Waterloo, Ont., Canada
Venue:
Journal of the ACM (JACM)
Year:
1987

Citing 11
Cited 1

Algebraic computations of scaled pade´ fractions

SIAM Journal on Computing
The Exact Solution of Systems of Linear Equations with Polynomial Coefficients

Journal of the ACM (JACM)
On Computing the Exact Determinant of Matrices with Polynomial Entries

Journal of the ACM (JACM)
The Algebraic Solution of Sparse Linear Systems via Minor Expansion

ACM Transactions on Mathematical Software (TOMS)
Analysis of Algorithms, A Case Study: Determinants of Matrices with Polynomial Entries

ACM Transactions on Mathematical Software (TOMS)
The Exact Solution of Linear Equations with Rational Function Coefficients

ACM Transactions on Mathematical Software (TOMS)
A Comparison of Algorithms for the Exact Solution of Linear Equations

ACM Transactions on Mathematical Software (TOMS)
Symbolic Computation of Padé Approximants

ACM Transactions on Mathematical Software (TOMS)
Approximate algorithms to derive exact solutions to systems of linear equations

EUROSAM '79 Proceedings of the International Symposiumon on Symbolic and Algebraic Computation
Chinese remainder and interpolation algorithms

SYMSAC '71 Proceedings of the second ACM symposium on Symbolic and algebraic manipulation
A cancellation free algorithm, with factoring capabilities, for the efficient solution of large sparse sets of equations

SYMSAC '81 Proceedings of the fourth ACM symposium on Symbolic and algebraic computation

A Method for Solution of Systems of Linear Algebraic Equations with m-Dimensional λ-Matrices

Cybernetics and Systems Analysis

Quantified Score

Hi-index	0.00

Visualization

Abstract

An algorithm for computing the power series solution of a system of linear equations with components that are dense univariate polynomials over a field is described and analyzed. A method for converting the power series solution to rational form is derived. Theoretical and experimental cost estimates are obtained and used to identify classes of problems for which the power series method outperforms modular methods. Finally, it is shown that the power series method also provides an effective mechanism for solving the problem in which the coefficients of the polynomials are from the ring of integers.