An adaptive neuro‐fuzzy inference system for islanding detection in wind turbine as distributed generation

This article proposes a new integrated diagnostic system for islanding detection by means of a neuro‐fuzzy approach. Islanding detection and prevention is a mandatory requirement for grid‐connected distributed generation (DG) systems. Several methods based on passive and active detection scheme have been proposed. Although passive schemes have a large non‐detection zone (NDZ), concern has been raised on active method due to its degrading power‐quality effect. Reliably detecting this condition is regarded by many as an ongoing challenge as existing methods are not entirely satisfactory. The main emphasis of the proposed scheme is to reduce the NDZ to as close as possible and to keep the output power quality unchanged. In addition, this technique can also overcome the problem of setting the detection thresholds inherent in the existing techniques. In this study, we propose to use a hybrid intelligent system called ANFIS (the adaptive neuro‐fuzzy inference system) for islanding detection. This approach utilizes rate of change of frequency (ROCOF) at the target DG location and used as the input sets for a neuro‐fuzzy inference system for intelligent islanding detection. This approach utilizes the ANFIS as a machine learning technology and fuzzy clustering for processing and analyzing the large data sets provided from network simulations using MATLAB software. To validate the feasibility of this approach, the method has been validated through several conditions and different loading, switching operation, and network conditions. The proposed algorithm is compared with the widely used ROCOF relays and found working effectively in the situations where ROCOF fails. Simulation studies showed that the ANFIS‐based algorithm detects islanding situation accurate than other islanding detection algorithms. © 2014 Wiley Periodicals, Inc. Complexity 21: 10–20, 2015     

Wavelet neural network based on islanding detection via inverter‐based DG

In this article, a passive neurowavelet based on islanding detection technique for grid‐connected inverter‐based distributed generation has been developed. Connecting distributed generator to the distribution network has many benefits such as increasing the capacity of the grid and enhancing the power quality. However, it gives rise to many problems. This is mainly due to the fact that distribution networks are designed without any generation units at that level. Hence, integrating distributed generators into the existing distribution network is not problem‐free. Unintentional islanding is one of the encountered problems. Islanding is the situation where the distribution system containing both distributed generator and loads is separated from the main grid as a result of many reasons such as electrical faults and their subsequent switching incidents, equipment failures, or preplanned switching events like maintenance. The proposed method utilizes and combines wavelet analysis and artificial neural network to detect islanding. Discrete wavelet transform is capable of decomposing the signals into different frequency bands. It can be utilized in extracting discriminative features from the acquired voltage signals. Passive schemes have a large nondetection zone (NDZ) and concern has been raised on active method due to its degrading power quality effect. The main emphasis of the proposed scheme is to reduce the NDZ to as close as possible and to keep the output power quality unchanged. The simulations results, performed by MATLAB/Simulink, shows that the proposed method has a small NDZ. Also, this method is capable of detecting islanding accurately within the minimum standard time. © 2014 Wiley Periodicals, Inc. Complexity 21: 309–324, 2015     

Practical finite‐analytic method for solving differential equations by compact numerical schemes

Methodology for development of compact numerical schemes by the practical finite‐analytic method (PFAM) is presented for spatial and/or temporal solution of differential equations. The advantage and accuracy of this approach over the conventional numerical methods are demonstrated. In contrast to the tedious discretization schemes resulting from the original finite‐analytic solution methods, such as based on the separation of variables and Laplace transformation, the practical finite‐analytical method is proven to yield simple and convenient discretization schemes. This is accomplished by a special universal determinant construction procedure using the general multi‐variate power series solutions obtained directly from differential equations. This method allows for direct incorporation of the boundary conditions into the numerical discretization scheme in a consistent manner without requiring the use of artificial fixing methods and fictitious points, and yields effective numerical schemes which are operationally similar to the finite‐difference schemes. Consequently, the methods developed for numerical solution of the algebraic equations resulting from the finite‐difference schemes can be readily facilitated. Several applications are presented demonstrating the effect of the computational molecule, grid spacing, and boundary condition treatment on the numerical accuracy. The quality of the numerical solutions generated by the PFAM is shown to approach to the exact analytical solution at optimum grid spacing. It is concluded that the PFAM offers great potential for development of robust numerical schemes. © 2008 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2009     

