Improved parallel QR method for large least squares problems involving Kronecker products
From MaRDI portal
The authors develop a new algorithm for the efficient solution of a large least squares problem in which the coefficient matrix of the linear system is a Kronecker product of two matrices of smaller dimension. The solution algorithm is based on QR factorizations of the smaller dimensioned matrices. Nearly perfect load balancing is achieved by exploiting the commutativity property of the Kronecker product. Communication requirements are minimized by employing a binary exchange algorithm for matrix transposition. A parallel algorithm is presented, and timing results are shown from test runs on an Intel C860 computer.
Recommendations
- scientific article; zbMATH DE number 741167
- Parallel algorithms for large least squares problems involving kronecker products
- scientific article; zbMATH DE number 878984
- A coarse-grained parallel QR-factorization algorithm for sparse least squares problems
- The parallel QR factorization algorithm for tridiagonal linear systems
- A parallel QR-factorization/solver of quasiseparable matrices
- Large Least Squares Problems Involving Kronecker Products
- A parallel version of QMRCGSTAB method for large linear systems in distributed parallel environments
- QR Factorization for Linear Least-Squares Problems on a Hypercube Multiprocessor
Cites work
- A Parallel Nonlinear Least-Squares Solver: Theoretical Analysis and Numerical Results
- A Parallel QR Factorization Algorithm with Controlled Local Pivoting
- Algorithms for Matrix Transposition on Boolean N-Cube Configured Ensemble Architectures
- Distributed Orthogonal Factorization: Givens and Householder Algorithms
- scientific article; zbMATH DE number 4213315 (Why is no real title available?)
- scientific article; zbMATH DE number 3783337 (Why is no real title available?)
- scientific article; zbMATH DE number 43693 (Why is no real title available?)
- scientific article; zbMATH DE number 41472 (Why is no real title available?)
- scientific article; zbMATH DE number 51132 (Why is no real title available?)
- scientific article; zbMATH DE number 53687 (Why is no real title available?)
- scientific article; zbMATH DE number 194139 (Why is no real title available?)
- scientific article; zbMATH DE number 741107 (Why is no real title available?)
- scientific article; zbMATH DE number 852536 (Why is no real title available?)
- scientific article; zbMATH DE number 3321671 (Why is no real title available?)
- scientific article; zbMATH DE number 3342967 (Why is no real title available?)
- scientific article; zbMATH DE number 3373921 (Why is no real title available?)
- scientific article; zbMATH DE number 3380133 (Why is no real title available?)
- Inertia characteristics of self-adjoint matrix polynomials
- Kronecker Products, Unitary Matrices and Signal Processing Applications
- Large Least Squares Problems Involving Kronecker Products
- Parallel matrix transpose algorithms on distributed memory concurrent computers
- QR Factorization of a Dense Matrix on a Hypercube Multiprocessor
- The vec-permutation matrix, the vec operator and Kronecker products: a review
Cited in
(14)- Parallel implementation of the Kronecker product technique for numerical solution of parabolic partial differential equations
- The ubiquitous Kronecker product
- Least squares problems involving generalized Kronecker products and application to bivariate polynomial regression
- Linear least squares problems with data over incomplete grids
- Condition numbers of the minimum norm least squares solution for the least squares problem involving Kronecker products
- Large Least Squares Problems Involving Kronecker Products
- Efficient algorithm for a class of least squares estimation problems
- scientific article; zbMATH DE number 741167 (Why is no real title available?)
- Parallel algorithms for large least squares problems involving kronecker products
- Efficient Solution of Constrained Least Squares Problems with Kronecker Product Structure
- scientific article; zbMATH DE number 878984 (Why is no real title available?)
- Fast algorithms for least squares problems with Kronecker lower subsets
- Efficient decomposition-based algorithms for _1-regularized inverse problems with column-orthogonal and Kronecker product matrices
- Bivariate least squares approximation with linear constraints
This page was built for publication: Improved parallel QR method for large least squares problems involving Kronecker products
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q675993)
