Finding the inverse and connections of a type of large sparse matrix

✍ Scribed by Martin Hershkowitz; Stedman B. Noble

• Publisher: John Wiley and Sons
• Year: 1965
• Tongue: English
• Weight: 621 KB
• Volume: 12
• Category: Article
• ISSN: 0894-069X
• DOI: 10.1002/nav.3800120107

✦ Synopsis

series is d e c o m p o s e d i n t o t e r m s which a r e p r o d u c t s of connected coefficients: the p r o c e d u r e lends itself to an efficient method of truncation that obtains a n a p p r o x im a t i o n t o the i n v e r s e m a t r i x . While t h i s a l g o r i t h m might not be e f f ic i e n t f o r s o m e m a t r i c e s , i t is quite efficient for the 4 3 0 -o r d e r Minkowski-Leontief m a t r i x upon which i t was t e s t e d . F u r t h e r m o r e , the computation e n u m e r a t e s the connections i n the m a t r i x ; hence the m o d e l c a n be "tested" by c o m p a r i n g the connections of the m o d e l with t h o s e known to e x i s t i n the underlying phenomena.