Convex Optimization approach to signals with fast varying instantaneous frequency

Motivated by the limitation of analyzing oscillatory signals composed of multiple components with fast-varying instantaneous frequency, we approach the time-frequency analysis problem by optimization. Based on the proposed adaptive harmonic model, the time-frequency representation of a signal is obtained by directly minimizing a functional, which involves few properties an “ideal time-frequency representation” should satisfy, for example, the signal reconstruction and concentrative time-frequency representation. FISTA (Fast Iterative Shrinkage-Thresholding Algorithm) is applied to achieve an efficient numerical approximation of the functional. We coin the algorithm as Time-frequency bY COnvex OptimizatioN (Tycoon). The numerical results confirm the potential of the Tycoon algorithm.     

Molecular conformation on the CM-5 by parallel two-level simulated annealing

In this paper, we propose a new kind of simulated annealing algorithm calledtwo-level simulated annealing for solving certain class of hard combinatorial optimization problems. This two-level simulated annealing algorithm is less likely to get stuck at a non-global minimizer than conventional simulated annealing algorithms. We also propose a parallel version of our two-level simulated annealing algorithm and discuss its efficiency. This new technique is then applied to the Molecular Conformation problem in 3 dimensional Euclidean space. Extensive computational results on Thinking Machines CM-5 are presented. With the full Lennard-Jones potential function, we were able to get satisfactory results for problems for cluster sizes as large as 100,000. A peak rate of over 0.8 giga flop per second in 64-bit operations was sustained on a partition with 512 processing elements. To the best of our knowledge, ground states of Lennard-Jones clusters of size as large as these have never been reported before.Also a researcher at the Army High Performance Computing Research Center, University of Minnesota, Minneapolis, MN 55415     

Theory, implementation and applications of nonstationary Gabor frames

Signal analysis with classical Gabor frames leads to a fixed time-frequency resolution over the whole time-frequency plane. To overcome the limitations imposed by this rigidity, we propose an extension of Gabor theory that leads to the construction of frames with time-frequency resolution changing over time or frequency. We describe the construction of the resulting nonstationary Gabor frames and give the explicit formula for the canonical dual frame for a particular case, the painless case. We show that wavelet transforms, constant-Q transforms and more general filter banks may be modeled in the framework of nonstationary Gabor frames. Further, we present the results in the finite-dimensional case, which provides a method for implementing the above-mentioned transforms with perfect reconstruction. Finally, we elaborate on two applications of nonstationary Gabor frames in audio signal processing, namely a method for automatic adaptation to transients and an algorithm for an invertible constant-Q transform.     

解带有二次约束非凸二次规划问题的一个分枝缩减方法

在这篇论文里,有机地把外逼近方法与分枝定界技术结合起来,提出了解带有二次约束非凸二次规划问题的一个分枝缩减方法;给出了原问题的一个新的线性规划松弛,以便确定它在超矩形上全局最优值的一个下界;利用超矩形的一个深度二级剖分方法,以及超矩形的缩减和删除技术,提高算法的收敛速度;证明了在知道原问题可行点的条件下,该算法在有限步里就可以获得原问题的一个全局最优化解,并且用一个例子说明了该算法是有效的.     

A Second-Order Synchrosqueezing Transform with a Simple Form of Phase Transformation

To model a non-stationary signal as a superposition of amplitude and frequency-modulated Fourier-like oscillatory modes is important to extract information, such as the underlying dynamics, hidden in the signal. Recently, the synchrosqueezed wavelet transform (SST) and its variants have been developed to estimate instantaneous frequencies and separate the components of non-stationary multicomponent signals. The short-time Fourier transform-based SST (FSST for short) reassigns the frequency variable to sharpen the time-frequency representation and to separate the components of a multicomponent non-stationary signal. However, FSST works well only with multicomponent signals having slowly changing frequencies. To deal with multicomponent signals having fast-changing frequencies, the second-order FSST (FSST2 for short) was proposed. The key point for FSST2 is to construct a phase transformation of a signal which is the instantaneous frequency when the signal is a linear chirp. In this paper we consider a phase transformation for FSST2 which has a simpler expression than that used in the literature. In the study the theoretical analysis of FSST2 with this phase transformation, we observe that the proof for the error bounds for the instantaneous frequency estimation and component recovery is simpler than that with the conventional phase transformation. We also provide some experimental results which show that this FSST2 performs well in non-stationary multicomponent signal separation.     

