zbMATH — the first resource for mathematics

Geometry Search for the term Geometry in any field. Queries are case-independent.
Funct* Wildcard queries are specified by * (e.g. functions, functorial, etc.). Otherwise the search is exact.
"Topological group" Phrases (multi-words) should be set in "straight quotation marks".
au: Bourbaki & ti: Algebra Search for author and title. The and-operator & is default and can be omitted.
Chebyshev | Tschebyscheff The or-operator | allows to search for Chebyshev or Tschebyscheff.
"Quasi* map*" py: 1989 The resulting documents have publication year 1989.
so: Eur* J* Mat* Soc* cc: 14 Search for publications in a particular source with a Mathematics Subject Classification code (cc) in 14.
"Partial diff* eq*" ! elliptic The not-operator ! eliminates all results containing the word elliptic.
dt: b & au: Hilbert The document type is set to books; alternatively: j for journal articles, a for book articles.
py: 2000-2015 cc: (94A | 11T) Number ranges are accepted. Terms can be grouped within (parentheses).
la: chinese Find documents in a given language. ISO 639-1 language codes can also be used.

a & b logic and
a | b logic or
!ab logic not
abc* right wildcard
"ab c" phrase
(ab c) parentheses
any anywhere an internal document identifier
au author, editor ai internal author identifier
ti title la language
so source ab review, abstract
py publication year rv reviewer
cc MSC code ut uncontrolled term
dt document type (j: journal article; b: book; a: book article)
Matrix nearness problems and applications. (English) Zbl 0681.65029
Applications of matrix theory, Proc. Conf., Bradford/UK 1988, Inst. Math. Appl. Conf. Ser., New. Ser. 22, 1-27 (1989).
[For the entire collection see Zbl 0676.00007.] The following matrix nearness problems are surveyed: finding the nearest symmetric matrix, the nearest positive definite, the orthogonal Procrustes problem (a product formulation of the nearest orthogonal), the nearest normal matrix, and finding the smallest perturbation that makes the matrix unstable. Nearness is measured with either the Frobenius or the spectral norm, and both mathematical characterizations and algorithms are described as well as contexts when the solution of a nearness problem is of interest.
Reviewer: A.Ruhe

65F35Matrix norms, conditioning, scaling (numerical linear algebra)
15A60Applications of functional analysis to matrix theory