Sylvester's Identity and Multistep Integer-Preserving Gaussian Elimination
From MaRDI portal
Publication:5578437
DOI10.2307/2004533zbMath0187.09701OpenAlexW4230989983WikidataQ56041860 ScholiaQ56041860MaRDI QIDQ5578437
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
Related Items
An application of fast factorization algorithms in computer aided geometric design, 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, Faster geometric algorithms via dynamic determinant computation, Algorithmic properties of maximal orders in simple algebras over \(\mathbb{Q}\), The complexity of divisibility, An algorithm to calculate generalized Seifert matrices, Algebraic properties of Manin matrices. I, Computing algorithms for the reduction of a Hermite algorithm with polynomial coefficients, Matrix computation of subresultant polynomial remainder sequences in integral domains, Exactly Solving Sparse Rational Linear Systems via Roundoff-Error-Free Cholesky Factorizations, Algebraic and numerical techniques for the computation of matrix determinants, On One Type of Generalized Vandermonde Determinants, 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, Book Review: The Chinese roots of linear algebra, Algebraic number fields and the LLL algorithm, Termination of linear loops under commutative updates, Separation bounds for polynomial systems, The computational complexity of knot genus in a fixed 3‐manifold, Formula manipulation in ALGOL 68 and application to Routh's algorithm, Factoring multivariate polynomials represented by black boxes: a Maple + C implementation, Roundoff-Error-Free Basis Updates of LU Factorizations for the Efficient Validation of Optimality Certificates, Computational methods of linear algebra, 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, A simple division-free algorithm for computing determinants, Exact QR factorizations of rectangular matrices, Computing the maximum degree of minors in mixed polynomial matrices via combinatorial relaxation, A fraction free matrix Berlekamp/Massey algorithm, Parameterized complexity of determinant and permanent, Generalized fraction-free \(LU\) factorization for singular systems with kernel extraction, Chiò's and Dodgson's determinantal identities, Fraction-free row reduction of matrices of Ore polynomials., Complexity bounds for zero-test algorithms, Finding linearly generated subsequences, Online linear optimization and adaptive routing, Algorithms for Hermite and Smith Normal Matrices and Linear Diophantine Equations, Computing the Maximum Degree of Minors in Mixed Polynomial Matrices via Combinatorial Relaxation, A fast Las Vegas algorithm for computing the Smith normal form of a polynomial matrix, Output-sensitive modular algorithms for polynomial matrix normal forms, An algorithm for solving parametric linear systems, Solving Łukasiewicz \(\mu\)-terms, An isospectral problem for global conservative multi-peakon solutions of the Camassa-Holm equation, Efficient algorithms for computing the characteristic polynomial in a domain, Multi-stage programming with functors and monads: eliminating abstraction overhead from generic code, Computing high precision matrix Padé approximants, Inversion components of block Hankel-like matrices, A generalized Sylvester identity and fraction-free random Gaussian elimination, A Table of Quintic Number Fields, An effective algorithm of computing symbolic determinants with multivariate polynomial entries, Spécialisation de la suite de Sturm et sous-résultants (I), A logic based approach to finding real singularities of implicit ordinary differential equations, Roundoff-Error-Free Algorithms for Solving Linear Systems via Cholesky and LU Factorizations, Coalitional games induced by matching problems: complexity and islands of tractability for the Shapley value, Power series remainder sequences and Padé fractions over an integral domain, Additive primitive length in relatively free algebras, An interval algorithm for solving systems of linear equations to prespecified accuracy, Lazy and Forgetful Polynomial Arithmetic and Applications, Computing Characteristic Polynomials of Matrices of Structured Polynomials, A new method for computing polynomial greatest common divisors and polynomial remainder sequences, Semi-algebraic approximation using Christoffel-Darboux kernel, Exact Solution of Sparse Linear Systems via Left-Looking Roundoff-Error-Free LU Factorization in Time Proportional to Arithmetic Work, Various proofs of Sylvester's (determinant) identity., Rank Vertex Cover as a Natural Problem for Algebraic Compression, Common factors in fraction-free matrix decompositions, Complexity aspects of local minima and related notions, Algorithme de Bareiss, algorithme des sous-résultants, Definability and fast quantifier elimination in algebraically closed fields, A note on locality of algebras, Unnamed Item, Specifications for triangulation algorithms of elementary-algebraic systems, Which pivot to solve linear systems?, Complexity of factoring and calculating the GCD of linear ordinary differential operators, Subresultant chains using Bézout matrices, Residue polynomial systems, Computing characteristic polynomials of matrices of structured polynomials
