1,720,959 research outputs found
Antinorms on cones: duality and applications
No full textAn antinorm is a concave nonnegative homogeneous functional on a convex cone. It is shown that if the cone is polyhedral, then every antinorm has a unique continuous extension from the interior of the cone. The main facts of the duality theory in convex analysis, in particular, the Fenchel–Moreau theorem, are generalized to antinorms. However, it is shown that the duality relation for antinorms is discontinuous. In every dimension, there are infinitely many self-dual antinorms on the positive orthant and, in particular, infinitely many autopolar polyhedra. For the two-dimensional case, we characterize them all. The classification in higher dimensions is left as an open problem. Applications to linear dynamical systems, to the Lyapunov exponent of random matrix products, to the lower spectral radius of nonnegative matrices, and to convex trigonometry are considered
Analytic Functions in Local Shift-Invariant Spaces and Analytic Limits of Level Dependent Subdivision
Full text linkIn this paper we characterize all subspaces of analytic functions in finitely generated shift-invariant spaces with compactly supported generators and provide explicit descriptions of their elements. We illustrate the differences between our characterizations and Strang-Fix or zero conditions on several examples. Consequently, we depict the analytic functions generated by scalar or vector subdivision with masks of bounded and unbounded support. In particular, we prove that exponential polynomials are indeed the only analytic limits of level dependent scalar subdivision schemes with finitely supported masks
The greedy strategy for optimizing the Perron eigenvalue
Full text linkWe address the problems of minimizing and of maximizing the spectral radius over a compact family of non-negative matrices. Those problems being hard in general can be efficiently solved for some special families. We consider the so-called product families, where each matrix is composed of rows chosen independently from given sets. A recently introduced greedy method works very fast. However, it is applicable mostly for strictly positive matrices. For sparse matrices, it often diverges and gives a wrong answer. We present the “selective greedy method” that works equally well for all non-negative product families, including sparse ones. For this method, we prove a quadratic rate of convergence and demonstrate its efficiency in numerical examples. The numerical examples are realised for two cases: finite uncertainty sets and polyhedral uncertainty sets given by systems of linear inequalities. In dimensions up to 2000, the matrices with minimal/maximal spectral radii in product families are found within a few iterations. Applications to dynamical systems and to the graph theory are considered
Spaces of Dyadic Distributions
No full textAbstract: This paper studies spaces of distributions on a dyadic half-line, which is the positive half-line equipped with bitwise binary addition and Lebesgue measure. We prove the nonexistence of a space of dyadic distributions which satisfies a number of natural requirements (for instance, the property of being invariant with respect to the Walsh–Fourier transform) and, in addition, is invariant with respect to multiplication by linear functions. This, in particular, is evidence that the space of dyadic distributions suggested by S. Volosivets in 2009 is optimal. We also show applications of dyadic distributions to the theory of refinement equations and wavelets on the dyadic half-line
On mutually inverse transforms of functions on a half-line
No full textTwo transforms of functions on a half-line are considered. It is proved that their composition gives a concave majorant for every nonnegative function. In particular, this composition is an identity transform in the class of nonnegative concave functions. Applications of this result in Hilbert space operator theory and the theory of quantum systems are indicated. Several open problems are formulated
Switching systems with dwell time: Computing the maximal Lyapunov exponent
No full textWe study asymptotic stability of continuous-time systems with mode-dependent guaranteed dwell time. These systems are reformulated as special cases of a general class of mixed (discrete–continuous) linear switching systems on graphs, in which some modes correspond to discrete actions and some others correspond to continuous-time evolutions. Each discrete action has its own positive weight which accounts for its time-duration. We develop a theory of stability for the mixed systems; in particular, we prove the existence of an invariant Lyapunov norm for mixed systems on graphs and study its structure in various cases, including discrete-time systems for which discrete actions have inhomogeneous time durations. This allows us to adapt recent methods for the joint spectral radius computation (Gripenberg's algorithm and the Invariant Polytope Algorithm) to compute the Lyapunov exponent of mixed systems on graphs
Going Beyond Counting First Authors in Author Co-citation Analysis
Full text linkThe present study examines one of the fundamental aspects of author co-citation analysis (ACA) - the way co-citation
counts are defined. Co-citation counting provides the data on which all subsequent statistical analyses and mappings
are based, and we compare ACA results based on two different types of co-citation counting - the traditional type that
only counts the first one among a cited work's authors on the one hand and a non-traditional type that takes into
account the first 5 authors of a cited work on the other hand. Results indicate that the picture produced through this non-traditional author co-citation counting contains more coherent author groups and is therefore considerably clearer. However, this picture represents fewer specialties in the research field being studied than that produced through the traditional first-author co-citation counting when the same number of top-ranked authors is selected and analyzed. Reasons for these effects are discussed
Variations on the Author
Full text link“Variations on the Author” discusses two of Eduardo Coutinho’s recent films (Um Dia na Vida, from 2010, and Últimas Conversas, posthumously released in 2015) and their contribution to the general question of documentary authorship. The director’s filmography is characterized by a consistent yet self-effacing form of authorial self-inscription: Coutinho often features as an interviewer that rather than express opinions propels discourses; an interviewer that is good at listening. This mode of self-inscription characterizes him as an author who is not expressive but who is nonetheless markedly present on the screen. In Um Dia na Vida, however, Coutinho is completely absent form the image, while Últimas Conversas, on the contrary, includes a confessional prologue that moves the director from the margins to the center of his films. This article examines the ways in which these works stand out in the filmography of a director who offers new insights into the notion of cinematic authorship
Appropriate Similarity Measures for Author Cocitation Analysis
Full text linkWe provide a number of new insights into the methodological discussion about author cocitation analysis. We first argue that the use of the Pearson correlation for measuring the similarity between authors’ cocitation profiles is not very satisfactory. We then discuss what kind of similarity measures may be used as an alternative to the Pearson correlation. We consider three similarity measures in particular. One is the well-known cosine. The other two similarity measures have not been used before in the bibliometric literature. Finally, we show by means of an example that our findings have a high practical relevance.information science;Pearson correlation;cosine;similarity measure;author cocitation analysis
- …
