Kaltofen's division-free determinant algorithm differentiated for matrix adjoint computation
From MaRDI portal
Publication:540327
DOI10.1016/J.JSC.2010.08.012zbMATH Open1220.15004OpenAlexW2107481308MaRDI QIDQ540327FDOQ540327
Authors: Gilles Villard 
Publication date: 1 June 2011
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jsc.2010.08.012
Recommendations
- scientific article; zbMATH DE number 1263378
- Computation of determinants, adjoint matrices, and characteristic polynomials without division
- Acceleration of computation of determinants and characteristic polynomials without divisions
- On the complexity of computing determinants
- A simple division-free algorithm for computing determinants
exact algorithmcharacteristic polynomialautomatic differentiationmatrix inversedivision-free complexitymatrix adjointmatrix determinantWiedemann algorithm
Cites Work
- The complexity of partial derivatives
- On fast multiplication of polynomials over arbitrary algebras
- On the complexity of computing determinants
- Title not available (Why is that?)
- Matrix multiplication via arithmetic progressions
- Fast solution of toeplitz systems of equations and computation of Padé approximants
- Solving sparse linear equations over finite fields
- Modern computer algebra
- High-order lifting and integrality certification
- The Inverses of Block Hankel and Block Toeplitz Matrices
- Challenges of symbolic computation: My favorite open problems. With an additional open problem by Robert M. Corless and David J. Jeffrey
- Title not available (Why is that?)
- Fast computation of continued fraction expansions.
- Fast computation of GCDs
- Asymptotically fast polynomial matrix algorithms for multivariable systems
- On computing reciprocals of power series
- An algorithm for division of powerseries
- Title not available (Why is that?)
- The shifted number system for fast linear algebra on integer matrices
- Taylor expansion of the accumulated rounding error
- Title not available (Why is that?)
- Fast algorithms for the characteristic polynomial
- Efficient matrix preconditioners for black box linear algebra
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the complexity of inverting integer and polynomial matrices
Cited In (3)
This page was built for publication: Kaltofen's division-free determinant algorithm differentiated for matrix adjoint computation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q540327)
