Pages that link to "Item:Q5578437"
From MaRDI portal
The following pages link to Sylvester's Identity and Multistep Integer-Preserving Gaussian Elimination (Q5578437):
Displaying 50 items.
- Faster geometric algorithms via dynamic determinant computation (Q283878) (← links)
- The complexity of divisibility (Q286139) (← links)
- Multi-stage programming with functors and monads: eliminating abstraction overhead from generic code (Q532398) (← links)
- Generalized fraction-free \(LU\) factorization for singular systems with kernel extraction (Q648916) (← links)
- A fast Las Vegas algorithm for computing the Smith normal form of a polynomial matrix (Q677132) (← links)
- Solving Łukasiewicz \(\mu\)-terms (Q683713) (← links)
- Computing high precision matrix Padé approximants (Q695617) (← 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)
- Algebraic properties of Manin matrices. I (Q840705) (← links)
- An effective algorithm of computing symbolic determinants with multivariate polynomial entries (Q990537) (← 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)
- A simple division-free algorithm for computing determinants (Q1944204) (← links)
- Computing the maximum degree of minors in mixed polynomial matrices via combinatorial relaxation (Q1950387) (← links)
- A logic based approach to finding real singularities of implicit ordinary differential equations (Q2035628) (← links)
- Semi-algebraic approximation using Christoffel-Darboux kernel (Q2067503) (← links)
- Common factors in fraction-free matrix decompositions (Q2071522) (← links)
- Complexity aspects of local minima and related notions (Q2074805) (← links)
- Subresultant chains using Bézout matrices (Q2109975) (← links)
- Separation bounds for polynomial systems (Q2188979) (← links)
- Parameterized complexity of determinant and permanent (Q2207496) (← links)
- Finding linearly generated subsequences (Q2232219) (← links)
- An isospectral problem for global conservative multi-peakon solutions of the Camassa-Holm equation (Q2249770) (← links)
- Coalitional games induced by matching problems: complexity and islands of tractability for the Shapley value (Q2289024) (← links)
- A note on locality of algebras (Q2343500) (← links)
- Algorithmic properties of maximal orders in simple algebras over \(\mathbb{Q}\) (Q2366169) (← links)
- A fraction free matrix Berlekamp/Massey algorithm (Q2435413) (← links)
- Chiò's and Dodgson's determinantal identities (Q2451703) (← 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)
- Factoring multivariate polynomials represented by black boxes: a Maple + C implementation (Q2680117) (← links)
- Roundoff-Error-Free Algorithms for Solving Linear Systems via Cholesky and LU Factorizations (Q2802247) (← links)
