Sylvester's Identity and Multistep Integer-Preserving Gaussian Elimination

Recommendations

A generalized Sylvester identity and fraction-free random Gaussian elimination
The d-step conjecture and Gaussian elimination
A multi-dimensional extension of Sylvester’s identity
scientific article; zbMATH DE number 6098827
A generalization of Sylvester's identity on determinants and some applications
The Sylvester equation and approximate balanced reduction
ON THE EXPLICIT FORMULA FOR GAUSS-JORDAN ELIMINATION
On the solvability of the Sylvester equation
A generalization of Sylvester's identity

Cited in

(96)

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
Fast fraction-free triangularization of Bézoutians with applications to sub-resultant chain computation
Formula manipulation in ALGOL 68 and application to Routh's algorithm
Computational methods of linear algebra
An algorithm for solving parametric linear systems
Inversion components of block Hankel-like matrices
Computing algorithms for the reduction of a Hermite algorithm with polynomial coefficients
The d-step conjecture and Gaussian elimination
Algebraic and numerical techniques for the computation of matrix determinants
Various proofs of Sylvester's (determinant) identity.
Specifications for triangulation algorithms of elementary-algebraic systems
Residue polynomial systems
A new method for computing polynomial greatest common divisors and polynomial remainder sequences
Which pivot to solve linear systems?
An application of fast factorization algorithms in computer aided geometric design
Matrix computation of subresultant polynomial remainder sequences in integral domains
A simple division-free algorithm for computing determinants
Computing the maximum degree of minors in mixed polynomial matrices via combinatorial relaxation
A logic based approach to finding real singularities of implicit ordinary differential equations
Semi-algebraic approximation using Christoffel-Darboux kernel
Common factors in fraction-free matrix decompositions
Complexity aspects of local minima and related notions
Subresultant chains using Bézout matrices
Separation bounds for polynomial systems
Parameterized complexity of determinant and permanent
Finding linearly generated subsequences
An isospectral problem for global conservative multi-peakon solutions of the Camassa-Holm equation
Coalitional games induced by matching problems: complexity and islands of tractability for the Shapley value
A note on locality of algebras
Algorithmic properties of maximal orders in simple algebras over \(\mathbb{Q}\)
A fraction free matrix Berlekamp/Massey algorithm
Chiò's and Dodgson's determinantal identities
Fraction-free row reduction of matrices of Ore polynomials.
Complexity bounds for zero-test algorithms
Online linear optimization and adaptive routing
Output-sensitive modular algorithms for polynomial matrix normal forms
Factoring multivariate polynomials represented by black boxes: a Maple + C implementation
Roundoff-error-free algorithms for solving linear systems via Cholesky and LU factorizations
Computing characteristic polynomials of matrices of structured polynomials
Faster geometric algorithms via dynamic determinant computation
The complexity of divisibility
Solve linear system with Sylvester's condensation
Book Review: The Chinese roots of linear algebra
Computing the maximum degree of minors in mixed polynomial matrices via combinatorial relaxation
Algorithme de Bareiss, algorithme des sous-résultants
scientific article; zbMATH DE number 6098827 (Why is no real title available?)
Spécialisation de la suite de Sturm et sous-résultants (I)
Lazy and Forgetful Polynomial Arithmetic and Applications
A Table of Quintic Number Fields
On One Type of Generalized Vandermonde Determinants
Determining the number of Killing tensors by (linear) algebra
An algorithm to calculate generalized Seifert matrices
Exactly solving sparse rational linear systems via roundoff-error-free Cholesky factorizations
Additive primitive length in relatively free algebras
Exact solution of sparse linear systems via left-looking roundoff-error-free Lu factorization in time proportional to arithmetic work
Rank vertex cover as a natural problem for algebraic compression
Computing characteristic polynomials of matrices of structured polynomials
Multi-stage programming with functors and monads: eliminating abstraction overhead from generic code
Roundoff-Error-Free Basis Updates of LU Factorizations for the Efficient Validation of Optimality Certificates
Algorithms for Hermite and Smith Normal Matrices and Linear Diophantine Equations
Algorithm 1021: SPEX Left LU, Exactly Solving Sparse Linear Systems via a Sparse Left-looking Integer-preserving LU Factorization
Planar and Toroidal Morphs Made Easier
Efficient algorithms for computing the characteristic polynomial in a domain
A generalized Sylvester identity and fraction-free random Gaussian elimination
Algebraic number fields and the LLL algorithm
Termination of linear loops under commutative updates
The computational complexity of knot genus in a fixed 3‐manifold
Methodologies of Symbolic Computation
Absolute reconstruction for sums of powers of linear forms: degree 3 and beyond
Continued fraction expansions of Herglotz–Nevanlinna functions and generalized indefinite strings of Stieltjes type
Exact QR factorizations of rectangular matrices
Generalized fraction-free \(LU\) factorization for singular systems with kernel extraction
Solving Parametric Linear Systems Using Sparse Rational Function Interpolation
Clausal proofs for pseudo-Boolean reasoning
Maximum energy dissipation-based incremental approach for structural analyses involving discrete fracture propagation in quasi-brittle materials
Interpolation by decomposable univariate polynomials
A fast Las Vegas algorithm for computing the Smith normal form of a polynomial matrix
Solving Łukasiewicz \(\mu\)-terms
Unconditional correctness of recent quantum algorithms for factoring and computing discrete logarithms
Integer linear-exponential programming in NP by quantifier elimination
Roundoff-error-free QR factorization via integer-preserving Gram Schmidt orthogonalization
The complexity of the greedoid Tutte polynomial
Computing high precision matrix Padé approximants
A novel discrete integrable system related to hyper-elliptic curves of genus two
The Weil bound for generalized Kloosterman sums of half-integral weight
An introduction to the theory of linear integer arithmetic (invited paper)
Title not available (Why is no real title available?)
Title not available (Why is no real title available?)
Title not available (Why is no real title available?)
Counting permutation patterns with multidimensional trees
Power series remainder sequences and Padé fractions over an integral domain
An interval algorithm for solving systems of linear equations to prespecified accuracy
Definability and fast quantifier elimination in algebraically closed fields
Complexity of factoring and calculating the GCD of linear ordinary differential operators
Algebraic properties of Manin matrices. I
An effective algorithm of computing symbolic determinants with multivariate polynomial entries

This page was built for publication: Sylvester's Identity and Multistep Integer-Preserving Gaussian Elimination

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5578437)