Kaltofen's division-free determinant algorithm differentiated for matrix adjoint computation
From MaRDI portal
Publication:540327
DOI10.1016/j.jsc.2010.08.012zbMath1220.15004OpenAlexW2107481308MaRDI QIDQ540327
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
characteristic polynomialautomatic differentiationexact algorithmmatrix inversedivision-free complexitymatrix adjointmatrix determinantWiedemann algorithm
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the complexity of inverting integer and polynomial matrices
- Matrix multiplication via arithmetic progressions
- Fast algorithms for the characteristic polynomial
- The complexity of partial derivatives
- On fast multiplication of polynomials over arbitrary algebras
- Efficient matrix preconditioners for black box linear algebra
- Challenges of symbolic computation: My favorite open problems. With an additional open problem by Robert M. Corless and David J. Jeffrey
- On the complexity of computing determinants
- High-order lifting and integrality certification
- On computing reciprocals of power series
- The shifted number system for fast linear algebra on integer matrices
- Fast computation of continued fraction expansions.
- An algorithm for division of powerseries
- The Inverses of Block Hankel and Block Toeplitz Matrices
- Solving sparse linear equations over finite fields
- Fast solution of toeplitz systems of equations and computation of Padé approximants
- Fast computation of GCDs
- Taylor expansion of the accumulated rounding error
- Asymptotically fast polynomial matrix algorithms for multivariable systems
This page was built for publication: Kaltofen's division-free determinant algorithm differentiated for matrix adjoint computation
