A mixed high‐order vector finite element method for waveguides: convergence and spurious mode studies

In this article we construct and analyse the performance of various combinations of high order edge elements for the transverse field component with high order node elements for the longitudinal field component. The overall efficiency and mode resolution improve dramatically with high order elements. For example, quadratic/cubic elements provide accuracy of 10⁻⁴ in eigenvalue 1000 times faster and resolve the discontinuities in the field very accurately. In the mixed FEM for waveguides we observed that edge elements may produce spurious modes. When the order of the edge elements is equal or larger than the order of the node elements, spurious and degenerate modes are present. Any other combination of the orders did not produce spurious modes. We study the spurious modes from the divergence point of view. We also study the convergence properties of high order elements and compare the results with the theory. Copyright © 2005 John Wiley & Sons, Ltd.     

Iterative learning control for non‐repetitive trajectory tracking of robot manipulators with joint position constraints and actuator faults

In this work, we present a novel iterative learning control (ILC) scheme for a class of joint position constrained robot manipulator systems with both multiplicative and additive actuator faults. Unlike most ILC literature that requires identical reference trajectory from trail to trail, in this work the reference trajectory can be non‐repetitive over the iteration domain without assuming the identical initial condition. A tan‐type Barrier Lyapunov Function is proposed to deal with the constraint requirements which can be both time and iteration varying, with ILC update laws adopted to learn the iteration‐invariant system uncertainties, and robust methods used to compensate the iteration and time varying actuator faults and disturbances. We show that under the proposed ILC scheme, uniform convergence of the full state tracking error beyond a small time interval in each iteration can be guaranteed over the iteration domain, while the constraint requirements on the joint position vector will not be violated during operation. An illustrative example on a two degree‐of‐freedom robotic manipulator is presented to demonstrate the effectiveness of the proposed control scheme. Copyright © 2016 John Wiley & Sons, Ltd.     

Classical eigenvalue mode‐spectrum analysis of multiple‐ridged rectangular and circular waveguides for the design of narrowband waveguide components

A classical eigenvalue mode‐spectrum analysis of waveguides with multi‐ridged cross sections is presented and applied to the design of narrowband waveguide components in rectangular and circular waveguide technology. Modifications of the modes of the empty waveguide enclosures are used as expansion functions and lead to a classical, real and symmetric eigenvalue problem. A simple yet efficient constraint function is introduced to satisfy boundary conditions for TM modes. The number and locations of ridges positioned in a regular rectangular or circular waveguide enclosure is arbitrary. Measurements and comparisons with results from existing full‐wave modeling tools and commercially available field solvers verify the correctness and flexibility of the approach. Copyright © 2009 John Wiley & Sons, Ltd.     

Hierarchical multi‐label classification based on over‐sampling and hierarchy constraint for gene function prediction

Hierarchical multi‐label classification (HMC) is a variant of classification where instances may belong to multiple classes at the same time and these classes are organized in a hierarchy. Gene function prediction is a complicated HMC problem with large class number and usually strongly imbalanced class distributions. This paper proposes an improved HMC method based on over‐sampling and hierarchy constraint for solving the gene function prediction problem. The HMC task is transferred into a set of binary support vector machine (SVM) classification tasks. Then, two measures are implemented to enhance the HMC performance by introducing the hierarchy constraint into learning procedures. Firstly, for imbalanced classes, a hierarchical synthetic minority over‐sampling technique (SMOTE) is proposed as over‐sampling preprocessing to improve the SVM learning performance. Secondly, an improved True Path Rule (TPR) ensemble approach is introduced to combine the results of binary probabilistic SVM classifications. It can improve the classification results and guarantee the hierarchy constraint of classes. Experiment results on four benchmark FunCat Yeast datasets show that the proposed method significantly outperforms the basic TPR method and the Flat ensemble method. © 2012 Institute of Electrical Engineers of Japan. Published by John Wiley & Sons, Inc.     

On the design of two channel perfect construction QMF filters

This paper presents two rapidly convergent methods for the design of two‐channel odd degree linear phase FIR banks as well as IIR filter banks. In both cases, zeros of arbitrary multiplicity are assumed at z = −1, to ensure regularity of the generated wavelet basis. It is shown that in the FIR case, the problem reduces to the solution of an eigenvalue problem. A simple minimization method is proposed for its solution to reduce most of the computational complexities of eigenvalue evaluations. In the IIR case, a simple rapidly convergent algorithm is also described for the determination of a perfect as well as pseudo‐perfect reconstruction stable IIR function having equiripple pass and stop band responses and with almost constant group delay. It is also shown that the analysis and synthesis banks are of same complexities, and as a result of being expressed as sum of two all‐pass functions, they are realized in a lattice form. Therefore, they are immune from quantization effects. Illustrative examples are also given. Copyright © 2000 John Wiley & Sons, Ltd.     

