An algorithm for solving linear algebraic equations using residue arithmetic I

DOI10.1007/BF01946813MaRDI QIDQ5585753zbMATH OpenFDO

Authors Jo Ann Howell, R. T. Gregory

Publication date 1969

Published in BIT (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF01946813

zbMATH Keywords

numerical analysis

Cites work

• Solving equations exactly

Cited in

(12)

• Error-free computation with rational numbers
• Error-free computation of a reflexive generalized inverse
• Computational methods of linear algebra
• On symmetric radix representation of Gaussian integers
• A layered algorithm for quantifier elimination from linear modular constraints
• An error-free generalized matrix inversion and linear least squares method based on bordering
• Error-free computation of the moore-penrose inverse with application to linear least squares analysis
• A Class of Hessenberg Matrices with Known Pseudoinverse and Drazin Inverse
• EXACT SOLUTION OF LINEAR EQUATIONS ON DISTRIBUTED-MEMORY MULTIPROCESSORS
• An algorithm for solving linear algebraic equations using residue arithmetic II
• Solving linear equations using residue arithmetic — Algorithm II
• An interval algorithm for solving systems of linear equations to prespecified accuracy

This page was built for publication: An algorithm for solving linear algebraic equations using residue arithmetic I

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