<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<item>
  <id>02135284</id>
  <dt>j</dt>
  <an>02135284</an>
  <augroup>
    <au>Maslen, David K.</au>
    <au>Orrison, Michael E.</au>
    <au>Rockmore, Daniel N.</au>
  </augroup>
  <ti>Computing isotypic projections with the Lanczos iteration.</ti>
  <so>SIAM J. Matrix Anal. Appl. 25, No. 3, 784-803 (2004).</so>
  <py>2004</py>
  <pu>Society for Industrial and Applied Mathematics (SIAM), Philadelphia, PA</pu>
  <lagroup>
    <la>EN</la>
  </lagroup>
  <ccgroup>
  </ccgroup>
  <utgroup>
    <ut>isotypic projection</ut>
    <ut>Lanczos iteration</ut>
    <ut>separating set</ut>
    <ut>distance transitive graphs</ut>
    <ut>symmetric groups</ut>
  </utgroup>
  <cigroup>
  </cigroup>
  <ligroup>
    <li>doi:10.1137/S0895479801399778</li>
  </ligroup>
  <abgroup>
    <ab>The authors show how the Lanczos iteration give rise to an efficient method for computing projections onto isotypic subspaces when the number of subspaces is relatively small. The method is applied for permutation representations of distance transitive graphs and symmetric groups.</ab>
    <rv>Constantin Popa (Constanta)</rv>
  </abgroup>
</item>