Computing Isotypic Projections with the Lanczos Iteration
نویسندگان
چکیده
When the isotypic subspaces of a representation are viewed as the eigenspaces of a symmetric linear transformation, isotypic projections may be achieved as eigenspace projections and computed using the Lanczos iteration. In this paper, we show how this approach gives rise to an efficient isotypic projection method for permutation representations of distance transitive graphs and the symmetric group.
منابع مشابه
An Eigenspace Approach to Decomposing Representations of Finite Groups
The first half of this thesis develops an eigenspace approach to computing the basisindependent isotypic decomposition of a vector in a representation of a finite group. The approach takes advantage of well-chosen diagonalizable linear transformations to compute isotypic projections through a series of eigenspace projections, and at its heart is an efficient eigenspace projection method built a...
متن کاملEfficient Computation of the Maximum Eigenvalue of Large Symmetric Matrices
Though the implicitly restarted Arnoldi/Lanczos method in ARPACK is a reliable method for computing a few eigenvalues of large-scale matrices, it can be inefficient because it only checks for convergence at restarts. Significant savings in runtime can be obtained by checking convergence at each Lanczos iteration. We describe a new convergence test for the maximum eigenvalue that is numerically ...
متن کاملSuperlinear Convergence Rates for the Lanczos Method Applied to Elliptic Operators
This paper investigates the convergence of the Lanczos method for computing the smallest eigenpair of a selfadjoint elliptic diierential operator via inverse iteration (without shifts). Superlinear convergence rates are established, and their sharpness is investigated for a simple model problem. These results are illustrated numerically for a more diicult problem.
متن کاملA Block Lanczos with Warm Start Technique for Accelerating Nuclear Norm Minimization Algorithms
Recent years have witnessed the popularity of using rank minimization as a regularizer for various signal processing and machine learning problems. As rank minimization problems are often converted to nuclear norm minimization (NNM) problems, they have to be solved iteratively and each iteration requires computing a singular value decomposition (SVD). Therefore, their solution suffers from the ...
متن کاملThe Radau-Lanczos Method for Matrix Functions
Analysis and development of restarted Krylov subspace methods for computing f(A)b have proliferated in recent years. We present an acceleration technique for such methods when applied to Stieltjes functions f and Hermitian positive definite matrices A. This technique is based on a rank-one modification of the Lanczos matrix derived from a connection between the Lanczos process and Gauss–Radau q...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- SIAM J. Matrix Analysis Applications
دوره 25 شماره
صفحات -
تاریخ انتشار 2003