Number of the records: 1
Max-min and min-max Approximation Problems for Normal Matrices Revisited
- 1.
SYSNO ASEP 0435950 Document Type J - Journal Article R&D Document Type Journal Article Subsidiary J Článek ve WOS Title Max-min and min-max Approximation Problems for Normal Matrices Revisited Author(s) Liesen, J. (DE)
Tichý, Petr (UIVT-O) SAI, RID, ORCIDSource Title Electronic Transactions on Numerical Analysis. - : Kent State University - ISSN 1068-9613
Roč. 41, 4 July (2014), s. 159-166Number of pages 8 s. Language eng - English Country US - United States Keywords matrix approximation problems ; min-max and max-min approximation problems ; best approximation ; normal matrices Subject RIV BA - General Mathematics R&D Projects GA13-06684S GA ČR - Czech Science Foundation (CSF) Institutional support UIVT-O - RVO:67985807 UT WOS 000348498600010 EID SCOPUS 84910005576 Annotation We give a new proof of an equality of certain max-min and min-max approximation problems involving normal matrices. The previously published proofs of this equality apply tools from matrix theory, (analytic) optimization theory, and constrained convex optimization. Our proof uses a classical characterization theorem from approximation theory and thus exploits the link between the two approximation problems with normal matrices on the one hand and approximation problems on compact sets in the complex plane on the other. Workplace Institute of Computer Science Contact Tereza Šírová, sirova@cs.cas.cz, Tel.: 266 053 800 Year of Publishing 2015 Electronic address http://etna.mcs.kent.edu/volumes/2011-2020/vol41/abstract.php?vol=41&pages=159-166
Number of the records: 1