Parallel Complexity of Computations with General and Toeplitz-Like Matrices Filled with Integers and Extensions

DOI10.1137/S0097539797349959zbMath0969.68190OpenAlexW2070175560MaRDI QIDQ4507386

Pan, Victor Y.

Publication date: 18 October 2000

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s0097539797349959

zbMATH Keywords

computational complexityparallel algorithmsrandomized algorithmsdisplacement rank\(p\)-adic liftingToeplitz-like matricespolynomial gcdblock Gauss-Jordan decompositionNewton-Hensel's liftingToeplitz matrix computations

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Parallel algorithms in computer science (68W10) Toeplitz operators, Hankel operators, Wiener-Hopf operators (47B35) Grammars and rewriting systems (68Q42) Complexity and performance of numerical algorithms (65Y20)

Related Items (1)

A multilevel parallel algorithm to solve symmetric Toeplitz linear systems

This page was built for publication: Parallel Complexity of Computations with General and Toeplitz-Like Matrices Filled with Integers and Extensions