Abstract
We derive new algorithms for solving strongly nonsingular Cauchy-like systems of linear equations \(C\tilde x = \tilde v{\kern 1pt} in{\kern 1pt} O(n{\log ^2}n)\) running time, where F is a field and \(\tilde v \in {F^{n \times 1}}\) is a vector, C ∈ F n×n is a strongly nonsingular Cauchy-like matrix. Morf, Bitmead and Anderson presented the efficient algorithms to solve strongly nonsingular Toeplitz-like equations of linear systems by using the Recursive Triangular Factorization in 1980. Recently, Pan and Zheng extended the Recursive Triangular Factorization to solve Cauchy-like systems with the complexity of O(n log3 n) operations. This is the best known complexity bound by using the direct approach of Recursive Triangular Factorization in Cauchy-like cases. However, these algorithms are still slower than the well known algorithms with the asymptotic bound of O(n log2 n) operations, which have been proposed by the means of reducing Cauchy-like matrices into Toeplitz-like matrices. In our present paper, we will modify the Recursive Triangular Factorization so that the complexity bound of the direct recursive approach can be decreased to O(n log2 n)operations. This matches the asymptotic bound without transforming to Toeplitzlike matrices. Our improvement of the direct recursive approach is by a factor off log n due to changing the original vectors which expressed in the given Cauchy-like matrix into the special vectors, where the entries are unit roots. The applications of structured matrices include Nevanlinna-Pick tangential interpolation problems.
Supported by PSC CUNY Awards 62835-00-31, NYCTC1 and NYCLSAMP.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
D. Bini, V. Y. Pan, (1994), Polynomial and Matrix Computations, v. 1: Fundamental Algorithms, Birkhaeuser, Boston.
R. R. Bitmead, B. D. O. Anderson, (1980), Asymptotically Fast Solution of Toeplitz and Related Systems of Linear Equations, Linear Algebra Appl., 34, 103–116.
A. L. Cauchy, (1841), Mémorie sur les Fonctions Alternées et sur les Somme Alternées, Exercises d’ Analyse et de Phys. Math., II, 151–159.
W.F. Donoghue, (1974), Monotone Matrix Functions and Analytic Continuation, Springer, Berlin.
W. Gautschi, (1975), Norm Estimates for the Inverses of Vandermonde Matrices, Numer. Math., 23, 337–347.
I. Gohberg, V. Olshevsky, (1994), Fast state space algorithms for matrix Nehari and Nehari-Takagi interpolation problems, Integral Equations and Operator Theory, 20, 1, 44–83.
I. Gohberg, V. Olshevsky, (1994), Complexity of Multiplication with Vectors for Structured Matrices, Linear Algebra Appl., 202, 163–192.
I. Gohberg, V. Olshevsky, (1994), Fast Algorithms with Preprocessing for Matrix-Vector Multiplication Problems, J. of Complexity, 10, 4, 411–427.
I. Gohberg, T. Kailath, V. Olshevsky, (1995), Fast Gausian Elimination with Partial Pivoting for Matrices with Displacement Structure, Math. of Computation, 64, 1557–1576.
G. Heinig, (1995), Inversion of Generalized Cauchy Matrices and the Other Classes of Structured Matrices, Linear Algebra for Signal Processing, IMA Volume in Math. and Its Applications, 69, 95–114, Springer.
T. Kailath, A. Viera, and M. Morf, (1978), Inverses of Toeplitz Operators, Innovations, and Orthogonal Polynomials, SIAM Review, 20, 1, pp. 106–119.
T. Kailath, A. Sayed (editors), (1999), Fast Reliable Algorithms for Matrices with Structure, SIAM Publications, Philadelphia.
M. Morf, (1980), Doubling Algorithms for Toeplitz and Related Equations, Proc. IEEE Internat. Conf. on ASSP, 954–959, IEEE Computer Society Press.
V. Olshevsky, V. Y. Pan, (1998), A Unified Superfast Algorithm for Boundary Rational Tangential Interpolation Problem, Proc. 39th Ann. IEEE Symp. Foundations of Comp. Sci.,192–201, IEEE Comp. Soc. Press.
V. Olshevsky, V. Y. Pan, (1999), Polynomial and Rational Evaluation and Interpolation (with Structured Matrices), Proc. 26th Ann. Intern. Colloq. on Automata, Languages, Programming (ICALP’99), Lecture Notes in Computer Science, Springer.
V. Olshevsky, M. A. Shokrollahi, (1999), A Displacement Approach to Efficient Decoding of Algebraic-Geometric Codes, Proc. 31st Ann. Symp. on Theory of Computing, 235–244, ACM Press, New York.
V. Y. Pan, M. AbuTabanjeh, Z. Chen, S. Providence, A. Sadikou, (1998), Transformations of Cauchy Matrices for Trummer’s Problem and a Cauchy-like Linear Solver, Proc. of 5th Annual International Symposium on Solving Irregularly Structured Problems in Parallel, (Irregular98), (A. Ferreira, J. Rolim, H. Simon, S.-H. Teng Editors), Lecture Notes in Computer Science, 1457, 274–284, Springer.
V. Y. Pan, M. AbuTabanjeh, Z. Chen, E. Landowne, A. Sadikou, (1998), New Transformations of Cauchy Matrices and Trummer’s Problem, Computers and Math. (with Applics.), 35, 12, 1–5.
V. Y. Pan, A. Sadikou, E. Landowne, O. Tiga, (1993), A New Approach to Fast Polynomial Interpolation and Multipoint Evaluation, Computers 6 Math. (with Applications), 25, 9, 25–30.
V. Y. Pan, A. Zheng, (2000), Superfast algorithms for Cauchy-like matrix computations and extensions. Linear Algebra Appl. 310, no. 1–3, 83–108.
V. Y. Pan, A. Zheng, M. Abutabanjeh, Z. Chen, S. Providence, (1999), Superfast Computations with Singular Structured Matrices over Abstract Fields, Proc. 2rd Workshop on Computer Algebra in Scientific Computing (CASC’99), (V. G. Ganzha, E. W. Mayr, and E. V. Vorontsov, Editors), 323–338, Springer, Berlin.
V. Y. Pan, A. Zheng, X. Huang, Y. Yu, (1997), Fast Multipoint Polynomial Evaluation and Interpolation via Computations with Structured Matrices, Annals of Numerical Math., 4, 483–510.
L. Reichel, (1990), A Matrix Problem with Application to Rapid Solution of Integral Equations, SIAM J. on Scientific and Stat. Computing, 11, 263–280.
F. Rokhlin, (1985), Rapid Solution of Integral Equations of Classical Potential Theory, J. Comput. Physics, 60, 187–207.
M. Trummer, (1986), An Efficient Implementation of a Conformal Mapping Method Using the Szegö Kernel, SIAM J. on Numerical Analysis, 23, 853–872.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer Science+Business Media New York
About this chapter
Cite this chapter
Chen, Z. (2002). A Modified Recursive Triangular Factorization for Cauchy-Like Systems. In: Baeza-Yates, R., Montanari, U., Santoro, N. (eds) Foundations of Information Technology in the Era of Network and Mobile Computing. IFIP — The International Federation for Information Processing, vol 96. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-35608-2_12
Download citation
DOI: https://doi.org/10.1007/978-0-387-35608-2_12
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4757-5275-5
Online ISBN: 978-0-387-35608-2
eBook Packages: Springer Book Archive