About

Log in?

DTU users get better search results including licensed content and discounts on order fees.

Anyone can log in and get personalized features such as favorites, tags and feeds.

Log in as DTU user Log in as non-DTU user No thanks

DTU Findit

Recent

Boolean: (bicycle AND helmet) OR (head AND protection) (always group AND in parenthesis)
Title: title:(climate change)
Author: author:("bohr niels" OR "bohr n") (avoid only full first name)
Phrase: "water pump control" (does not work with wildcards)
Wildcards: wom?n pharm*

More help on how to search

Flexible matching

About search syntax

Search syntax Advanced
Close advanced
{{problem}}
By field Using AND/OR By author
This tool can help you build boolean queries suitable for doing a broad search for different synonyms or spellings of each word. Start via the drop-down below or just start typing in the search field.
{{ row.typeTitle }}: ( )

Since our index often lack the full first name of people it can be difficult to correctly search by author.

Fill in the fields and let us help you build a good query:

If you need to find everything possible, consider only searching by last name.

Use "Starting year" to ignore publications out of year range.

Author: Ostromsky remove
Filter results...

Interpreted as:

title:(A AND Parallel AND Sparse AND QR-Factorization AND Algorithm)

Suggestions: Include records that partially match the query

Filter results
Access
Type
Language
Year
From DTU
Advanced
Previous 1 - 3 of 3 Next
Export
10 items by relevance
1 Conference paper

A Parallel Sparse QR-Factorization Algorithm

Ostromsky, Tzvetan; Hansen, Per Christian; Zlatev, Zahari

Applied Parallel Computing — 1996, pp. 462-472

A sparse QR-factorization algorithm for coarse-grain parallel computations is described. Initially the coefficient matrix, which is assumed to be general sparse, is reordered properly in an attempt to bring as many zero elements in the lower left corner as possible. Then the matrix is partitioned

Year: 1996

Language: English

More...
i gmdofn eahplckb j
2 Journal article

A Coarse-Grained Parallel QR-Factorization Algorithms for Sparse Least Squares Problems

Ostromsky, Tzvetan; Hansen, Per Christian; Zlatev, Zahari

Parallel Computing — 1998, Volume 24, pp. 937-964

Year: 1998

Language: English

More...
dhpjcklaof e ibngm
3 Journal article

A coarse-grained parallel QR-factorization algorithm for sparse least squares problems

Ostromsky, Tz.; Hansen, P.C.; Zlatev, Z.

Parallel Computing — 1996, Volume 24, Issue 5-6, pp. 937-964

A sparse QR-factorization algorithm SPARQR for coarse-grained parallel computations is described. The coefficient matrix, which is assumed to be general sparse, is reordered in an attempt to bring as many zero elements in the lower left corner as possible. The reordered matrix is then partitioned

Year: 1996

Language: English

More...
ghk dbmiol acenfjp

DTU users get better search results including licensed content and discounts on order fees.

Log in as DTU user