IDEAS home Printed from https://ideas.repec.org/p/sce/scecf0/153.html
   My bibliography  Save this paper

Rank Test Based Matrix Perturbation Theory

Author

Listed:
  • Zaka Ratsmalahelo

    (University of Franche-Comt)

Abstract

Establishing the rank of a matrix is an important problem in a wide variety of econometric and statistical contexts that includes the classical identification problem in linear simultaneous equation models, determining the rank of demand systems, the order of lag polynomials in ARMA models, and the composition of factor models. In an important paper, Gill and Lewbel (1992) introduce a rank test based on the Lower-Diagonal-Upper triangular (LDU) decomposition. Unfortunately, the asymptotic distribution given for this test statistic is incorrect except in a limited special case. Cragg and Donald (1996) provides an appropriate modification of the LDU decomposition.This paper proposes another means for determining the rank of a matrix. We consider a rank test for a matrix for which a root-n consistent estimator is available whose limiting (normal) distribution's variance matrix may be of either unknown or less than full rank. The test statistic is based on certain estimated singular values. Using Matrix Perturbation Theory, we determine that the asymptotic distribution of the test statistic is chi-squared. The test has certain advantages over standard tests in being easier to compute and not requiring knowledge of the rank of the limiting variance matrix of the root-n consistent estimator. Simulation evidence is given for this test and its performance is compared with that of the LDU test modified.

Suggested Citation

  • Zaka Ratsmalahelo, 2000. "Rank Test Based Matrix Perturbation Theory," Computing in Economics and Finance 2000 153, Society for Computational Economics.
  • Handle: RePEc:sce:scecf0:153
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:sce:scecf0:153. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Christopher F. Baum (email available below). General contact details of provider: https://edirc.repec.org/data/sceeeea.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.