The determinant and rank criteria used for space-time code design apply at high SNR. Code design metrics developed for low SNR assume a channel autocorrelation matrix with equal eigenvalues, which does not hold in many practical scenarios. This paper shows ...
We obtain Liouville type theorems for mappings with bounded s-distorsion between Riemannian manifolds. Besides these mappings, we introduce and study a new class, which we call mappings with bounded q-codistorsion. ...
2002
Spectral factorization is a crucial step in the solution of linear quadratic estimation and control problems. It is no wonder that a variety of methods has been developed over the years for the computation of canonical spectral factors. This paper provides ...
Two recent approaches (Van Overschee, De Moor, N4SID, Automatica 30 (1) (1994) 75; Verhaegen, Int. J. Control 58(3) (1993) 555) in subspace identification problems require the computation of the R factor of the QR factorization of a block-Hankel matrix H, ...
We consider the following problem: minx∈Rnmin∥E∥≤η∥(A+E)x−b∥, where A is an m×n real matrix and b is an n-dimensional real column vector when it has multiple global minima. This problem is an errors-in-variables ...
We present a semiclassical technique that relies on replacing complicated classical manifold structure with simpler manifolds, which are then evaluated by the usual semiclassical rules. Under circumstances where the original manifold structure gives poor o ...
2001
We consider Wave Maps with smooth compactly supported initial data of small (H) over dot (3/2)-norm from R3+1 to certain 2-dimensional Riemannian manifolds and show that they stay smooth globally in time. Our methods are based on the introduction of a glob ...
Springer Verlag2003
In this semester project we deal with hyperbolic partial differential equations and Fluid-Structure Interaction ...
2003
This paper deals with a general matrix extension problem with structural constraints and provides a recursive solution in terms of an inverse scattering experiment. Both the stationary and nonstationary cases are considered, in addition to connections to t ...
Elsevier2002
,
Unconstrained zero-one quadratic maximization problems can be solved in polynomial time when the symmetric matrix describing the objective function is positive semidefinite of fixed rank with known spectral decomposition. ...