## Operator compression preserving lowest energy eigenspace.

### Remember to vote up questions/answers you find interesting or helpful (requires 15 reputation points)

I have a large ($10^6$ by $10^6$) sparse ($0.4$% nonzero) hermitian matrix $H$ arising from the discretization of an elliptic PDE. I would like to approximate $H$ with a smaller matrix $H'$ in such a way that $H'$ and $H$ have nearly identical eigenvectors and eigenvalues for the lowest 5 or 6 eigenvalues.

This could be done if I knew the lowest eigenvectors of $H$ as I could simply restrict $H$ to the space spanned by these values. However I would like to be able to find an approximation before solving eigenvalue problem (in fact my eventual goal is to make solving the eigenvalue problem more efficient).

I know of the recent work on approximating SDD systems with graph sparsification as well as multilevel operator compression. What else is out there?

The application is a full-CI treatment of a multiparticle quantum system.

-

## 1 Answer

Isn't this what the Lanczos algorithm was designed for? http://en.wikipedia.org/wiki/Lanczos_algorithm

-
Sorta, but that's not what I want here. I am trying to compress the operator without first computing an invariant subspace. It would be great if one could identify which entries of the matrix contribute most to the eigenvectors without explicitly forming the matrix (it's about 90GB in RAM). If you think this sounds crazy that makes two of us. Ideally my advisor would be the third but no luck there. – rcompton May 6 2011 at 4:39

1
You do not need to form the matrix to run Lanczos, you just need a "black-box" function that computes $Av$ given a vector $v$. If you cannot even do this efficiently, please specify how you can interact with the matrix, or which special structure it has. – Federico Poloni May 6 2011 at 7:03
Yes, you only need to form $Av$ to do Lanczos. My matrix is exactly this $\mathbb{H}$: en.wikipedia.org/wiki/Configuration_interaction . I would like it to be smaller while still preserving the lowest energy states. A similar problem arises in finite element simulations. Consider coarsening the discretization in certain regions in order to work with a smaller stiffness matrix. Normally this is done using geometric intuition but in my problem the space is high dimensional so I would like to somehow automate the coarsening. – rcompton May 6 2011 at 21:35
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 14, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0}, "config": {"markdown_headings": true, "markdown_code": false, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 10, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "github"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "english_confidence": 0.9287679195404053, "perplexity_flag": "head"}