A discrete Fourier transform based on Simpson's rule

Fourier analysis plays a vital role in the analysis of continuous‐time signals. In many cases, we are forced to approximate the Fourier coefficients based on a sampling of the time signal. Hence, the need for a discrete transformation into the frequency domain giving rise to the classical discrete Fourier transform. In this paper, we present a transformation that arises naturally if one approximates the Fourier coefficients of a continuous‐time signal numerically using the Simpson quadrature rule. This results in a decomposition of the discrete signal into two sequences of equal length. We show that the periodic discrete time signal can be reconstructed completely from its discrete spectrum using an inverse transform. We also present many properties satisfied by this transform. Copyright © 2012 John Wiley & Sons, Ltd.     

Iteratively reweighted algorithm for signals recovery with coherent tight frame

We consider the problem of compressed sensing with a coherent tight frame and design an iteratively reweighted least squares algorithm to solve it. To analyze the problem, we propose a sufficient null space property under a tight frame (sufficient D‐NSP). We show that, if a measurement matrix A satisfies the sufficient D‐NSP of order s, then an s‐sparse signal under the tight frame can be exactly recovered. Furthermore, if A satisfies the restricted isometric property with tight frame D of order 2bs, then it also satisfies the sufficient D‐NSP of order as with a < b and b sufficiently large. We prove the convergence of the algorithm based on the sufficient D‐NSP and give the upper error bounds. In numerical experiments, we use the discrete cosine transform, discrete Fourier transform, and Haar wavelets to verify the effectiveness of this algorithm. With increasing measurement number, the signal‐to‐noise ratio increases monotonically.     

Analytical Functional Models and Local Spectral Theory

In 1959 E. Bishop used a Banach-space version of the analyticduality principle established by e Silva, Köthe, Grothendieckand others to study connections between spectral decompositionproperties of a Banach-space operator and its adjoint. Accordingto Bishop a continuous linear operator T L(X) on a Banach spaceX satisfies property (rß) if the multiplication operator is injective with closed range for each open set U in the complex plane. In the present articlethe analytic duality principle in its original locally convexform is used to develop a complete duality theory for property(rß). At the same time it is shown that, up to similarity,property (rß) characterizes those operators occurringas restrictions of operators decomposable in the sense of C.Foias, and that its dual property, formulated as a spectraldecomposition property for the spectral subspaces of the givenoperator, characterizes those operators occurring as quotientsof decomposable operators. It is proved that, unlike the situationfor commuting subnormal operators, each finite commuting systemof operators with property (rß) can be extended toa finite commuting system of decomposable operators. Meanwhilethe results of this paper have been used to prove the existenceof invariant subspaces for subdecomposable operators with sufficientlyrich spectrum. 1991 Mathematics Subject Classification: 47A11,47B40.     

Some New Results on the Chu Duality of Discrete Groups

This paper deals mainly with the Chu duality of discrete groups. Among other results, we give sufficient conditions for an FC group to satisfy Chu duality and characterize when the Chu quasi-dual and the Takahashi quasi-dual of a group G coincide. As a consequence, it follows that when G is a weak sum of a family of finite simple groups, if the exponent of the groups in the family is bounded then G satisfies Chu duality; on the other hand, if the exponent of the group goes to infinity, then the Chu quasi-dual of G coincides with its Takahashi quasi-dual. We also present examples of discrete groups whose Chu quasi-duals are not locally compact and examples of discrete Chu reflexive groups which contain non-trivial sequences converging in the Bohr topology of the groups. Our results systematize some previous work and answer some open questions on the subject [2, 16, 3].     

Sustainability in bankruptcy problems

This paper focuses on a new property for bankruptcy rules, calledsustainability, which requires that the agents with small enough claims be fully reimbursed. We show that the constrained equal-awards rule is the only rule that satisfies path independence and sustainability. Exploiting duality relations, we also provide a characterization of the constrained equal-losses rule, as the only one that satisfies composition and independence of residual claims (the dual property of sustainability).     

Duality between compactness and discreteness beyond pontryagin duality

One of the most striking results of Pontryagin’s duality theory is the duality between compact and discrete locally compact abelian groups. This duality also persists in part for objects associated with noncommutative topological groups. In particular, it is well known that the dual space of a compact topological group is discrete, while the dual space of a discrete group is quasicompact (i.e., it satisfies the finite covering theorem but is not necessarily Hausdorff). The converse of the former assertion is also true, whereas the converse of the latter is not (there are simple examples of nondiscrete locally compact solvable groups of height 2 whose dual spaces are quasicompact and non-Hausdorff (they are T ₁ spaces)). However, in the class of locally compact groups all of whose irreducible unitary representations are finite-dimensional, a group is discrete if and only if its dual space is quasicompact (and is automatically a T ₁ space). The proof is based on the structural theorem for locally compact groups all of whose irreducible unitary representations are finite-dimensional. Certain duality between compactness and discreteness can also be revealed in groups that are not necessarily locally compact but are unitarily, or at least reflexively, representable, provided that (in the simplest case) the irreducible representations of a group form a sufficiently large family and have jointly bounded dimensions. The corresponding analogs of compactness and discreteness cannot always be easily identified, but they are still duals of each other to some extent.     

