Linear complexity algorithm for semiseparable matrices |
| |
| Authors: | Israel Koltracht |
| |
| Institution: | (1) Department of Mathematics, University of Connecticut, 06269 Storrs, Connecticut, USA |
| |
| Abstract: | A new linear complexity algorithm for general nonsingular semiseparable matrices is presented. For symmetric matrices whose semiseparability rank equals to 1 this algorithm leads to an explicit formula for the inverse matrix.Supported in part by the NSF Grant DMS 9306357 |
| |
| Keywords: | 15A06 15A09 15A57 |
| 本文献已被 SpringerLink 等数据库收录！ |
|
