QR factorization for the regularized least squares problem on hypercubes

DOI10.1016/0167-8191(93)90076-WzbMath0780.65027OpenAlexW2000151958MaRDI QIDQ688204

Jian-Ping Zhu

Publication date: 23 January 1994

Published in: Parallel Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-8191(93)90076-w

zbMATH Keywords

performanceGiven's rotationsQR factorizationhybrid algorithmHouseholder transformationTikhonov's regularization methodtiming resultsill-conditioned least squares problemIntel hypercubesover-determined system

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Numerical solutions to overdetermined systems, pseudoinverses (65F20) Parallel numerical computation (65Y05) Complexity and performance of numerical algorithms (65Y20)

This page was built for publication: QR factorization for the regularized least squares problem on hypercubes