Fast Parallel Algorithms for QR and Triangular Factorization
From MaRDI portal
Publication:3769848
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
Cited in
(40)- Fast algorithms for generalized displacement structures and lossless systems
- Stability analysis of a general Toeplitz system solver
- Fast Inverse $QR$ Factorization for Toeplitz Matrices
- Some complexity results in parallel matrix-based signal processing
- Newton's iteration for inversion of Cauchy-like and other structured matrices
- Parallel quadrant interlocking factorization on hypercube computers
- Least squares modifications with inverse factorizations: Parallel implications
- A Parallel QR Factorization Algorithm with Controlled Local Pivoting
- Fast QR factorization of Cauchy-like matrices
- On Computations with Dense Structured Matrices
- Product rules for the displacement of near-Toeplitz matrices
- Fast parallel algorithms for vandermonde determinants
- Estimating the extremal eigenvalues of a symmetric matrix
- An inverse factorization algorithm for linear prediction
- Parallel solution of Toeplitzlike linear systems
- A fast algorithm for subspace state-space system identification via exploitation of the displacement structure
- QR factorization of Toeplitz matrices
- scientific article; zbMATH DE number 857679 (Why is no real title available?)
- Improved parallel computations with Toeplitz-like and Hankel-like matrices
- Diagonal pivoting for partially reconstructible Cauchy-like matrices, with applications to Toeplitz-like linear equations and to boundary rational matrix interpolation problems
- Parallel computation of polynomial GCD and some related parallel computations over abstract fields
- High performance algorithms for Toeplitz and block Toeplitz matrices
- Computing theULfactorisation by newton's method
- A modification to the LINPACK downdating algorithm
- New homotopic/factorization and symmetrization techniques for Newton's and Newton/structured iteration
- A constructive proof of the Gohberg-Semencul formula
- A total least squares method for Toeplitz systems of equations
- Computationally efficient cholesky factorization of a covariance matrix with block toeplitz structure
- A superfast method for solving Toeplitz linear least squares problems.
- Fast parallel QR decomposition of block-Toeplitz matrices
- State-space approach to factorization of lossless transfer functions and structured matrices
- Fast and efficient parallel evaluation of the zeros of a polynomial having only real zeros
- Fast Triangular Factorization of Covariance Matrices of Differenced Time Series
- Parametrization of Newton's iteration for computations with structured matrices and applications
- A new approach to fast polynomial interpolation and multipoint evaluation
- Fast recursive identification of state space models via exploitation of displacement structure
- On low-complexity approximation of matrices
- Fast algorithms for generalized predictive control
- Homotopic residual correction processes
- 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)