A multilevel decoupled method for a mixed Stokes/Darcy model

This paper studies decoupled numerical methods for a mixed Stokes/Darcy model for coupling fluid and porous media flows. A two-level algorithm is proposed and analyzed in Mu and Xu (2007) [10]. We generalize the two-level algorithm to a multilevel algorithm in this paper and present numerical analysis on the error estimates for the multilevel algorithm. The multilevel algorithm solves the mixed Stokes/Darcy system by applying efficient legacy code for single model solvers to solve two decoupled Stokes and Darcy subproblems on all the subsequently refined meshes, except for a much smaller global problem only on a very coarse initial mesh. Numerical experiments are conducted for both the two-level and multilevel algorithms to illustrate their effectiveness and efficiency, and validate the related theoretical analysis.     

BBM-Burgers方程解得衰减估计

本文研究了一维空间的BBM-Burgers方程.利用时频分解和能量估计等工具,在解整体存在的前提下,得到了本方程柯西问题解的某些衰减估计.     

Numerical approximation of the Smagorinsky model by a two-level method

A two-level method for discretizing the Smagorinsky model for the numerical simulation of turbulent flows is proposed. In the two-level algorithm, the solution to the fully nonlinear coarse mesh problem is utilized in a single-step linear fine mesh problem. When modeling parameters are chosen appropriately, the error in the two-level algorithm is comparable to the error in solving the fully nonlinear problem on the fine mesh. We provide an a priori error estimate for the two-level method, which yields appropriate scalings between the coarse and fine mesh-sizes (H and h, respectively), and the radius of the spatial filter used in the Smagorinsky model (δ). In addition, we provide an algorithm in which a coarse mesh correction is performed to further enhance the accuracy. (© 2008 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim)     

Variable neighborhood search: Principles and applications

Systematic change of neighborhood within a possibly randomized local search algorithm yields a simple and effective metaheuristic for combinatorial and global optimization, called variable neighborhood search (VNS). We present a basic scheme for this purpose, which can easily be implemented using any local search algorithm as a subroutine. Its effectiveness is illustrated by solving several classical combinatorial or global optimization problems. Moreover, several extensions are proposed for solving large problem instances: using VNS within the successive approximation method yields a two-level VNS, called variable neighborhood decomposition search (VNDS); modifying the basic scheme to explore easily valleys far from the incumbent solution yields an efficient skewed VNS (SVNS) heuristic. Finally, we show how to stabilize column generation algorithms with help of VNS and discuss various ways to use VNS in graph theory, i.e., to suggest, disprove or give hints on how to prove conjectures, an area where metaheuristics do not appear to have been applied before.     

A two-level finite element method for the Navier–Stokes equations based on a new projection

We consider a fully discrete two-level approximation for the time-dependent Navier–Stokes equations in two dimension based on a time-dependent projection. By defining this new projection, the iteration between large and small eddy components can be reflected by its associated space splitting. Hence, we can get a weakly coupled system of large and small eddy components. This two-level method applies the finite element method in space and Crank–Nicolson scheme in time. Moreover,the analysis and some numerical examples are shown that the proposed two-level scheme can reach the same accuracy as the classical one-level Crank–Nicolson method with a very fine mesh size h by choosing a proper coarse mesh size H. However, the two-level method will involve much less work.     

全局最优化问题的一个无参数的填充函数算法

本文研究了全局最优化问题.利用构造填充函数的方法,提出了一个新的无参数填充函数,它是目标函数的一个明确表达式.得到了一个新的无参数填充函数算法,数值试验结果表明该填充函数算法是有效的,从而推广了填充函数算法在求解全局最优化问题方面的应用.     

地震动瞬时谱估计的UnscentedKalman滤波方法

用时变ARMA模型描述地震动时程,提出了采用Unscented Kalman滤波技术实现地震动瞬时谱估计的思路．算例分析表明,Unscented Kalman滤波方法较Kalman滤波方法适用范围广,具有较高的时间和频率分辨率,能够更好地跟踪地震动的局部特性,适合处理非线性模型或有突变特性的模型的辨识问题．不同阶数ARMA模型的估计结果还表明,以往被忽略的ARMA模型的理论频率分辨力对地震动瞬时谱估计精度有重要影响,应作为一个参考指标在ARMA模型的判阶中加以考虑．     

