一种基于迭代近端投影的被动声纳探测离网格DOA估计方法

Traditional direction of arrival(DOA)estimation methods based on sparse reconstruction commonly use convex or smooth functions to approximate non-convex and non-smooth sparse representation problems.This approach often introduces errors into the sparse representation model,necessitating the development of improved DOA estimation algorithms.Moreover,conventional DOA estimation methods typically assume that the signal coincides with a predetermined grid.However,in reality,this assumption often does not hold true.The likelihood of a signal not aligning precisely with the predefined grid is high,resulting in potential grid mismatch issues for the algorithm.To address the challenges associated with grid mismatch and errors in sparse representation models,this article proposes a novel high-performance off-grid DOA estimation approach based on iterative proximal projection(IPP).In the proposed method,we employ an alternating optimization strategy to jointly estimate sparse signals and grid offset parameters.A proximal function optimization model is utilized to address non-convex and non-smooth sparse representation problems in DOA estimation.Subsequently,we leverage the smoothly clipped absolute deviation penalty(SCAD)function to compute the proximal operator for solving the model.Simulation and sea trial experiments have validated the superiority of the proposed method in terms of higher resolution and more accurate DOA estimation performance when compared to both traditional sparse reconstruction methods and advanced off-grid techniques.

Iterative analytic extension in tomographic imaging

If a spatial-domain function has a finite support,its Fourier transform is an entire function.The Taylor series expansion of an entire function converges at every finite point in the complex plane.The analytic continuation theory suggests that a finite-sized object can be uniquely determined by its frequency components in a very small neighborhood.Trying to obtain such an exact Taylor expansion is difficult.This paper proposes an iterative algorithm to extend the measured frequency components to unmeasured regions.Computer simulations show that the proposed algorithm converges very slowly,indicating that the problem is too ill-posed to be practically solvable using available methods.

Algorithm of Slub Yarn Parameter Measurement Based on Capacitive Sensors

A new algorithm of measurement slub yarn parameter was put forward to improve precision and efficient. The basic principal of measurement slub yarn by parallel-plate capacitor was introduced,and slub yarns were tested with a measurement system developed by ourselves. Time sequence for slub length and slub space can be got. And distributions of slub length,slub space and slub scaling factor can also be obtained. The agreement can be attained compared with those original settings. Some error was analyzed also. Consequently this system is effective,and can be adopted in practice.

An orthogonally accumulated projection method for symmetric linear system of equations

A direct as well as iterative method(called the orthogonally accumulated projection method, or the OAP for short) for solving linear system of equations with symmetric coefficient matrix is introduced in this paper. With the Lanczos process the OAP creates a sequence of mutually orthogonal vectors, on the basis of which the projections of the unknown vectors are easily obtained, and thus the approximations to the unknown vectors can be simply constructed by a combination of these projections. This method is an application of the accumulated projection technique proposed recently by the authors of this paper, and can be regarded as a match of conjugate gradient method(CG) in its nature since both the CG and the OAP can be regarded as iterative methods, too. Unlike the CG method which can be only used to solve linear systems with symmetric positive definite coefficient matrices, the OAP can be used to handle systems with indefinite symmetric matrices. Unlike classical Krylov subspace methods which usually ignore the issue of loss of orthogonality, OAP uses an effective approach to detect the loss of orthogonality and a restart strategy is used to handle the loss of orthogonality.Numerical experiments are presented to demonstrate the efficiency of the OAP.

Stationary flow fields prediction of variable physical domain based on proper orthogonal decomposition and kriging surrogate model

In this paper a new flow field prediction method which is independent of the governing equations, is developed to predict stationary flow fields of variable physical domain. Predicted flow fields come from linear superposition of selected basis modes generated by proper orthogonal decomposition（POD）. Instead of traditional projection methods, kriging surrogate model is used to calculate the superposition coefficients through building approximate function relationships between profile geometry parameters of physical domain and these coefficients. In this context,the problem which troubles the traditional POD-projection method due to viscosity and compressibility has been avoided in the whole process. Moreover, there are no constraints for the inner product form, so two forms of simple ones are applied to improving computational efficiency and cope with variable physical domain problem. An iterative algorithm is developed to determine how many basis modes ranking front should be used in the prediction. Testing results prove the feasibility of this new method for subsonic flow field, but also prove that it is not proper for transonic flow field because of the poor predicted shock waves.

Analysis and Efficient Solution of Stationary Schrodinger Equation Governing Electronic States of Quantum Dots and Rings in Magnetic Field

In this work the one-band effective Hamiltonian governing the electronic states of a quantum dot/ring in a homogenous magnetic field is used to derive a pair/quadruple of nonlinear eigenvalue problems corresponding to different spin orientations and in case of rotational symmetry additionally to quantum number±ℓ.We show,that each of those pair/quadruple of nonlinear problems allows for the minmax characterization of its eigenvalues under certain conditions,which are satisfied for our examples and the common InAs/GaAs heterojunction.Exploiting the minmax property we devise efficient iterative projection methods simultaneously handling the pair/quadruple of nonlinear problems and thereby saving up to 40%of the computational time as compared to the nonlinear Arnoldi method applied to each of the problems separately.