An error-free algorithm to solve a linear system of polynomial equations
This paper concerns an algorithm for solving the linear system \(A(s)\cdot \bar x(s)= \bar y(s)\), where the elements of the polynomial matrix \(A\) and the output vector are \[ a_{i,j}(s)={^{p-1} a_{i,j}}\cdot s^{p-1}+\cdots +{^ 1 a_{i,j}}\cdot s^ 1+ {^ 0 a_{i,j}},\quad y_ i(s)= {^{p-1} y_ i}\cdot s^{p-1}+\cdots+ {^ 1 y_ i}\cdot s^ 1+ {^ 0 y_ i}, \] with \(i,j\in \{0,\dots, n-1\}\). Applications of some classic algorithms lead to very large degrees \((n,p)\) of the polynomials of the inverse matrix \(A^{-1}(s)\) and the determinant of the matrix \(A(s)\). The algorithm presented restricts the degree of polynomial elements during the calculation to the constant value \(p\) and therefore restricts memory space for the calculation of \(A^{-1}(s)\). Modular arithmetics in the residual polynomial class and in the residual numerical class are employed.
- An algorithm for solving the matrix polynomial equation B(s)D(s)+A(s)N(s)=H(s)
- Rational solutions of singular linear systems
- Error-free algorithms to solve special and general discrete systems of linear equations
- Solution algorithms for systems of linear equations over residue rings
- scientific article; zbMATH DE number 3890617
- Determination of inverse volterra kernels in nonlinear discrete systems
- scientific article; zbMATH DE number 3874496 (Why is no real title available?)
- scientific article; zbMATH DE number 3967873 (Why is no real title available?)
- k-dimensional error-free deconvolution using the Fermat number transform
- Precise deconvolution using the Fermat number transform
- Precise multidimensional deconvolution using the polynomial algebra concept
- Solving equations exactly
- Direct fail-proof triangularization algorithms for \(AX+XB=C\) with error- free and parallel implementations
- Remarks on polynomial methods for solving systems of linear algebraic equations
- One-modulus residue arithmetic algorithm to solve linear equations exactly
- Exact algorithm of multidimensional circulant deconvolution
- An algorithm to solve Hilbert systems of linear equations precisely
- Numerical linear system solving with parametric entries by error correction
- scientific article; zbMATH DE number 3890617 (Why is no real title available?)
- Rational solutions of singular linear systems
- scientific article; zbMATH DE number 4050861 (Why is no real title available?)
- scientific article; zbMATH DE number 70114 (Why is no real title available?)
- Early termination in parametric linear system solving and rational function vector recovery with error correction
- An approach to solving systems of polynomials via modular arithmetics with applications
- Error-free algorithms to solve special and general discrete systems of linear equations
This page was built for publication: An error-free algorithm to solve a linear system of polynomial equations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1334719)
