Parallel QR processing of generalized Sylvester matrices

DOI10.1016/J.TCS.2010.11.051MaRDI QIDQ633629zbMATH OpenOpenAlexFDO

Authors M. Kourniotis, Marilena Mitrouli, D. S. Triantafyllou

Publication date 29 March 2011

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2010.11.051

zbMATH Keywords

generalized Sylvester matrixnumerical experimentsparallel computationQR factorizationrank

Mathematics Subject Classification ID

Factorization of matrices (15A23) Direct numerical methods for linear systems and matrix inversion (65F05) Parallel numerical computation (65Y05)

Recommendations

• A parallel QR-factorization/solver of quasiseparable matrices
• Structured matrix methods computing the greatest common divisor of polynomials
• The generalized Schur algorithm and some applications
• On rank and null space computation of the generalized Sylvester matrix
• scientific article; zbMATH DE number 741168

Cites work

• A parallel QR-factorization/solver of quasiseparable matrices
• Generalized Displacement Structure for Block-Toeplitz, Toeplitz-Block, and Toeplitz-Derived Matrices
• Greatest common divisors from generalized sylvester resultant matrices
• Numerical linear algebra and applications
• On rank and null space computation of the generalized Sylvester matrix
• Toward a better parallel performance metric

Cited in

(1)

• Parallel QR decomposition of a rectangular matrix

Describes a project that uses

Uses Software

• ScaLAPACK

This page was built for publication: Parallel QR processing of generalized Sylvester matrices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q633629)