2,566 research outputs found

    Constructing matrix geometric means

    Full text link
    In this paper, we analyze the process of "assembling" new matrix geometric means from existing ones, through function composition or limit processes. We show that for n=4 a new matrix mean exists which is simpler to compute than the existing ones. Moreover, we show that for n>4 the existing proving strategies cannot provide a mean computationally simpler than the existing ones

    A Perron iteration for the solution of a quadratic vector equation arising in Markovian Binary Trees

    Full text link
    We propose a novel numerical method for solving a quadratic vector equation arising in Markovian Binary Trees. The numerical method consists in a fixed point iteration, expressed by means of the Perron vectors of a sequence of nonnegative matrices. A theoretical convergence analysis is performed. The proposed method outperforms the existing methods for close-to-critical problems

    A note on forecasting demand using the multivariate exponential smoothing framework

    Full text link
    Simple exponential smoothing is widely used in forecasting economic time series. This is because it is quick to compute and it generally delivers accurate forecasts. On the other hand, its multivariate version has received little attention due to the complications arising with the estimation. Indeed, standard multivariate maximum likelihood methods are affected by numerical convergence issues and bad complexity, growing with the dimensionality of the model. In this paper, we introduce a new estimation strategy for multivariate exponential smoothing, based on aggregating its observations into scalar models and estimating them. The original high-dimensional maximum likelihood problem is broken down into several univariate ones, which are easier to solve. Contrary to the multivariate maximum likelihood approach, the suggested algorithm does not suffer heavily from the dimensionality of the model. The method can be used for time series forecasting. In addition, simulation results show that our approach performs at least as well as a maximum likelihood estimator on the underlying VMA(1) representation, at least in our test problems

    On the closure of the tame automorphism group of affine three-space

    Full text link
    We provide explicit families of tame automorphisms of the complex affine three-space which degenerate to wild automorphisms. This shows that the tame subgroup of the group of polynomial automorphisms of \C^3 is not closed, when the latter is seen as an infinite dimensional algebraic group.tomorphism group of affine three-spac

    Embedding Riemann surfaces with isolated punctures into the complex plane

    Get PDF
    We enlarge the class of open Riemann surfaces known to be holomorphically embeddable into the plane by allowing them to have additional isolated punctures compared to the known embedding results
    • …
    corecore