Robust learning controller design for MIMO stochastic discrete‐time systems: An H∞‐based approach

This paper is devoted to designing iterative learning control (ILC) for multiple‐input multiple‐output discrete‐time systems that are subject to random disturbances varying from iteration to iteration. Using the super‐vector approach to ILC, statistical expressions are presented for both expectation and variance of the tracking error, and time‐domain conditions are developed to ensure their asymptotic stability and monotonic convergence. It shows that time‐domain conditions can be tied together with an H_∞‐based condition in the frequency domain by considering the properties of block Toeplitz matrices. This makes it possible to apply the linear matrix inequality technique to describe the convergence conditions and to obtain formulas for the control law design. Furthermore, the H_∞‐based approach is shown applicable to ILC design regardless of the system relative degree, which can also be used to address issues of model uncertainty. For a class of systems with a relative degree of one, simulation tests are provided to illustrate the effectiveness of the H_∞‐based approach to robust ILC design. Copyright © 2011 John Wiley & Sons, Ltd.     

Compact model order reduction of weakly nonlinear systems by associated transform

We advance a recently proposed approach, called the associated transform, for computing slim projection matrices serving high‐order Volterra transfer functions in the context of weakly nonlinear model order reduction (NMOR). The innovation is to carry out an association of multivariate (Laplace) variables in high‐order multiple‐input multiple‐output transfer functions to generate univariate single‐s transfer functions. In contrast to conventional projection‐based NMOR which finds projection subspaces about every s_i in multivariate transfer functions, only that about a single s is required in the proposed approach. This leads to much more compact reduced‐order models without compromising accuracy. Specifically, the proposed NMOR procedure first converts the original set of Volterra transfer functions into a new set of linear transfer functions, which then allows direct utilization of linear MOR techniques for modeling weakly nonlinear systems with either single‐tone or multi‐tone inputs. An adaptive algorithm is also given to govern the selection of appropriate basis orders in different Volterra transfer functions. Numerical examples then verify the effectiveness of the proposed scheme. Copyright © 2015 John Wiley & Sons, Ltd.     

Eigenvalue range determination for interval and parametric matrices

Study of the dynamic behaviour of linear limped parameter circuits or systems under parametric uncertainties is a well‐established research area. The present paper addresses the problem of determining the exact (within rounding errors) ranges for the real and imaginary parts of an eigenvalue of real matrices whose elements are either independent intervals or linear (affine) functions of independent interval parameters. A unified method for solving the above problem is suggested in the paper. It is iterative and reduces to forming and solving, at each iteration, two real (incomplete) quadratic systems to find outer interval bounds on the set of the right and left eigenvectors associated with the eigenvalue considered. The method is applicable if: (i) the solutions of both quadratic systems involved are positive and (ii) the outer interval bounds on the eigenvectors satisfy certain constant sign conditions. It is shown that its numerical complexity is polynomial in the size n of the matrix studied. Numerical examples illustrating the applicability of the new method are provided. Copyright © 2009 John Wiley & Sons, Ltd.     

利用改进Rayleigh商逆迭代法进行大系统特定模式降阶

对大系统特定模式进行降阶计算.依据特征值灵敏度对系统状态矩阵A重新排序,仅保留与特定模式强相关的发电机组,使矩阵维数得以降低.由于降阶后矩阵一般为复数形式,把矩阵虚部作为实部的修正量.以实部的特定特征值作为初值,用改进Rayleigh商逆迭代格式准确计算.算例分析验证了该方法的有效性.     

Estimation of charge distribution on a bulky solid dielectric using regularization technique

We have been studying a multi‐point charge measurement method using an electrostatic probe. In this technique, charge densities x must be estimated from the probe outputs b by an inverse calculation based on an equation A x = b . The matrix A is obtained by applying a numerical field calculation technique. When the matrix A is in ill‐condition, the solution often makes no sense, including extremely large errors. Therefore, we apply the regularized least squares method (RLS) with a penalty term to perform the inverse calculation stably for the ill‐conditioned matrix. The penalty term imposes some constraints on the solutions. In this paper, first, we have analyzed the accuracy of the charge distribution estimated by the inverse calculation. Although the perturbation bound of the solution errors has already been proposed for the least squares method, it has not yet been given for the RLS. We have derived the equations that express the perturbation bound of the solution errors in applying the RLS to evaluate the estimation accuracy. Second, we have applied the above equations to an experimental result for a cylindrical dielectric solid, and estimated the charge distribution represented by 10,140 unknowns. We have utilized an iteration technique and the symmetric configuration of the measured arrangement so as to reduce the amount of operations and memory capacity required for the inverse calculation. © 2008 Wiley Periodicals, Inc. Electr Eng Jpn, 163(2): 1–13, 2008; Published online in Wiley InterScience ( www.interscience.wiley.com ). DOI 10.1002/eej.20412     

