The Accurate and Efficient Solution of a Totally Positive Generalized Vandermonde Linear System

Vandermonde, Cauchy, and Cauchy--Vandermonde totally positive linear systems can be solved extremely accurately in O(n2 time using Bjorck--Pereyra-type methods. We prove that Bjorck--Pereyra-type methods exist not only for the above linear systems but also for any totally positive linear system as long as the initial minors (i.e., contiguous minors that include the first row or column) can be computed accurately. Using this result we design a new O(n2 Bjorck--Pereyra-type method for solving generalized Vandermonde systems of equations by using a new algorithm for computing the Schur function. We present explicit formulas for the entries of the bidiagonal decomposition, the LDU decomposition, and the inverse of a totally positive generalized Vandermonde matrix, as well as algorithms for computing these entries to high relative accuracy.

[1]  Plamen Koev,et al.  Accurate and efficient computations with structured matrices , 2002 .

[2]  Lawrence S. Kroll.  Mathematica--A System for Doing Mathematics by Computer. , 1989 .

[3]  James Demmel,et al.  Applied Numerical Linear Algebra , 1997 .

[4]  S. Fomin,et al.  Parametrizations of Canonical Bases and Totally Positive Matrices , 1996 .

[5]  T. Kailath,et al.  A fast parallel Björck–Pereyra-type algorithm for solving Cauchy linear equations , 1999 .

[6]  F. Gantmacher,et al.  Oscillation matrices and kernels and small vibrations of mechanical systems , 1961 .

[7]  Juan Manuel Peña,et al.  Scaled pivoting in Gauss and Neville elimination for totally positive systems , 1993 .

[8]  Juan Manuel Peña,et al.  Total positivity and Neville elimination , 1992 .

[9]  Å. Björck,et al.  Solution of Vandermonde Systems of Equations , 1970 .

[10]  I. G. MacDonald,et al.  Symmetric functions and Hall polynomials , 1979 .

[11]  Peter Lancaster,et al.  The theory of matrices , 1969 .

[12]  Sergey Fomin,et al.  Total positivity : tests and parametrizations , 2018 .

[13]  Juan Manuel Peña,et al.  Fast algorithms of Bjo¨rck-Pereyra type for solving Cauchy-Vandermonde linear systems , 1998 .

[14]  F. R. Gantmakher.  The Theory of Matrices , 1984 .

[15]  Juan Manuel Peña,et al.  Backward error analysis of Neville elimination , 1997 .

[16]  James Demmel,et al.  Accurate and efficient evaluation of Schur and Jack functions , 2005, Math. Comput..

[17]  Shaun M. Fallat.  Bidiagonal Factorizations of Totally Nonnegative Matrices , 2001, Am. Math. Mon..

[18]  Plamen Koev,et al.  Accurate Eigenvalues and SVDs of Totally Nonnegative Matrices , 2005, SIAM J. Matrix Anal. Appl..

[19]  C. D. Boor,et al.  Backward error analysis for totally positive linear systems , 1976 .

[20]  Halil Oruç,et al.  Explicit factorization of the Vandermonde matrix , 2000 .

[21]  Juan Manuel Peña,et al.  Factorizations of Cauchy-Vandermonde matrices , 1998 .

[22]  Nicholas J. Higham,et al.  Error analysis of the Björck-Pereyra algorithms for solving Vandermonde systems , 1987 .

[23]  Sergey Fomin,et al.  Double Bruhat cells and total positivity , 1998, math/9802056.

[24]  Juan Manuel Peña,et al.  A matricial description of Neville elimination with applications to total positivity , 1994 .

[25]  J. M. Peña,et al.  On Factorizations of Totally Positive Matrices , 1996 .

[26]  H. Van de Vel,et al.  Numerical treatment of a generalized Vandermonde system of equations , 1977 .

[27]  W. Prager,et al.  Compatibility of approximate solution of linear equations with given error bounds for coefficients and right-hand sides , 1964 .

[28]  Nicholas J. Higham,et al.  Stability analysis of algorithms for solving confluent Vandermonde-like systems , 1990 .