Full metadata record
DC FieldValueLanguage
dc.contributor.authorLUO, JCen_US
dc.date.accessioned2014-12-08T15:04:23Z-
dc.date.available2014-12-08T15:04:23Z-
dc.date.issued1993-09-01en_US
dc.identifier.issn0893-9659en_US
dc.identifier.urihttp://hdl.handle.net/11536/2883-
dc.description.abstractA 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.language.isoen_USen_US
dc.titleAN OPTIMUM PARTITION FOR INVERTING A NONSINGULAR MATRIXen_US
dc.typeArticleen_US
dc.identifier.journalAPPLIED MATHEMATICS LETTERSen_US
dc.citation.volume6en_US
dc.citation.issue5en_US
dc.citation.spage79en_US
dc.citation.epage84en_US
dc.contributor.department交大名義發表zh_TW
dc.contributor.department土木工程學系zh_TW
dc.contributor.departmentNational Chiao Tung Universityen_US
dc.contributor.departmentDepartment of Civil Engineeringen_US
dc.identifier.wosnumberWOS:A1993LV30200018-
dc.citation.woscount0-
Appears in Collections:Articles


Files in This Item:

  1. A1993LV30200018.pdf