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