Low noise regimes for ℓ regularization : continuous and discrete settings

We focus on support recovery for signal deconvolution with sparsity assumption. We adopt the continuous setting defined by several recent works and we try to reconstruct a sum of Dirac masses from its low frequencies (possibly perturbed by some noise), by using a total variation prior for Radon measures (i.e. the generalization to measures of the ℓ¹ norm). We show that, under a non degenerate source condition, there exists a small noise regime in which the model recovers exactly the same number of spikes as the original signal, and the spikes converge to those of the original signal as the noise vanishes. This continuous setting, by allowing the spikes to “move”, provides robust support recovery for signals composed of well separated spikes. In a discrete setting, where the spikes are reconstructed on a grid, similar low noise regimes which guarantee the exact recovery of the support also exist (see [3]). Yet, this property only concerns a small class of signals. Considering the asymptotics of the discrete problems as the size of the grid tends to zero, we show that the support of the original signal cannot be stable on thin grids, and that the discrete models actually reconstruct pairs of spikes near each original spike. (© 2014 Wiley-VCH Verlag GmbH & Co. KGaA, Weinheim)     

Augmented Lagrangian function, non-quadratic growth condition and exact penalization

In this paper, under the assumption that the perturbation function satisfies a growth condition, necessary and sufficient conditions for an exact penalty representation and a zero duality gap property between the primal problem and its augmented Lagrangian dual problem are established.     

Some New Results on the Chu Duality of Discrete Groups

This paper deals mainly with the Chu duality of discrete groups. Among other results, we give sufficient conditions for an FC group to satisfy Chu duality and characterize when the Chu quasi-dual and the Takahashi quasi-dual of a group G coincide. As a consequence, it follows that when G is a weak sum of a family of finite simple groups, if the exponent of the groups in the family is bounded then G satisfies Chu duality; on the other hand, if the exponent of the group goes to infinity, then the Chu quasi-dual of G coincides with its Takahashi quasi-dual. We also present examples of discrete groups whose Chu quasi-duals are not locally compact and examples of discrete Chu reflexive groups which contain non-trivial sequences converging in the Bohr topology of the groups. Our results systematize some previous work and answer some open questions on the subject [2, 16, 3]. The first named author acknowledges partial financial support by the Spanish Ministry of Science (including FEDER funds), grant MTM2004-07665-C02-01; and the Generalitat Valenciana, grant GV04B-019.     

Relative cohomology theory for profinite groups

In this paper we define and develop the theory of the cohomology of a profinite group relative to a collection of closed subgroups. Having made the relevant definitions we establish a robust theory of cup products and use this theory to define profinite Poincaré duality pairs. We use the theory of groups acting on profinite trees to give Mayer–Vietoris sequences, and apply this to give results concerning decompositions of 3-manifold groups. Finally we discuss the relationship between discrete duality pairs and profinite duality pairs, culminating in the result that profinite completion of the fundamental group of a compact aspherical 3-manifold is a profinite Poincaré duality group relative to the profinite completions of the fundamental groups of its boundary components.     

Phaseless Sampling and Reconstruction of Real-Valued Signals in Shift-Invariant Spaces

Sampling in shift-invariant spaces is a realistic model for signals with smooth spectrum. In this paper, we consider phaseless sampling and reconstruction of real-valued signals in a high-dimensional shift-invariant space from their magnitude measurements on the whole Euclidean space and from their phaseless samples taken on a discrete set with finite sampling density. The determination of a signal in a shift-invariant space, up to a sign, by its magnitude measurements on the whole Euclidean space has been shown in the literature to be equivalent to its nonseparability. In this paper, we introduce an undirected graph associated with the signal in a shift-invariant space and use connectivity of the graph to characterize nonseparability of the signal. Under the local complement property assumption on a shift-invariant space, we find a discrete set with finite sampling density such that nonseparable signals in the shift-invariant space can be reconstructed in a stable way from their phaseless samples taken on that set. In this paper, we also propose a reconstruction algorithm which provides an approximation to the original signal when its noisy phaseless samples are available only. Finally, numerical simulations are performed to demonstrate the robustness of the proposed algorithm to reconstruct box spline signals from their noisy phaseless samples.

     

An alternate implementation of Goldfarb's minimization algorithm

Goldfarb's algorithm, which is one of the most successful methods for minimizing a function of several variables subject to linear constraints, uses a single matrix to keep second derivative information and to ensure that search directions satisfy any active constraints. In the original version of the algorithm this matrix is full, but by making a change of variables so that the active constraints become bounds on vector components, this matrix is transformed so that the dimension of its non-zero part is only the number of variablesless the number of active constraints. It is shown how this transformation may be used to give a version of the algorithm that usually provides a good saving in the amount of computation over the original version. Also it allows the use of sparse matrix techniques to take advantage of zeros in the matrix of linear constraints. Thus the method described can be regarded as an extension of linear programming to allow a non-linear objective function.     