A study on the tie‐set graph theory and network flow optimization problems

Aiming at establishing a firm basic theory to ring‐based information network management systems, our paper proposes a tie‐set graph theory. We define a binary vector representing a tie‐set in a biconnected undirected graph G=(V,E) as a tie‐set vector. The set of tie‐set vectors forms a vector space over the proposed law of composition, then a basis of the vector space, μ linear independent tie‐set vectors, is defined as a tie‐set basis. The essential key concept in our theory is a tie‐set graph, which has a one‐to‐one correspondence to a tie‐set basis and represents a relation between two tie‐set vectors of the basis. Some important properties of tie‐set graphs and their application to survivable mesh networks in modern high‐speed backbone networks are also presented. Furthermore, as a general approach to network flow optimization problems, tie‐set flow vector space is proposed based on the tie‐set graph theory. A distributed algorithm for the network flow optimization problems and its application are also presented in this paper. Copyright © 2004 John Wiley & Sons, Ltd.     

An interface‐enriched generalized finite element analysis for electromagnetic problems with non‐conformal discretizations

An interface‐enriched generalized finite element method is presented for analyzing electromagnetic problems involving highly inhomogeneous materials. To avoid creating conformal meshes within a complex computational domain and preparing multiple meshes during optimization, enriched vector basis functions are introduced over the finite elements that intersect the material interfaces to capture the normal derivative discontinuity of the tangential field component. These enrichment functions are directly constructed from a linear combination of the vector basis functions of the sub‐elements. Several numerical examples are presented to verify the method with analytical solutions and demonstrate its h‐refinement convergence rate. The proposed interface‐enriched generalized finite element method is shown to achieve the same level of accuracy as the standard finite element method based on conformal meshes. Two examples, involving multiple microvascular channels and circular inclusions of different radii, are analyzed to illustrate the capability of the proposed approach in handling complicated inhomogeneous geometries. Copyright © 2015 John Wiley & Sons, Ltd.     

Kernelized relative entropy for direct fault detection in industrial rotary kilns

The objective of this work is to use a 1‐dimensional signal that reflects the dissimilarity between multidimensional probability densities for detection. With the modified Kullback‐Leibler divergence, faults can be directly detected without any normality assumption or joint monitoring of related test statistics in different subspaces such as the T² and SPE in principal component analysis–based methods. To relieve the difficulty associated with asymptotic high‐dimensional density estimates, we have estimated the density ratio rather than the densities themselves. This can be done by approximating the density ratio with kernel basis functions and learn the weights from the available data. The developed algorithm is generic and can be applied to any industrial system as long as process historical data is available. As a case study, we apply this algorithm to a real rotary kiln in operation, which is an integral part of the cement manufacturing plant of Ain El Kebira, Algeria.     

Global adaptive finite‐time stabilization of a class of switched nonlinear systems with parametric uncertainty

This paper investigates the global adaptive finite‐time stabilization of a class of switched nonlinear systems, whose subsystems are all in p (p≤1) normal form with unknown control coefficients and parametric uncertainties. The restrictions on the power orders and the nonlinear perturbations are relaxed. By using the parameter separation technique, the uncertain parameters are separated from nonlinear functions. A systematic design procedure for a common state feedback controller and a switching adaptive law is presented by employing the backstepping methodology. It is proved that the closed‐loop system is finite‐time stable under arbitrary switching by utilizing the common Lyapunov function. Finally, with the application to finite‐time control of chemical reactor systems, the effectiveness of the proposed method is demonstrated. Copyright © 2015 John Wiley & Sons, Ltd.     

小干扰稳定性分析中一种关键特征值计算的稀疏实现

该文提出了一种大规模电力系统小干扰稳定性分析中基于稀疏技术的关键特征值求解方法。该方法借助于Cayley变换，将关键特征值计算变为主特征值的计算，导出了基于稀疏增广状态矩阵的幂法迭代公式，并利用稀疏2×2分块矩阵及稀疏三角分解技术实现了该方法。2个示例系统的计算结果验证了算法的正确性和有效性。该方法不但可用于低频振荡抑制中控制器参数的协调优化，而且其中使用的多种基本技术也可以推广到基于子空间法求取部分关键特征值的各种迭代计算中。     

Mode‐matching analysis of a spit‐circular cavity resonator for measurement of the dielectric constant for film on a substrate

