The logarithmic norm. History and modern theory
By Gustaf Söderlind. 2006
212 citations recorded by the source corpus.
Subfields: Computational Theory and Mathematics, Control and Systems Engineering, Numerical Analysis
View Paper: https://www.semanticscholar.org/paper/40338bdeb15a087274d28330dc9f1d456d1134b0
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Computational Theory and Mathematics
In Control and Systems Engineering
- Zahra Aminzarey
- Eduardo D. Sontagy
- Eduardo Sontag
- P. Zgliczy'nski
- Tomasz Kapela
- Zbigniew Galias
- Gheorghe Craciun
- Francesco Bullo
In Numerical Analysis
Citations in the corpus
- Contractive Systems with Inputs (2010, background): “We remark that in some cases it might be possible to prove a strict contraction (K = 1) even if the domain is not convex, by appealing to the deeper theory of logarithmic Lipschitz constants (see [14] for definitions and details).”
- Contraction methods for nonlinear systems: A brief introduction and some open problems (2014, methodology): “Remark 1: [19], [18] Another way to define M± is by the concept of semi inner product which is in fact a generalization of inner product to non Hilbert spaces.”
- A Lohner-type algorithm for control systems and ordinary differential inclusions (2007, background): “A survey regarding the modern developments stemming from this notion the reader is referred to [ 19 ] and the literature given there.”
- A structural analysis of asymptotic mean-square stability for multi-dimensional linear stochastic differential systems (2012, unknown): “The relation to the spectral abscissa and the spectral radius are provided by the inequalities α(A) ≤ μp[A] and ρ(A) ≤ ‖A‖p for any induced matrix norm ‖·‖p, see [11, 33].”