Rational solutions of singular linear systems
From MaRDI portal
Recommendations
Cited in
(21)- Cramer-type formula for the polynomial solutions of coupled linear equations with polynomial coefficients
- Solving linear systems of determinant frequently zero over finite field GF(2)
- An error-free algorithm to solve a linear system of polynomial equations
- On lattice reduction for polynomial matrices
- System reduction and solution algorithms for singular linear difference systems under rational expectations
- High-order lifting and integrality certification
- Linear differential and difference systems: \(\mathrm{EG}_\delta\)- and \(\mathrm{EG}_\sigma\)-eliminations
- Improved distance queries and cycle counting by Frobenius normal form
- Fast computation of the rank profile matrix and the generalized Bruhat decomposition
- Certified dense linear system solving
- Certified sparse linear system solving
- Roundoff-error-free algorithms for solving linear systems via Cholesky and LU factorizations
- Numerical linear system solving with parametric entries by error correction
- scientific article; zbMATH DE number 3890617 (Why is no real title available?)
- Systems of linear equations with dense univariate polynomial coefficients
- Fast solution of linear systems with polynomial coefficients over the ring of integers
- Triangular \(x\)-basis decompositions and derandomization of linear algebra algorithms over \(K[x]\)
- scientific article; zbMATH DE number 1559365 (Why is no real title available?)
- Early termination in parametric linear system solving and rational function vector recovery with error correction
- Rational elimination algorithm and applications
- Generalized fraction-free \(LU\) factorization for singular systems with kernel extraction
This page was built for publication: Rational solutions of singular linear systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3454771)
