Partitioned Matrix Algorithms for VLSI Arithmetic Systems
From MaRDI portal
Publication:3960038
DOI10.1109/TC.1982.1675945zbMath0496.65008OpenAlexW2009055506MaRDI QIDQ3960038
Publication date: 1982
Published in: IEEE Transactions on Computers (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tc.1982.1675945
inversionparallel processingnumerical analysisvery large scale integrationtriangular matrixmatrix computationslinear system of equationscomputer architecturecomputer arithmeticLU decompositionreal-time applicationslarge-scale matrix solvers
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (6)
Mapping dynamic programming onto modular linear systolic arrays ⋮ MODULAR FIXED-SIZE VLSI ARCHITECTURES FOR GENERAL MULTISPLITTING ITERATION ⋮ A modular systolic linear array for gaussian elimination ⋮ On high-speed computing with a programmable linear array ⋮ Optimal piecewise linear schedules for LSGP- and LPGS-decomposed array processors via quadratic programming ⋮ Calculating an inverse matrix for lower triangular matrix using a two-processor system
This page was built for publication: Partitioned Matrix Algorithms for VLSI Arithmetic Systems
