1 Introduetion Many industrial and engineering applieations require numerieally solving ill-posed Problems. Regularization methods are employed to find approximate solutions of these problems.The choice of regularization
This paper introduces the principle of the multi-level method of moments (MoM) and its application in the analysis of the wire-antenna arrays. The multi-level MoM broadens the usage of the iterative methods in the MoM...This paper introduces the principle of the multi-level method of moments (MoM) and its application in the analysis of the wire-antenna arrays. The multi-level MoM broadens the usage of the iterative methods in the MoM. Our numerical results show that when applying it to the wire-antenna array analysis with the consideration of the mutual coupling between elements, it can allow a rapid and accurate evaluation of the current distribution on the antennas, and the computational cost is less, especially when the number of antennas is large.展开更多
In this paper, local multiplicative and additive multilevel methods on adaptively refined meshes are considered for second-order elliptic problems with highly discontinuous coeffi- cients. For the multilevel-precondit...In this paper, local multiplicative and additive multilevel methods on adaptively refined meshes are considered for second-order elliptic problems with highly discontinuous coeffi- cients. For the multilevel-preconditioned system, we study the distribution of its spectrum by using the abstract Schwarz theory. It is proved that, except for a few small eigenval- ues, the spectrum of the preconditioned system is bounded quasi-uniformly with respect to the jumps of the coefficient and the mesh sizes. The convergence rate of multilevel- preconditioned conjugate gradient methods is shown to be quasi-optimal regarding the jumps and the meshes. Numerical experiments are presented to illustrate the theoretical findings.展开更多
In this paper, a local multilevel product algorithm and its additive version are con- sidered for linear systems arising from adaptive nonconforming P1 finite element approx- imations of second order elliptic boundary...In this paper, a local multilevel product algorithm and its additive version are con- sidered for linear systems arising from adaptive nonconforming P1 finite element approx- imations of second order elliptic boundary value problems. The abstract Schwarz theory is applied to analyze the multilevel methods with Jaeobi or Gauss-Seidel smoothers per- formed on local nodes on coarse meshes and global nodes on the finest mesh. It is shown that the local multilevel methods are optimal, i.e., the convergence rate of the multilevel methods is independent of the mesh sizes and mesh levels. Numerical experiments are given to confirm the theoretical results.展开更多
In this paper we develop two multilevel iteration methods for solving linear systems resulting from the Galerkin method and Tikhonov regularization for linear ill-posed problems. The two algorithms and their convergen...In this paper we develop two multilevel iteration methods for solving linear systems resulting from the Galerkin method and Tikhonov regularization for linear ill-posed problems. The two algorithms and their convergence analyses are presented in an abstract framework.展开更多
We introduce multilevel augmentation methods for solving operator equations based on direct sum decompositions of the range space of the operator and the solution space of the operator equation and a matrix splitting ...We introduce multilevel augmentation methods for solving operator equations based on direct sum decompositions of the range space of the operator and the solution space of the operator equation and a matrix splitting scheme. We establish a general setting for the analysis of these methods, showing that the methods yield approximate solutions of the same convergence order as the best approximation from the subspace. These augmentation methods allow us to develop fast, accurate and stable nonconventional numerical algorithms for solving operator equations. In particular, for second kind equations, special splitting techniques are proposed to develop such algorithms. These algorithms are then applied to solve the linear systems resulting from matrix compression schemes using wavelet-like functions for solving Fredholm integral equations of the second kind. For this special case, a complete analysis for computational complexity and convergence order is presented. Numerical examples are included to demonstrate the efficiency and accuracy of the methods. In these examples we use the proposed augmentation method to solve large scale linear systems resulting from the recently developed wavelet Galerkin methods and fast collocation methods applied to integral equations of the secondkind. Our numerical results confirm that this augmentation method is particularly efficient for solving large scale linear systems induced from wavelet compression schemes.展开更多
In this paper we develop multilevel iteration methods for solving linear systems resulting from the Galerkin method and Tikhonov regularization for ill-posed problems. The algorithm and its convergence analysis are pr...In this paper we develop multilevel iteration methods for solving linear systems resulting from the Galerkin method and Tikhonov regularization for ill-posed problems. The algorithm and its convergence analysis are presented in an abstract framework.展开更多
Some ways of multilevel relaxed preconditioning matrices for the stiffness matrix in the discretization of selfad joint second order elliptic boundary value problems are proposed. For reason-able assumptions of the re...Some ways of multilevel relaxed preconditioning matrices for the stiffness matrix in the discretization of selfad joint second order elliptic boundary value problems are proposed. For reason-able assumptions of the relaxed factor ω, smaller relative condition numbers are given. The optimal relaxed factor ω is derived, too.展开更多
In the present paper we extend the method presented by 0. Axelsson and P. Vassilevski called AMLP version (i) of recursively constructing preconditioner for the stiffness matrix in the discretization of selfadjoint se...In the present paper we extend the method presented by 0. Axelsson and P. Vassilevski called AMLP version (i) of recursively constructing preconditioner for the stiffness matrix in the discretization of selfadjoint second order elliptic boundary value problems. In our extended method the systems to be eliminated on each level containing the major block matrices of the given matrix can be solved approximately, while they must be solved exactly in the original method.展开更多
The multilevel characteristic basis function method(MLCBFM)with the adaptive cross approximation(ACA)algorithm for accelerated solution of electrically large scattering problems is studied in this paper.In the convent...The multilevel characteristic basis function method(MLCBFM)with the adaptive cross approximation(ACA)algorithm for accelerated solution of electrically large scattering problems is studied in this paper.In the conventional MLCBFM based on Foldy-Lax multiple scattering equations,the improvement is only made in the generation of characteristic basis functions(CBFs).However,it does not provide a change in impedance matrix filling and reducing matrix calculation procedure,which is time-consuming.In reality,all the impedance and reduced matrix of each level of the MLCBFM have low-rank property and can be calculated efficiently.Therefore,ACA is used for the efficient generation of two-level CBFs and the fast calculation of reduced matrix in this study.Numerical results are given to demonstrate the accuracy and efficiency of the method.展开更多
In this paper, some simple and practical multilevel preconditioners for Hermite conforming and some well known nonconforming finite elements are constructed.
In this paper, a comprehensive energy function is used to formulate the three most popular objective functions:Kapur's, Otsu and Tsalli's functions for performing effective multilevel color image thresholding....In this paper, a comprehensive energy function is used to formulate the three most popular objective functions:Kapur's, Otsu and Tsalli's functions for performing effective multilevel color image thresholding. These new energy based objective criterions are further combined with the proficient search capability of swarm based algorithms to improve the efficiency and robustness. The proposed multilevel thresholding approach accurately determines the optimal threshold values by using generated energy curve, and acutely distinguishes different objects within the multi-channel complex images. The performance evaluation indices and experiments on different test images illustrate that Kapur's entropy aided with differential evolution and bacterial foraging optimization algorithm generates the most accurate and visually pleasing segmented images.展开更多
Among all segmentation techniques, Otsu thresholding method is widely used. Line intercept histogram based Otsu thresholding method(LIH Otsu method) can be more resistant to Gaussian noise, highly efficient in computi...Among all segmentation techniques, Otsu thresholding method is widely used. Line intercept histogram based Otsu thresholding method(LIH Otsu method) can be more resistant to Gaussian noise, highly efficient in computing time, and can be easily extended to multilevel thresholding. But when images contain salt-and-pepper noise, LIH Otsu method performs poorly. An improved LIH Otsu method(ILIH Otsu method) is presented, which can be more resistant to Gaussian noise and salt-and-pepper noise. Moreover, it can be easily extended to multilevel thresholding. In order to improve the efficiency, the optimization algorithm based on the kinetic-molecular theory(KMTOA) is used to determine the optimal thresholds. The experimental results show that ILIH Otsu method has stronger anti-noise ability than two-dimensional Otsu thresholding method(2-D Otsu method), LIH Otsu method, K-means clustering algorithm and fuzzy clustering algorithm.展开更多
Efficient data visualization techniques are critical for many scientific applications. Centroidal Voronoi tessellation(CVT) based algorithms offer a convenient vehicle for performing image analysis,segmentation and co...Efficient data visualization techniques are critical for many scientific applications. Centroidal Voronoi tessellation(CVT) based algorithms offer a convenient vehicle for performing image analysis,segmentation and compression while allowing to optimize retained image quality with respect to a given metric.In experimental science with data counts following Poisson distributions,several CVT-based data tessellation algorithms have been recently developed.Although they surpass their predecessors in robustness and quality of reconstructed data,time consumption remains to be an issue due to heavy utilization of the slowly converging Lloyd iteration.This paper discusses one possible approach to accelerating data visualization algorithms.It relies on a multidimensional generalization of the optimization based multilevel algorithm for the numerical computation of the CVTs introduced in[1],where a rigorous proof of its uniform convergence has been presented in 1-dimensional setting.The multidimensional implementation employs barycentric coordinate based interpolation and maximal independent set coarsening procedures.It is shown that when coupled with bin accretion algorithm accounting for the discrete nature of the data,the algorithm outperforms Lloyd-based schemes and preserves uniform convergence with respect to the problem size.Although numerical demonstrations provided are limited to spectroscopy data analysis,the method has a context-independent setup and can potentially deliver significant speedup to other scientific and engineering applications.展开更多
The augmented Lagrangian penalty formulation and four different coordination strategies are used to examine the nu- merical behavior of Analytical Target Cascading (ATC) for multilevel optimization of hierarchical sys...The augmented Lagrangian penalty formulation and four different coordination strategies are used to examine the nu- merical behavior of Analytical Target Cascading (ATC) for multilevel optimization of hierarchical systems. The coordination strategies considered include augmented Lagrangian using the method of multipliers and alternating direction method of multipliers, diagonal quadratic approximation, and truncated diagonal quadratic approximation. Properties examined include computational cost and solution accuracy based on the selected values for the different parameters that appear in each formulation. The different strategies are implemented using two- and three-level decomposed example problems. While the results show the interaction between the selected ATC formulation and the values of associated parameters, they clearly highlight the impact they could have on both the solution accuracy and computational cost.展开更多
Multilevel inverter has played a vital role in medium and high power applications in the recent years. In this paper, Reduced Switch Count Multi Level Inverter structure (RSCMLI) topology is presented with different p...Multilevel inverter has played a vital role in medium and high power applications in the recent years. In this paper, Reduced Switch Count Multi Level Inverter structure (RSCMLI) topology is presented with different pulse width modulation techniques. The harmonic level analysis is carried out for the reduced switch count multilevel inverter with the different PWM technique such as with Alternate Phase Opposition Disposition (APOD) method, In Phase Disposition (IPD) method and multi reference pulse width modulation method for five level, seven level , nine level and eleven level inverter. The simulation results are compared with the cascaded H Bridge Multi Level Inverter (CHBMLI). The nine level RSCMLI inverter with APOD method is used for the Distribution Static Synchronous Compensator (DSTATCOM) application in the nonlinear load connected system for power factor improvement. The result shows that the harmonic level and the number of switches required for RSCMLI is reduced compared to CHBMLI. RSCMLI employed in DSTATCOM improves the power factor and harmonic level of the system when it is connected to the nonlinear load.展开更多
基金The NNSF (10371137 and 10201034) of China, the Foundation of Doctoral Program of National Higher Education (20030558008)Guangdong Provincial Natural Science Foundation (1011170) of China and the Foundation of Zhongshan University Advanced Research Center.
文摘1 Introduetion Many industrial and engineering applieations require numerieally solving ill-posed Problems. Regularization methods are employed to find approximate solutions of these problems.The choice of regularization
文摘This paper introduces the principle of the multi-level method of moments (MoM) and its application in the analysis of the wire-antenna arrays. The multi-level MoM broadens the usage of the iterative methods in the MoM. Our numerical results show that when applying it to the wire-antenna array analysis with the consideration of the mutual coupling between elements, it can allow a rapid and accurate evaluation of the current distribution on the antennas, and the computational cost is less, especially when the number of antennas is large.
文摘In this paper, local multiplicative and additive multilevel methods on adaptively refined meshes are considered for second-order elliptic problems with highly discontinuous coeffi- cients. For the multilevel-preconditioned system, we study the distribution of its spectrum by using the abstract Schwarz theory. It is proved that, except for a few small eigenval- ues, the spectrum of the preconditioned system is bounded quasi-uniformly with respect to the jumps of the coefficient and the mesh sizes. The convergence rate of multilevel- preconditioned conjugate gradient methods is shown to be quasi-optimal regarding the jumps and the meshes. Numerical experiments are presented to illustrate the theoretical findings.
基金Acknowledgements. The work of the first author was supported by the National Basic Research Program under the Grant 2011CB30971 and National Science Foundation of China (11171335). The work of the second author was supported by the National Natural Science Foundation of China (Grant No. 11201394) and the Fundamental Research Funds for the Central Universities (Grant No. 2012121003).
文摘In this paper, a local multilevel product algorithm and its additive version are con- sidered for linear systems arising from adaptive nonconforming P1 finite element approx- imations of second order elliptic boundary value problems. The abstract Schwarz theory is applied to analyze the multilevel methods with Jaeobi or Gauss-Seidel smoothers per- formed on local nodes on coarse meshes and global nodes on the finest mesh. It is shown that the local multilevel methods are optimal, i.e., the convergence rate of the multilevel methods is independent of the mesh sizes and mesh levels. Numerical experiments are given to confirm the theoretical results.
基金The NSF(0611005)of Jiangxi Province and the SF(2007293)of Jiangxi Provincial Education Department.
文摘In this paper we develop two multilevel iteration methods for solving linear systems resulting from the Galerkin method and Tikhonov regularization for linear ill-posed problems. The two algorithms and their convergence analyses are presented in an abstract framework.
基金Supported in part by the Natural Science Foundation of China under grants 10371137and 10201034Foundation of Doctoral Program of National Higher Education of China under under grant 20030558008Guangdong Provincial Natural Science Foundation of China u
文摘We introduce multilevel augmentation methods for solving operator equations based on direct sum decompositions of the range space of the operator and the solution space of the operator equation and a matrix splitting scheme. We establish a general setting for the analysis of these methods, showing that the methods yield approximate solutions of the same convergence order as the best approximation from the subspace. These augmentation methods allow us to develop fast, accurate and stable nonconventional numerical algorithms for solving operator equations. In particular, for second kind equations, special splitting techniques are proposed to develop such algorithms. These algorithms are then applied to solve the linear systems resulting from matrix compression schemes using wavelet-like functions for solving Fredholm integral equations of the second kind. For this special case, a complete analysis for computational complexity and convergence order is presented. Numerical examples are included to demonstrate the efficiency and accuracy of the methods. In these examples we use the proposed augmentation method to solve large scale linear systems resulting from the recently developed wavelet Galerkin methods and fast collocation methods applied to integral equations of the secondkind. Our numerical results confirm that this augmentation method is particularly efficient for solving large scale linear systems induced from wavelet compression schemes.
基金Natural Science Foundation of China under grants 10371137 and 10201034 the Foundation of Doctoral Program of National Higher Education of China under grant 20030558008 Guangdong Provincial Natural Science Foundation of China under grant 1011170 the Foundation of Zhongshan University Advanced Research Center.
文摘In this paper we develop multilevel iteration methods for solving linear systems resulting from the Galerkin method and Tikhonov regularization for ill-posed problems. The algorithm and its convergence analysis are presented in an abstract framework.
文摘Some ways of multilevel relaxed preconditioning matrices for the stiffness matrix in the discretization of selfad joint second order elliptic boundary value problems are proposed. For reason-able assumptions of the relaxed factor ω, smaller relative condition numbers are given. The optimal relaxed factor ω is derived, too.
基金Supported by State Major Key Project for Basic Researches and the National Natural Science Foundation of China
文摘In the present paper we extend the method presented by 0. Axelsson and P. Vassilevski called AMLP version (i) of recursively constructing preconditioner for the stiffness matrix in the discretization of selfadjoint second order elliptic boundary value problems. In our extended method the systems to be eliminated on each level containing the major block matrices of the given matrix can be solved approximately, while they must be solved exactly in the original method.
基金supported by the National Natural Science Foundation of China (No.61401003)the Specialized Research Fund for the Doctoral Program of Higher Education of China (No.20123401110006)the Natural Science Research Project of Anhui Education ( No. KJ2015A436)
文摘The multilevel characteristic basis function method(MLCBFM)with the adaptive cross approximation(ACA)algorithm for accelerated solution of electrically large scattering problems is studied in this paper.In the conventional MLCBFM based on Foldy-Lax multiple scattering equations,the improvement is only made in the generation of characteristic basis functions(CBFs).However,it does not provide a change in impedance matrix filling and reducing matrix calculation procedure,which is time-consuming.In reality,all the impedance and reduced matrix of each level of the MLCBFM have low-rank property and can be calculated efficiently.Therefore,ACA is used for the efficient generation of two-level CBFs and the fast calculation of reduced matrix in this study.Numerical results are given to demonstrate the accuracy and efficiency of the method.
文摘In this paper, some simple and practical multilevel preconditioners for Hermite conforming and some well known nonconforming finite elements are constructed.
文摘In this paper, a comprehensive energy function is used to formulate the three most popular objective functions:Kapur's, Otsu and Tsalli's functions for performing effective multilevel color image thresholding. These new energy based objective criterions are further combined with the proficient search capability of swarm based algorithms to improve the efficiency and robustness. The proposed multilevel thresholding approach accurately determines the optimal threshold values by using generated energy curve, and acutely distinguishes different objects within the multi-channel complex images. The performance evaluation indices and experiments on different test images illustrate that Kapur's entropy aided with differential evolution and bacterial foraging optimization algorithm generates the most accurate and visually pleasing segmented images.
基金Project(61440026)supported by the National Natural Science Foundation of ChinaProject(11KZ|KZ08062)supported by Doctoral Research Project of Xiangtan University,China
文摘Among all segmentation techniques, Otsu thresholding method is widely used. Line intercept histogram based Otsu thresholding method(LIH Otsu method) can be more resistant to Gaussian noise, highly efficient in computing time, and can be easily extended to multilevel thresholding. But when images contain salt-and-pepper noise, LIH Otsu method performs poorly. An improved LIH Otsu method(ILIH Otsu method) is presented, which can be more resistant to Gaussian noise and salt-and-pepper noise. Moreover, it can be easily extended to multilevel thresholding. In order to improve the efficiency, the optimization algorithm based on the kinetic-molecular theory(KMTOA) is used to determine the optimal thresholds. The experimental results show that ILIH Otsu method has stronger anti-noise ability than two-dimensional Otsu thresholding method(2-D Otsu method), LIH Otsu method, K-means clustering algorithm and fuzzy clustering algorithm.
基金supported by the grants DMS 0405343 and DMR 0520425.
文摘Efficient data visualization techniques are critical for many scientific applications. Centroidal Voronoi tessellation(CVT) based algorithms offer a convenient vehicle for performing image analysis,segmentation and compression while allowing to optimize retained image quality with respect to a given metric.In experimental science with data counts following Poisson distributions,several CVT-based data tessellation algorithms have been recently developed.Although they surpass their predecessors in robustness and quality of reconstructed data,time consumption remains to be an issue due to heavy utilization of the slowly converging Lloyd iteration.This paper discusses one possible approach to accelerating data visualization algorithms.It relies on a multidimensional generalization of the optimization based multilevel algorithm for the numerical computation of the CVTs introduced in[1],where a rigorous proof of its uniform convergence has been presented in 1-dimensional setting.The multidimensional implementation employs barycentric coordinate based interpolation and maximal independent set coarsening procedures.It is shown that when coupled with bin accretion algorithm accounting for the discrete nature of the data,the algorithm outperforms Lloyd-based schemes and preserves uniform convergence with respect to the problem size.Although numerical demonstrations provided are limited to spectroscopy data analysis,the method has a context-independent setup and can potentially deliver significant speedup to other scientific and engineering applications.
文摘The augmented Lagrangian penalty formulation and four different coordination strategies are used to examine the nu- merical behavior of Analytical Target Cascading (ATC) for multilevel optimization of hierarchical systems. The coordination strategies considered include augmented Lagrangian using the method of multipliers and alternating direction method of multipliers, diagonal quadratic approximation, and truncated diagonal quadratic approximation. Properties examined include computational cost and solution accuracy based on the selected values for the different parameters that appear in each formulation. The different strategies are implemented using two- and three-level decomposed example problems. While the results show the interaction between the selected ATC formulation and the values of associated parameters, they clearly highlight the impact they could have on both the solution accuracy and computational cost.
文摘Multilevel inverter has played a vital role in medium and high power applications in the recent years. In this paper, Reduced Switch Count Multi Level Inverter structure (RSCMLI) topology is presented with different pulse width modulation techniques. The harmonic level analysis is carried out for the reduced switch count multilevel inverter with the different PWM technique such as with Alternate Phase Opposition Disposition (APOD) method, In Phase Disposition (IPD) method and multi reference pulse width modulation method for five level, seven level , nine level and eleven level inverter. The simulation results are compared with the cascaded H Bridge Multi Level Inverter (CHBMLI). The nine level RSCMLI inverter with APOD method is used for the Distribution Static Synchronous Compensator (DSTATCOM) application in the nonlinear load connected system for power factor improvement. The result shows that the harmonic level and the number of switches required for RSCMLI is reduced compared to CHBMLI. RSCMLI employed in DSTATCOM improves the power factor and harmonic level of the system when it is connected to the nonlinear load.