Article

Fast inversion of Chebyshev-Vandermonde matrices

Numerische Mathematik (Impact Factor: 1.33). 08/1995; DOI: 10.1007/s002110050018
Source: CiteSeer

ABSTRACT This paper contains two fast algorithms for inversion of Chebyshev-- Vandermonde matrices of the first and second kind. They are based on special representations of the Bezoutians of Chebyshev polynomials of both kinds. The paper also contains the results of numerical experiments which show that the algorithms proposed here are not only much faster, but also more stable than other algorithms available. It is also efficient to use the above two algorithms for solving Chebyshev--Vandermode systems of equations with preprocessing.

0 Bookmarks
 · 
72 Views
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: We use the language of signal flow graph representation of digital filter structures to solve three purely mathematical problems, including fast inversion of certain polynomial-Vandermonde matrices, deriving an analogue of the Horner and Clenshaw rules for polynomial evaluation in a (H,m)-quasiseparable basis, and computation of eigenvectors of (H,m)-quasiseparable classes of matrices. While algebraic derivations are possible, using elementary operations (specifically, flow reversal) on signal flow graphs provides a unified derivation, reveals connections with systems theory, etc.
    Linear Algebra and Its Applications - LINEAR ALGEBRA APPL. 01/2010; 432(8):2032-2051.
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: Cryptography protects users by providing functionality for the encryption of data and authentication of other users. This technology lets the receiver of an electronic message verify the sender, ensures that a message can be read only by the intended person, and assures the recipient that a message has not be altered in transit. Classical cryptanalysis involves an interesting combination of analytical reasoning, application of mathematical tools and pattern finding. The objectives of the proposed work are to propose a new cryptographic method based on the special matrix called the Hilbert matrix for authentication and confidentiality and to propose a model for confidentiality and authentication using shared key cryptosystems with the concept of digital enveloping using a session key. In the present work various algorithms are presented for encryption and authentication based on Hilbert matrix using a session key.
    10/2011;
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: Cryptography is the science of using mathematics to encrypt and decrypt data. Cryptography enables you to store sensitive information or transmit it across insecure networks so that it cannot be read by anyone except the intended recipient. While cryptography is the science of securing data, cryptanalysis is the science of analyzing and breaking secure communication. Classical cryptanalysis involves an interesting combination of analytical reasoning, application of mathematical tools and pattern finding. The objectives of the proposed work are to propose a new cryptographic method based on the special matrix called the Hilbert matrix for authentication and confidentiality and to propose a model for confidentiality and authentication using a combination of symmetric and public cryptosystems. Further, it is extended to shared key cryptosystems with the concept of digital enveloping using a session key. In the present work an algorithm for shared key encryption is developed using Hilbert matrix cryptosystem. In this the block chaining modes of operation have been used to tackle the issues of confusion and diffusion.
    10/2011;

Full-text

View
0 Downloads
Available from