Improved parallel QR method for large least squares problems involving Kronecker products

DOI10.1016/S0377-0427(96)00109-4zbMath0868.65019MaRDI QIDQ675993

Hany Hashish, Charles T. Fulton, Donald W. Fausett

Publication date: 5 August 1997

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

algorithmnumerical examplesparallel algorithmload balancingbinary exchange algorithmlarge least squares problemQR factorizations

Mathematics Subject Classification ID

Numerical solutions to overdetermined systems, pseudoinverses (65F20) Parallel numerical computation (65Y05)

Related Items

Condition numbers of the minimum norm least squares solution for the least squares problem involving Kronecker products, Linear least squares problems with data over incomplete grids, Parallel algorithms for large least squares problems involving kronecker products, Bivariate least squares approximation with linear constraints, Least squares problems involving generalized Kronecker products and application to bivariate polynomial regression, The ubiquitous Kronecker product

Uses Software

• LAPACK
• NAPACK

Cites Work

• Parallel matrix transpose algorithms on distributed memory concurrent computers
• Inertia characteristics of self-adjoint matrix polynomials
• Distributed Orthogonal Factorization: Givens and Householder Algorithms
• QR Factorization of a Dense Matrix on a Hypercube Multiprocessor
• Algorithms for Matrix Transposition on Boolean N-Cube Configured Ensemble Architectures
• The vec-permutation matrix, the vec operator and Kronecker products: a review
• A Parallel Nonlinear Least-Squares Solver: Theoretical Analysis and Numerical Results
• Kronecker Products, Unitary Matrices and Signal Processing Applications
• Large Least Squares Problems Involving Kronecker Products
• A Parallel QR Factorization Algorithm with Controlled Local Pivoting
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item