The optimum design and development of a high-frequency transformer (HFT) is a key requirement in the development of a solid state transformer (SST) for incorporating in smart grid environment. This paper proposes an i...
详细信息
The optimum design and development of a high-frequency transformer (HFT) is a key requirement in the development of a solid state transformer (SST) for incorporating in smart grid environment. This paper proposes an iteration- based algorithm for the optimum design of a HFT. The algorithm generate optimum design by evaluating an objective function of minimizing the total owning cost (TOC). The unique features of the algorithm developed for the optimum design of HFT include the following: it iterates eight design variables from their minimum values to maximum values and considers four design constraints for selecting the valid designs. This algorithm can work with three different core materials and can select a suitable AC test voltage based on the HFT voltage rating. A case study is conducted on a HFT incorporated in 1000 kVA, 11 kV/415 V, Dyn11 three-phase SST. It enables us to determine the optimum design parameters of HFT. In this case study, the algorithm is iterated with 121,500 design data inputs, generating 19,873 designs that satisfied all design constraints. The optimum design with minimum TOC is selected from the generated 19,873 designs. The optimum design is validated using finite element analysis in ANSYS software. The results obtained in finite element analysis are comparable with the analytical results and hence the algorithm is validated.
A class of quaternionmatrices called generalized.-(anti-) bi- Hermitian matrices is defined which incorporates the.-(anti-) bi- Hermitian matrices mentioned by Yuan et al. [Linear Multilinear Algebra. 63;2015: 1849- 1...
详细信息
A class of quaternionmatrices called generalized.-(anti-) bi- Hermitian matrices is defined which incorporates the.-(anti-) bi- Hermitian matrices mentioned by Yuan et al. [Linear Multilinear Algebra. 63;2015: 1849- 1863] as special cases. In the earlier referred work, Yuan et al. have derived explicit formulas for the least- squares.-(anti-) biHermitian solutions of the coupled matrix equations (AXB, CXD) = (E, F). In this paper, an efficient iterative algorithm is proposed to numerically find the generalized least- squares.-(anti-) bi- Hermitian solutions of the coupled matrix equations A1X1B1 + C1X2D1, A2X1B2 + C2X2D2 = E1, E2 The validity and efficiency of the presented algorithm is examined by some test experiments.
This paper points out an error in Davidov and Iliopoulos's (Biometrika 100, 778-80) proof of convergence of an iterative algorithm for the proportional likelihood ratio model. It is shown that the iterative algori...
详细信息
This paper points out an error in Davidov and Iliopoulos's (Biometrika 100, 778-80) proof of convergence of an iterative algorithm for the proportional likelihood ratio model. It is shown that the iterative algorithm increases the likelihood in each iteration and converges under mild additional conditions when the odds ratio function is bounded.
The top-k query is an important type of query for the wireless sensor network. In this paper, we present an iterative algorithm to process the top-k query, which is a distributed algorithm combining the in-network agg...
详细信息
The top-k query is an important type of query for the wireless sensor network. In this paper, we present an iterative algorithm to process the top-k query, which is a distributed algorithm combining the in-network aggregation and the trace back techniques. By using the in-network aggregation technique, the iterative algorithm calculates the current maximum value in the network. By using the trace back technology, the maximum value just calculated is removed from the network. The two steps are repeated k times. As the current maximum value in the network is selected per round, the answer to a top-k query can be obtained after k repetitions. Experimental results show that the iterative algorithm can reduce the number of messages transmitted during the procedure of the top-k query processing.
In this paper, under the framework of real Hilbert spaces, we introduce a new iterative algorithm for finding a common element in the solution set of a generalized equilibrium problem and in the fixed-point sets of a ...
详细信息
In this paper, under the framework of real Hilbert spaces, we introduce a new iterative algorithm for finding a common element in the solution set of a generalized equilibrium problem and in the fixed-point sets of a family of nonexpansive mappings. We obtain strong convergence theorems of the common solution problem. An example is provided to support the convergence analysis.
The purpose of this paper is to present a new iterative scheme for finding a common solution to a variational inclusion problem with a finite family of accretive operators and a modified system of variational inequali...
详细信息
The purpose of this paper is to present a new iterative scheme for finding a common solution to a variational inclusion problem with a finite family of accretive operators and a modified system of variational inequalities in infinite-dimensional Banach spaces. Under mild conditions, a strong convergence theorem for approximating this common solution is proved. The methods in the paper are novel and different from those in the early and recent literature.
This paper proposes a new effective pseudo-spectral approximation to solve the Sylvester and Lyapunov matrix differential equations. The properties of the Chebyshev basis operational matrix of derivative are applied t...
详细信息
This paper proposes a new effective pseudo-spectral approximation to solve the Sylvester and Lyapunov matrix differential equations. The properties of the Chebyshev basis operational matrix of derivative are applied to convert the main equation to the matrix equations. Afterwards, an iterative algorithm is examined for solving the obtained equations. Also, the error analysis of the propounded method is presented, which reveals the spectral rate of convergence. To illustrate the effectiveness of the proposed framework, several numerical examples are given.
In this paper, an iterative algorithm is proposed to retrieve the particle-size distributions via Fraunhofer diffraction. A dual integral inversion was proposed in our previous work, the inversion is robust and genera...
详细信息
In this paper, an iterative algorithm is proposed to retrieve the particle-size distributions via Fraunhofer diffraction. A dual integral inversion was proposed in our previous work, the inversion is robust and generates precise particle sizing, if the diffraction pattern can be accurately captured. In real applications, the pattern can only be partially detected, and the inversion fails to reconstruct the size distributions in detail. However, the results of the inversion can be used to produce an initial estimate. Then, a simulated diffraction pattern was generated from the estimated particle sizes. The deviation between the measured pattern and the simulated one was deduced to correct the results of particle sizing. The corrections can be achieved in an iterative approach, and the particle-size distribution was updated subsequently. The iteration stopped once the deviation was below the target value. Both simulation and experiment were conducted to validate the feasibility and effectiveness of the proposed algorithm. The results demonstrate that the size distribution from the proposed algorithm agrees well with the original phantoms for both noise-free and noise-contaminated data.
In this paper, iterative algorithm for strong vector equilibrium problem (SVEP) is studied. Firstly, an auxiliary problem for SVEP is introduced and the relationships between these two problems are discussed. Then, ba...
详细信息
In this paper, iterative algorithm for strong vector equilibrium problem (SVEP) is studied. Firstly, an auxiliary problem for SVEP is introduced and the relationships between these two problems are discussed. Then, based on the auxiliary problem, a projection iterative algorithm for SVEP is proposed. Moreover, analysis of convergence of this iterative algorithm is investigated under suitable conditions of continuity and convexity. The main result obtained in this paper generalizes and improves the corresponding ones of Iusem and Sosa [Iusem AN, Sosa W. iterative algorithms for equilibrium problems. Optimization. 2003;52(3):301-316.] and Cheng and Liu [Cheng B, Liu SY. An iterative algorithm for vector equilibrium problems. J. Lanzhou Univ. (Nat. Sci.). 2009;45(5):105-109.].
In this paper, an iterative algorithm that approximates solutions of split equality fixed point problems (SEFPP) for quasi-phi-nonexpansive mappings is constructed. Weak convergence of the sequence generated by this a...
详细信息
In this paper, an iterative algorithm that approximates solutions of split equality fixed point problems (SEFPP) for quasi-phi-nonexpansive mappings is constructed. Weak convergence of the sequence generated by this algorithm is established in certain real Banach spaces. The theorem proved is applied to solve split equality problem, split equality variational inclusion problem, and split equality equilibrium problem. Finally, some numerical examples are given to demonstrate the convergence of the algorithm. The theorems proved improve and complement a host of important recent results.
暂无评论