Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

An algorithm to solve Hilbert systems of linear equations precisely

From MaRDI portal
Publication:1908247
Jump to:navigation, search

DOI10.1016/0096-3003(95)00061-5zbMath0842.65016OpenAlexW2008493418MaRDI QIDQ1908247

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 algorithmill-conditioningHilbert matrixmodular arithmeticToeplitz system


Mathematics Subject Classification ID

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


Related Items (3)

Error-free algorithms to solve special and general discrete systems of linear equations ⋮ An iterative error-free algorithm to solve Vandermonde systems ⋮ Exact algorithm of multidimensional circulant deconvolution



Cites Work

  • An error-free Levison algorithm to solve integer Toeplitz system
  • Solving equations exactly
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item




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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1908247&oldid=14325036"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 1 February 2024, at 14:15.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki