|
|||||
|
|
Checking robust nonsingularity of tridiagonal matrices in linear time |
|
| Authors: | Ilan Bar-On Bruno Codenotti Mauro Leoncini |
| Affiliation: | (1) Department of Computer Science, Technion, 32000 Haifa, Israel;(2) Istituto di Matematica Computazionale del CNR, Via S. Maria 46, I-56126 Pisa, Italy;(3) Dipartimento di Informatica, Università di Pisa, Corso Italia 40, I-56125 Pisa, Italy |
| Abstract: | In this paper we present a linear time algorithm for checking whether a tridiagonal matrix will become singular under certain perturbations of its coefficients. The problem is known to be NP-hard for general matrices. Our algorithm can be used to get perturbation bounds on the solutions to tridiagonal systems.Research produced with the help of the Cooperation Agreement CNR-MOSA. |
| Keywords: | Robust nonsingularity tridiagonal systems well defined systems |
| 本文献已被 SpringerLink 等数据库收录！ | |