A note on best constants in discrete inequalities (Q1087472)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A note on best constants in discrete inequalities |
scientific article; zbMATH DE number 3989121
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A note on best constants in discrete inequalities |
scientific article; zbMATH DE number 3989121 |
Statements
A note on best constants in discrete inequalities (English)
0 references
1986
0 references
Consider the problem of finding eigenvalues of \(B^{-1}D\) where B is a symmetric positive definite matrix and \(D=(A+A^ t)/2\). It is shown that the largest and smallest eigenvalues are the optimal values of the fractional programs maximize \((x^ tAx)/(x^ tBx)\) and minimize \((x^ tAx)/(x^ tBx)\) respectively.
0 references
best constants in discrete inequalities
0 references
eigenvalues
0 references
symmetric positive definite matrix
0 references
