Exact Solution of Systems of Linear Equations with Iterative Methods

DOI10.1137/0604014zbMath0502.65019OpenAlexW1989961517MaRDI QIDQ3968378

Silvio Ursic, C. Patarra

Publication date: 1983

Published in: SIAM Journal on Algebraic Discrete Methods (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0604014

zbMATH Keywords

continued fractionsalgebraic algorithmsrational rounding

Mathematics Subject Classification ID

Iterative numerical methods for linear systems (65F10)

Related Items

Computing the determinant and the characteristic polynomial of a matrix via solving linear systems of equations, Iterative Refinement for Linear Programming

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the Computational Complexity of Combinatorial Problems
• A Polynomial-Time Algorithm for the Knapsack Problem with Two Variables
• A Comparison of Algorithms for the Exact Solution of Linear Equations
• Computer Algebra of Polynomials and Rational Functions
• The Minimum Root Separation of a Polynomial
• The Exact Solution of Systems of Linear Equations with Polynomial Coefficients