## Eigenvalues of a Parametrized Family of Linear Functions

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

Suppose that we have a family of linear functions $L(\alpha) : \mathbb{R}^n \rightarrow \mathbb{R}^n$, where $\alpha$ is a positive real number.

For each $\alpha$, it is given that $L(\alpha)$ is a symmetric matrix, and so it has a basis of eigenvectors, and $n$ eigenvalues (not necessarily distinct). We define a function $f(\alpha)$ to be the smallest eigenvalue of $L(\alpha)$.

It is also given that the elements of $L(\alpha)$ are smooth functions of $\alpha$ for each $\alpha$. Therefore, as the eigenvalues are the roots of a polynomial whose coefficients are also smooth functions of $\alpha$, $f(\alpha)$ is a smooth function of $\alpha$ for all but a few values of $\alpha$ (this follows from the implicit function theorem).

The problem I am having is to try to find the global minimum of $f(\alpha)$. Usually what one would do is to take its derivative with respect to alpha, and set that equal to 0, but that is actually not possible in the present case because there is no way to get an explicit formula for $f(\alpha)$.

A possible idea that I had was to get some kind of sequence which converges to the smallest eigenvalue of $L(\alpha)$, and hope that this sequence converges uniformly in $\alpha$, but I have not yet found such a thing.

-

1
I don't find a question here. – Denis Serre Feb 16 2011 at 9:27
I belive he wants a method to minimalize $f(\alpha)$. Is it clear that this minimum exists? – András Bátkai Feb 16 2011 at 9:32
over a compact set of $\alpha$'s. Otherwise certainly not: $\alpha \mapsto L (\alpha) = \alpha$ viewed as a $1\times1$ matrix does not have a minimum... – Stefan Waldmann Feb 16 2011 at 9:51
Educated guess: The search is for the global minimum of the absolute value of the smallest eigenvalue. – Tim van Beek Feb 16 2011 at 10:13
I did not say this in the above, but it is implicit that I am assuming the existence of a global minimum. Just like you can find the global minimum of a function f: R -> R in principle by solving f'=0 should it exist, is there a practical way to in principle find the global minimum of this function $f(\alpha)$ given that it exists? – Eric Haengel Feb 16 2011 at 12:44
show 2 more comments
{"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": 23, "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": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 10, "end_threshold": 15, "enable": false}, "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.9350554347038269, "perplexity_flag": "head"}