Finite field computation technique for exact solution of systems of linear equations and interval linear programming problems

DOI10.1080/00207727708942113zbMath0423.65017OpenAlexW2026257175MaRDI QIDQ3857651

E. V. Krishnamurthy, E. O. Adegbeyeni

Publication date: 1977

Published in: International Journal of Systems Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207727708942113

zbMATH Keywords

inequalitiesnumerical examplesinteger solutionsgeneralized inversessystems of linear equationsinterval linear programmingerror free computational methodfinite field or modular arithmetic

Mathematics Subject Classification ID

Numerical solutions to overdetermined systems, pseudoinverses (65F20) Numerical mathematical programming methods (65K05) Linear programming (90C05) Direct numerical methods for linear systems and matrix inversion (65F05)

Related Items (3)

Error-free computer solution of certain system of linear equations ⋮ An integer arithmetic method to compute generalized matrix inverse and solve linear equations exactly ⋮ A comparative study of algorithms for computing the Smith normal form of an integer matrix†

Cites Work

• Unnamed Item
• Unnamed Item
• On explicit solutions of interval programs
• Residue Arithmetic Algorithms for Exact Computation ofg-Inverses of Matrices
• Number Systems and Arithmetic
• An Explicit Solution of a Special Class of Linear Programming Problems
• A Generalized Inverse Which Gives all the Integral Solutions to a System of Linear Equations
• The Generalized Inverse in Linear Programming—An Intersection Projection Method and the Solution of a Class of Structured Linear Programming Problems

This page was built for publication: Finite field computation technique for exact solution of systems of linear equations and interval linear programming problems