Systems of linear equations with dense univariate polynomial coefficients

DOI10.1145/28869.28877zbMATH Open0638.65034OpenAlexW1994577040MaRDI QIDQ3779664FDOQ3779664

Authors: Stanley Cabay, Bart Domzy 

Publication date: 1987

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/28869.28877

Recommendations

• Rational solutions of singular linear systems
• Fast computation of power series solutions of systems of differential equations
• Regular solutions of linear differential systems with power series coefficients
• Fast solution of linear systems with polynomial coefficients over the ring of integers
• Fast algorithms for polynomial solutions of linear differential equations

zbMATH Keywords

analysis of algorithmslinear systemspower seriesgreatest common divisorsalgebraic algorithmspower series solutionpolynomial equationscomputations on polynomialscomputations in finite fieldsexact computationscomputations on matriceslinear system with polynomial coefficientsPadé fractions

Mathematics Subject Classification ID

Algorithms for approximation of functions (65D15) Matrices over function rings in one or more variables (15A54)

Cited In (4)

• Solving systems of linear algebraic equations of a special kind with sparse polynomial and numerical coefficients
• Overdetermined systems of sparse polynomial equations
• Rational solutions of singular linear systems
• Cramer-type formula for the polynomial solutions of coupled linear equations with polynomial coefficients

This page was built for publication: Systems of linear equations with dense univariate polynomial coefficients

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3779664)