The trace invariant and matrix inversion

DOI10.1016/0304-3975(88)90145-4zbMath0648.68058OpenAlexW2083520164MaRDI QIDQ1105373

S. H. Smith

Publication date: 1988

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(88)90145-4

zbMATH Keywords

tracematrix inversionParallel computationsindeterminates over infinite fieldnonscalar complexity measure

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Direct numerical methods for linear systems and matrix inversion (65F05)

Related Items (1)

Some computational problems in linear algebra as hard as matrix multiplication

Cites Work

• The complexity of partial derivatives
• Gaussian elimination is not optimal
• A noncommutative algorithm for multiplying 3×3 matrices using 23 multiplications
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The trace invariant and matrix inversion