Solving equations exactly

DOI10.6028/JRES.071B.023MaRDI QIDQ5574334zbMATH OpenFDO

Authors Morris Newman

Publication date 1967

Published in Journal of Research of the National Bureau of Standards Section B Mathematics and Mathematical Physics (Search for Journal in Brave)

zbMATH Keywords

numerical analysis

Cited in

(18)

• An error-free Levison algorithm to solve integer Toeplitz system
• An error-free algorithm to solve a linear system of polynomial equations
• One-modulus residue arithmetic algorithm to solve linear equations exactly
• A method for exact computation with rational numbers
• An algorithm to solve Hilbert systems of linear equations precisely
• An iterative error-free algorithm to solve Vandermonde systems
• EXACT SOLUTION OF LINEAR EQUATIONS ON DISTRIBUTED-MEMORY MULTIPROCESSORS
• A test of the numerical accuracy of some matrix inversion algorithms commonly used in least squares programs
• Algorithms for Hermite and Smith Normal Matrices and Linear Diophantine Equations
• An algorithm for solving linear algebraic equations using residue arithmetic I
• Error-free computation of a reflexive generalized inverse
• Error-free computer solution of certain system of linear equations
• A parallel algorithm for exact solution of linear equations via congruence technique
• An algorithm for solving linear algebraic equations using residue arithmetic II
• An improved algorithm for mixed-radix conversion of residue numbers
• Error-free computation with rational numbers
• Error-free algorithms to solve special and general discrete systems of linear equations
• Test procedures and test problems for least squares algorithms

This page was built for publication: Solving equations exactly

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