Kaltofen's division-free determinant algorithm differentiated for matrix adjoint computation

DOI10.1016/J.JSC.2010.08.012MaRDI QIDQ540327zbMATHOpenAlexFDO

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

zbMATH Keywords

exact algorithmcharacteristic polynomialautomatic differentiationmatrix inversedivision-free complexitymatrix adjointmatrix determinantWiedemann algorithm

Mathematics Subject Classification ID

Software, source code, etc. for problems pertaining to linear algebra (15-04)

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

Cites work

• scientific article; zbMATH DE number 3890725 (Why is no real title available?)
• scientific article; zbMATH DE number 177858 (Why is no real title available?)
• scientific article; zbMATH DE number 3461412 (Why is no real title available?)
• scientific article; zbMATH DE number 3628385 (Why is no real title available?)
• scientific article; zbMATH DE number 1254019 (Why is no real title available?)
• scientific article; zbMATH DE number 1263378 (Why is no real title available?)
• scientific article; zbMATH DE number 976329 (Why is no real title available?)
• scientific article; zbMATH DE number 2151179 (Why is no real title available?)
• scientific article; zbMATH DE number 3440002 (Why is no real title available?)
• scientific article; zbMATH DE number 3362881 (Why is no real title available?)
• An algorithm for division of powerseries
• Asymptotically fast polynomial matrix algorithms for multivariable systems
• Challenges of symbolic computation: My favorite open problems. With an additional open problem by Robert M. Corless and David J. Jeffrey
• Efficient matrix preconditioners for black box linear algebra
• Fast algorithms for the characteristic polynomial
• Fast computation of GCDs
• Fast computation of continued fraction expansions.
• Fast solution of toeplitz systems of equations and computation of Padé approximants
• High-order lifting and integrality certification
• Matrix multiplication via arithmetic progressions
• Modern computer algebra
• On computing reciprocals of power series
• On fast multiplication of polynomials over arbitrary algebras
• On the complexity of computing determinants
• On the complexity of inverting integer and polynomial matrices
• Solving sparse linear equations over finite fields
• Taylor expansion of the accumulated rounding error
• The Inverses of Block Hankel and Block Toeplitz Matrices
• The complexity of partial derivatives
• The shifted number system for fast linear algebra on integer matrices

Cited in

(3)

• scientific article; zbMATH DE number 713870 (Why is no real title available?)
• Computation of the Adjoint Matrix
• Computation of determinants, adjoint matrices, and characteristic polynomials without division

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)