Stationary phase approximation in the ambient noise method revisited

The method of extracting Green＇s function between stations from cross correlation has proven to be effective theoretically and experimentally. It has been widely applied to surface wave tomography of the crust and upmost mantle. However, there are still controversies about why this method works. Snieder employed stationary phase approximation in evaluating contribution to cross correlation function from scatterers in the whole space, and concluded that it is the constructive interference of waves emitted by the scatterers near the receiver line that leads to the emergence of Green＇s function. His derivation demonstrates that cross correlation function is just the convolution of noise power spectrum and the Green＇s function. However, his derivation ignores influence from the two stationary points at infinities, therefore it may fail when attenuation is absent. In order to obtain accurate noise-correlation function due to scatters over the whole space, we compute the total contribution with numerical integration in polar coordinates. Our numerical computation of cross correlation function indicates that the incomplete stationary phase approximation introduces remarkable errors to the cross correlation function, in both amplitude and phase, when the frequency is low with reasonable quality factor Q. Our results argue that the dis- tance between stations has to be beyond several wavelengths in order to reduce the influence of this inaccuracy on the applications of ambient noise method, and only the station pairs whose distances are above several （〉5） wavelengths can be used.

THE STRUCTURE AND APPROXIMATION OF A.S. SELF-SIMILAR SET

The structure of any a.s. self-similar set K(w) generated by a class of random elements {gn,wσ} taking values in the space of contractive operators is given and the approximation of K(w) by the fixed points {Pn,wσ} of {gn,ow} is obtained. It is useful to generate the fractal in computer.

Stochastic Approximation Method for Fixed Point Problems

We study iterative processes of stochastic approximation for finding fixed points of weakly contractive and nonexpansive operators in Hilbert spaces under the condition that operators are given with random errors. We prove mean square convergence and convergence almost sure (a.s.) of iterative approximations and establish both asymptotic and nonasymptotic estimates of the convergence rate in degenerate and non-degenerate cases. Previously the stochastic approximation algorithms were studied mainly for optimization problems.

On M–Term Approximations of the Nikol'skii–Besov Class in the Lorentz Spaces

In this paper, we consider a Lorentz space with a mixed norm of periodic functions of many variables. We obtain the exact estimation of the best M-term approximations of Nikol＇skii＇s and Besov＇s classes in the Lorentz space with the mixed norm.

Controllable precision of the projective truncation approximation for Green's functions

Recently, we developed the projective truncation approximation for the equation of motion of two-time Green's functions(Fan et al., Phys. Rev. B 97, 165140(2018)). In that approximation, the precision of results depends on the selection of operator basis. Here, for three successively larger operator bases, we calculate the local static averages and the impurity density of states of the single-band Anderson impurity model. The results converge systematically towards those of numerical renormalization group as the basis size is enlarged. We also propose a quantitative gauge of the truncation error within this method and demonstrate its usefulness using the Hubbard-I basis. We thus confirm that the projective truncation approximation is a method of controllable precision for quantum many-body systems.

Magnetic Properties of One-Dimensional Ferromagnetic Mixed-Spin Model within Tyablikov Decoupling Approximation

In this paper, we apply the two-time Green's function method, and provide a simple way to study themagnetic properties of one-dimensional spin-(S, s) Heisenberg ferromagnets.The magnetic susceptibility and correlationfunctions are obtained by using the Tyablikov decoupling approximation.Our results show that the magnetic susceptibilityand correlation length are a monotonically decreasing function of temperature regardless of the mixed spins.It isfound that in the case of S = s, our results of one-dimensional mixed-spin model is reduced to be those of the isotropicferromagnetic Heisenberg chain in the whole temperature region.Our results for the susceptibility are in agreement withthose obtained by other theoretical approaches.

On Approximation of Function Classes in Lorentz Spaces with Anisotropic Norm

In this paper, Lorentz space of functions of several variables and Besov＇s class are considered. We establish an exact approximation order of Besov＇s class by partial sums of Fourier＇s series for multiple trigonometric system.

An Approximation Method for a Maximum Likelihood Equation System and Application to the Analysis of Accidents Data