In this paper, we apply the mode‐matching technique (eigenmode expansion) to formulate an analytical model for a split cylindrical cavity resonator with a thick ceramic film layer sandwiched between two‐layer alumina substrates. We then compute the resonant frequencies with the TE₀₁₁ mode with an eigenvalue problem approach using the model formula. The quality factor (Q ‐factor) of the resonator is also calculated by applying the perturbation method to the analytical model. The validity of the proposed analytical technique is confirmed by applying this method to the estimation of permittivity of thick films as an inverse problem. Ceramic films (2 µm thickness) were synthesized using a chemical solution method onto 200‐µm‐thick, 50‐mm‐diameter alumina substrates. The complex permittivity of the films was then determined using the TE₀₁₁ mode split cylindrical cavity resonator in the 10‐GHz band. The extent of the edge effect at a sample insertion space was evaluated by comparing the estimated results through TE wave analysis using the mode‐matching method when the transverse resonance technique and the perturbation method were applied to calculate the resonant frequency and the dielectric Q ‐factor. The results obtained indicate that a difference of 0.153% in the permittivity of the alumina substrate causes differences of 6.10 and 3.75% in the measured permittivity and loss tangent, respectively, of 2‐µm‐thick ceramic film with a permittivity of ∼50. Differences in permittivity and loss tangent were more pronounced with thinner films. It was also confirmed that the estimated results for permittivity and the loss tangent values of these ceramic films were affected by the estimated permittivity value of the alumina substrate. © 2017 Institute of Electrical Engineers of Japan. Published by John Wiley & Sons, Inc.     

Convergence properties of bias‐eliminating algorithms for errors‐in‐variables identification

This paper considers the problem of dynamic errors‐in‐variables identification. Convergence properties of the previously proposed bias‐eliminating algorithms are investigated. An error dynamic equation for the bias‐eliminating parameter estimates is derived. It is shown that the convergence of the bias‐eliminating algorithms is basically determined by the eigenvalue of largest magnitude of a system matrix in the estimation error dynamic equation. When this system matrix has all its eigenvalues well inside the unit circle, the bias‐eliminating algorithms can converge fast. In order to avoid possible divergence of the iteration‐type bias‐eliminating algorithms in the case of high noise, the bias‐eliminating problem is re‐formulated as a minimization problem associated with a concentrated loss function. A variable projection algorithm is proposed to efficiently solve the resulting minimization problem. A numerical simulation study is conducted to demonstrate the theoretical analysis. Copyright © 2005 John Wiley & Sons, Ltd.     

Higher‐order CN‐FETD method for analysis of microwave circuit structures

In this paper, the hierarchical high‐order basis functions on tetrahedrons are introduced to the Crank–Nicolson (CN) finite‐element time‐domain (FETD) with the 3D Maxwell equations for analysis of the microwave circuit structures. Whitney 1‐form high‐order hierarchical basis functions are used to expand the electric field and Whitney 2‐form high‐order hierarchical basis functions for the magnetic field. The CN scheme is employed in the FETD method to lead to an unconditionally stable algorithm. Numerical results were presented to demonstrate the accuracy and efficiency of the proposed high‐order CN‐FETD method. Copyright © 2012 John Wiley & Sons, Ltd.     

An approximation for the input conductivity function of the non‐linear resistive grid

The 2‐term approximations for the input conductivity functions, i_in=f_in(v_in), of a grid of similar weakly non‐linear (parabolic) conductors, and the grid's symmetric cuts, measured between two close nodes, are derived, using a semi‐empirical method; the results of a relevant PSpice simulation are presented. The functions f_in(v_in) of the grid's symmetric cuts possess a common analytical feature. Simulation results show that the error in the calculation of the non‐linear terms in the input functions is less than 1 per cent. Copyright © 2001 John Wiley & Sons, Ltd.     

Computational aspects of the DC analysis of transistor networks

For a general transistor-resistor network a method is proposed to obtain, in some normed linear vector space Rⁿ, the numerical solution of the dc equation G(U) = C for a given constant vector C = C*. At each step k, k = 0, 1,…, a vector C^k is chosen from a certain set Γ_k and the equation solved for C = C^k by a Newtonian iteration yielding the locally unique solution U^k. Convergence in a finite number of steps is proved for a sequence {C^k} on the straight line through C° and C*, provided this line does not contain a point C? between C° and C*, such that at the solution C? of G(U) = C?, the derivative G'(ū) is singular. Otherwise another initial point C° must be chosen, or the path of {C^k be altered to reach C*. The method is restricted to a closed and bounded subset of Rⁿ, in which all the solutions of the dc equation have to lie. To find all the solutions, this bounded subset can be covered with balls. The method proposed in this paper is also useful in the analysis of a transistor-resistor circuit, where often the important problem arises of whether the circuit will admit its correct dc bias, since this problem can be best understood by investigating the uniqueness of solutions of the dc equation.