596 research outputs found
Minimal symmetric Darlington synthesis
We consider the symmetric Darlington synthesis of a p x p rational symmetric
Schur function S with the constraint that the extension is of size 2p x 2p.
Under the assumption that S is strictly contractive in at least one point of
the imaginary axis, we determine the minimal McMillan degree of the extension.
In particular, we show that it is generically given by the number of zeros of
odd multiplicity of I-SS*. A constructive characterization of all such
extensions is provided in terms of a symmetric realization of S and of the
outer spectral factor of I-SS*. The authors's motivation for the problem stems
from Surface Acoustic Wave filters where physical constraints on the
electro-acoustic scattering matrix naturally raise this mathematical issue
Optimal CDMA signatures: a finite-step approach
A description of optimal sequences for direct-sequence code division multiple access is a byproduct of recent characterizations of the sum capacity. The paper restates the sequence design problem as an inverse singular value problem and shows that it can be solved with finite-step algorithms from matrix analysis. Relevant algorithms are reviewed and a new one-sided construction is proposed that obtains the sequences directly instead of computing the Gram matrix of the optimal signatures
Finite-step algorithms for constructing optimal CDMA signature sequences
A description of optimal sequences for direct-spread code-division multiple access (DS-CDMA) is a byproduct of recent characterizations of the sum capacity. This paper restates the sequence design problem as an inverse singular value problem and shows that the problem can be solved with finite-step algorithms from matrix theory. It proposes a new one-sided algorithm that is numerically stable and faster than previous methods
Tensor Rank, Invariants, Inequalities, and Applications
Though algebraic geometry over is often used to describe the
closure of the tensors of a given size and complex rank, this variety includes
tensors of both smaller and larger rank. Here we focus on the tensors of rank over , which has as a dense subset the orbit
of a single tensor under a natural group action. We construct polynomial
invariants under this group action whose non-vanishing distinguishes this orbit
from points only in its closure. Together with an explicit subset of the
defining polynomials of the variety, this gives a semialgebraic description of
the tensors of rank and multilinear rank . The polynomials we
construct coincide with Cayley's hyperdeterminant in the case , and thus
generalize it. Though our construction is direct and explicit, we also recast
our functions in the language of representation theory for additional insights.
We give three applications in different directions: First, we develop basic
topological understanding of how the real tensors of complex rank and
multilinear rank form a collection of path-connected subsets, one of
which contains tensors of real rank . Second, we use the invariants to
develop a semialgebraic description of the set of probability distributions
that can arise from a simple stochastic model with a hidden variable, a model
that is important in phylogenetics and other fields. Third, we construct simple
examples of tensors of rank which lie in the closure of those of rank
.Comment: 31 pages, 1 figur
Generalized Finite Algorithms for Constructing Hermitian Matrices with Prescribed Diagonal and Spectrum
In this paper, we present new algorithms that can replace the diagonal entries of a Hermitian matrix by any set of diagonal entries that majorize the original set without altering the eigenvalues of the matrix. They perform this feat by applying a sequence of (N-1) or fewer plane rotations, where N is the dimension of the matrix. Both the Bendel-Mickey and the Chan-Li algorithms are special cases of the proposed procedures. Using the fact that a positive semidefinite matrix can always be factored as \mtx{X^\adj X}, we also provide more efficient versions of the algorithms that can directly construct factors with specified singular values and column norms. We conclude with some open problems related to the construction of Hermitian matrices with joint diagonal and spectral properties
Null-space preconditioners for saddle point systems
The null-space method is a technique that has been used for many years to reduce a saddle point system to a smaller, easier to solve, symmetric positive-definite system. This method can be understood as a block factorization of the system. Here we explore the use of preconditioners based on incomplete versions of a particular null-space factorization, and compare their performance with the equivalent Schur-complement based preconditioners. We also describe how to apply the non-symmetric preconditioners proposed using the conjugate gradient method (CG) with a non-standard inner product. This requires an exact solve with the (1,1) block, and the resulting algorithm is applicable in other cases where Bramble-Pasciak CG is used. We verify the efficiency of the newly proposed preconditioners on a number of test cases from a range of applications
- …