Time-frequency partitions and characterizations of modulation spaces with localization operators

We study families of time-frequency localization operators and derive a new characterization of modulation spaces. This characterization relates the size of the localization operators to the global time-frequency distribution. As a by-product, we obtain a new proof for the existence of multi-window Gabor frames and extend the structure theory of Gabor frames.     

基于分数阶Fourier变换的结构瞬时频率识别北大核心CSCD

为识别时变信号的瞬时频率,由分数阶Fourier变换定义推导出了一般信号的频率与单一变量旋转角度α的关系式,从理论上解释了分数阶Fourier变换本质上是一种普通Fourier变换结合伸缩平移窗的算法,进而在分数阶Fourier域建立了非平稳信号瞬时频率的一般表达式,实现了结构瞬时频率的识别.采用任意非线性调频信号仿真算例和三自由度有阻尼时变结构系统的数值算例对提出的方法进行了比较分析.结果表明,该文提出的方法与理论值吻合良好,并具有一定的抗噪性,验证了方法的可靠性和实用性,可以应用于时变结构瞬时频率的识别.     

Subspace Preconditioned LSQR for Discrete Ill-Posed Problems

We present a novel implementation of a two-level iterative method for the solution of discrete linear ill-posed problems. The algorithm is algebraically equivalent to the two-level Schur complement CG algorithm of Hanke and Vogel, but involves less work per iteration. We review the algorithm, discuss our implementation, and show promising results from numerical experiments that give insight into the proper use of the algorithm.This revised version was published online in October 2005 with corrections to the Cover Date.     

Fast computation of two-level circulant preconditioners

In this paper we present an algorithm for the construction of the superoptimal circulant preconditioner for a two-level Toeplitz linear system. The algorithm is fast, in the sense that it operates in FFT time. Numerical results are given to assess its performance when applied to the solution of two-level Toeplitz systems by the conjugate gradient method, compared with the Strang and optimal circulant preconditioners.     

非嵌套网格上的Morley元两水平加性Schwarz方法

1．引言设0是RZ中的有界多边形区域，其边界为Rfl．考虑下面的重调和Dirichlet问题：（1．1）的变分形式为：求。EHI（fi）使得对？／EL‘（m，问题（1．幻的唯一可解性可由冯（m上的M线性型的强制性和连续性以及La。Mlgram定理得出（of［4］）．令人一｛丸）是n的一个三角剖分，并且满足最小角条件，其中h是它的网格参数．设Vh为Money元空间［41．问题（1．2）的有限元离散问题为：求。eVh使得当有限元参数人很小时，这个方程组很大，而且矩阵A的条件数变得非常大，直接求解，存贮量及计算量都很大．如果B可逆，则方程组（1．4）等…     

Global regularity for 3D magneto-hydrodynamics equations with only horizontal dissipation

We investigate the Cauchy problem for the 3D magneto-hydrodynamics equations with only horizontal dissipation for the small initial data. With the help of the dissipation in the horizontal direction and the structure of the system, we analyze the properties of the decay of the solution and apply these decay properties to get the global regularity of the solution. In the process, we mainly use the frequency decomposition in Green's function method and energy method.     

线性方程组逼近双障碍问题

针对双障碍问题,本文提出了与其等价的B可微方程的类Broyden算法,并 在一定条件下证明了该算法的全局收敛性和超线性收敛性.经数值实验表明该算法是 有效的.     

具简单界约束变分不等式的拟牛顿算法的收敛性分析

１．引言 牛顿型方法是解变分不等式的一类重要数值迭代算法．其局部收敛性质的研究也取得了很好的成果（见［５］等）．近几年来,此类算法的全局收敛性研究也得到了许多进展．如阻尼牛顿法的局部超线性乃至二阶收敛性质的研究（见［４,６,９; １１, １２, １４; １６］等）．然而,对于计算上更为实用的拟牛顿法的研究还不多见．文［１８］基于祁力群等在［１４］中给出的逐次逼近牛顿型法,建立了一种解非线性互补问题的拟牛顿法,并得到了类Ｂｒｏｙｄｅｎ算法的全局收敛性．但是,该方法有以下两个缺陷：１．线搜索可能不能实现…