Sparse generalized Fourier transforms
- 61 Downloads
Block-diagonalization of sparse equivariant discretization matrices is studied. Such matrices typically arise when partial differential equations that evolve in symmetric geometries are discretized via the finite element method or via finite differences.
By considering sparse equivariant matrices as equivariant graphs, we identify a condition for when block-diagonalization via a sparse variant of a generalized Fourier transform (GFT) becomes particularly simple and fast.
Characterizations for finite element triangulations of a symmetric domain are given, and formulas for assembling the block-diagonalized matrix directly are presented. It is emphasized that the GFT preserves symmetric (Hermitian) properties of an equivariant matrix.
By simulating the heat equation at the surface of a sphere discretized by an icosahedral grid, it is demonstrated that the block-diagonalization is beneficial. The gain is significant for a direct method, and modest for an iterative method.
A comparison with a block-diagonalization approach based upon the continuous formulation is made. It is found that the sparse GFT method is an appropriate way to discretize the resulting continuous subsystems, since the spectrum and the symmetry are preserved.
Key wordsnon commutative Fourier analysis block-diagonalization equivariant operators sparse matrices finite differences finite elements
Unable to display preview. Download preview PDF.
- 1.K. Åhlander, Supporting tensor symmetries in EinSum, Comput. Math. Appl., 45 (2003), pp. 789–803. Also available as Technical Report 212 from Dept. of Informatics, University of Bergen.Google Scholar
- 2.K. Åhlander and H. Munthe-Kaas, Applications of the generalized Fourier transform in numerical linear algebra, BIT Numerical Mathematics, (2005), pp. 819–850. Also available as Technical Report 2004-029, Dept. of Information Technology, Uppsala University.Google Scholar
- 5.E. L. Allgower and K. Georg, Numerical exploitation of symmetric structures in BEM, in Boundary Integral Methods – Numerical and Mathematical Aspects, M. Golberg, ed., pp. 289–306, Computational Mechanics Publications, Southampton, 1998.Google Scholar
- 6.E. L. Allgower, K. Georg, and R. Miranda, Exploiting permutation symmetry with fixed points in linear equations, in Lectures in Applied Mathematics, E. L. Allgower, K. Georg, and R. Miranda, eds., vol. 29, pp. 23–36, American Mathematical Society, Providence, RI, 1993.Google Scholar
- 10.S. C. Brenner and L. R. Scott, The Mathematical Theory of Finite Element Methods, vol. 15 of Texts in Applied Mathematics, 2nd ed., Springer, New York, 2002.Google Scholar
- 13.G. Golub and C. van Loan, Matrix Computations, The John Hopkins University Press, Baltimore, MD, 1984.Google Scholar
- 14.D. Henriksson, Exploiting Symmetries when Solving the Heat Equation on a Spherical Icosahedral Grid, Master’s thesis, Uppsala University, Uppsala, Sweden, 2006.Google Scholar
- 15.C. Johnsson, Numerical solution of partial differential equations by the finite element method, Studentlitteratur, Lund, 1987.Google Scholar
- 16.E. Larsson, K. Åhlander, and A. Hall, Multi-dimensional option pricing using radial basis functions and the generalized Fourier transform, Techn. Rep. 2006-037, Department of Information Technology, Uppsala University, 2006.Google Scholar
- 18.D. K. Maslen and D. N. Rockmore, Generalized FFTs – a survey of some recent results, in Proceedings of the 1995 DIMACS Workshop on Groups and Computation, L. Finkelstein and W. Kantor, eds., June 1997, pp. 183–237, American Mathematical Society, Providence, RIGoogle Scholar
- 19.T. Minkwitz, Algorithms explained by symmetry, in Lect. Notes Comput. Sci., vol. 900, pp. 157–167, Springer, Berlin, Heidelberg, 1995.Google Scholar
- 21.C. C. Paige and M. A. Saunders, Minres: Sparse symmetric equations, http://www.stanford.edu/group/SOL/software/minres.html.Google Scholar
- 24.A. Trønnes, Symmetries and Generalized Fourier Transforms Applied to Computing the Matrix Exponential, Master’s thesis, University of Bergen, Bergen, Norway, 2005.Google Scholar