Triangular factorization and inversion by fast matrix multiplication:
The fast matrix multiplication algorithm by Strassen is used to obtain the triangular factorization of a permutation of any non-singular matrix of order n in (C sub 1)(n sup(log of 7 to the base 2)) operations, and hence the inverse of any non-singular matrix in (C sub 2)(n sup (log of 7 to the base...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Book |
| Language: | English |
| Published: |
Ithaca, New York
1972
|
| Series: | Cornell University <Ithaca, NY> / Department of Computer Science: Technical report
152 |
| Subjects: | |
| Summary: | The fast matrix multiplication algorithm by Strassen is used to obtain the triangular factorization of a permutation of any non-singular matrix of order n in (C sub 1)(n sup(log of 7 to the base 2)) operations, and hence the inverse of any non-singular matrix in (C sub 2)(n sup (log of 7 to the base 2)) operations. (Author). |
| Physical Description: | 10 Bl. |
Staff View
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV009875060 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 941103s1972 |||| 00||| engod | ||
| 035 | |a (OCoLC)227693882 | ||
| 035 | |a (DE-599)BVBBV009875060 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-91G | ||
| 100 | 1 | |a Bunch, James R. |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Triangular factorization and inversion by fast matrix multiplication |c James R. Bunch and John E. Hopcroft |
| 264 | 1 | |a Ithaca, New York |c 1972 | |
| 300 | |a 10 Bl. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Cornell University <Ithaca, NY> / Department of Computer Science: Technical report |v 152 | |
| 520 | 3 | |a The fast matrix multiplication algorithm by Strassen is used to obtain the triangular factorization of a permutation of any non-singular matrix of order n in (C sub 1)(n sup(log of 7 to the base 2)) operations, and hence the inverse of any non-singular matrix in (C sub 2)(n sup (log of 7 to the base 2)) operations. (Author). | |
| 650 | 4 | |a ARITHMETIC | |
| 650 | 4 | |a COMPUTATION | |
| 650 | 4 | |a FACTORIZATION | |
| 650 | 4 | |a MATRIX MULTIPLICATION | |
| 650 | 7 | |a (Matrices(mathematics) |2 dtict | |
| 650 | 7 | |a Algorithms) |2 dtict | |
| 650 | 7 | |a Numerical analysis |2 dtict | |
| 650 | 7 | |a Permutations |2 dtict | |
| 650 | 7 | |a Theoretical Mathematics |2 scgdst | |
| 700 | 1 | |a Hopcroft, John E. |d 1939- |e Verfasser |0 (DE-588)112071481 |4 aut | |
| 810 | 2 | |a Department of Computer Science: Technical report |t Cornell University <Ithaca, NY> |v 152 |w (DE-604)BV006185504 |9 152 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-006540886 | ||
Record in the Search Index
| _version_ | 1804124235496423424 |
|---|---|
| any_adam_object | |
| author | Bunch, James R. Hopcroft, John E. 1939- |
| author_GND | (DE-588)112071481 |
| author_facet | Bunch, James R. Hopcroft, John E. 1939- |
| author_role | aut aut |
| author_sort | Bunch, James R. |
| author_variant | j r b jr jrb j e h je jeh |
| building | Verbundindex |
| bvnumber | BV009875060 |
| ctrlnum | (OCoLC)227693882 (DE-599)BVBBV009875060 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01674nam a2200397 cb4500</leader><controlfield tag="001">BV009875060</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">941103s1972 |||| 00||| engod</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)227693882</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV009875060</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakddb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-91G</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Bunch, James R.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Triangular factorization and inversion by fast matrix multiplication</subfield><subfield code="c">James R. Bunch and John E. Hopcroft</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Ithaca, New York</subfield><subfield code="c">1972</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">10 Bl.</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">Cornell University <Ithaca, NY> / Department of Computer Science: Technical report</subfield><subfield code="v">152</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">The fast matrix multiplication algorithm by Strassen is used to obtain the triangular factorization of a permutation of any non-singular matrix of order n in (C sub 1)(n sup(log of 7 to the base 2)) operations, and hence the inverse of any non-singular matrix in (C sub 2)(n sup (log of 7 to the base 2)) operations. (Author).</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">ARITHMETIC</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">COMPUTATION</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">FACTORIZATION</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">MATRIX MULTIPLICATION</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">(Matrices(mathematics)</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Algorithms)</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Numerical analysis</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Permutations</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Theoretical Mathematics</subfield><subfield code="2">scgdst</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Hopcroft, John E.</subfield><subfield code="d">1939-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)112071481</subfield><subfield code="4">aut</subfield></datafield><datafield tag="810" ind1="2" ind2=" "><subfield code="a">Department of Computer Science: Technical report</subfield><subfield code="t">Cornell University <Ithaca, NY></subfield><subfield code="v">152</subfield><subfield code="w">(DE-604)BV006185504</subfield><subfield code="9">152</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-006540886</subfield></datafield></record></collection> |
| id | DE-604.BV009875060 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:42:26Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-006540886 |
| oclc_num | 227693882 |
| open_access_boolean | |
| owner | DE-91G DE-BY-TUM |
| owner_facet | DE-91G DE-BY-TUM |
| physical | 10 Bl. |
| publishDate | 1972 |
| publishDateSearch | 1972 |
| publishDateSort | 1972 |
| record_format | marc |
| series2 | Cornell University <Ithaca, NY> / Department of Computer Science: Technical report |
| spelling | Bunch, James R. Verfasser aut Triangular factorization and inversion by fast matrix multiplication James R. Bunch and John E. Hopcroft Ithaca, New York 1972 10 Bl. txt rdacontent n rdamedia nc rdacarrier Cornell University <Ithaca, NY> / Department of Computer Science: Technical report 152 The fast matrix multiplication algorithm by Strassen is used to obtain the triangular factorization of a permutation of any non-singular matrix of order n in (C sub 1)(n sup(log of 7 to the base 2)) operations, and hence the inverse of any non-singular matrix in (C sub 2)(n sup (log of 7 to the base 2)) operations. (Author). ARITHMETIC COMPUTATION FACTORIZATION MATRIX MULTIPLICATION (Matrices(mathematics) dtict Algorithms) dtict Numerical analysis dtict Permutations dtict Theoretical Mathematics scgdst Hopcroft, John E. 1939- Verfasser (DE-588)112071481 aut Department of Computer Science: Technical report Cornell University <Ithaca, NY> 152 (DE-604)BV006185504 152 |
| spellingShingle | Bunch, James R. Hopcroft, John E. 1939- Triangular factorization and inversion by fast matrix multiplication ARITHMETIC COMPUTATION FACTORIZATION MATRIX MULTIPLICATION (Matrices(mathematics) dtict Algorithms) dtict Numerical analysis dtict Permutations dtict Theoretical Mathematics scgdst |
| title | Triangular factorization and inversion by fast matrix multiplication |
| title_auth | Triangular factorization and inversion by fast matrix multiplication |
| title_exact_search | Triangular factorization and inversion by fast matrix multiplication |
| title_full | Triangular factorization and inversion by fast matrix multiplication James R. Bunch and John E. Hopcroft |
| title_fullStr | Triangular factorization and inversion by fast matrix multiplication James R. Bunch and John E. Hopcroft |
| title_full_unstemmed | Triangular factorization and inversion by fast matrix multiplication James R. Bunch and John E. Hopcroft |
| title_short | Triangular factorization and inversion by fast matrix multiplication |
| title_sort | triangular factorization and inversion by fast matrix multiplication |
| topic | ARITHMETIC COMPUTATION FACTORIZATION MATRIX MULTIPLICATION (Matrices(mathematics) dtict Algorithms) dtict Numerical analysis dtict Permutations dtict Theoretical Mathematics scgdst |
| topic_facet | ARITHMETIC COMPUTATION FACTORIZATION MATRIX MULTIPLICATION (Matrices(mathematics) Algorithms) Numerical analysis Permutations Theoretical Mathematics |
| volume_link | (DE-604)BV006185504 |
| work_keys_str_mv | AT bunchjamesr triangularfactorizationandinversionbyfastmatrixmultiplication AT hopcroftjohne triangularfactorizationandinversionbyfastmatrixmultiplication |