An algorithm to solve Hilbert systems of linear equations precisely

DOI10.1016/0096-3003(95)00061-5zbMATH Open0842.65016OpenAlexW2008493418MaRDI QIDQ1908247FDOQ1908247

Miroslav Morháč

Publication date: 5 August 1996

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0096-3003(95)00061-5

zbMATH Keywords

parallel computationLevinson algorithmmodular arithmeticill-conditioningHilbert matrixToeplitz system

Mathematics Subject Classification ID

Direct numerical methods for linear systems and matrix inversion (65F05) Parallel numerical computation (65Y05)

Cites Work

• Solving equations exactly
• An error-free Levison algorithm to solve integer Toeplitz system
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (8)

• Title not available (Why is that?)
• Hermite's method of separation of solutions of systems of algebraic equations and its applications
• Exact algorithm of multidimensional circulant deconvolution
• An iterative error-free algorithm to solve Vandermonde systems
• On the vector \(\varepsilon\)-algorithm for solving linear systems of equations
• Title not available (Why is that?)
• Title not available (Why is that?)
• Error-free algorithms to solve special and general discrete systems of linear equations

Recommendations

• An algorithm to solve integer linear systems exactly using numerical methods 👍 👎
• An interval algorithm for solving systems of linear equations to prespecified accuracy 👍 👎
• An error-free algorithm to solve a linear system of polynomial equations 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎

This page was built for publication: An algorithm to solve Hilbert systems of linear equations precisely

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