Some Algorithms Providing Rigorous Bounds for the Eigenvalues of a Matrix
| dc.creator | Pavec,Raymond | |
| dc.date | 1995 | |
| dc.date.accessioned | 2024-02-06T12:47:52Z | |
| dc.date.available | 2024-02-06T12:47:52Z | |
| dc.description | Three algorithms providing rigourous bounds for the eigenvalues of a real matrix are presented. The first is an implementation of the bisection algorithm for a symmetric tridiagonal matrix using IEEE floating-point arithmetic. The two others use interval arithmetic with directed rounding and are deduced from the Jacobi method for a symmetric matrix and the Jacobi-like method of Eberlein for an unsymmetric matrix. | |
| dc.format | text/html | |
| dc.identifier | https://doi.org/10.3217/jucs-001-07-0548 | |
| dc.identifier | https://lib.jucs.org/article/27147/ | |
| dc.identifier.uri | https://openrepository.mephi.ru/handle/123456789/6832 | |
| dc.language | en | |
| dc.publisher | Journal of Universal Computer Science | |
| dc.relation | info:eu-repo/semantics/altIdentifier/eissn/0948-6968 | |
| dc.relation | info:eu-repo/semantics/altIdentifier/pissn/0948-695X | |
| dc.rights | info:eu-repo/semantics/openAccess | |
| dc.rights | J.UCS License | |
| dc.source | JUCS - Journal of Universal Computer Science 1(7): 548-559 | |
| dc.title | Some Algorithms Providing Rigorous Bounds for the Eigenvalues of a Matrix | |
| dc.type | Research Article |