Convex feasibility problems are widely used in image reconstruction,sparse signal recovery,and other areas.This paper is devoted to considering a class of convex feasibility problem arising from sparse signal recovery...Convex feasibility problems are widely used in image reconstruction,sparse signal recovery,and other areas.This paper is devoted to considering a class of convex feasibility problem arising from sparse signal recovery.We rst derive the projection formulas for a vector onto the feasible sets.The centralized circumcentered-reection method is designed to solve the convex feasibility problem.Some numerical experiments demonstrate the feasibility and e ectiveness of the proposed algorithm,showing superior performance compared to conventional alternating projection methods.展开更多
Under suitable conditions,the monotone convergence about the projected iteration method for solving linear complementarity problem is proved and the influence of the involved parameter matrix on the convergence rate o...Under suitable conditions,the monotone convergence about the projected iteration method for solving linear complementarity problem is proved and the influence of the involved parameter matrix on the convergence rate of this method is investigated.展开更多
Algorithms are the primary component of Artificial Intelligence(AI).The algorithm is the process in AI that imitates the human mind to solve problems.Currently evaluating the performance of AI is achieved by evaluatin...Algorithms are the primary component of Artificial Intelligence(AI).The algorithm is the process in AI that imitates the human mind to solve problems.Currently evaluating the performance of AI is achieved by evaluating AI algorithms by metric scores on data sets.However the evaluation of algorithms in AI is challenging because the evaluation of the same type of algorithm has many data sets and evaluation metrics.Different algorithms may have individual strengths and weaknesses in evaluation metric scores on separate data sets,lacking the credibility and validity of the evaluation.Moreover,evaluation of algorithms requires repeated experiments on different data sets,reducing the attention of researchers to the research of the algorithms itself.Crucially,this approach to evaluating comparative metric scores does not take into account the algorithm’s ability to solve problems.And the classical algorithm evaluation of time and space complexity is not suitable for evaluating AI algorithms.Because classical algorithms input is infinite numbers,whereas AI algorithms input is a data set,which is limited and multifarious.According to the AI algorithm evaluation without response to the problem solving capability,this paper summarizes the features of AI algorithm evaluation and proposes an AI evaluation method that incorporates the problem-solving capabilities of algorithms.展开更多
In this paper,two-grid immersed finite element (IFE) algorithms are proposed and analyzed for semi-linear interface problems with discontinuous diffusion coefficients in two dimension.Because of the advantages of fini...In this paper,two-grid immersed finite element (IFE) algorithms are proposed and analyzed for semi-linear interface problems with discontinuous diffusion coefficients in two dimension.Because of the advantages of finite element (FE) formulation and the simple structure of Cartesian grids,the IFE discretization is used in this paper.Two-grid schemes are formulated to linearize the FE equations.It is theoretically and numerically illustrated that the coarse space can be selected as coarse as H =O(h^1/4)(or H =O(h^1/8)),and the asymptotically optimal approximation can be achieved as the nonlinear schemes.As a result,we can settle a great majority of nonlinear equations as easy as linearized problems.In order to estimate the present two-grid algorithms,we derive the optimal error estimates of the IFE solution in the L^p norm.Numerical experiments are given to verify the theorems and indicate that the present two-grid algorithms can greatly improve the computing efficiency.展开更多
Several effective numerical methods for solving the elasto-plastic contact problems with friction are pres- ented.First,a direct substitution method is employed to impose the contact constraint conditions on condensed...Several effective numerical methods for solving the elasto-plastic contact problems with friction are pres- ented.First,a direct substitution method is employed to impose the contact constraint conditions on condensed finite ele- ment equations,thus resulting in a reduction by half in the dimension of final governing equations.Second,an algorithm composed of contact condition probes and elasto-plastic iterations is utilized to solve the governing equation,which distinguishes two kinds of nonlinearities,and makes the solution unique.In addition,Positive-Negative Sequence Modifica- tion Method is used to condense the finite element equations of each substructure and an analytical integration is intro- duced to determine the elasto-plastic status after each time step or each iteration,hence the computational efficiency is en- hanced to a great extent.Finally,several test and practical examples are pressented showing the validity and versatility of these methods and algorithms.展开更多
A class of preconditioned iterative methods, i.e., preconditioned generalized accelerated overrelaxation （GAOR） methods, is proposed to solve linear systems based on a class of weighted linear least squares problems...A class of preconditioned iterative methods, i.e., preconditioned generalized accelerated overrelaxation （GAOR） methods, is proposed to solve linear systems based on a class of weighted linear least squares problems. The convergence and comparison results are obtained. The comparison results show that the convergence rate of the preconditioned iterative methods is better than that of the original methods. Furthermore, the effectiveness of the proposed methods is shown in the numerical experiment.展开更多
In this paper,a fully discrete stability analysis is carried out for the direct discontinuous Galerkin(DDG)methods coupled with Runge-Kutta-type implicit-explicit time marching,for solving one-dimensional linear conve...In this paper,a fully discrete stability analysis is carried out for the direct discontinuous Galerkin(DDG)methods coupled with Runge-Kutta-type implicit-explicit time marching,for solving one-dimensional linear convection-diffusion problems.In the spatial discretization,both the original DDG methods and the refined DDG methods with interface corrections are considered.In the time discretization,the convection term is treated explicitly and the diffusion term implicitly.By the energy method,we show that the corresponding fully discrete schemes are unconditionally stable,in the sense that the time-stepis only required to be upper bounded by a constant which is independent of the mesh size h.Opti-mal error estimate is also obtained by the aid of a special global projection.Numerical experiments are given to verify the stability and accuracy of the proposed schemes.展开更多
In this paper,a class of new immersed interface finite element methods (IIFEM) is developed to solve elasticity interface problems with homogeneous and non-homogeneous jump conditions in two dimensions.Simple non-body...In this paper,a class of new immersed interface finite element methods (IIFEM) is developed to solve elasticity interface problems with homogeneous and non-homogeneous jump conditions in two dimensions.Simple non-body-fitted meshes are used.For homogeneous jump conditions,both non-conforming and conforming basis functions are constructed in such a way that they satisfy the natural jump conditions. For non-homogeneous jump conditions,a pair of functions that satisfy the same non-homogeneous jump conditions are constructed using a level-set representation of the interface.With such a pair of functions,the discontinuities across the interface in the solution and flux are removed;and an equivalent elasticity interface problem with homogeneous jump conditions is formulated.Numerical examples are presented to demonstrate that such methods have second order convergence.展开更多
This paper analyzed necessity and laws of natural and cultural resource consumption and creation activities as a branch of economics or research direction, proposed such basic frameworks of landscape economics such as...This paper analyzed necessity and laws of natural and cultural resource consumption and creation activities as a branch of economics or research direction, proposed such basic frameworks of landscape economics such as connotations, basic problems and research methods on the basis of sorting out literature. Landscape economics is a social science focusing on the public preferences for natural and humanistic landscapes, and the preference evolution laws, economic laws of landscape resource consumption and creation activities. The basic problems include evaluation of landscape resource value, optimal utilization of landscape resources, landscape resource development and protection policies, formation and creation of diversified landscape structure. The research methods include investigation of consumers' willingness, experiment and behavioral economics, logical reasoning, and case study.展开更多
This paper studies to numerical solutions of an inverse heat conduction problem.The effect of algorithms based on the Newton-Tikhonov method and the Newton-implicit iterative method is investigated,and then several mo...This paper studies to numerical solutions of an inverse heat conduction problem.The effect of algorithms based on the Newton-Tikhonov method and the Newton-implicit iterative method is investigated,and then several modifications are presented.Numerical examples show the modified algorithms always work and can greatly reduce the computational costs.展开更多
By presenting a general framework, some regularization methods for solving linear ill-posed problems are considered in a unified manner. Applications to some specific approaches are illustrated.
Iterative methods for solving discrete optimal control problems are constructed and investigated. These discrete problems arise when approximating by finite difference method or by finite element method the optimal co...Iterative methods for solving discrete optimal control problems are constructed and investigated. These discrete problems arise when approximating by finite difference method or by finite element method the optimal control problems which contain a linear elliptic boundary value problem as a state equation, control in the righthand side of the equation or in the boundary conditions, and point-wise constraints for both state and control functions. The convergence of the constructed iterative methods is proved, the implementation problems are discussed, and the numerical comparison of the methods is executed.展开更多
With constant deepening of the reform and opening-up,national economic system has changed from planned economy to market economy,and rural survey and statistics remain in a difficult transition period. In this period,...With constant deepening of the reform and opening-up,national economic system has changed from planned economy to market economy,and rural survey and statistics remain in a difficult transition period. In this period,China needs transforming original statistical mode according to market economic system. All levels of government should report and submit a lot and increasing statistical information. Besides,in this period,townships,villages and counties are faced with old and new conflicts. These conflicts perplex implementation of rural statistics and survey and development of rural statistical undertaking,and also cause researches and thinking of reform of rural statistical and survey methods.展开更多
In 1992, Cooper [2] has presented some new stability concepts for Runge-Kutta methods whichis based on two slightly different test problems, and obtained the algebraic conditions that guarantee newstability properties...In 1992, Cooper [2] has presented some new stability concepts for Runge-Kutta methods whichis based on two slightly different test problems, and obtained the algebraic conditions that guarantee newstability properties. In this paper, we extend these results to general linear methods and to more generalproblem class Kστ. The concepts of (k, p, q)-secondary stability and (k, p. q)-secondary stability are introduced, and the criteria of secondary algebraic stability are also established. The criteria relax algebraicstability conditions while retaining the virtues of a nonlinear test problem.展开更多
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.展开更多
We derived and analyzed a new numerical scheme for the coupled Stokes and Darcy problems by using H（div） conforming elements in the entire domain. The approach employs the mixed finite element method for the Darcy e...We derived and analyzed a new numerical scheme for the coupled Stokes and Darcy problems by using H（div） conforming elements in the entire domain. The approach employs the mixed finite element method for the Darcy equations and a stabilized H（div） finite element method for the Stokes equations. Optimal error estimates for the fluid velocity and pressure are derived. The finite element solutions from the new scheme not only feature a full satisfaction of the continuity equation, which is highly demanded in scientific computing, but also satisfy the mass conservation.展开更多
Inspired by inertial methods and extragradient algorithms,two algorithms were proposed to investigate fixed point problem of quasinonexpansive mapping and pseudomonotone equilibrium problem in this study.In order to e...Inspired by inertial methods and extragradient algorithms,two algorithms were proposed to investigate fixed point problem of quasinonexpansive mapping and pseudomonotone equilibrium problem in this study.In order to enhance the speed of the convergence and reduce computational cost,the algorithms used a new step size and a cutting hyperplane.The first algorithm was proved to be weak convergence,while the second algorithm used a modified version of Halpern iteration to obtain strong convergence.Finally,numerical experiments on several specific problems and comparisons with other algorithms verified the superiority of the proposed algorithms.展开更多
Accelerated proximal gradient methods have recently been developed for solving quasi-static incremental problems of elastoplastic analysis with some different yield criteria.It has been demonstrated through numerical ...Accelerated proximal gradient methods have recently been developed for solving quasi-static incremental problems of elastoplastic analysis with some different yield criteria.It has been demonstrated through numerical experiments that these methods can outperform conventional optimization-based approaches in computational plasticity.However,in literature these algorithms are described individually for specific yield criteria,and hence there exists no guide for application of the algorithms to other yield criteria.This short paper presents a general form of algorithm design,independent of specific forms of yield criteria,that unifies the existing proximal gradient methods.Clear interpretation is also given to each step of the presented general algorithm so that each update rule is linked to the underlying physical laws in terms of mechanical quantities.展开更多
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
A variety of matrix rational interpolation problems include the partial realizationproblem for matrix power series and the minimal rational interpolation problem for generalmatrix functions.Several problems in circuit...A variety of matrix rational interpolation problems include the partial realizationproblem for matrix power series and the minimal rational interpolation problem for generalmatrix functions.Several problems in circuit theory and digital filter design can also be re-duced to the solution of matrix rational interpolation problems[1—4].By means of thereachability and the observability indices of defined pairs of matrices,Antoulas,Ball,Kang and Willems solved the minimal matrix rational interpolation problem in[1].On展开更多
基金Supported by the Natural Science Foundation of Guangxi Province(Grant Nos.2023GXNSFAA026067,2024GXN SFAA010521)the National Natural Science Foundation of China(Nos.12361079,12201149,12261026).
文摘Convex feasibility problems are widely used in image reconstruction,sparse signal recovery,and other areas.This paper is devoted to considering a class of convex feasibility problem arising from sparse signal recovery.We rst derive the projection formulas for a vector onto the feasible sets.The centralized circumcentered-reection method is designed to solve the convex feasibility problem.Some numerical experiments demonstrate the feasibility and e ectiveness of the proposed algorithm,showing superior performance compared to conventional alternating projection methods.
文摘Under suitable conditions,the monotone convergence about the projected iteration method for solving linear complementarity problem is proved and the influence of the involved parameter matrix on the convergence rate of this method is investigated.
基金funded by the General Program of the National Natural Science Foundation of China grant number[62277022].
文摘Algorithms are the primary component of Artificial Intelligence(AI).The algorithm is the process in AI that imitates the human mind to solve problems.Currently evaluating the performance of AI is achieved by evaluating AI algorithms by metric scores on data sets.However the evaluation of algorithms in AI is challenging because the evaluation of the same type of algorithm has many data sets and evaluation metrics.Different algorithms may have individual strengths and weaknesses in evaluation metric scores on separate data sets,lacking the credibility and validity of the evaluation.Moreover,evaluation of algorithms requires repeated experiments on different data sets,reducing the attention of researchers to the research of the algorithms itself.Crucially,this approach to evaluating comparative metric scores does not take into account the algorithm’s ability to solve problems.And the classical algorithm evaluation of time and space complexity is not suitable for evaluating AI algorithms.Because classical algorithms input is infinite numbers,whereas AI algorithms input is a data set,which is limited and multifarious.According to the AI algorithm evaluation without response to the problem solving capability,this paper summarizes the features of AI algorithm evaluation and proposes an AI evaluation method that incorporates the problem-solving capabilities of algorithms.
基金Project supported by the National Natural Science Foundation of China(Nos.11671157 and11826212)
文摘In this paper,two-grid immersed finite element (IFE) algorithms are proposed and analyzed for semi-linear interface problems with discontinuous diffusion coefficients in two dimension.Because of the advantages of finite element (FE) formulation and the simple structure of Cartesian grids,the IFE discretization is used in this paper.Two-grid schemes are formulated to linearize the FE equations.It is theoretically and numerically illustrated that the coarse space can be selected as coarse as H =O(h^1/4)(or H =O(h^1/8)),and the asymptotically optimal approximation can be achieved as the nonlinear schemes.As a result,we can settle a great majority of nonlinear equations as easy as linearized problems.In order to estimate the present two-grid algorithms,we derive the optimal error estimates of the IFE solution in the L^p norm.Numerical experiments are given to verify the theorems and indicate that the present two-grid algorithms can greatly improve the computing efficiency.
基金The Project Supported by National Natural Science Foundation of China
文摘Several effective numerical methods for solving the elasto-plastic contact problems with friction are pres- ented.First,a direct substitution method is employed to impose the contact constraint conditions on condensed finite ele- ment equations,thus resulting in a reduction by half in the dimension of final governing equations.Second,an algorithm composed of contact condition probes and elasto-plastic iterations is utilized to solve the governing equation,which distinguishes two kinds of nonlinearities,and makes the solution unique.In addition,Positive-Negative Sequence Modifica- tion Method is used to condense the finite element equations of each substructure and an analytical integration is intro- duced to determine the elasto-plastic status after each time step or each iteration,hence the computational efficiency is en- hanced to a great extent.Finally,several test and practical examples are pressented showing the validity and versatility of these methods and algorithms.
基金supported by the National Natural Science Foundation of China (No. 11071033)the Fundamental Research Funds for the Central Universities (No. 090405013)
文摘A class of preconditioned iterative methods, i.e., preconditioned generalized accelerated overrelaxation （GAOR） methods, is proposed to solve linear systems based on a class of weighted linear least squares problems. The convergence and comparison results are obtained. The comparison results show that the convergence rate of the preconditioned iterative methods is better than that of the original methods. Furthermore, the effectiveness of the proposed methods is shown in the numerical experiment.
基金the NSFC grant 11871428the Nature Science Research Program for Colleges and Universities of Jiangsu Province grant 20KJB110011Qiang Zhang:Research supported by the NSFC grant 11671199。
文摘In this paper,a fully discrete stability analysis is carried out for the direct discontinuous Galerkin(DDG)methods coupled with Runge-Kutta-type implicit-explicit time marching,for solving one-dimensional linear convection-diffusion problems.In the spatial discretization,both the original DDG methods and the refined DDG methods with interface corrections are considered.In the time discretization,the convection term is treated explicitly and the diffusion term implicitly.By the energy method,we show that the corresponding fully discrete schemes are unconditionally stable,in the sense that the time-stepis only required to be upper bounded by a constant which is independent of the mesh size h.Opti-mal error estimate is also obtained by the aid of a special global projection.Numerical experiments are given to verify the stability and accuracy of the proposed schemes.
基金supported by the US ARO grants 49308-MA and 56349-MAthe US AFSOR grant FA9550-06-1-024+1 种基金he US NSF grant DMS-0911434the State Key Laboratory of Scientific and Engineering Computing of Chinese Academy of Sciences during a visit by Z.Li between July-August,2008.
文摘In this paper,a class of new immersed interface finite element methods (IIFEM) is developed to solve elasticity interface problems with homogeneous and non-homogeneous jump conditions in two dimensions.Simple non-body-fitted meshes are used.For homogeneous jump conditions,both non-conforming and conforming basis functions are constructed in such a way that they satisfy the natural jump conditions. For non-homogeneous jump conditions,a pair of functions that satisfy the same non-homogeneous jump conditions are constructed using a level-set representation of the interface.With such a pair of functions,the discontinuities across the interface in the solution and flux are removed;and an equivalent elasticity interface problem with homogeneous jump conditions is formulated.Numerical examples are presented to demonstrate that such methods have second order convergence.
文摘This paper analyzed necessity and laws of natural and cultural resource consumption and creation activities as a branch of economics or research direction, proposed such basic frameworks of landscape economics such as connotations, basic problems and research methods on the basis of sorting out literature. Landscape economics is a social science focusing on the public preferences for natural and humanistic landscapes, and the preference evolution laws, economic laws of landscape resource consumption and creation activities. The basic problems include evaluation of landscape resource value, optimal utilization of landscape resources, landscape resource development and protection policies, formation and creation of diversified landscape structure. The research methods include investigation of consumers' willingness, experiment and behavioral economics, logical reasoning, and case study.
基金Project supported by the Key Disciplines of Shanghai Municipality (Grant No.S30104)the Shanghai Leading Academic Discipline Project (Grant No.J50101)
文摘This paper studies to numerical solutions of an inverse heat conduction problem.The effect of algorithms based on the Newton-Tikhonov method and the Newton-implicit iterative method is investigated,and then several modifications are presented.Numerical examples show the modified algorithms always work and can greatly reduce the computational costs.
文摘By presenting a general framework, some regularization methods for solving linear ill-posed problems are considered in a unified manner. Applications to some specific approaches are illustrated.
文摘Iterative methods for solving discrete optimal control problems are constructed and investigated. These discrete problems arise when approximating by finite difference method or by finite element method the optimal control problems which contain a linear elliptic boundary value problem as a state equation, control in the righthand side of the equation or in the boundary conditions, and point-wise constraints for both state and control functions. The convergence of the constructed iterative methods is proved, the implementation problems are discussed, and the numerical comparison of the methods is executed.
基金Supported by Project of Business Management Cultivation Discipline in Commerce Department of Rongchang Campus,Southwest University
文摘With constant deepening of the reform and opening-up,national economic system has changed from planned economy to market economy,and rural survey and statistics remain in a difficult transition period. In this period,China needs transforming original statistical mode according to market economic system. All levels of government should report and submit a lot and increasing statistical information. Besides,in this period,townships,villages and counties are faced with old and new conflicts. These conflicts perplex implementation of rural statistics and survey and development of rural statistical undertaking,and also cause researches and thinking of reform of rural statistical and survey methods.
文摘In 1992, Cooper [2] has presented some new stability concepts for Runge-Kutta methods whichis based on two slightly different test problems, and obtained the algebraic conditions that guarantee newstability properties. In this paper, we extend these results to general linear methods and to more generalproblem class Kστ. The concepts of (k, p, q)-secondary stability and (k, p. q)-secondary stability are introduced, and the criteria of secondary algebraic stability are also established. The criteria relax algebraicstability conditions while retaining the virtues of a nonlinear test problem.
基金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.
基金The Key Technologies R&D Program ofSichuan Province (No.05GG006-0062)
文摘We derived and analyzed a new numerical scheme for the coupled Stokes and Darcy problems by using H（div） conforming elements in the entire domain. The approach employs the mixed finite element method for the Darcy equations and a stabilized H（div） finite element method for the Stokes equations. Optimal error estimates for the fluid velocity and pressure are derived. The finite element solutions from the new scheme not only feature a full satisfaction of the continuity equation, which is highly demanded in scientific computing, but also satisfy the mass conservation.
文摘Inspired by inertial methods and extragradient algorithms,two algorithms were proposed to investigate fixed point problem of quasinonexpansive mapping and pseudomonotone equilibrium problem in this study.In order to enhance the speed of the convergence and reduce computational cost,the algorithms used a new step size and a cutting hyperplane.The first algorithm was proved to be weak convergence,while the second algorithm used a modified version of Halpern iteration to obtain strong convergence.Finally,numerical experiments on several specific problems and comparisons with other algorithms verified the superiority of the proposed algorithms.
文摘Accelerated proximal gradient methods have recently been developed for solving quasi-static incremental problems of elastoplastic analysis with some different yield criteria.It has been demonstrated through numerical experiments that these methods can outperform conventional optimization-based approaches in computational plasticity.However,in literature these algorithms are described individually for specific yield criteria,and hence there exists no guide for application of the algorithms to other yield criteria.This short paper presents a general form of algorithm design,independent of specific forms of yield criteria,that unifies the existing proximal gradient methods.Clear interpretation is also given to each step of the presented general algorithm so that each update rule is linked to the underlying physical laws in terms of mechanical quantities.
基金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
基金The works is supported by the National Natural Science Foundation of China(19871054)
文摘A variety of matrix rational interpolation problems include the partial realizationproblem for matrix power series and the minimal rational interpolation problem for generalmatrix functions.Several problems in circuit theory and digital filter design can also be re-duced to the solution of matrix rational interpolation problems[1—4].By means of thereachability and the observability indices of defined pairs of matrices,Antoulas,Ball,Kang and Willems solved the minimal matrix rational interpolation problem in[1].On
