Fast Parallel Algorithms for QR and Triangular Factorization
DOI10.1137/0908073zbMATH Open0632.65023OpenAlexW2065405327MaRDI QIDQ3769848FDOQ3769848
Authors: Hanoch Lev-Ari, Joohwan Chun, T. Kailath 
Publication date: 1987
Published in: SIAM Journal on Scientific and Statistical Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0908073
Recommendations
- The parallel QR factorization algorithm for tridiagonal linear systems
- A parallel QR-factorization/solver of quasiseparable matrices
- Parallel complexity of Householder QR factorization
- Fast \(CU\) triangular factorization algorithm
- Parallel \textit{QR} factorization of block-tridiagonal matrices
- Parallel complexities and computations of cholesky's decomposition and QR factorization
- Parallel QR factorization by Householder and modified Gram-Schmidt algorithms
- scientific article; zbMATH DE number 3947528
- Parallel Factorizations for Tridiagonal Matrices
Cholesky factorizationToeplitz matrixQR factorizationtriangular factorizationSchur algorithmGivens rotationdisplacement structurehyperbolic rotations
Direct numerical methods for linear systems and matrix inversion (65F05) Parallel numerical computation (65Y05) Factorization of matrices (15A23)
Cited In (40)
- Parallel computation of polynomial GCD and some related parallel computations over abstract fields
- A total least squares method for Toeplitz systems of equations
- Parametrization of Newton's iteration for computations with structured matrices and applications
- Product rules for the displacement of near-Toeplitz matrices
- Fast parallel algorithms for vandermonde determinants
- Fast QR factorization of Cauchy-like matrices
- A constructive proof of the Gohberg-Semencul formula
- Improved parallel computations with Toeplitz-like and Hankel-like matrices
- Least squares modifications with inverse factorizations: Parallel implications
- New homotopic/factorization and symmetrization techniques for Newton's and Newton/structured iteration
- Fast algorithms for generalized predictive control
- A fast algorithm for subspace state-space system identification via exploitation of the displacement structure
- Parallel solution of Toeplitzlike linear systems
- Fast algorithms for generalized displacement structures and lossless systems
- Computing theULfactorisation by newton's method
- A superfast method for solving Toeplitz linear least squares problems.
- Fast Triangular Factorization of Covariance Matrices of Differenced Time Series
- Fast parallel QR decomposition of block-Toeplitz matrices
- Fast recursive identification of state space models via exploitation of displacement structure
- Newton's iteration for inversion of Cauchy-like and other structured matrices
- Estimating the extremal eigenvalues of a symmetric matrix
- A modification to the LINPACK downdating algorithm
- Stability analysis of a general Toeplitz system solver
- On Computations with Dense Structured Matrices
- Title not available (Why is that?)
- High performance algorithms for Toeplitz and block Toeplitz matrices
- Homotopic residual correction processes
- QR factorization of Toeplitz matrices
- Computationally efficient cholesky factorization of a covariance matrix with block toeplitz structure
- Some complexity results in parallel matrix-based signal processing
- Parallel quadrant interlocking factorization on hypercube computers
- On low-complexity approximation of matrices
- An inverse factorization algorithm for linear prediction
- A new approach to fast polynomial interpolation and multipoint evaluation
- Fast Inverse $QR$ Factorization for Toeplitz Matrices
- Fast and efficient parallel evaluation of the zeros of a polynomial having only real zeros
- A Parallel QR Factorization Algorithm with Controlled Local Pivoting
- Diagonal pivoting for partially reconstructible Cauchy-like matrices, with applications to Toeplitz-like linear equations and to boundary rational matrix interpolation problems
- State-space approach to factorization of lossless transfer functions and structured matrices
- Fast triangular factorization of the sum of quasi-Toeplitz and quasi- Hankel matrices
This page was built for publication: Fast Parallel Algorithms for QR and Triangular Factorization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3769848)
