Superfast algorithms for Cauchy-like matrix computations and extensions

Linear Algebra and Its Applications

Volumn 310, Issue 1-3, 2000, Pages 83-108

  Pan, Victor Y ^a   Zheng, Ailong ^b  

^a CITY UNIVERSITY OF NEW YORK   (United States)

^b CITY UNIVERSITY OF NEW YORK   (United States)

Author keywords

15A09; 47B35; 65F05; Cauchy like matrices; Displacement rank; Fast algorithms; Finite fields; Matrix factorization; Rational interpolation; Scaling rank

Indexed keywords

EID: 0034375299     PISSN: 00243795     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0024-3795(00)00041-0     Document Type: Article

References (55)

1. Bitmead R.R., Anderson B.D.O. Asymptotically fast solution of Toeplitz and related systems of linear equations. Linear Algebra Appl. 34:1980;103-116.
2. J.A. Ball, I. Gohberg, L. Rodman, Interpolation of Rational Matrix Functions, OT45, Birkhäuser, Basel, 1990.
3. D. Bini, V.Y. Pan, Polynomial and Matrix Computations, Volume 1: Fundamental Algorithms, Birkhäuser, Boston, 1994.
4. Björck A., Pereyra V. Solution of Vandermonde systems of equations. Math. Comp. 24:1970;893-903.
5. Cauchy A.L. Mémorie sur les fonctions alternées et sur les somme alternées. Exercises d' Analyse et de Phys. Math. II:1841;151-159.
6. Cantor D.G., Kaltofen E. On fast multiplication of polynomials over arbitrary rings. Acta Inf. 28(7):1991;697-701.
7. J.F. Canny, E. Kaltofen, Y. Lakshman, Solving systems of non-linear polynomial equations faster, Proc. ACM-SIGSAM Int. Symp. on Symb. and Alg. Comp. (ISSAC'89), ACM Press, New York, 1989, pp. 121-128.
8. Donoghue W.F. Monotone Matrix Functions and Analytic Continuation. 1974;Springer, Berlin.
9. Demillo R.A., Lipton R.J. A probabilistic remark on algebraic program testing. Inform. Process. Lett. 7(4):1978;193-195.
10. Fink T., Heinig G., Rost K. An inversion formula and fast algorithm for Cauchy-Vandermonde matrices. Linear Algebra Appl. 183:1993;179-191.
11. Gautschi W. Norm estimates for the inverses of Vandermonde matrices. Numer. Math. 23:1975;337-347.
12. W. Gautschi, How (un)stable are Vandermonde systems? in: R. Wong (Ed.), Proceedings of the International Symposium on Asymptotic and Computational Analysis: Conference in Honor Frank W.J. Olver's 65th Birthday. Lecture Notes in Pure and Applied Mathematics, vol. 124, Marcel-Decker, New York, pp. 193-210.
13. Gastinel N. Inversion d'une matrice generalisant la matrice de Hilbert. Chiffres. 3:1960;149-152.
14. Gerasoulis A. A fast algorithm for the multiplication of generalized Hilbert matrices with vectors. Math. Comp. 50(181):1987;179-188.
15. Gohberg I., Kailath T., Koltracht I. Efficient solution of linear systems of equations with recursive structure. Linear Algebra Appl. 80:1986;81-113.
16. Gohberg I., Kailath T., Koltracht I., Lancaster P. Linear complexity parallel algorithms for linear systems of equations with recursive structure. Linear Algebra Appl. 88/89:1987;271-315.
17. Gohberg I., Kailath T., Olshevsky V. Fast Gausian elimination with partial pivoting for matrices with displacement structure. Math. Comp. 64:1995;1557-1576.
18. G.H. Golub, C.F. Van Loan, Matrix Computations, Johns Hopkins University Press, Baltimore, MD, 1989 (second ed.), 1996 (third ed.).
19. Gohberg I., Olshevsky V. Complexity of multiplication with vectors for structured matrices. Linear Algebra Appl. 202:1994;163-192.
20. Gohberg I., Olshevsky V. Fast algorithms with preprocessing for matrix-vector multiplication problems. J. Complexity. 10(4):1994;411-427.
21. Gohberg I., Olshevsky V. Fast state space algorithms for matrix Nehari and Nehari-Takagi interpolation problems. Integral Equations Operator Theory. 20(1):1994;44-83.
22. I. Gohberg, V. Olshevsky, Fast inversion of Vandermonde and Vandermonde-like matrices, in: A. Paulraj, V. Roychowdhury, C. Shaper (Eds.), Communications, Computation, Control and Signal Processing: A Tribute to Thomas Kailath, Kluwer Academic Publisher, Dordrecht, 1996, pp. 205-221.
23. Greengard L., Rokhlin V. A fast algorithm for particle simulation. J. Comput. Phys. 73(2):1987;325-348.
24. Higham N.J. Fast solution of Vandermonde-like systems involving orthogonal polynomials. IMAJ. Numer. Anal. 8:1988;473-486.
25. Higham N.J. Stability analysis of algorithm for solving confluent Vandermonde-like systems. SIAM J. Matrix Anal. Appl. 11:1990;23-41.
26. G.Heinig, InversionofgeneralizedCauchymatricesandtheotherclassesofstructuredmatrices, LinearAlgebraforSignalProcessing,IMAVolumeinMathematicsanditsApplications,vol. 69, Springer, Berlin, 1995, pp. 95-114.
27. H. Heinig, K. Rost, Algebraic methods for Toeplitz-like matrices and operators, Operator Theory, vol. 13, Birkhäuser, Basel, 1984.
28. E. Kaltofen, Asymptotically fast solution of Toeplitz-like singular linear systems, Proc. ACM-SIGSAM Intern. Symp. on Symbolic and Alg. Comp., ACM Press, New York, 1994, pp. 297-304.
29. Kaltofen E. Analysis of Coppersmith's block Wiedemann algorithm for the parallel solution of sparse linear systems. Math. Comp. 64(210):1995;777-806.
30. Kailath T., Kung S.Y., Morf M. Displacement ranks of matrices and linear equations. J. Math. Anal. Appl. 68(2):1979;395-407.
31. E. Kaltofen, B.D. Saunders, On Wiedemann's method for solving sparse linear systems, Proc. AAECC-5, Lecture Notes in Computer Science, vol. 536, Springer, Berlin, 1991, pp. 29-38.
32. Lu H. Fast solution of confluent Vandermonde linear systems. SIAM J. Matrix Anal. Appl. 15(4):1994;1277-1289.
33. Lu H. Fast algorithms for confluent Vandermonde linear systems and generalized Trummer's problem. SIAM J. Matrix Anal. Appl. 16(2):1995;655-674.
34. Lu H. Solution of Vandermonde-like systems and confluent Vandermonde-like systems. SIAMJ. Matrix Anal. Appl. 17(1):1996;127-138.
35. M. Morf, Fast algorithms for multivariable systems, Ph.D. Thesis, Department of Electrical Engineering, Stanford University, Stanford, CA, 1974.
36. B. Mourrain, V.Y. Pan, Multivariate polynomials, duality and structured matrices, J. Complexity 16 (1) 2000.
37. M. Morf, Doubling algorithms for Toeplitz and related equations, in: Proceedings of the IEEE International Conference on ASSP, IEEE Computer Society Press, Silver Spring, MD, 1980, pp. 954-959.
38. V. Olshevsky, V.Y. Pan, A unified superfast algorithm for boundary rational tangential interpolation problem and for inversion and factorization of dense structured matrices, in: Proceedings of the 39th Annual IEEE Symposium on Foundations of Computer Science, IEEE Computer Society Press, Silver Spring, MD, October 1998, pp. 192-201.
39. V. Olshevsky, V.Y. Pan, Polynomial and rational interpolation and multipoint evaluation (with structured matrices), in: Proceedings of the 26th International Colloquium on Automata, Languages and Programming (ICALP'99), Lecture Notes in Computer Science, vol. 1644, Springer, Berlin, 1999, pp. 585-594.
40. V. Olshevsky, M.A. Shokrollahi, A displacement approach to efficient decoding of algebraic-geometric codes, in: Proceedings of the 31st Annual Symposium on Theory of Computing, ACM Press, New York, May 1999, 235-244.
41. V.Y. Pan, On computations with dense structured matrices, Proc. ACM-SIGSAM Intern. Symp. on Symbolic and Alg. Comp., ACM Press, New York, 1989, pp. 34-42. Math. Comp. 55 (191) (1990) 179-190.
42. V.Y. Pan, On computations with dense structured matrices, Proc. ACM-SIGSAM Intern. Symp. on Symbolic and Alg. Comp., ACM Press, New York, 1989, pp. 34-42. Math. Comp. 55 (191) (1990) 179-190.
43. V.Y. Pan, Parametrization of Newton's iteration for computations with structured matrices and applications, Comput. Math. (with Appl.) 24 (3) (1992) 61-75.
44. Pan V.Y. Decreasing the displacement rank of a matrix. SIAM J. Matrix Anal. Appl. 14(1):1993;118-121.
45. V.Y. Pan, A unified superfast divide-and-conquer algorithm for structured matrices, MSRI Preprint 1999-033, Mathematical Sciences Research Institute, Berkeley, CA, April 1999.
46. V.Y. Pan, Nearly optimal computations with structured matrices, in: Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'2000), ACM Press, New York, and SIAM Publications, Philadelphia, PA, 2000, pp. 953-962.
47. V.Y. Pan, M. Abu Tabanjeh, Z. Chen, E. Landowne, A. Sadikou, New transformations of Cauchy matrices and Trummer's problem, Comput. Math. (with Applications) 35 (12) (1998) 1-5.
48. V.Y. Pan, M. Abu Tabanjeh, Z. Chen, S. Providence, A. Sadikou, Transformations of Cauchy matrices for Trummer's problem and a Cauchy-like linear solver, in: A. Ferreria, J. Rolim, H. Simon, S.-H. Teng (Eds.), Proceedings of the Fifth Annual International Symposium on Solving Irregularly Structured Problems in Parallel (Irregular 98), Lecture Notes in Computer Science, vol. 1457, Springer, Berlin, August 1998, pp. 274-284.
49. V.Y. Pan, A. Zheng, M. Abu Tabanjeh, Z. Chen, S. Providence, Superfast computations with singular structured matrices over abstract fields, in: V.G. Ganzha, E.W. Mayr, E.V. Vorontsov (Eds.), Proceedings of the Second Workshop on Computer Algebra in Scientific Computing (CASC-99), Springer, Berlin, May 1999, pp. 323-338.
50. Reichel L. A matrix problem with application to rapid solution of integral equations. SIAM J. Sci. Statist. Comput. 11:1990;263-280.
51. Rokhlin F. Rapid solution of integral equations of classical potential theory. J. Comput. Phys. 60:1985;187-207.
52. Schwartz J.T. Fast probabilistic algorithms for verification of polynomial identities. J. ACM. 27(4):1980;701-717.
53. Strassen V. Gaussian elimination is not optimal. Numer. Math. 13:1969;354-356.
54. Trummer M. An efficient implementation of a conformal mapping method using the Szegö kernel. SIAM J. Numer. Anal. 23:1986;853-872.
55. R.Z. Zippel, Probabilistic Algorithm for Sparse Polynominals, Proc. EUROSAM 79, Lecture Notes in Computer Science, vol. 72, Springer, Berlin, 1979, pp. 216-226.