Non-negative integer basis algorithms for linear equations with integer coefficients

DOI10.1007/BF00245019MaRDI QIDQ908692zbMATH OpenFDO

Authors Dallas Lankford

Publication date 1989

Published in Journal of Automated Reasoning (Search for Journal in Brave)

zbMATH Keywords

unificationcomputation of matrices

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Radix representation; digital problems (11A63)

Recommendations

• An elementary proof of the theorem that the most general matrix commutative with a given \(n\)-rowed square matrix involves at least \(n\) arbitrary parameters.
• scientific article; zbMATH DE number 3930334
• Actual solution of simultaneous linear numerical equations.
• Banded Eigenvalue Solvers on Vector Machines
• scientific article; zbMATH DE number 3872553
• scientific article; zbMATH DE number 3919641
• Asymptotically fast polynomial matrix algorithms for multivariable systems
• Untersuchung über Unabhängigkeitsbeweise nach der Matrizenmethode.
• scientific article; zbMATH DE number 741169
• scientific article; zbMATH DE number 49550

Cited in

(5)

• An algebraic approach to unification under associativity and commutativity
• Proving geometry theorems with rewrite rules
• On Model Checking Boolean BI
• AC-termination of rewrite systems: a modified Knuth-Bendix ordering
• AC-unification race: The system solving approach, implementation and benchmarks

This page was built for publication: Non-negative integer basis algorithms for linear equations with integer coefficients

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q908692)