Nearly Optimal Bit Complexity Bounds for Computations with Structured Matrices

نویسنده

  • Elias Tsigaridas
چکیده

We present optimal, up to poly-logarithmic factors, bit complexity results for basic operations, matrix-vector multiplication and solving non-singular linear systems, with structured matrices.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

cient Parallel Factorization and Solution ofStructured and Unstructured Linear

This paper gives improved parallel methods for several exact factoriza-tions of some classes of symmetric positive deenite (SPD) matrices. Our factorizations also provide us similarly eecient algorithms for exact computation of the solution of the corresponding linear systems (which need not be SPD), and for nding rank and determinant magnitude. We assume the input matrices have entries that ar...

متن کامل

Efficient parallel factorization and solution of structured and unstructured linear systems

This paper gives improved parallel methods for several exact factorizations of some classes of symmetric positive definite (SPD) matrices. Our factorizations also provide us similarly efficient algorithms for exact computation of the solution of the corresponding linear systems (which need not be SPD), and for finding rank and determinant magnitude. We assume the input matrices have entries tha...

متن کامل

TR-2008003: Unified Nearly Optimal Algorithms for Structured Integer Matrices and Polynomials

We seek the solution of banded, Toeplitz, Hankel, Vandermonde, Cauchy and other structured linear systems of equations with integer coefficients. By combining Hensel’s symbolic lifting with either divide-and-conquer algorithms or numerical iterative refinement, we unify the solution for all these structures. We yield the solution in nearly optimal randomized Boolean time, which covers both solu...

متن کامل

Unified Nearly Optimal Algorithms for Structured Integer Matrices and Polynomials

We seek the solution of banded, Toeplitz, Hankel, Vandermonde, Cauchy and other structured linear systems of equations with integer coefficients. By combining Hensel’s symbolic lifting with either divide-and-conquer algorithms or numerical iterative refinement, we unify the solution for all these structures. We yield the solution in nearly optimal randomized Boolean time, which covers both solu...

متن کامل

Some Recent Algebraic/numerical Algorithms

Combination of algebraic and numerical techniques for improving the computations in algebra and geometry is a popular research topic of growing interest. We survey some recent progress that we made in this area, in particular , regarding polynomial roottnding, the solution of a polynomial system of equations, the computation of an approximate greatest common divisor of two polynomials as well a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2015