umu.sePublications
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
A Faster and Simpler Recursive Algorithm for the LAPACK Routine DGELS
Umeå University, Faculty of Science and Technology, Department of Computing Science.
2001 (English)In: BIT Numerical Mathematics, ISSN 0006-3835, E-ISSN 1572-9125, Vol. 41, no 5, 936-949 p.Article in journal (Refereed) Published
Place, publisher, year, edition, pages
2001. Vol. 41, no 5, 936-949 p.
Identifiers
URN: urn:nbn:se:umu:diva-40419DOI: 10.1023/A:1021928926132OAI: oai:DiVA.org:umu-40419DiVA: diva2:399620
Available from: 2011-02-23 Created: 2011-02-23 Last updated: 2017-12-11

Open Access in DiVA

No full text

Other links

Publisher's full text

Search in DiVA

By author/editor
Elmroth, Erik
By organisation
Department of Computing Science
In the same journal
BIT Numerical Mathematics

Search outside of DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 20 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf