AN OPTIMUM PARTITION FOR INVERTING A NONSINGULAR MATRIX
| dc.citation.epage | 84 | en_US |
| dc.citation.issue | 5 | en_US |
| dc.citation.spage | 79 | en_US |
| dc.citation.volume | 6 | en_US |
| dc.citation.woscount | 0 | |
| dc.contributor.author | LUO, JC | en_US |
| dc.contributor.department | 交大名義發表 | zh_TW |
| dc.contributor.department | 土木工程學系 | zh_TW |
| dc.contributor.department | National Chiao Tung University | en_US |
| dc.contributor.department | Department of Civil Engineering | en_US |
| dc.date.accessioned | 2014-12-08T15:04:23Z | |
| dc.date.available | 2014-12-08T15:04:23Z | |
| dc.date.issued | 1993-09-01 | en_US |
| dc.description.abstract | A new strategy for inverting a nonsingular matrix is evaluated in this paper. The essential concept of this strategy is to partition a nonsingular matrix into blocks, then to apply the author's decomposition to the block-based procedure. Since different partitions require different costs, finding an economical partition is necessary. This paper studies the optimum partition so that the complexity for the inverse of a nonsingular matrix may be significantly reduced. | en_US |
| dc.identifier.issn | 0893-9659 | en_US |
| dc.identifier.journal | APPLIED MATHEMATICS LETTERS | en_US |
| dc.identifier.uri | https://ir.lib.nycu.edu.tw/handle/11536/2883 | |
| dc.identifier.wosnumber | WOS:A1993LV30200018 | |
| dc.language.iso | en_US | en_US |
| dc.title | AN OPTIMUM PARTITION FOR INVERTING A NONSINGULAR MATRIX | en_US |
| dc.type | Article | en_US |