Pages that link to "Item:Q5578437"
From MaRDI portal
The following pages link to Sylvester's Identity and Multistep Integer-Preserving Gaussian Elimination (Q5578437):
Displayed 31 items.
- A fast Las Vegas algorithm for computing the Smith normal form of a polynomial matrix (Q677132) (← links)
- Power series remainder sequences and Padé fractions over an integral domain (Q749215) (← links)
- An interval algorithm for solving systems of linear equations to prespecified accuracy (Q760758) (← links)
- Definability and fast quantifier elimination in algebraically closed fields (Q798314) (← links)
- Complexity of factoring and calculating the GCD of linear ordinary differential operators (Q805235) (← links)
- A hybrid approach to the computation of the inertia of a parametric family of Bézoutians with application to some stability problems for bivariate polynomials (Q1124738) (← links)
- Fast fraction-free triangularization of Bézoutians with applications to sub-resultant chain computation (Q1124757) (← links)
- Formula manipulation in ALGOL 68 and application to Routh's algorithm (Q1141184) (← links)
- Computational methods of linear algebra (Q1148099) (← links)
- An algorithm for solving parametric linear systems (Q1194335) (← links)
- Inversion components of block Hankel-like matrices (Q1208260) (← links)
- Computing algorithms for the reduction of a Hermite algorithm with polynomial coefficients (Q1351936) (← links)
- Algebraic and numerical techniques for the computation of matrix determinants (Q1368466) (← links)
- Various proofs of Sylvester's (determinant) identity. (Q1565842) (← links)
- Specifications for triangulation algorithms of elementary-algebraic systems (Q1598480) (← links)
- Residue polynomial systems (Q1603888) (← links)
- A new method for computing polynomial greatest common divisors and polynomial remainder sequences (Q1822238) (← links)
- Which pivot to solve linear systems? (Q1860424) (← links)
- An application of fast factorization algorithms in computer aided geometric design (Q1874663) (← links)
- Matrix computation of subresultant polynomial remainder sequences in integral domains (Q1904349) (← links)
- Algorithmic properties of maximal orders in simple algebras over \(\mathbb{Q}\) (Q2366169) (← links)
- Fraction-free row reduction of matrices of Ore polynomials. (Q2457346) (← links)
- Complexity bounds for zero-test algorithms (Q2457383) (← links)
- Online linear optimization and adaptive routing (Q2462507) (← links)
- Output-sensitive modular algorithms for polynomial matrix normal forms (Q2470057) (← links)
- Algorithme de Bareiss, algorithme des sous-résultants (Q3124402) (← links)
- Spécialisation de la suite de Sturm et sous-résultants (I) (Q3358238) (← links)
- A Table of Quintic Number Fields (Q4305961) (← links)
- Algorithms for Hermite and Smith Normal Matrices and Linear Diophantine Equations (Q5641964) (← links)
- Efficient algorithms for computing the characteristic polynomial in a domain (Q5928850) (← links)
- A generalized Sylvester identity and fraction-free random Gaussian elimination (Q5933502) (← links)