There exist many iterative methods for computing the maximum likelihood estimator but most of them suffer from one or several drawbacks such as the need to inverse a Hessian matrix and the need to find good initial approximations of the parameters that are unknown in practice. In this paper, we present an estimation method without matrix inversion based on a linear approximation of the likelihood equations in a neighborhood of the constrained maximum likelihood estimator. We obtain closed-form approximations of solutions and standard errors. Then, we propose an iterative algorithm which cycles through the components of the vector parameter and updates one component at a time. The initial solution, which is necessary to start the iterative procedure, is automated. The proposed algorithm is compared to some of the best iterative optimization algorithms available on R and MATLAB software through a simulation study and applied to the statistical analysis of a road safety measure.

ON CONSERVATIVE APPROXIMATION BY LINEAR POLYNOMIAL OPERATORS AN EXTENSION OF THE BERNSTEIN'S OPERATOR

In this work we slwly linear polynomial operators preserving some consecutive i-convexities and leaving in-verant the polynomtals up to a certain degree. First we study the existence of an incompatibility between the conservation of cenain i-cotivexities and the invariance of a space of polynomials. Interpolation properties are obtained and a theorem by Berens and DcVore about the Bernstein's operator ts extended. Finally, from these results a genera'ized Bernstein's operator is obtained.

H2 and H∞-Feedback Control Design for Nonlinear Gene Networks via Successive Galerkin’s Approximation

This paper presents a design method of H2 and H∞-feedback control loop for nonlinear smooth gene networks that are in control affine form. Formulaic solution methodology for solving the nonlinear partial differential equations, namely the Hamilton-Jacobi-Bellman and Hamilton-Jacobi-Isaacs equations through successive Galerkin’s approximation is implemented and the results are compared. Throughout the implementation, there were several caveats that need to be further resolved for practical applications in general cases. Such issues and the clarification of causes are mathematically established and reviewed.

Approximate expression of Young's equation and molecular dynamics simulation for its applicability

