M. Seethharama Gowda
Computational Theory and Mathematics · 1990–2016
A researcher in the Science corpus: 5 papers; trusts 4 researchers and is trusted by 4 researchers here, as inferred from the citation graph.
Subfields
- Computational Theory and Mathematics — 15 citations into it; #10,544 of 12,182 by trust here, #8,294 by citations
- Numerical Analysis — 10 citations into it; #3,208 of 3,586 by trust here, #2,832 by citations
- Computational Mathematics — 6 citations into it; #524 of 612 by trust here, #532 by citations
Whom M. Seethharama Gowda trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
Who trusts M. Seethharama Gowda overall
- Radu Ioan Bot
- Michel Baes
- Gert Wanka
- Jonathan Michael Borwein
- Aharon Ben-Tal
- Ziyan Luo
- Gauthier Gidel
Papers from M. Seethharama Gowda's perspective
Ordered by how strongly the researchers M. Seethharama Gowda trusts endorse each paper. Same corpus, a different order for every researcher.
- Further Results for Perron-Frobenius Theorem for Nonnegative Tensors (SIAM Journal on Matrix Analysis and Applications)
- Perron-Frobenius theorem for nonnegative tensors
- Polynomial complementarity problems
- Sums of Squares, Moment Matrices and Optimization Over Polynomials
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- M-Tensors and Some Applications (SIAM Journal on Matrix Analysis and Applications)
- Linear Complementarity Problem (Encyclopedia of Optimization)
- M-tensors and nonsingular M-tensors
- Some properties of strong H-tensors and general H-tensors
- Complementarity forms of theorems of Lyapunov and Stein, and related results
Their papers
- Polynomial complementarity problems (2016) — 63 citations
- Complementarity forms of theorems of Lyapunov and Stein, and related results (2000) — 62 citations
- Z-tensors and complementarity problems (2015) — 64 citations
- Some P-properties for linear transformations on Euclidean Jordan algebras (2004) — 261 citations
- A comparison of constraint quali cations in in nite-dimensional convex programming (1990)