Two‐grid mixed finite‐element methods for nonlinear Schrödinger equations

Two‐grid mixed finite element schemes are developed for solving both steady state and unsteady state nonlinear Schrödinger equations. The schemes use discretizations based on a mixed finite‐element method. The two‐grid approach yields iterative procedures for solving the nonlinear discrete equations. The idea is to relegate all of the Newton‐like iterations to grids much coarser than the final one, with no loss in order of accuracy. Numerical tests are performed. © 2010 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 28: 63‐73, 2012     

SUPG and grad‐div stabilized finite element methods for steady weakly compressible viscous flow

The extensive application of mathematical and computational methods has become an efficient and powerful approach to the investigation and solution of many problems and processes in fluid dynamics from qualitative as well as quantitative point of view. In this work a new class of advanced numerical approximation schemes to isothermal compressible viscous flow is presented. The schemes are based on an iteration between an Oseen like problem for the velocity and a hyperbolic transport equation for the density. Such schemes seem attractive for computations because they offer a reduction to simpler problems for which highly refined numerical methods either are known or can be built from existing approximation schemes to similar equations, and because of the guidance that can be drawn from an existence theory based on them. For the generalized Oseen subproblem a Taylor–Hood finite element method is proposed that is stabilized by a reduced SUPG and grad‐div technique (cf. [1, 4]) in the convection‐dominated case. Results of theoretical investigations and numerical studies are presented. (© 2004 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Finite analytic numerical method for solving two‐dimensional quasi‐Laplace equation

A typical power series analytic solution of quasi‐Laplace equation in the infinitesimal angle domain around the singular point of the square cells is provided in this article. Toward the singular point, the gradient of the potential variable will tend to infinity, which is described by the first term of the power series solution. Based on this analytic solution, three finite analytic numerical methods are proposed. These methods are analogous and are constructed, respectively, when considering different numbers of the terms or using different schemes to determine the relevant parameters in the power series. Numerical examples show that all of the three finite analytic numerical methods proposed can provide rather accurate solutions than the traditional numerical methods. In contrast, when using the traditional numerical schemes to solve the quasi‐Laplace equation in a strong heterogeneous medium, the refinement ratio for the grid cell needs to increase dramatically to get an accurate result. In practical applications, subdividing each origin cell into 2 × 2 or 3 × 3 subcells is enough for the finite analytical numerical methods to get relatively accurate results. The finite analytical numerical methods are also convenient to construct the flux field with high accuracy.© 2014 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 30: 1755–1769, 2014     

A decoupling two‐grid algorithm for the mixed Stokes‐Darcy model with the Beavers‐Joseph interface condition

In this article, a decoupling scheme based on two‐grid finite element for the mixed Stokes‐Darcy problem with the Beavers‐Joseph interface condition is proposed and investigated. With a restriction of a physical parameter α, we derive the numerical stability and error estimates for the scheme. Numerical experiments indicate that such two‐grid based decoupling finite element schemes are feasible and efficient. © 2014 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 30: 1066–1082, 2014     

Two‐grid methods for mixed finite‐element solution of coupled reaction‐diffusion systems

We develop 2‐grid schemes for solving nonlinear reaction‐diffusion systems: where p = (p, q) is an unknown vector‐valued function. The schemes use discretizations based on a mixed finite‐element method. The 2‐grid approach yields iterative procedures for solving the nonlinear discrete equations. The idea is to relegate all the Newton‐like iterations to grids much coarser than the final one, with no loss in order of accuracy. The iterative algorithms examined here extend a method developed earlier for single reaction‐diffusion equations. An application to prepattern formation in mathematical biology illustrates the method's effectiveness. © 1999 John Wiley & Sons, Inc. Numer Methods Partial Differential Eq 15: 589–604, 1999     

An analytical methodology for assessment of smart monitoring impact on future electric power distribution system reliability

Smart grid is referred to a modernized power grid which can mitigate fault detection and allow self‐healing of the system without the intervention of operators. This article proposes an innovative analytical formulation using Markov method to evaluate electric power distribution system reliability in smart grids, which incorporates the impact of smart monitoring on the overall system reliability. An accurate reliability model of the main network components and the communication infrastructure have been also considered in the methodology. The proposed approach was applied to a well‐known test bed (Roy Billinton Test System) and various reliability case studies with monitoring provision and monitoring deficiency are analyzed. This article involves the developing possibilities of communication technologies and next‐generation control systems of the entire smart network based on the real‐time monitoring and modern control system to achieve a reliable, economical, safe, and high efficiency of electricity. The implementations indicate that using an appropriate set of the smart grid monitoring devices for power system components can virtually influence all the reliability indices although the amount of improvement varies between techniques. The proposed approach determined that smart monitoring for which components of the electric power distribution systems are tailored and deduce to major economical benefits. The described approach also reveals which reliability indices drastically influenced using monitoring. © 2014 Wiley Periodicals, Inc. Complexity 21: 99–113, 2015     

Antidiffusive Lagrangian‐remap schemes for models of polydisperse sedimentation

One‐dimensional models of gravity‐driven sedimentation of polydisperse suspensions with particles that belong to N size classes give rise to systems of N strongly coupled, nonlinear first‐order conservation laws for the local solids volume fractions. As the eigenvalues and eigenvectors of the flux Jacobian have no closed algebraic form, characteristic‐wise numerical schemes for these models become involved. Alternative simple schemes for this model directly utilize the velocity functions and are based on splitting the system of conservation laws into two different first‐order quasi‐linear systems, which are solved successively for each time iteration, namely, the Lagrangian and remap steps (so‐called Lagrangian‐remap [LR] schemes). This approach was advanced in (Bürger, Chalons, and Villada, SIAM J Sci Comput 35 (2013), B1341–B1368) for a multiclass Lighthill–Whitham‐Richards traffic model with nonnegative velocities. By incorporating recent antidiffusive techniques for transport equations a new version of these Lagrangian‐antidiffusive remap (L‐AR) schemes for the polydisperse sedimentation model is constructed. These L‐AR schemes are supported by a partial analysis for N = 1. They are total variation diminishing under a suitable CFL condition and therefore converge to a weak solution. Numerical examples illustrate that these schemes, including a more accurate version based on MUSCL extrapolation, are competitive in accuracy and efficiency with several existing schemes. © 2015 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 32: 1109–1136, 2016     

Detecting change points in the stress‐strength reliability P(X < Y)

We address the statistical problem of detecting change points in the stress‐strength reliability R=P(X<Y) in a sequence of paired variables (X,Y). Without specifying their underlying distributions, we embed this nonparametric problem into a parametric framework and apply the maximum likelihood method via a dynamic programming approach to determine the locations of the change points in R. Under some mild conditions, we show the consistency and asymptotic properties of the procedure to locate the change points. Simulation experiments reveal that, in comparison with existing parametric and nonparametric change‐point detection methods, our proposed method performs well in detecting both single and multiple change points in R in terms of the accuracy of the location estimation and the computation time. Applications to real data demonstrate the usefulness of our proposed methodology for detecting the change points in the stress‐strength reliability R. Supplementary materials are available online.     

A class of multi‐step difference schemes by using Padé approximant

In this paper, we present a method for the construction of a class of multi‐step finite differences schemes for solving arbitrary order linear two‐point boundary value problems. The construction technique is based on Padé approximant. It is easy to derive multi‐step difference schemes, and it includes many existing schemes as its special cases. Numerical experiments show that the proposed schemes are flexible and convergent. Copyright © 2013 John Wiley & Sons, Ltd.     

A robust algebraic multilevel preconditioner for non‐symmetric M‐matrices

Stable finite difference approximations of convection‐diffusion equations lead to large sparse linear systems of equations whose coefficient matrix is an M‐matrix, which is highly non‐symmetric when the convection dominates. For an efficient iterative solution of such systems, it is proposed to consider in the non‐symmetric case an algebraic multilevel preconditioning method formerly proposed for pure diffusion problems, and for which theoretical results prove grid independent convergence in this context. These results are supplemented here by a Fourier analysis that applies to constant coefficient problems with periodic boundary conditions whenever using an ‘idealized’ version of the two‐level preconditioner. Within this setting, it is proved that any eigenvalue λ of the preconditioned system satisfies for some real constant c such that . This result holds independently of the grid size and uniformly with respect to the ratio between convection and diffusion. Extensive numerical experiments are conducted to assess the convergence of practical two‐ and multi‐level schemes. These experiments, which include problems with highly variable and rotating convective flow, indicate that the convergence is grid independent. It deteriorates moderately as the convection becomes increasingly dominating, but the convergence factor remains uniformly bounded. This conclusion is supported for both uniform and some non‐uniform (stretched) grids. Copyright © 2000 John Wiley & Sons, Ltd.     

Efficient local structure‐preserving schemes for the RLW‐type equation

The multisymplectic schemes have been used in numerical simulations for the RLW‐type equation successfully. They well preserve the local geometric property, but not other local conservation laws. In this article, we propose three novel efficient local structure‐preserving schemes for the RLW‐type equation, which preserve the local energy exactly on any time‐space region and can produce richer information of the original problem. The schemes will be mass‐ and energy‐preserving as the equation is imposed on appropriate boundary conditions. Numerical experiments are presented to verify the efficiency and invariant‐preserving property of the schemes. Comparisons with the existing nonconservative schemes are made to show the behavior of the energy affects the behavior of the solution.© 2017 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 33: 1678–1691, 2017     

High‐order finite difference schemes for numerical solutions of the generalized Burgers–Huxley equation

In this article, up to tenth‐order finite difference schemes are proposed to solve the generalized Burgers–Huxley equation. The schemes based on high‐order differences are presented using Taylor series expansion. To establish the numerical solutions of the corresponding equation, the high‐order schemes in space and a fourth‐order Runge‐Kutta scheme in time have been combined. Numerical experiments have been conducted to demonstrate the high‐order accuracy of the current algorithms with relatively minimal computational effort. The results showed that use of the present approaches in the simulation is very applicable for the solution of the generalized Burgers–Huxley equation. The current results are also seen to be more accurate than some results given in the literature. The proposed algorithms are seen to be very good alternatives to existing approaches for such physical applications. © 2010 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 27: 1313‐1326, 2011     

Stability and convergence of two‐grid Crank‐Nicolson extrapolation scheme for the time‐dependent natural convection equations

In this paper, we consider the Crank‐Nicolson extrapolation scheme for the 2D/3D unsteady natural convection problem. Our numerical scheme includes the implicit Crank‐Nicolson scheme for linear terms and the recursive linear method for nonlinear terms. Standard Galerkin finite element method is used to approximate the spatial discretization. Stability and optimal error estimates are provided for the numerical solutions. Furthermore, a fully discrete two‐grid Crank‐Nicolson extrapolation scheme is developed, the corresponding stability and convergence results are derived for the approximate solutions. Comparison from aspects of the theoretical results and computational efficiency, the two‐grid Crank‐Nicolson extrapolation scheme has the same order as the one grid method for velocity and temperature in H¹‐norm and for pressure in L²‐norm. However, the two‐grid scheme involves much less work than one grid method. Finally, some numerical examples are provided to verify the established theoretical results and illustrate the performances of the developed numerical schemes.     

A two‐grid stabilized mixed finite element method for Darcy‐Forchheimer model

A two‐grid stabilized mixed finite element method based on pressure projection stabilization is proposed for the two‐dimensional Darcy‐Forchheimer model. We use the derivative of a smooth function, , to approximate the derivative of in constructing the two‐grid algorithm. The two‐grid method consists of solving a small nonlinear system on the coarse mesh and then solving a linear system on the fine mesh. There are a substantial reduction in computational cost. We prove the existence and uniqueness of solution of the discrete schemes on the coarse grid and the fine grid and obtain error estimates for the two‐grid algorithm. Finally, some numerical experiments are carried out to verify the accuracy and efficiency of the method.     

A Cartesian‐grid collocation method based on radial‐basis‐function networks for solving PDEs in irregular domains

This paper reports a new Cartesian‐grid collocation method based on radial‐basis‐function networks (RBFNs) for numerically solving elliptic partial differential equations in irregular domains. The domain of interest is embedded in a Cartesian grid, and the governing equation is discretized by using a collocation approach. The new features here are (a) one‐dimensional integrated RBFNs are employed to represent the variable along each line of the grid, resulting in a significant improvement of computational efficiency, (b) the present method does not require complicated interpolation techniques for the treatment of Dirichlet boundary conditions in order to achieve a high level of accuracy, and (c) normal derivative boundary conditions are imposed by means of integration constants. The method is verified through the solution of second‐ and fourth‐order PDEs; accurate results and fast convergence rates are obtained. © 2007 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2007     

Two‐level Fourier analysis of multigrid for higher‐order finite‐element discretizations of the Laplacian

In this paper, we employ local Fourier analysis (LFA) to analyze the convergence properties of multigrid methods for higher‐order finite‐element approximations to the Laplacian problem. We find that the classical LFA smoothing factor, where the coarse‐grid correction is assumed to be an ideal operator that annihilates the low‐frequency error components and leaves the high‐frequency components unchanged, fails to accurately predict the observed multigrid performance and, consequently, cannot be a reliable analysis tool to give good performance estimates of the two‐grid convergence factor. While two‐grid LFA still offers a reliable prediction, it leads to more complex symbols that are cumbersome to use to optimize parameters of the relaxation scheme, as is often needed for complex problems. For the purposes of this analytical optimization as well as to have simple predictive analysis, we propose a modification that is “between” two‐grid LFA and smoothing analysis, which yields reasonable predictions to help choose correct damping parameters for relaxation. This exploration may help us better understand multigrid performance for higher‐order finite element discretizations, including for Q₂‐Q₁ (Taylor‐Hood) elements for the Stokes equations. Finally, we present two‐grid and multigrid experiments, where the corrected parameter choice is shown to yield significant improvements in the resulting two‐grid and multigrid convergence factors.     

An Ergodic Algorithm for the Power-Control Games for CDMA Data Networks

In this paper, we consider power control for the uplink of a direct-sequence code-division multiple-access data network. In the uplink, the purpose of power control is for each user to transmit enough power so that it can achieve the required quality of service without causing unnecessary interference to other users in the system. One method that has been very successful in solving this purpose for power control is the game-theoretic approach. The problem for power control is modified as a Nash equilibrium problem in which each user can choose its transmit power in order to maximize its own utility, and a Nash equilibrium is an ideal solution of the power-control game. We present a noncooperative power-control game in which each user can choose the transmit power in a way that it gets the sufficient signal-to-interference-plus-noise ratio and maximizes its own utility. To ensure the existence of a solution, we also propose the variational inequality problem which is connected with the proposed game. On a linear receiver, we deal with the matched filter receiver. Next we present a new ergodic algorithm for the proposed power control because the existing iterative algorithms can not be applied effectively to the proposed power control. We also present convergence analysis for the proposed algorithm. In addition, applying the proposed algorithm to the proposed power control, we provide numerical examples for the transmit power, the signal-to-interference-plus-noise ratio and so on. Numerical results for the proposed algorithm shall show that as compared with the existing power-control game and its method, all users in the network can enjoy the sufficient signal-to-interference-plus-noise ratio and achieve the required quality of service.