Recursive formulation of Cholesky algorithm in Fortran 90
Fortran 90 allows writing recursive procedures (see [7]). Recursion leads to automatic variable blocking for dense linear-algebra algorithms (see [5, 8]). The recursive way of programming algorithms eliminate the use of BLAS level 2 in the factorization steps. For this and other reasons recursion us...
Gespeichert in:
| Hauptverfasser: | , , |
|---|---|
| Format: | Tagungsbericht |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 578 |
|---|---|
| container_issue | |
| container_start_page | 574 |
| container_title | |
| container_volume | |
| creator | Waśniewski, Jerzy Andersen, Bjarne Stig Gustavson, Fred |
| description | Fortran 90 allows writing recursive procedures (see [7]). Recursion leads to automatic variable blocking for dense linear-algebra algorithms (see [5, 8]). The recursive way of programming algorithms eliminate the use of BLAS level 2 in the factorization steps. For this and other reasons recursion usually speed up the algorithms.
The formulation of the Cholesky factorization algorithm using recursion in Fortran 90 is presented in this paper. |
| doi_str_mv | 10.1007/BFb0095384 |
| format | Conference Proceeding |
| fullrecord | <record><control><sourceid>pascalfrancis_sprin</sourceid><recordid>TN_cdi_pascalfrancis_primary_1574024</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>1574024</sourcerecordid><originalsourceid>FETCH-LOGICAL-p1324-9481837e7dd6e7bbcef58b89272d64b0e510062b72cd79f6d6c1f0b77bbce6143</originalsourceid><addsrcrecordid>eNpFkEtPwzAQhM1LopRe-AU-cOAS2PUzPkJFAakSEoJzZCd2G5rGlV2Q-u9JKRJ7mcN82tkdQq4QbhFA3z3MHICRvBRH5IJLAcIwhfKYjFAhFpwLc3IwlBQo-CkZAQdWGC34OZnk_AnDcIZcmhExb77-Srn99jTEtP7q7LaNPY2BTpex83m1o7ZbxNRul2va9nQW0zbZnhq4JGfBdtlP_nRMPmaP79PnYv769DK9nxcb5EwURpRYcu110yivnat9kKUrDdOsUcKBl8NXijnN6kaboBpVYwCnf1E13D8m14e9G5tr24UhvW5ztUnt2qZdhVILYHvs5oDlwekXPlUuxlWuEKp9bdV_bfwHwcJZUg</addsrcrecordid><sourcetype>Index Database</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Recursive formulation of Cholesky algorithm in Fortran 90</title><source>Springer Books</source><creator>Waśniewski, Jerzy ; Andersen, Bjarne Stig ; Gustavson, Fred</creator><contributor>Waśniewski, Jerzy ; Dongarra, Jack ; Elmroth, Erik ; Kågström, Bo</contributor><creatorcontrib>Waśniewski, Jerzy ; Andersen, Bjarne Stig ; Gustavson, Fred ; Waśniewski, Jerzy ; Dongarra, Jack ; Elmroth, Erik ; Kågström, Bo</creatorcontrib><description>Fortran 90 allows writing recursive procedures (see [7]). Recursion leads to automatic variable blocking for dense linear-algebra algorithms (see [5, 8]). The recursive way of programming algorithms eliminate the use of BLAS level 2 in the factorization steps. For this and other reasons recursion usually speed up the algorithms.
The formulation of the Cholesky factorization algorithm using recursion in Fortran 90 is presented in this paper.</description><identifier>ISSN: 0302-9743</identifier><identifier>ISBN: 3540654143</identifier><identifier>ISBN: 9783540654148</identifier><identifier>EISSN: 1611-3349</identifier><identifier>EISBN: 3540492615</identifier><identifier>EISBN: 9783540492610</identifier><identifier>DOI: 10.1007/BFb0095384</identifier><language>eng</language><publisher>Berlin, Heidelberg: Springer Berlin Heidelberg</publisher><subject>Applied sciences ; Computer science; control theory; systems ; Exact sciences and technology ; Miscellaneous ; Software</subject><ispartof>Applied Parallel Computing Large Scale Scientific and Industrial Problems, 2006, p.574-578</ispartof><rights>Springer-Verlag Berlin Heidelberg 1998</rights><rights>1999 INIST-CNRS</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://link.springer.com/content/pdf/10.1007/BFb0095384$$EPDF$$P50$$Gspringer$$H</linktopdf><linktohtml>$$Uhttps://link.springer.com/10.1007/BFb0095384$$EHTML$$P50$$Gspringer$$H</linktohtml><link.rule.ids>309,310,779,780,784,789,790,793,4047,4048,27923,38253,41440,42509</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=1574024$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><contributor>Waśniewski, Jerzy</contributor><contributor>Dongarra, Jack</contributor><contributor>Elmroth, Erik</contributor><contributor>Kågström, Bo</contributor><creatorcontrib>Waśniewski, Jerzy</creatorcontrib><creatorcontrib>Andersen, Bjarne Stig</creatorcontrib><creatorcontrib>Gustavson, Fred</creatorcontrib><title>Recursive formulation of Cholesky algorithm in Fortran 90</title><title>Applied Parallel Computing Large Scale Scientific and Industrial Problems</title><description>Fortran 90 allows writing recursive procedures (see [7]). Recursion leads to automatic variable blocking for dense linear-algebra algorithms (see [5, 8]). The recursive way of programming algorithms eliminate the use of BLAS level 2 in the factorization steps. For this and other reasons recursion usually speed up the algorithms.
The formulation of the Cholesky factorization algorithm using recursion in Fortran 90 is presented in this paper.</description><subject>Applied sciences</subject><subject>Computer science; control theory; systems</subject><subject>Exact sciences and technology</subject><subject>Miscellaneous</subject><subject>Software</subject><issn>0302-9743</issn><issn>1611-3349</issn><isbn>3540654143</isbn><isbn>9783540654148</isbn><isbn>3540492615</isbn><isbn>9783540492610</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2006</creationdate><recordtype>conference_proceeding</recordtype><recordid>eNpFkEtPwzAQhM1LopRe-AU-cOAS2PUzPkJFAakSEoJzZCd2G5rGlV2Q-u9JKRJ7mcN82tkdQq4QbhFA3z3MHICRvBRH5IJLAcIwhfKYjFAhFpwLc3IwlBQo-CkZAQdWGC34OZnk_AnDcIZcmhExb77-Srn99jTEtP7q7LaNPY2BTpex83m1o7ZbxNRul2va9nQW0zbZnhq4JGfBdtlP_nRMPmaP79PnYv769DK9nxcb5EwURpRYcu110yivnat9kKUrDdOsUcKBl8NXijnN6kaboBpVYwCnf1E13D8m14e9G5tr24UhvW5ztUnt2qZdhVILYHvs5oDlwekXPlUuxlWuEKp9bdV_bfwHwcJZUg</recordid><startdate>20061020</startdate><enddate>20061020</enddate><creator>Waśniewski, Jerzy</creator><creator>Andersen, Bjarne Stig</creator><creator>Gustavson, Fred</creator><general>Springer Berlin Heidelberg</general><general>Springer-Verlag</general><scope>IQODW</scope></search><sort><creationdate>20061020</creationdate><title>Recursive formulation of Cholesky algorithm in Fortran 90</title><author>Waśniewski, Jerzy ; Andersen, Bjarne Stig ; Gustavson, Fred</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-p1324-9481837e7dd6e7bbcef58b89272d64b0e510062b72cd79f6d6c1f0b77bbce6143</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2006</creationdate><topic>Applied sciences</topic><topic>Computer science; control theory; systems</topic><topic>Exact sciences and technology</topic><topic>Miscellaneous</topic><topic>Software</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Waśniewski, Jerzy</creatorcontrib><creatorcontrib>Andersen, Bjarne Stig</creatorcontrib><creatorcontrib>Gustavson, Fred</creatorcontrib><collection>Pascal-Francis</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Waśniewski, Jerzy</au><au>Andersen, Bjarne Stig</au><au>Gustavson, Fred</au><au>Waśniewski, Jerzy</au><au>Dongarra, Jack</au><au>Elmroth, Erik</au><au>Kågström, Bo</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Recursive formulation of Cholesky algorithm in Fortran 90</atitle><btitle>Applied Parallel Computing Large Scale Scientific and Industrial Problems</btitle><date>2006-10-20</date><risdate>2006</risdate><spage>574</spage><epage>578</epage><pages>574-578</pages><issn>0302-9743</issn><eissn>1611-3349</eissn><isbn>3540654143</isbn><isbn>9783540654148</isbn><eisbn>3540492615</eisbn><eisbn>9783540492610</eisbn><abstract>Fortran 90 allows writing recursive procedures (see [7]). Recursion leads to automatic variable blocking for dense linear-algebra algorithms (see [5, 8]). The recursive way of programming algorithms eliminate the use of BLAS level 2 in the factorization steps. For this and other reasons recursion usually speed up the algorithms.
The formulation of the Cholesky factorization algorithm using recursion in Fortran 90 is presented in this paper.</abstract><cop>Berlin, Heidelberg</cop><pub>Springer Berlin Heidelberg</pub><doi>10.1007/BFb0095384</doi><tpages>5</tpages></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0302-9743 |
| ispartof | Applied Parallel Computing Large Scale Scientific and Industrial Problems, 2006, p.574-578 |
| issn | 0302-9743 1611-3349 |
| language | eng |
| recordid | cdi_pascalfrancis_primary_1574024 |
| source | Springer Books |
| subjects | Applied sciences Computer science control theory systems Exact sciences and technology Miscellaneous Software |
| title | Recursive formulation of Cholesky algorithm in Fortran 90 |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-14T14%3A19%3A25IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-pascalfrancis_sprin&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=Recursive%20formulation%20of%20Cholesky%20algorithm%20in%20Fortran%2090&rft.btitle=Applied%20Parallel%20Computing%20Large%20Scale%20Scientific%20and%20Industrial%20Problems&rft.au=Wa%C5%9Bniewski,%20Jerzy&rft.date=2006-10-20&rft.spage=574&rft.epage=578&rft.pages=574-578&rft.issn=0302-9743&rft.eissn=1611-3349&rft.isbn=3540654143&rft.isbn_list=9783540654148&rft_id=info:doi/10.1007/BFb0095384&rft_dat=%3Cpascalfrancis_sprin%3E1574024%3C/pascalfrancis_sprin%3E%3Curl%3E%3C/url%3E&rft.eisbn=3540492615&rft.eisbn_list=9783540492610&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true |