The Exact Solution of Systems of Linear Equations with Polynomial Coefficients
From MaRDI portal
Publication:5180761
DOI10.1145/321784.321787zbMath0273.65030OpenAlexW2013079012MaRDI QIDQ5180761
Publication date: 1973
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: http://digital.library.wisc.edu/1793/57720
Numerical solutions to overdetermined systems, pseudoinverses (65F20) Numerical computation of solutions to systems of equations (65H10) Direct numerical methods for linear systems and matrix inversion (65F05) Matrices of integers (15B36) Matrices, determinants in number theory (11C20)
Related Items
Algorithm of polynomial complexity for factoring polynomials and finding the components of varieties in subexponential time, Factorization of polynomials over a finite field and the solution of systems of algebraic equations, Exact Solution of Systems of Linear Equations with Iterative Methods, Solving systems of linear equations over polynomials, An adaptable and extensible geometry kernel, Finding linear dependencies in integration-by-parts equations: a Monte Carlo approach, Computing a matrix symmetrizer exactly using modified multiple modulus residue arithmetic, Parametric Markov chains: PCTL complexity and fraction-free Gaussian elimination, An Algorithm for the Exact Reduction of a Matrix to Frobenius Form Using Modular Arithmetic. I, Unnamed Item, List decoding of number field codes, A parallel algorithm for exact solution of linear equations via congruence technique, Linear differential and difference systems: \(\mathrm{EG}_\delta\)- and \(\mathrm{EG}_\sigma\)-eliminations, Computing the Greatest Common Divisor of Polynomials Using the Comrade Matrix, Symbolic iterative algorithm for generalized inversion of rational polynomial matrices, Bibliography on the evaluation of numerical software, An algorithm for inverting polynomial matrices, Complexity of wild matrix problems and of isomorphism of algebras and graphs, The Minimum Root Separation of a Polynomial
