Abstract
Let Z be a set of integers and Z n×n be a ring for any integer n. We define \({\hat{s}}\in \mathbf{Z}^{n}\) as a latter point. Hom(Z n,Z m) denotes as a homomorphism of Z n into Z m. For any element \({\hat{q}}\) in Z n, we define S+T:Z n→Z m as \((S+T)({\hat{q}})=S({\hat{q}})+T({\hat{q}})\) . As a result, S+T become a homomorphism of Z n into Z m. We also define kU:Z n→Z m as \((kU)({\hat{q}})=k(U({\hat{q}}))\) . Consequently, kU become a homomorphism of Z n into Z m. Moreover, Hom (Z n,Z m) is isomorphic to Z n×m. A novel class of the structured matrices which is a set of elements of Hom (Z n,Z n) over a ring of integers with a displacement structure, referred to as a C-Cauchy-like matrix, will be formulated and presented.
Using the displacement approach, which was originally discovered by Kailath, Kung, and Morf (J. Math. Anal. Appl. 68:395–407, 1979), a new superfast algorithm for the multiplication of a C-Cauchy-like matrix of the size n×n over a field with a vector will be designed. The memory space for storing a C-Cauchy-like matrix of the size n×n over a field is O(n) versus O(n 2) for a general matrix of the size n×n over a field. The arithmetic operations of a product of a C-Cauchy-like matrix and a vector is reduced dramatically to O(n) from O(n 2), which can be used to transform a latter point \({\hat{s}}\in Z^{n}\) to another latter point \({\hat{t}}\in Z^{n}\) such that \({\hat{t}}=C{\hat{s}}\) .
Moreover, the displacement structure can also be extended to a Kronecker matrix W ⊗ Z. A new class of the Kronecker-like matrices with the displacement rank r, r<n will be also discovered. The memory space for storing a Kronecker-like matrix of the size (n×1)⊗(1×n) over a field is decreased to O(rn). The arithmetic operations for a product of a Kronecker-like matrix with the displacement rank r and a vector is also accelerated to O(rn).
Similar content being viewed by others
References
Bini D, Pan VY (1994) Fundamental Algorithms. Polynomial and matrix computations, vol 1. Birkhaeuser, Boston
Bitmead RR, Anderson BDO (1980) Asymptotically fast solution of Toeplitz and related systems of linear equations. Linear Algebra Appl 34:103–116
Cauchy AL (1841) Mémorie sur les fonctions alternées et sur les somme alternées. Exerc d’Anal Phys Math II:151–159
Chen Z (2003) A new class of structured matrices. In: Arabnia H, Mun Y (eds) Proceedings the 2003 international conference on parallel and distributed processing techniques and applications. CSREA Press, pp 379–384
Chen Z (2006) New approach to a class of matrices. In: Arabnia H (ed) Proceedings of the 2006 international conference on foundations of computer science. CSREA Press, pp 133–139
Chen Z, Pan V (2004) An efficient solution for Cauchy-like systems of linear equations. Comput Math Appl 48:529–537
Chun J, Kailath T, Lev-Ari H (1987) Fast parallel algorithm for QR-factorization of structured matrices. SIAM J Sci Stat Comput 8(6):899–913
Donoghue WF (1974) Monotone matrix functions and analytic continuation. Springer, Berlin
Gerasoulis A (1987) A fast algorithm for the multiplication of generalized Hilbert matrices with vectors. Math Comput 50(181):179–188
Golub GH, Van Loan CF (1996) Matrix computations, 3rd edn. Johns Hopkins Univ Press, Baltimore
Gohberg I, Olshevsky V (1994) Complexity of multiplication with vectors for structured matrices. Linear Algebra Appl 202:163–192
Gohberg I, Olshevsky V (1994) Fast algorithms with preprocessing for matrix—vector multiplication problems. J Complex 10(4):411–427
Gohberg I, Olshevsky V (1994) Fast state space algorithms for matrix Nehari and Nehari–Takagi interpolation problems. Integral Equ Oper Theory 20(1):44–83
Gohberg I, Kailath T, Koltracht I (1986) Efficient solution of linear systems of equations with recursive structure. Linear Algebra Appl 80:81–113
Gohberg I, Kailath T, Olshevsky V (1995) Fast Gausian elimination with partial pivoting for matrices with displacement structure. Math Comput 64:1557–1576
Graham A (1981) Kronecker products and matrix calculus with applications. Wiley, New York
Heinig G (1994) Inversion of generalized Cauchy matrices and the other classes of structured matrices. In: Linear algebra for signal processing. IMA volume in math and its applications, vol 69. Springer, Berlin, pp 95–114
Heinig H, Rost K (1984) Algebraic methods for Toeplitz-like matrices and operators. Operator Theory, vol 13. Birkhaeuser, Boston
Kailath T, Sayed A (eds) (1999) Fast reliable algorithms for matrices with structure. SIAM Publications, Philadelphia
Kailath T, Viera A, Morf M (1978) Inverses of Toeplitz operators, innovations, and orthogonal polynomials. SIAM Rev 20(1):106–119
Kailath T, Kung S, Morf M (1979) Displacement ranks of matrices and linear equations. J Math Anal Appl 68:395–407
Morf M (1974) Fast algorithms for multivariable systems. PhD Thesis, Department of Electrical Engineering, Stanford University, Stanford, CA
Morf M (1980) Doubling algorithms for Toeplitz and related equations. In: Proc IEEE int conf on ASSP. IEEE Comput Soc Press, Los Alamitos, pp 954–959
Olshevsky V, Pan VY (1998) A unified superfast algorithm for boundary rational tangential interpolation problem. In: Proc 39th ann IEEE symp foundations of comp sci. IEEE Comput Soc Press, Los Alamitos, pp 192–201
Olshevsky V, Pan VY (1999) Polynomial and rational evaluation and interpolation (with structured matrices). In: Proc 26th ann int colloq on automata, languages, programming (ICALP’99). Lecture notes in computer science. Springer, Berlin
Olshevsky V, Shokrollahi MA (1999) A displacement approach to efficient decoding of algebraic-geometric codes. In: Proc 31st ann symp on theory of computing. ACM Press, New York, pp 235–244
Olshevsky V, Shokrollahi A (2000) Matrix-vector product for confluent Cauchy-like matrices with application to confluent rational interpolation. In: Proc of the thirty second ACM symposium on theory of computing (STOC’00). ACM Press, New York, pp 573–581
Pan VY (1989) Fast and efficient parallel evaluation of the zeros of a polynomial having only real zeros. Comput Math Appl 17(11):1475–1480
Pan VY (1990) Computations with dense structured matrices. Math Comput 55:179–190
Pan VY (1992) Complexity of computations with matrices and polynomials. SIAM Rev 34(2):225–262
Pan VY (2000) Nearly optimal computations with structured matrices. Accepted by SODA
Pan VY, Zheng A (2000) Superfast algorithms for Cauchy-like matrix computations and extensions. Linear Algebra Appl 310(13):83–108
Pan VY, Sadikou A, Landowne E, Tiga O (1993) A new approach to fast polynomial interpolation and multipoint evaluation. Comput Math Appl 25(9):25–30
Pan VY, Zheng A, Huang X, Yu Y (1997) Fast multipoint polynomial evaluation and interpolation via computations with structured matrices. Ann Numer Math 4:483–510
Pan VY, AbuTabanjeh M, Chen Z, Landowne E, Sadikou A (1998) New transformations of Cauchy matrices and Trummer’s problem. Comput Math Appl 35(12):1–5
Pan VY, AbuTabanjeh M, Chen Z, Providence S, Sadikou A (1998) Transformations of Cauchy matrices for Trummer’s problem and a Cauchy-like linear solver. In: Ferreira A, Rolim J, Simon H, Teng S-H (eds) Proc of 5th annual international symposium on solving irregularly structured problems in parallel (Irregular98). Lecture notes in computer science, vol 1457. Springer, Berlin, pp 274–284
Pan VY, Zheng A, AbuTabanjeh M, Chen Z, Providence S (1999) Superfast computations with singular structured matrices over abstract fields. In: Ganzha VG, Mayr EW, Vorontsov EV (eds) Proc 2rd workshop on computer algebra in scientific computing (CASC’99). Springer, Berlin, pp 323–338
Reichel L (1990) A matrix problem with application to rapid solution of integral equations. SIAM J Sci Stat Comput 11:263–280
Rokhlin F (1985) Rapid solution of integral equations of classical potential theory. J Comput Phys 60:187–207
Trummer M (1986) An efficient implementation of a conformal mapping method using the Szegö kernel. SIAM J Numer Anal 23:853–872
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Chen, Z. Mapping computations. J Supercomput 48, 152–162 (2009). https://doi.org/10.1007/s11227-008-0209-x
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11227-008-0209-x