Dario Andrea Bini

On the Solution of a Nonlinear Matrix Equation arising in Queueing Problems

By extending the cyclic reduction technique to infinite block matrices we devise a new algorithm for computing the solution

Spectral and computational properties of band symmetric toeplitz matrices

G_0

O ( n 2.7799 ) complexity for n × n approximate matrix multiplication

of the matrix equation

Design, Analysis and Implementation of a Multiprecision Polynomial Rootfinder

G=\sum_{i=0}^{+\infty}G^iA_i

Numerical computation of polynomial zeros by means of Aberth's method

arising in a wide class of queueing problems. Here

Fast and stable QR eigenvalue algorithms for generalized companion matrices and secular equations

A_i

On a matrix algebra related to the discrete Hartley transform

,

On Cyclic Reduction Applied to a Class of Toeplitz-Like Matrices Arising in Queueing Problems

i=0,1,\ldots,

Algorithms for the matrix pth root

are

Parallel solution of certain toeplitz linear systems

k\times k