Theoretical and Computational Aspects of Matrix Algorithms (Dagstuhl Seminar 03421)

Higham, Nick; Mehrmann, Volker; Rump, Siegfried M.; Szyld, Daniel B.

doi:10.4230/DagSemRep.398

Document

Theoretical and Computational Aspects of Matrix Algorithms (Dagstuhl Seminar 03421)

Authors Nick Higham, Volker Mehrmann, Siegfried M. Rump, Daniel B. Szyld

Part of: Volume: Dagstuhl Seminar Reports (DagSemRep)
Part of: Series: Dagstuhl Seminar Reports (DagSemRep)
License: Creative Commons Attribution 4.0 International license
Publication Date: 2003-10-17

PDF

File

DagSemRep.398.pdf

Filesize: 310 kB
5 pages

Document Identifiers

DOI: 10.4230/DagSemRep.398
URN: urn:nbn:de:0030-drops-152786

Author Details

Nick Higham

Volker Mehrmann

Siegfried M. Rump

Daniel B. Szyld

Cite AsGet BibTex

Nick Higham, Volker Mehrmann, Siegfried M. Rump, and Daniel B. Szyld. Theoretical and Computational Aspects of Matrix Algorithms (Dagstuhl Seminar 03421). Dagstuhl Seminar Report 398, pp. 1-5, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2003)
https://doi.org/10.4230/DagSemRep.398

Metrics

Access Statistics
Total Accesses (updated on a weekly basis)

0

PDF Downloads

0

Metadata Views

Questions / Remarks / Feedback

Feedback for Dagstuhl Publishing

Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail