{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T22:25:22Z","timestamp":1757629522368,"version":"3.44.0"},"reference-count":55,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1990,9,1]],"date-time":"1990-09-01T00:00:00Z","timestamp":652147200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1990,9,1]],"date-time":"1990-09-01T00:00:00Z","timestamp":652147200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2006,9,7]],"date-time":"2006-09-07T00:00:00Z","timestamp":1157587200000},"content-version":"vor","delay-in-days":5850,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Journal of Complexity"],"published-print":{"date-parts":[[1990,9]]},"DOI":"10.1016\/0885-064x(90)90026-a","type":"journal-article","created":{"date-parts":[[2004,9,8]],"date-time":"2004-09-08T14:41:18Z","timestamp":1094654478000},"page":"324-336","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":1,"title":["Some complexity results in parallel matrix-based signal processing"],"prefix":"10.1016","volume":"6","author":[{"given":"Adam W","family":"Bojanczyk","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0885-064X(90)90026-A_BIB1","series-title":"Hypercube Multiprocessors, 1987","first-page":"612","article-title":"The two-sided block Jacobi method on a hypercube","author":"Bischof","year":"1987"},{"issue":"3","key":"10.1016\/0885-064X(90)90026-A_BIB2","doi-asserted-by":"crossref","first-page":"591","DOI":"10.1137\/0721041","article-title":"Complexity of solving linear systems in different models of computation","volume":"21","author":"Bojanczyk","year":"1984","journal-title":"SIAM J. Numer. Anal."},{"key":"10.1016\/0885-064X(90)90026-A_BIB3","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1016\/0743-7315(85)90028-0","article-title":"Matrix tridiagonalization on an N \u00d7 N array of mesh-connected processors","volume":"2","author":"Bojanczyk","year":"1985","journal-title":"J. Parallel Distrib. Comput."},{"key":"10.1016\/0885-064X(90)90026-A_BIB4","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1007\/BF01389431","article-title":"QR factorization of Toeplitz matrices","volume":"49","author":"Bojanczyk","year":"1986","journal-title":"Numer. Math."},{"issue":"3","key":"10.1016\/0885-064X(90)90026-A_BIB5","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1016\/0743-7315(90)90077-3","article-title":"Linearly connected arrays for Toeplitz least squares problems","volume":"9","author":"Bojanczyk","year":"1990","journal-title":"J. Parallel Distrib. Comput."},{"issue":"1","key":"10.1016\/0885-064X(90)90026-A_BIB6","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1137\/0905007","article-title":"Numerically stable solution of linear equations using mesh-connected processors","volume":"5","author":"Bojanczyk","year":"1984","journal-title":"SIAM J. Sci. Statist. Comput."},{"key":"10.1016\/0885-064X(90)90026-A_BIB7","series-title":"Proceedings of SPIE 87","article-title":"A novel MVDR beamforming algorithm","author":"Bojanczyk","year":"1987"},{"issue":"4","key":"10.1016\/0885-064X(90)90026-A_BIB8","doi-asserted-by":"crossref","first-page":"388","DOI":"10.1016\/0743-7315(90)90137-E","article-title":"A unified systolic array for adaptive beamforming","volume":"8","author":"Bojanczyk","year":"1990","journal-title":"J. Parallel Distrib. Comput."},{"key":"10.1016\/0885-064X(90)90026-A_BIB55","unstructured":"Bojanczyk, A. W., and Lutoborski, A. (to appear), \u201cParallel Euler-Jacobi Methods for Spectral Decompositions,\u201d SIAM J. Mat. Comp."},{"key":"10.1016\/0885-064X(90)90026-A_BIB9","series-title":"Proceedings of the SPIE Conference","article-title":"Matrix downdating techniques for signal processing","author":"Bojanczyk","year":"1988"},{"key":"10.1016\/0885-064X(90)90026-A_BIB10","series-title":"Proceedings of the Third International Systolic Conference","article-title":"A systolic array for hyperbolic SVD based covariance differencing","author":"Bojanczyk","year":"1989"},{"issue":"3","key":"10.1016\/0885-064X(90)90026-A_BIB11","doi-asserted-by":"crossref","first-page":"210","DOI":"10.1137\/0908031","article-title":"A note on downdating the Cholesky factorization","volume":"8","author":"Bojanczyk","year":"1987","journal-title":"SIAM J. Sci. Statist. Comput."},{"key":"10.1016\/0885-064X(90)90026-A_BIB12","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1137\/0906007","article-title":"The solution of singular value and symmetric eigenvalue problems on multiprocessor arrays","volume":"6","author":"Brent","year":"1985","journal-title":"SIAM J. Sci. Statist. Comput."},{"key":"10.1016\/0885-064X(90)90026-A_BIB13","series-title":"Proc. IEEE Int. Conf. on Parallel Processing","first-page":"448","article-title":"Unifying VLSI array design with linear transformations of space time","author":"Cappello","year":"1983"},{"article-title":"A Jacobi-like Algorithm for Computing the Generalized Schur Form for a Regular Pencil","year":"1988","author":"Charlier","key":"10.1016\/0885-064X(90)90026-A_BIB14"},{"key":"10.1016\/0885-064X(90)90026-A_BIB15","series-title":"Proceedings of 18th Allerton Conf. on Comm. Contr. and Comput.","first-page":"564","article-title":"A Jacobi algorithm and its implementation on parallel computers","author":"Chen","year":"1980"},{"issue":"6","key":"10.1016\/0885-064X(90)90026-A_BIB16","doi-asserted-by":"crossref","first-page":"899","DOI":"10.1137\/0908073","article-title":"Fast parallel algorithms for QR and triangular factorization","volume":"8","author":"Chun","year":"1987","journal-title":"SIAM J. Sci. Statist. Comput."},{"key":"10.1016\/0885-064X(90)90026-A_BIB17","doi-asserted-by":"crossref","first-page":"790","DOI":"10.1137\/0608064","article-title":"On one-sided Jacobi methods for parallel computation","volume":"8","author":"Eberlein","year":"1987","journal-title":"SIAM J. Algebraic Discrete Methods"},{"key":"10.1016\/0885-064X(90)90026-A_BIB18","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1109\/TC.1987.1676879","article-title":"On the Schure decomposition of a matrix for parallel computation","volume":"C-36","author":"Eberlein","year":"1987","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0885-064X(90)90026-A_BIB19","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1090\/S0002-9947-1960-0109825-2","article-title":"The cyclic Jacobi method for computing the principal values of a complex matrix","volume":"94","author":"Forsythe","year":"1960","journal-title":"Trans. Amer. Math. Soc."},{"key":"10.1016\/0885-064X(90)90026-A_BIB20","series-title":"Proc. SPIE.","article-title":"Matrix triangularization by systolic arrays","author":"Gentelman","year":"1981"},{"year":"1989","series-title":"Matrix Computations","author":"Golub","key":"10.1016\/0885-064X(90)90026-A_BIB21"},{"key":"10.1016\/0885-064X(90)90026-A_BIB22","doi-asserted-by":"crossref","first-page":"448","DOI":"10.1137\/0111032","article-title":"On cyclic Jacobi methods","volume":"11","author":"Hansen","year":"1963","journal-title":"J. Soc. Ind. Appl. Math."},{"key":"10.1016\/0885-064X(90)90026-A_BIB23","first-page":"338","article-title":"A novel algorithms and architecture for adaptive digital beamforming","author":"Hargrave","year":"1986","journal-title":"IEEE Trans. Antennas and Propagation"},{"key":"10.1016\/0885-064X(90)90026-A_BIB24","doi-asserted-by":"crossref","first-page":"1147","DOI":"10.1137\/0907078","article-title":"Computing the singular value decomposition of a product of matrices","volume":"7","author":"Heath","year":"1986","journal-title":"SIAM J. Sci. Statist. Comput."},{"key":"10.1016\/0885-064X(90)90026-A_BIB25","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1137\/0904020","article-title":"Systolic networks for orthogonal decompositions","volume":"4","author":"Heller","year":"1983","journal-title":"SIAM J. Sci. Statist. Comput."},{"key":"10.1016\/0885-064X(90)90026-A_BIB26","first-page":"51","article-title":"Inversion of matrices by biorthogonalization and related results","volume":"6","author":"Hestenes","year":"1958","journal-title":"J. SIAM"},{"key":"10.1016\/0885-064X(90)90026-A_BIB27","first-page":"1304","article-title":"Array architectures for iterative algorithms","volume":"Vol. 75","author":"Jagdish","year":"1987"},{"issue":"3","key":"10.1016\/0885-064X(90)90026-A_BIB28","doi-asserted-by":"crossref","first-page":"563","DOI":"10.1145\/321406.321418","article-title":"The organization of computations for uniform recurrence equations","volume":"14","author":"Karp","year":"1967","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0885-064X(90)90026-A_BIB29","series-title":"Info. Processing 1971","first-page":"1266","article-title":"Parallel computation of eigenvalues of real matrices","author":"Kuck","year":"1972"},{"issue":"1","key":"10.1016\/0885-064X(90)90026-A_BIB30","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1109\/MC.1982.1653825","article-title":"Why systolic architectures?","volume":"15","author":"Kung","year":"1982","journal-title":"IEEE Comput."},{"year":"1988","series-title":"VLSI Array Processors","author":"Kung","key":"10.1016\/0885-064X(90)90026-A_BIB31"},{"key":"10.1016\/0885-064X(90)90026-A_BIB32","doi-asserted-by":"crossref","first-page":"250","DOI":"10.1016\/0743-7315(85)90027-9","article-title":"A parallel method for computing the generalized SVD","volume":"2","author":"Luk","year":"1985","journal-title":"J. Parallel Distrib. Comp."},{"key":"10.1016\/0885-064X(90)90026-A_BIB33","doi-asserted-by":"crossref","first-page":"452","DOI":"10.1137\/0907030","article-title":"A parallel method for computing the QR decomposition","volume":"7","author":"Luk","year":"1986","journal-title":"SIAM J. Sci. Statist. Comput."},{"key":"10.1016\/0885-064X(90)90026-A_BIB34","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1016\/0024-3795(86)90171-0","article-title":"A triangular processor array for computing singular values","volume":"77","author":"Luk","year":"1986","journal-title":"Linear Algebra Appl."},{"key":"10.1016\/0885-064X(90)90026-A_BIB35","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1137\/0910002","article-title":"On parallel Jacobi orderings","volume":"10","author":"Luk","year":"1989","journal-title":"SIAM J. Sci. Statist. Comput."},{"issue":"19","key":"10.1016\/0885-064X(90)90026-A_BIB36","doi-asserted-by":"crossref","first-page":"729","DOI":"10.1049\/el:19830496","article-title":"Systolic array for recursive least squares minimization","volume":"18","author":"McWhirter","year":"1983","journal-title":"Electron. Lett."},{"key":"10.1016\/0885-064X(90)90026-A_BIB37","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1007\/BF01389496","article-title":"Efficient implementation of Jacobi's diagonalization method on the DAP","volume":"46","author":"Modi","year":"1985","journal-title":"Numer. Math."},{"issue":"1","key":"10.1016\/0885-064X(90)90026-A_BIB38","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1109\/TCAD.1987.1270243","article-title":"ADVIS: A software package for the design of systolic arrays","volume":"CAD-6","author":"Moldovan","year":"1987","journal-title":"IEEE Trans. Comput. Aided Design"},{"issue":"1","key":"10.1016\/0885-064X(90)90026-A_BIB39","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1109\/TC.1986.1676652","article-title":"Partitioning and mapping algorithms into fixed size systolic arrays","volume":"C-35","author":"Moldovan","year":"1986","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0885-064X(90)90026-A_BIB40","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1016\/0024-3795(86)90173-4","article-title":"On the quadratic convergence of Kogbetliantz's algorithms for computing the SVD","volume":"77","author":"Paige","year":"1986","journal-title":"Linear Algebra Appl."},{"year":"1957","series-title":"Elementary Theory of Angular Momentum","author":"Rose","key":"10.1016\/0885-064X(90)90026-A_BIB41"},{"key":"10.1016\/0885-064X(90)90026-A_BIB42","doi-asserted-by":"crossref","first-page":"585","DOI":"10.1007\/BF01937278","article-title":"Closest normal matrix finally found!","volume":"27","author":"Ruhe","year":"1987","journal-title":"BIT"},{"key":"10.1016\/0885-064X(90)90026-A_BIB43","doi-asserted-by":"crossref","first-page":"579","DOI":"10.1090\/S0025-5718-1971-0297131-6","article-title":"On Jacobi and Jacobi-like algorithms for a parallel computer","volume":"25","author":"Sameh","year":"1971","journal-title":"Math. Comput."},{"key":"10.1016\/0885-064X(90)90026-A_BIB44","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1007\/BF01933710","article-title":"On systolic arrays for updating the Cholesky factorization","volume":"26","author":"Schreiber","year":"1986","journal-title":"BIT"},{"key":"10.1016\/0885-064X(90)90026-A_BIB45","doi-asserted-by":"crossref","first-page":"334","DOI":"10.1016\/0743-7315(87)90041-4","article-title":"A systolic array for cyclic-by rows algorithms","volume":"4","author":"Schweigelshohn","year":"1987","journal-title":"J. Parallel Distrib. Comp."},{"key":"10.1016\/0885-064X(90)90026-A_BIB46","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1016\/0024-3795(86)90176-X","article-title":"Parallel block Jacobi eigenvalue algorithms using systolic arrays","volume":"77","author":"Scott","year":"1986","journal-title":"Linear Algebra Appl."},{"article-title":"Convergence of block Jacobi methods","year":"1987","author":"Shroff","key":"10.1016\/0885-064X(90)90026-A_BIB47"},{"key":"10.1016\/0885-064X(90)90026-A_BIB48","first-page":"2","article-title":"Parallel processing algorithms and architectures for real-time signal processing","volume":"Vol. 298","author":"Speiser","year":"1982"},{"key":"10.1016\/0885-064X(90)90026-A_BIB49","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1093\/imamat\/23.2.203","article-title":"The effect of rounding errors on an algorithm for downdating a Cholesky factorization","volume":"23","author":"Stewart","year":"1979","journal-title":"J. Inst. Math. Appl."},{"key":"10.1016\/0885-064X(90)90026-A_BIB50","doi-asserted-by":"crossref","first-page":"853","DOI":"10.1137\/0906058","article-title":"A Jacobi-like algorithm for computing the Schure decomposition of a nonhermitian matrix","volume":"6","author":"Stewart","year":"1985","journal-title":"SIAM J. Sci. Statist. Comput."},{"key":"10.1016\/0885-064X(90)90026-A_BIB51","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1007\/BF02165225","article-title":"On the quadratic convergence of the special cyclic Jacobi method","volume":"9","author":"Van Kempen","year":"1966","journal-title":"Numer. Math."},{"article-title":"The block Jacobi method for computing the SVD","year":"1985","author":"Van Loan","key":"10.1016\/0885-064X(90)90026-A_BIB52"},{"key":"10.1016\/0885-064X(90)90026-A_BIB53","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1109\/TC.1984.1676457","article-title":"A parallel Jacobi diagonalization algorithm for a loop multiprocessor system","volume":"C-33","author":"Whiteside","year":"1984","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0885-064X(90)90026-A_BIB54","doi-asserted-by":"crossref","first-page":"296","DOI":"10.1007\/BF01386321","article-title":"Note on the quadratic convergence of the cyclic Jacobi process","volume":"4","author":"Wilkinson","year":"1962","journal-title":"Numer. Math."}],"container-title":["Journal of Complexity"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0885064X9090026A?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0885064X9090026A?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,10]],"date-time":"2025-09-10T14:53:30Z","timestamp":1757516010000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0885064X9090026A"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,9]]},"references-count":55,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1990,9]]}},"alternative-id":["0885064X9090026A"],"URL":"https:\/\/doi.org\/10.1016\/0885-064x(90)90026-a","relation":{},"ISSN":["0885-064X"],"issn-type":[{"type":"print","value":"0885-064X"}],"subject":[],"published":{"date-parts":[[1990,9]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Some complexity results in parallel matrix-based signal processing","name":"articletitle","label":"Article Title"},{"value":"Journal of Complexity","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/0885-064X(90)90026-A","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1990 Published by Elsevier Inc.","name":"copyright","label":"Copyright"}]}}