In 1805, Thomas Young was the first to propose an equation(Young's equation) to predict the value of the equilibrium contact angle of a liquid on a solid. On the basis of our predecessors, we further clarify that the contact angle in Young's equation refers to the super-nano contact angle. Whether the equation is applicable to nanoscale systems remains an open question. Zhu et al. [College Phys. 4 7(1985)] obtained the most simple and convenient approximate formula, known as the Zhu–Qian approximate formula of Young's equation. Here, using molecular dynamics simulation, we test its applicability for nanodrops. Molecular dynamics simulations are performed on argon liquid cylinders placed on a solid surface under a temperature of 90 K, using Lennard–Jones potentials for the interaction between liquid molecules and between a liquid molecule and a solid molecule with the variable coefficient of strength a. Eight values of a between 0.650 and 0.825 are used. By comparison of the super-nano contact angles obtained from molecular dynamics simulation and the Zhu–Qian approximate formula of Young's equation, we find that it is qualitatively applicable for nanoscale systems.

Approximate aggregate nearest neighbor search on moving objects trajectories

Aggregate nearest neighbor(ANN) search retrieves for two spatial datasets T and Q, segment(s) of one or more trajectories from the set T having minimum aggregate distance to points in Q. When interacting with large amounts of trajectories, this process would be very time-consuming due to consecutive page loads. An approximate method for finding segments with minimum aggregate distance is proposed which can improve the response time. In order to index large volumes of trajectories, scalable and efficient trajectory index(SETI) structure is used. But some refinements are provided to temporal index of SETI to improve the performance of proposed method. The experiments were performed with different number of query points and percentages of dataset. It is shown that proposed method besides having an acceptable precision, can reduce the computation time significantly. It is also shown that the main fraction of search time among load time, ANN and computing convex and centroid, is related to ANN.

Approximate Private Quantum Channels on Fermionic Gaussian Systems

The private quantum channel (PQC) maps any quantum state to the maximally mixed state for the discrete as well as the bosonic Gaussian quantum systems, and it has fundamental meaning on the quantum cryptographic tasks and the quantum channel capacity problems. In this paper, we primally introduce a notion of approximate private quantum channel (ε-PQC) on fermionic Gaussian systems (i.e., ε-FPQC), and construct its explicit form of the fermionic (Gaussian) private quantum channel. First of all, we suggest a general structure for ε-FPQC on the fermionic Gaussian systems with respect to the Schatten p-norm class, and then we give an explicit proof of the statement in the trace norm case. In addition, we study that the cardinality of a set of fermionic unitary operators agrees on the ε-FPQC condition in the trace norm case. This result may give birth to intuition on the construction of emerging fermionic Gaussian quantum communication or computing systems.

考虑整流性负载特性的LCC-S型无线电能传输系统优化设计

无线电能传输系统中的整流性负载具有非线性特征,而对系统传输特性分析和谐振参数设计时常采用基波分析法,将整流性负载等效为纯电阻,导致理论分析与实际存在一定偏差、系统偏离谐振状态。针对该问题,以LCC-S型无线电能传输系统为研究对象,考虑谐波以及整流性负载的非线性,对系统传输特性进行分析,进而提出基于整流性负载补偿的负载阻抗和接收端串联谐振电容参数的计算方法,并对逆变电路开关特性进行分析验证。所提接收端谐振参数设计方法能够使系统接收端回路谐振,提高系统的输出功率;降低逆变电路开关管的关断电流,提升系统的传输效率。搭建了一套2.5 kW的LCC-S型无线电能传输实验平台,验证了理论分析与所提参数设计方法的有效性和正确性。

REMARKS ON BOUNDS ON THE DISCREPANCY OF APPROXIMATE SOLUTIONS CONSTRUCTED BY GODUNOV'S SCHEME

The bounds on the discrepancy of approximate solutions constructed by Gedunov's scheme to IVP of isentropic equations of gas dynamics are obtained, Three well-knowu results obtained by Lax for shock waves with small jumps for general quasilinear hyperbolic systems of conservation laws are extended to shock waves for isentropic equations of gas dynamics in a bounded invariant region with ρ=0 as one of boundries of the region. Two counterexamples are given to show that two iuequalities given by Godunov do not hold for all rational numbers γ∈(1, 3]. It seems that the approach by Godunov to obtain the forementioned bounds may not be possible.

Dykstra’s Algorithm for the Optimal Approximate Symmetric Positive Semidefinite Solution of a Class of Matrix Equations

Dykstra’s alternating projection algorithm was proposed to treat the problem of finding the projection of a given point onto the intersection of some closed convex sets. In this paper, we first apply Dykstra’s alternating projection algorithm to compute the optimal approximate symmetric positive semidefinite solution of the matrix equations AXB = E, CXD = F. If we choose the initial iterative matrix X0 = 0, the least Frobenius norm symmetric positive semidefinite solution of these matrix equations is obtained. A numerical example shows that the new algorithm is feasible and effective.

多分S-近似空间

基于知识空间理论的多分推广,提出了多分S-近似空间的概念,研究多分S-近似空间模型上、下近似在不同运算和不同决策映射下的性质.进一步,定义上、下近似多分知识状态,利用上、下近似算子的性质研究上、下近似多分知识状态集族形成多分知识结构的条件,特别地,探讨多分知识结构分别满足交封闭和并封闭的条件.多分S-近似空间为多分知识结构的构建及其应用提供了一种新的研究思路和方法,所得成果将丰富和发展S-近似空间理论和知识空间理论.

典型T-S模糊系统是通用逼近器

研究的多输入单输出T S模糊系统采用输入变量的线性函数作为规则后件 ,称为典型T S模糊系统 ,在每个输入变量的模糊子集满足一致性以及隶属函数连续且分段可微的条件下 ,证明了典型T S模糊系统是通用逼近器 .以此为基础 ,提出当典型T S模糊系统采用BP算法进行在线学习时 ,可以仅调节规则后件的参数 。

线性T-S模糊系统作为通用逼近器的充分条件

作为模糊系统理论研究和实际应用的基础 ,对模糊系统通用逼近性的研究已经取得了很大的进展 ,但是只有为数不多的文献研究了模糊系统作为通用逼近器的充分条件 .提出了线性 T- S模糊系统以任意精度一致逼近紧致集上任意连续实函数的一个充分条件 ,并给出了数值示例 .

覆盖S-粗集模型的性质

讨论基于覆盖理论的S-粗集模型的性质,给出了S-粗集生成的拓扑结构,证明了覆盖S-粗集模型与自反、传递关系下的S-粗集模型是等价的。