A discrete Hartley transform based on Simpson's rule

The Hartley transform is an integral transformation that maps a real valued function into a real valued frequency function via the Hartley kernel, thereby avoiding complex arithmetic as opposed to the Fourier transform. Approximation of the Hartley integral by the trapezoidal quadrature results in the discrete Hartley transform, which has proven a contender to the discrete Fourier transform because of its involutory nature. In this paper, a discrete transform is proposed as a real transform with a convolution property and is an alternative to the discrete Hartley transform. Copyright © 2015 John Wiley & Sons, Ltd.     

Notes on a new chain condition for prime ideals

A chain condition intermediate to the catenary property and the chain condition for prime ideals (c.c.) is studied. Like the c.c., the condition is inherited from a semi-local domain R by integral extension domains, by local quotient domains, and by factor domains, and a semi-local ring that satisfies the condition is catenary. (Unlike the c.c., none of these statements is true when R is not semi-local.) A number of characterizations of a semi-local domain that satisfies the condition are given in terms of: integral (respectively, algebraic, transcendental) extension domains, Henselizations, completions, Rees rings, associated graded rings and certain discrete valuation over-rings. Then four of the catenary chain conjectures are characterized in terms of this condition.     

Analysis of orthogonal multi-matching pursuit under restricted isometry property

Orthogonal multi-matching pursuit(OMMP)is a natural extension of orthogonal matching pursuit(OMP)in the sense that N(N≥1)indices are selected per iteration instead of 1.In this paper,the theoretical performance of OMMP under the restricted isometry property(RIP)is presented.We demonstrate that OMMP can exactly recover any K-sparse signal from fewer observations y=φx,provided that the sampling matrixφsatisfiesδKN-N+1+(K/N)~(1/2)θKN-N+1,N1.Moreover,the performance of OMMP for support recovery from noisy observations is also discussed.It is shown that,for l_2 bounded and l_∞bounded noisy cases,OMMP can recover the true support of any K-sparse signal under conditions on the restricted isometry property of the sampling matrixφand the minimum magnitude of the nonzero components of the signal.     

Finite character of finitely stable domains

A commutative domain is finitely stable if every nonzero finitely generated ideal is stable, i.e. invertible over its endomorphism ring. A domain satisfies the local stability property provided that every locally stable ideal is stable.We prove that a finitely stable domain satisfies the local stability property if and only if it has finite character, that is every nonzero ideal is contained in at most finitely many maximal ideals. This result allows us to answer the open problem of whether every Clifford regular domain is of finite character.     

Additively separable duality theory

In duality theory, there is a trade-off between generality and tractability. Thus, the generality of the Tind-Wolsey framework comes at the expense of an infinite-dimensional dual solution space, even if the primal solution space is finite dimensional. Therefore, the challenge is to impose additional structure on the dual solution space and to identify conditions on the primal program, such that the properties that are typically associated with duality, like weak and strong duality, are preserved.In this paper, we consider real-valuedness, continuity, and additive separability as such additional structures. The virtue of the latter property is that it restores the one-to-one correspondence between primal constraints and dual variables as it exists in Lagrangian duality. The main result of this paper is that, roughly speaking, the existence of realvalued, continuous, and additively separable dual solutions that preserve strong duality is guaranteed, once the primal program satisfies a certain stability condition. The latter condition is ensured by the well-known regularity conditions that imply constraint qualification in Karush-Kuhn-Tucker points. On the other hand, if instead of additive separability, a mild tractability condition is imposed on the dual solution space, then stability turns out to be a necessary condition for strong duality in a well-defined sense. This result, combined with the observation that applicability of some well-known augmented Lagrangian methods to constrained optimization.This study was supported by the Netherlands Foundation for Mathematics (SMC) with financial aid from the Netherlands Organization for Scientific Research (NWO).     

Convexifiability of continuous and discrete nonnegative quadratic programs for gap-free duality

In this paper we show that a convexifiability property of nonconvex quadratic programs with nonnegative variables and quadratic constraints guarantees zero duality gap between the quadratic programs and their semi-Lagrangian duals. More importantly, we establish that this convexifiability is hidden in classes of nonnegative homogeneous quadratic programs and discrete quadratic programs, such as mixed integer quadratic programs, revealing zero duality gaps. As an application, we prove that robust counterparts of uncertain mixed integer quadratic programs with objective data uncertainty enjoy zero duality gaps under suitable conditions. Various sufficient conditions for convexifiability are also given.     

Normal ergodic actions

The von Neumann-Halmos theory of ergodic transformations with discrete spectrum makes use of the duality theory of locally compact abelian groups to characterize those transformations preserving a probability measure, which are defined by a rotation on a compact abelian group. We use the recently developed duality between general locally compact groups and Hopf-von Neumann algebras to characterize those actions of a locally compact group, preserving a σ-finite measure, which are defined by a dense embedding in another group. They are characterized by the property of normality, previously introduced by the author, and motivated by Mackey's theory of virtual groups. The discrete spectrum theory is readily seen to come out as the special case in which the invariant measure is finite.