Within the lattice approach to analysis and synthesis problems recently developed in Quadrat (Signal Syst, to appear), we obtain a general parametrization of all stabilizing controllers for internally stabilizable multi input multi output (MIMO) plants which do not necessarily admit doubly coprime factorizations. This parametrization is a linear fractional transformation of free parameters and ...

The scaling limits of a variety of critical two-dimensional lattice models are equal to the Schramm-Loewner evolution (SLE) for a suitable value of the parameter κ. These lattice models have a natural parametrization of their random curves given by the length of the curve. This parametrization (with suitable scaling) should provide a natural parametrization for the curves in the scaling limit. ...

Stochastic parametrization provides a methodology for representing model uncertainty in ensemble forecasts, and also has the capability of reducing systematic error through the concept of nonlinear noise-induced rectification. The stochastically perturbed parametrization tendencies scheme and the stochastic backscatter scheme are described and their impact on medium-range forecast skill is disc...

The paper examines the stabilization and the H∞ norm performance analysis and control of state-delayed systems with a symmetric state-space realization. Such symmetric realizations appear in many engineering applications. By exploiting the state-space symmetry, we obtain an explicit solution for a bound on the H∞ norm of such symmetric time-delayed systems. Also, we derive an explicit parametri...

A parametrization of density operators for bipartite quantum systems is proposed. It is based on the particular parametrization of the unitary group found recently by Jarlskog. It is expected that this parametrization will find interesting applications in the study of quantum properties of many partite systems.

In this article algebraic constructions are introduced in order to study the variety defined by a radical parametrization (a tuple of functions involving complex numbers, n variables, the four field operations and radical extractions). We provide algorithms to implicitize radical parametrizations and to check whether a radical parametrization can be reparametrized into a rational parametrization.

Most approaches to least squares fitting of a B-spline surface to measurement data require a parametrization of the data point set and the choice of suitable knot vectors. We propose to use uniform knots in connection with a feature sensitive parametrization. This parametrization allocates more parameter space to highly curved feature regions and thus automatically provides more control points ...

This paper addresses the problem of spherical parametrization, i.e., mapping a given polygonal surface of genus-zero onto a unit sphere. We construct an improved algorithm for parametrization of genus-zero meshes and aim to obtain high-quality surfaces fitting with PHT-splines. This parametrization consists of minimizing discrete harmonic energy subject to spherical constraints and solving the ...

There are various algorithms known for deciding the parametrizability (rationality) of a plane algebraic curve, and if the curve is rational, actually computing a parametrization. Optimality criteria such as low degrees in the parametrization or low degree field extensions are met by some parametrization algorithms. In this paper we investigate real curves. Given a parametrizable plane curve ov...