Fast Parallel Algorithms for QR and Triangular Factorization
From MaRDI portal
Publication:3769848
DOI10.1137/0908073zbMath0632.65023OpenAlexW2065405327MaRDI QIDQ3769848
Hanoch Lev-Ari, Joohwan Chun, Thomas 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
Cholesky factorizationToeplitz matrixSchur algorithmdisplacement structureQR factorizationtriangular factorizationGivens rotationhyperbolic rotations
Factorization of matrices (15A23) Parallel numerical computation (65Y05) Direct numerical methods for linear systems and matrix inversion (65F05)
Related Items
A superfast method for solving Toeplitz linear least squares problems., On low-complexity approximation of matrices, Fast algorithms for generalized predictive control, Fast algorithms for generalized displacement structures and lossless systems, A modification to the LINPACK downdating algorithm, Stability analysis of a general Toeplitz system solver, Newton's iteration for inversion of Cauchy-like and other structured matrices, Parallel computation of polynomial GCD and some related parallel computations over abstract fields, Least squares modifications with inverse factorizations: Parallel implications, A constructive proof of the Gohberg-Semencul formula, High performance algorithms for Toeplitz and block Toeplitz matrices, Computationally efficient cholesky factorization of a covariance matrix with block toeplitz structure, Some complexity results in parallel matrix-based signal processing, State-space approach to factorization of lossless transfer functions and structured matrices, Parallel solution of Toeplitzlike linear systems, Homotopic residual correction processes, Diagonal pivoting for partially reconstructible Cauchy-like matrices, with applications to Toeplitz-like linear equations and to boundary rational matrix interpolation problems, An inverse factorization algorithm for linear prediction, Parametrization of Newton's iteration for computations with structured matrices and applications, A fast algorithm for subspace state-space system identification via exploitation of the displacement structure, On Computations with Dense Structured Matrices, New homotopic/factorization and symmetrization techniques for Newton's and Newton/structured iteration, A new approach to fast polynomial interpolation and multipoint evaluation, Improved parallel computations with Toeplitz-like and Hankel-like matrices, Product rules for the displacement of near-Toeplitz matrices, Estimating the extremal eigenvalues of a symmetric matrix, A total least squares method for Toeplitz systems of equations, Fast and efficient parallel evaluation of the zeros of a polynomial having only real zeros, Fast parallel QR decomposition of block-Toeplitz matrices, Fast recursive identification of state space models via exploitation of displacement structure
