正交共轭滤波器的构造

It is very importent for generating an orthonormal multiwavelet system to construct a conjugate quadrature filter(CQF). In this paper, a general method of deriving a length-L 1 conjugate quadrature filter from a length-L conjugate quadrature filter and vice versa is obtained. As a special case, we study generally the construction of any length-L 1 compactly supported symmetric-antisymmetric orthonormal multiwavelet system with multiplicity 2 from a length-L multiwavelet system and vice versa. Examples of conjugate quadrature filter are given.     

Scaling by Binormalization

We present an iterative algorithm (BIN) for scaling all the rows and columns of a real symmetric matrix to unit 2-norm. We study the theoretical convergence properties and its relation to optimal conditioning. Numerical experiments show that BIN requires 2–4 matrix–vector multiplications to obtain an adequate scaling, and in many cases significantly reduces the condition number, more than other scaling algorithms. We present generalizations to complex, nonsymmetric and rectangular matrices.     

Networks, Fields and Organizations: Micro-Dynamics, Scale and Cohesive Embeddings

Social action is situated in fields that are simultaneously composed of interpersonal ties and relations among organizations, which are both usefully characterized as social networks. We introduce a novel approach to distinguishing different network macro-structures in terms of cohesive subsets and their overlaps. We develop a vocabulary that relates different forms of network cohesion to field properties as opposed to organizational constraints on ties and structures. We illustrate differences in probabilistic attachment processes in network evolution that link on the one hand to organizational constraints versus field properties and to cohesive network topologies on the other. This allows us to identify a set of important new micro-macro linkages between local behavior in networks and global network properties. The analytic strategy thus puts in place a methodology for Predictive Social Cohesion theory to be developed and tested in the context of informal and formal organizations and organizational fields. We also show how organizations and fields combine at different scales of cohesive depth and cohesive breadth. Operational measures and results are illustrated for three organizational examples, and analysis of these cases suggests that different structures of cohesive subsets and overlaps may be predictive in organizational contexts and similarly for the larger fields in which they are embedded. Useful predictions may also be based on feedback from level of cohesion in the larger field back to organizations, conditioned on the level of multiconnectivity to the field.     

Polynomiality of primal-dual affine scaling algorithms for nonlinear complementarity problems

This paper provides an analysis of the polynomiality of primal-dual interior point algorithms for nonlinear complementarity problems using a wide neighborhood. A condition for the smoothness of the mapping is used, which is related to Zhu’s scaled Lipschitz condition, but is also applicable to mappings that are not monotone. We show that a family of primal-dual affine scaling algorithms generates an approximate solution (given a precision ε) of the nonlinear complementarity problem in a finite number of iterations whose order is a polynomial ofn, ln(1/ε) and a condition number. If the mapping is linear then the results in this paper coincide with the ones in Jansen et al., SIAM Journal on Optimization 7 (1997) 126–140. Research supported in part by Grant-in-Aids for Encouragement of Young Scientists (06750066) from the Ministry of Education, Science and Culture, Japan. Research supported by Dutch Organization for Scientific Research (NWO), grant 611-304-028     

Scaling units via the canonical correlation analysis in the DEA context

This paper deals with the evaluation of decision making units which have multiple inputs and outputs. A new method (CCA/DEA) is developed where the Canonical Correlation Analysis (CCA) is utilized to provide a full rank scaling for all the units rather than a categorical classification (for efficient and inefficient units) as done by the Data Envelopment Analysis (DEA). The CCA/DEA approach is an attempt to bridge the gap between the frontier approach of DEA and the average tendencies of statistics (econometrics). Nonparametric statistical tests are employed to validate the consistency between the classification from the DEA and the postclassification that was generated by the CCA/DEA.     

向量值双正交小波的存在性及滤波器的构造

引进了向量值多分辨分析与向量值双正交小波的概念.讨论了向量值双正交小波的存在性.运用多分辨分析和矩阵理论,给出一类紧支撑向量值双正交小波滤波器的构造算法.最后,给出4-系数向量值双正交小波滤波器的的构造算例.     

Respectively scaled HSS iteration methods for solving discretized spatial fractional diffusion equations

For the discrete linear systems resulted from the discretization of the one‐dimensional anisotropic spatial fractional diffusion equations of variable coefficients with the shifted finite‐difference formulas of the Grünwald–Letnikov type, we propose a class of respectively scaled Hermitian and skew‐Hermitian splitting iteration method and establish its asymptotic convergence theory. The corresponding induced matrix splitting preconditioner, through further replacements of the involved Toeplitz matrices with certain circulant matrices, leads to an economic variant that can be executed by fast Fourier transforms. Both theoretical analysis and numerical implementations show that this fast respectively scaled Hermitian and skew‐Hermitian splitting preconditioner can significantly improve the computational efficiency of the Krylov subspace iteration methods employed as effective linear solvers for the target discrete linear systems.     

分数阶尺度函数的分解与重构算法

引入分数阶多分辨分析与分数阶尺度函数的概念.运用时频分析方法与分数阶小波变换,研究了分数阶正交小波的构造方法,得到分数阶正交小波存在的充要条件.给出分数阶尺度函数与小波的分解与重构算法,算法比经典的尺度函数与小波的分解与重构算法更具有一般性.     

Scaling considerations for modelling the in situ vitrification process

Thermal-electric field interactions occur in many areas of engineering. An example is the in situ vitrification process, a relatively new technology for remediating hazardous wastes. Mathematical and physical modelling of this process requires knowledge of the similarity constraints involving thermal- electric fields. This paper addresses this issue and derives the scaling relationships for modelling the remediation process from fundamental principles. Requirements for maintaining temperature and electric potential field similarity between the model and the prototype are determined as well as requirements for maintaining similarity in off-gas generation rates. A scaling rationale for designing reduced scale experiments is presented, and the results are assessed numerically.     

Comparative analysis of affine scaling algorithms based on simplifying assumptions

We analyze several affine potential reduction algorithms for linear programming based on simplifying assumptions. We show that, under a strong probabilistic assumption regarding the distribution of the data in an iteration, the decrease in the primal potential function will be with high probability, compared to the guaranteed(1). ( 2n is a parameter in the potential function andn is the number of variables.) Under the same assumption, we further show that the objective reduction rate of Dikin's affine scaling algorithm is with high probability, compared to no guaranteed convergence rate.Research supported in part by NSF Grant DDM-8922636.