Fraction-free matrix factors: new forms for LU and QR factors
Gaussian elimination and LU factoring have been greatly studied from the algorithmic point of view, but much less from the point view of the best output format. In this paper, we give new output formats for fraction free LU factoring and for QR factoring. The formats and the algorithms used to obtai...
Gespeichert in:
| Veröffentlicht in: | Frontiers of Computer Science 2008-03, Vol.2 (1), p.67-80 |
|---|---|
| Hauptverfasser: | , |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 80 |
|---|---|
| container_issue | 1 |
| container_start_page | 67 |
| container_title | Frontiers of Computer Science |
| container_volume | 2 |
| creator | Zhou, Wenqin Jeffrey, David J. |
| description | Gaussian elimination and LU factoring have been greatly studied from the algorithmic point of view, but much less from the point view of the best output format. In this paper, we give new output formats for fraction free LU factoring and for QR factoring. The formats and the algorithms used to obtain them are valid for any matrix system in which the entries are taken from an integral domain, not just for integer matrix systems. After discussing the new output format of LU factoring, the complexity analysis for the fraction free algorithm and fraction free output is given. Our new output format contains smaller entries than previously suggested forms, and it avoids the gcd computations required by some other partially fraction free computations. As applications of our fraction free algorithm and format, we demonstrate how to construct a fraction free QR factorization and how to solve linear systems within a given domain. |
| doi_str_mv | 10.1007/s11704-008-0005-z |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_2918719114</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2918719114</sourcerecordid><originalsourceid>FETCH-LOGICAL-c231z-3be749210165e96341d0769488d99dfb7b2b795d0c9e5c54ec6bc288bc5efca53</originalsourceid><addsrcrecordid>eNp1kEtLAzEUhYMoWKs_wF3AdfTeTB4TwYUUq0JBFLsOM5lEWuxMTaao_fWmjMWVi_vg8p1z4RByjnCJAPoqIWoQDKDMBZJtD8gIlS6YFkod7vdCwjE5SWkJoDhXMCI301i5ftG1LETv6arq4-KLhnzrYrqmrf-koYurtOt0NqdV29Dnlz1wSo5C9Z782e8ck_n07nXywGZP94-T2xlzvMAtK2qvheEIqKQ3qhDYgFZGlGVjTBNqXfNaG9mAM146KbxTteNlWTvpg6tkMSYXg-86dh8bn3q77DaxzS8tN1hqNIgiUzhQLnYpRR_sOi5WVfy2CHaXkh1Ssjklu0vJbrOGD5qU2fbNxz_n_0U_io5pGg</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2918719114</pqid></control><display><type>article</type><title>Fraction-free matrix factors: new forms for LU and QR factors</title><source>ProQuest Central UK/Ireland</source><source>SpringerLink Journals - AutoHoldings</source><source>ProQuest Central</source><creator>Zhou, Wenqin ; Jeffrey, David J.</creator><creatorcontrib>Zhou, Wenqin ; Jeffrey, David J.</creatorcontrib><description>Gaussian elimination and LU factoring have been greatly studied from the algorithmic point of view, but much less from the point view of the best output format. In this paper, we give new output formats for fraction free LU factoring and for QR factoring. The formats and the algorithms used to obtain them are valid for any matrix system in which the entries are taken from an integral domain, not just for integer matrix systems. After discussing the new output format of LU factoring, the complexity analysis for the fraction free algorithm and fraction free output is given. Our new output format contains smaller entries than previously suggested forms, and it avoids the gcd computations required by some other partially fraction free computations. As applications of our fraction free algorithm and format, we demonstrate how to construct a fraction free QR factorization and how to solve linear systems within a given domain.</description><identifier>ISSN: 1673-7350</identifier><identifier>ISSN: 2095-2228</identifier><identifier>EISSN: 1673-7466</identifier><identifier>EISSN: 2095-2236</identifier><identifier>DOI: 10.1007/s11704-008-0005-z</identifier><language>eng</language><publisher>Heidelberg: SP Higher Education Press</publisher><subject>Algorithms ; Computer Science ; Format ; Gaussian elimination ; Linear systems ; Research Article</subject><ispartof>Frontiers of Computer Science, 2008-03, Vol.2 (1), p.67-80</ispartof><rights>Higher Education Press 2008</rights><rights>Higher Education Press 2008.</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c231z-3be749210165e96341d0769488d99dfb7b2b795d0c9e5c54ec6bc288bc5efca53</citedby><cites>FETCH-LOGICAL-c231z-3be749210165e96341d0769488d99dfb7b2b795d0c9e5c54ec6bc288bc5efca53</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://www.proquest.com/docview/2918719114?pq-origsite=primo$$EHTML$$P50$$Gproquest$$H</linktohtml><link.rule.ids>314,780,784,21387,27923,27924,33743,43804,64384,64388,72340</link.rule.ids></links><search><creatorcontrib>Zhou, Wenqin</creatorcontrib><creatorcontrib>Jeffrey, David J.</creatorcontrib><title>Fraction-free matrix factors: new forms for LU and QR factors</title><title>Frontiers of Computer Science</title><addtitle>Front. Comput. Sci. China</addtitle><description>Gaussian elimination and LU factoring have been greatly studied from the algorithmic point of view, but much less from the point view of the best output format. In this paper, we give new output formats for fraction free LU factoring and for QR factoring. The formats and the algorithms used to obtain them are valid for any matrix system in which the entries are taken from an integral domain, not just for integer matrix systems. After discussing the new output format of LU factoring, the complexity analysis for the fraction free algorithm and fraction free output is given. Our new output format contains smaller entries than previously suggested forms, and it avoids the gcd computations required by some other partially fraction free computations. As applications of our fraction free algorithm and format, we demonstrate how to construct a fraction free QR factorization and how to solve linear systems within a given domain.</description><subject>Algorithms</subject><subject>Computer Science</subject><subject>Format</subject><subject>Gaussian elimination</subject><subject>Linear systems</subject><subject>Research Article</subject><issn>1673-7350</issn><issn>2095-2228</issn><issn>1673-7466</issn><issn>2095-2236</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2008</creationdate><recordtype>article</recordtype><sourceid>AFKRA</sourceid><sourceid>AZQEC</sourceid><sourceid>BENPR</sourceid><sourceid>CCPQU</sourceid><sourceid>DWQXO</sourceid><sourceid>GNUQQ</sourceid><recordid>eNp1kEtLAzEUhYMoWKs_wF3AdfTeTB4TwYUUq0JBFLsOM5lEWuxMTaao_fWmjMWVi_vg8p1z4RByjnCJAPoqIWoQDKDMBZJtD8gIlS6YFkod7vdCwjE5SWkJoDhXMCI301i5ftG1LETv6arq4-KLhnzrYrqmrf-koYurtOt0NqdV29Dnlz1wSo5C9Z782e8ck_n07nXywGZP94-T2xlzvMAtK2qvheEIqKQ3qhDYgFZGlGVjTBNqXfNaG9mAM146KbxTteNlWTvpg6tkMSYXg-86dh8bn3q77DaxzS8tN1hqNIgiUzhQLnYpRR_sOi5WVfy2CHaXkh1Ssjklu0vJbrOGD5qU2fbNxz_n_0U_io5pGg</recordid><startdate>200803</startdate><enddate>200803</enddate><creator>Zhou, Wenqin</creator><creator>Jeffrey, David J.</creator><general>SP Higher Education Press</general><general>Springer Nature B.V</general><scope>AAYXX</scope><scope>CITATION</scope><scope>8FE</scope><scope>8FG</scope><scope>AFKRA</scope><scope>ARAPS</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>GNUQQ</scope><scope>HCIFZ</scope><scope>JQ2</scope><scope>K7-</scope><scope>P5Z</scope><scope>P62</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope></search><sort><creationdate>200803</creationdate><title>Fraction-free matrix factors: new forms for LU and QR factors</title><author>Zhou, Wenqin ; Jeffrey, David J.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c231z-3be749210165e96341d0769488d99dfb7b2b795d0c9e5c54ec6bc288bc5efca53</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2008</creationdate><topic>Algorithms</topic><topic>Computer Science</topic><topic>Format</topic><topic>Gaussian elimination</topic><topic>Linear systems</topic><topic>Research Article</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Zhou, Wenqin</creatorcontrib><creatorcontrib>Jeffrey, David J.</creatorcontrib><collection>CrossRef</collection><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>ProQuest Central UK/Ireland</collection><collection>Advanced Technologies & Aerospace Collection</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>Technology Collection (ProQuest)</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central Korea</collection><collection>ProQuest Central Student</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Computer Science Collection</collection><collection>Computer Science Database</collection><collection>Advanced Technologies & Aerospace Database</collection><collection>ProQuest Advanced Technologies & Aerospace Collection</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><jtitle>Frontiers of Computer Science</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Zhou, Wenqin</au><au>Jeffrey, David J.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Fraction-free matrix factors: new forms for LU and QR factors</atitle><jtitle>Frontiers of Computer Science</jtitle><stitle>Front. Comput. Sci. China</stitle><date>2008-03</date><risdate>2008</risdate><volume>2</volume><issue>1</issue><spage>67</spage><epage>80</epage><pages>67-80</pages><issn>1673-7350</issn><issn>2095-2228</issn><eissn>1673-7466</eissn><eissn>2095-2236</eissn><abstract>Gaussian elimination and LU factoring have been greatly studied from the algorithmic point of view, but much less from the point view of the best output format. In this paper, we give new output formats for fraction free LU factoring and for QR factoring. The formats and the algorithms used to obtain them are valid for any matrix system in which the entries are taken from an integral domain, not just for integer matrix systems. After discussing the new output format of LU factoring, the complexity analysis for the fraction free algorithm and fraction free output is given. Our new output format contains smaller entries than previously suggested forms, and it avoids the gcd computations required by some other partially fraction free computations. As applications of our fraction free algorithm and format, we demonstrate how to construct a fraction free QR factorization and how to solve linear systems within a given domain.</abstract><cop>Heidelberg</cop><pub>SP Higher Education Press</pub><doi>10.1007/s11704-008-0005-z</doi><tpages>14</tpages></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 1673-7350 |
| ispartof | Frontiers of Computer Science, 2008-03, Vol.2 (1), p.67-80 |
| issn | 1673-7350 2095-2228 1673-7466 2095-2236 |
| language | eng |
| recordid | cdi_proquest_journals_2918719114 |
| source | ProQuest Central UK/Ireland; SpringerLink Journals - AutoHoldings; ProQuest Central |
| subjects | Algorithms Computer Science Format Gaussian elimination Linear systems Research Article |
| title | Fraction-free matrix factors: new forms for LU and QR factors |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-09T05%3A48%3A18IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Fraction-free%20matrix%20factors:%20new%20forms%20for%20LU%20and%20QR%20factors&rft.jtitle=Frontiers%20of%20Computer%20Science&rft.au=Zhou,%20Wenqin&rft.date=2008-03&rft.volume=2&rft.issue=1&rft.spage=67&rft.epage=80&rft.pages=67-80&rft.issn=1673-7350&rft.eissn=1673-7466&rft_id=info:doi/10.1007/s11704-008-0005-z&rft_dat=%3Cproquest_cross%3E2918719114%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2918719114&rft_id=info:pmid/&rfr_iscdi=true |