Abstract
We survey certain techniques such as approximation, interpolation and embedding in matrix algebra, which are particularly useful to devise fast parallel algorithms for some matrix-structured problems. The problems we consider are triangular Toeplitz matrix inversion and its algebraic counterpart polynomial division, matrix multiplication, and some computations concerning banded Toeplitz matrices.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
