Systolic Networks for Orthogonal Decompositions
From MaRDI portal
Publication:3314863
DOI10.1137/0904020zbMath0532.65029OpenAlexW1976979589MaRDI QIDQ3314863
Ilse C. F. Ipsen, Don E. Heller
Publication date: 1983
Published in: SIAM Journal on Scientific and Statistical Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0904020
linear systemssystolic arraysleast squaresQR decompositionvery large scale integrated circuitsband matrix computations
Related Items (max. 100)
Systolic SVD and QR Decomposition by Householder Reflections ⋮ On the VLSI complexity of some arithmetic and numerical problems ⋮ Unnamed Item ⋮ Some complexity results in parallel matrix-based signal processing ⋮ On systolic array methods for band matrix factorizations ⋮ On systolic arrays for updating the Cholesky factorization ⋮ \(QR\)-like algorithms for eigenvalue problems ⋮ A direct method for completing eigenproblem solutions on a parallel computer ⋮ A triangular processor array for computing singular values ⋮ A systolic array for the regularization of ill-conditioned least-squares problem with triangular Toeplitz matrix
This page was built for publication: Systolic Networks for Orthogonal Decompositions