Searcharxiv⌕ Search

arXiv subjects

Jinxin Wang

Publications and source records attributed to Jinxin Wang.

22 records · Page 2Linked to original sources

Morphological effects of leading-edge serrations on the acoustic signatures of mixed flow fan analyzed using novel CFD-informed methods

Leading-edge (LE) noise is a common source of broadband noise for fans that can be suppressed using appended LE serrations. We conduct an integrated study of the morphological effects of interval, length, and inclination angle of owl-inspired LE serrations on the aeroacoustic characteristics of a mixed flow fan using experiments, computational fluid dynamics (CFD), and the Ffowcs Williams-Hawkings (FWH) analogy. A novel method for surface noise strength (SNS) visualization was developed based on the FWH analogy with large-eddy simulations, and a CFD-informed index SAPG is proposed to evaluate the severity of flow separation with pressure gradient, which are verified to be effective in examining the acoustic sources and chordwise separation. Acoustic measurements show the robust tradeoff solving capability of the serrations under various morphologies and the SNS visualizations indicate that the separation-induced LE noise is suppressed considerably. One-third octave analyses suggest that extending serration length can lower separation noise more effectively than shrinking the interval over 100-3k Hz. A smaller interval is more desirable while an optimal length exists in association with tonal noise. Moreover, small inclination angles (below 20 degrees) enable the deceleration of oncoming flows with stagnation relieved, and consequently, further suppress the LE noise, by a flow-buffering effect. Heavy inclination angles (over 40 degrees) induce an additional tip vortex, causing high-coherence turbulence impingement noise and resulting in a drastic increase in broadband noise at frequencies exceeding 4k Hz. Our study thus clarifies the morphological effects of LE serrations on aeroacoustic signatures of rotary devices while providing useful methods for acoustic analyses.

physics.flu-dyn↗

Orthogonal Group Synchronization with Incomplete Measurements: Error Bounds and Linear Convergence of the Generalized Power Method

Group synchronization refers to estimating a collection of group elements from the noisy pairwise measurements. Such a nonconvex problem has received much attention from numerous scientific fields including computer vision, robotics, and cryo-electron microscopy. In this paper, we focus on the orthogonal group synchronization problem with general additive noise models under incomplete measurements, which is much more general than the commonly considered setting of complete measurements. Characterizations of the orthogonal group synchronization problem are given from perspectives of optimality conditions as well as fixed points of the projected gradient ascent method which is also known as the generalized power method (GPM). It is well worth noting that these results still hold even without generative models. In the meantime, we derive the local error bound property for the orthogonal group synchronization problem which is useful for the convergence rate analysis of different algorithms and can be of independent interest. Finally, we prove the linear convergence result of the GPM to a global maximizer under a general additive noise model based on the established local error bound property. Our theoretical convergence result holds under several deterministic conditions which can cover certain cases with adversarial noise, and as an example we specialize it to the setting of the Erdös-Rényi measurement graph and Gaussian noise.

math.OC↗

Sparse High-Order Portfolios via Proximal DCA and SCA

In this paper, we aim at solving the cardinality constrained high-order portfolio optimization, i.e., mean-variance-skewness-kurtosis model with cardinality constraint (MVSKC). Optimization for the MVSKC model is of great difficulty in two parts. One is that the objective function is non-convex, the other is the combinational nature of the cardinality constraint, leading to non-convexity as well dis-continuity. Based on the observation that cardinality constraint has the difference-of-convex (DC) property, we transform the cardinality constraint into a penalty term and then propose three algorithms including the proximal difference of convex algorithm (pDCA), pDCA with extrapolation (pDCAe) and the successive convex approximation (SCA) to handle the resulting penalized MVSK (PMVSK) formulation. Moreover, theoretical convergence results of these algorithms are established respectively. Numerical experiments on the real datasets demonstrate the superiority of our proposed methods in obtaining high utility and sparse solutions as well as efficiency in terms of time usage.

q-fin.PM↗

Joint Bandwidth Allocation and Path Selection in WANs with Path Cardinality Constraints

In this paper, we study a joint bandwidth allocation and path selection problem via solving a multi-objective minimization problem under the path cardinality constraints, namely MOPC. Our problem formulation captures various types of objectives including the proportional fairness, the total completion time, as well as the worst-case link utilization ratio. Such an optimization problem is very challenging since it is highly non-convex. Almost all existing works deal with such a problem using relaxation techniques to transform it to be a convex optimization problem. However, we provide a novel solution framework based on the classic alternating direction method of multipliers (ADMM) approach for solving this problem. Our proposed algorithm is simple and easy to be implemented. Each step of our algorithm consists of either finding the maximal root of a single-cubic equation which is guaranteed to have at least one positive solution or solving a one-dimensional convex subproblem in a fixed interval. Under some mild assumptions, we prove that any limiting point of the generated sequence under our proposed algorithm is a stationary point. Extensive numerical simulations are performed to demonstrate the advantages of our algorithm compared with various baselines.

eess.SP↗