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, we design high-order Runge-Kutta discontinuous Galerkin (RKDG) methods with multi-resolution weighted essentially non-oscillatory (multi-resolution WENO) limiters to compute compressible steady-state pr...In this paper, we design high-order Runge-Kutta discontinuous Galerkin (RKDG) methods with multi-resolution weighted essentially non-oscillatory (multi-resolution WENO) limiters to compute compressible steady-state problems on triangular meshes. A troubled cell indicator extended from structured meshes to unstructured meshes is constructed to identify triangular cells in which the application of the limiting procedures is required. In such troubled cells, the multi-resolution WENO limiting methods are used to the hierarchical L^(2) projection polynomial sequence of the DG solution. Through using the RKDG methods with multi-resolution WENO limiters, the optimal high-order accuracy can be gradually reduced to first-order in the triangular troubled cells, so that the shock wave oscillations can be well suppressed. In steady-state simulations on triangular meshes, the numerical residual converges to near machine zero. The proposed spatial reconstruction methods enhance the robustness of classical DG methods on triangular meshes. The good results of these RKDG methods with multi-resolution WENO limiters are verified by a series of two-dimensional steady-state problems.展开更多
Formalizing complex processes and phenomena of a real-world problem may require a large number of variables and constraints,resulting in what is termed a large-scale optimization problem.Nowadays,such large-scale opti...Formalizing complex processes and phenomena of a real-world problem may require a large number of variables and constraints,resulting in what is termed a large-scale optimization problem.Nowadays,such large-scale optimization problems are solved using computing machines,leading to an enormous computational time being required,which may delay deriving timely solutions.Decomposition methods,which partition a large-scale optimization problem into lower-dimensional subproblems,represent a key approach to addressing time-efficiency issues.There has been significant progress in both applied mathematics and emerging artificial intelligence approaches on this front.This work aims at providing an overview of the decomposition methods from both the mathematics and computer science points of view.We also remark on the state-of-the-art developments and recent applications of the decomposition methods,and discuss the future research and development perspectives.展开更多
With the development of economic globalization,distributedmanufacturing is becomingmore andmore prevalent.Recently,integrated scheduling of distributed production and assembly has captured much concern.This research s...With the development of economic globalization,distributedmanufacturing is becomingmore andmore prevalent.Recently,integrated scheduling of distributed production and assembly has captured much concern.This research studies a distributed flexible job shop scheduling problem with assembly operations.Firstly,a mixed integer programming model is formulated to minimize the maximum completion time.Secondly,a Q-learning-assisted coevolutionary algorithmis presented to solve themodel:(1)Multiple populations are developed to seek required decisions simultaneously;(2)An encoding and decoding method based on problem features is applied to represent individuals;(3)A hybrid approach of heuristic rules and random methods is employed to acquire a high-quality population;(4)Three evolutionary strategies having crossover and mutation methods are adopted to enhance exploration capabilities;(5)Three neighborhood structures based on problem features are constructed,and a Q-learning-based iterative local search method is devised to improve exploitation abilities.The Q-learning approach is applied to intelligently select better neighborhood structures.Finally,a group of instances is constructed to perform comparison experiments.The effectiveness of the Q-learning approach is verified by comparing the developed algorithm with its variant without the Q-learning method.Three renowned meta-heuristic algorithms are used in comparison with the developed algorithm.The comparison results demonstrate that the designed method exhibits better performance in coping with the formulated problem.展开更多
In this paper,a composite numerical scheme is proposed to solve the threedimensional Darcy-Forchheimer miscible displacement problem with positive semi-definite assumptions.A mixed finite element is used for the fow e...In this paper,a composite numerical scheme is proposed to solve the threedimensional Darcy-Forchheimer miscible displacement problem with positive semi-definite assumptions.A mixed finite element is used for the fow equation.The velocity and pressure are computed simultaneously.The accuracy of velocity is improved one order.The concentration equation is solved by using mixed finite element,multi-step difference and upwind approximation.A multi-step method is used to approximate time derivative for improving the accuracy.The upwind approximation and an expanded mixed finite element are adopted to solve the convection and diffusion,respectively.The composite method could compute the diffusion flux and its gradient.It possibly becomes an eficient tool for solving convection-dominated diffusion problems.Firstly,the conservation of mass holds.Secondly,the multi-step method has high accuracy.Thirdly,the upwind approximation could avoid numerical dispersion.Using numerical analysis of a priori estimates and special techniques of differential equations,we give an error estimates for a positive definite problem.Numerical experiments illustrate its computational efficiency and feasibility of application.展开更多
Enforcing initial and boundary conditions(I/BCs)poses challenges in physics-informed neural networks(PINNs).Several PINN studies have gained significant achievements in developing techniques for imposing BCs in static...Enforcing initial and boundary conditions(I/BCs)poses challenges in physics-informed neural networks(PINNs).Several PINN studies have gained significant achievements in developing techniques for imposing BCs in static problems;however,the simultaneous enforcement of I/BCs in dynamic problems remains challenging.To overcome this limitation,a novel approach called decoupled physics-informed neural network(d PINN)is proposed in this work.The d PINN operates based on the core idea of converting a partial differential equation(PDE)to a system of ordinary differential equations(ODEs)via the space-time decoupled formulation.To this end,the latent solution is expressed in the form of a linear combination of approximation functions and coefficients,where approximation functions are admissible and coefficients are unknowns of time that must be solved.Subsequently,the system of ODEs is obtained by implementing the weighted-residual form of the original PDE over the spatial domain.A multi-network structure is used to parameterize the set of coefficient functions,and the loss function of d PINN is established based on minimizing the residuals of the gained ODEs.In this scheme,the decoupled formulation leads to the independent handling of I/BCs.Accordingly,the BCs are automatically satisfied based on suitable selections of admissible functions.Meanwhile,the original ICs are replaced by the Galerkin form of the ICs concerning unknown coefficients,and the neural network(NN)outputs are modified to satisfy the gained ICs.Several benchmark problems involving different types of PDEs and I/BCs are used to demonstrate the superior performance of d PINN compared with regular PINN in terms of solution accuracy and computational cost.展开更多
In this paper,a two-step iteration method is established which can be viewed as a generalization of the existing modulus-based methods for vertical linear complementarity problems given by He and Vong(Appl.Math.Lett.1...In this paper,a two-step iteration method is established which can be viewed as a generalization of the existing modulus-based methods for vertical linear complementarity problems given by He and Vong(Appl.Math.Lett.134:108344,2022).The convergence analysis of the proposed method is established,which can improve the existing results.Numerical examples show that the proposed method is efficient with the two-step technique.展开更多
This study sets up two new merit functions,which are minimized for the detection of real eigenvalue and complex eigenvalue to address nonlinear eigenvalue problems.For each eigen-parameter the vector variable is solve...This study sets up two new merit functions,which are minimized for the detection of real eigenvalue and complex eigenvalue to address nonlinear eigenvalue problems.For each eigen-parameter the vector variable is solved from a nonhomogeneous linear system obtained by reducing the number of eigen-equation one less,where one of the nonzero components of the eigenvector is normalized to the unit and moves the column containing that component to the right-hand side as a nonzero input vector.1D and 2D golden section search algorithms are employed to minimize the merit functions to locate real and complex eigenvalues.Simultaneously,the real and complex eigenvectors can be computed very accurately.A simpler approach to the nonlinear eigenvalue problems is proposed,which implements a normalization condition for the uniqueness of the eigenvector into the eigenequation directly.The real eigenvalues can be computed by the fictitious time integration method(FTIM),which saves computational costs compared to the one-dimensional golden section search algorithm(1D GSSA).The simpler method is also combined with the Newton iterationmethod,which is convergent very fast.All the proposed methods are easily programmed to compute the eigenvalue and eigenvector with high accuracy and efficiency.展开更多
A bicubic B-spline finite element method is proposed to solve optimal control problems governed by fourth-order semilinear parabolic partial differential equations.Its key feature is the selection of bicubic B-splines...A bicubic B-spline finite element method is proposed to solve optimal control problems governed by fourth-order semilinear parabolic partial differential equations.Its key feature is the selection of bicubic B-splines as trial functions to approximate the state and costate variables in two space dimensions.A Crank-Nicolson difference scheme is constructed for time discretization.The resulting numerical solutions belong to C2in space,and the order of the coefficient matrix is low.Moreover,the Bogner-Fox-Schmit element is considered for comparison.Two numerical experiments demonstrate the feasibility and effectiveness of the proposed method.展开更多
In this study,a wavelet multi-resolution interpolation Galerkin method(WMIGM)is proposed to solve linear singularly perturbed boundary value problems.Unlike conventional wavelet schemes,the proposed algorithm can be r...In this study,a wavelet multi-resolution interpolation Galerkin method(WMIGM)is proposed to solve linear singularly perturbed boundary value problems.Unlike conventional wavelet schemes,the proposed algorithm can be readily extended to special node generation techniques,such as the Shishkin node.Such a wavelet method allows a high degree of local refinement of the nodal distribution to efficiently capture localized steep gradients.All the shape functions possess the Kronecker delta property,making the imposition of boundary conditions as easy as that in the finite element method.Four numerical examples are studied to demonstrate the validity and accuracy of the proposedwavelet method.The results showthat the use ofmodified Shishkin nodes can significantly reduce numerical oscillation near the boundary layer.Compared with many other methods,the proposed method possesses satisfactory accuracy and efficiency.The theoretical and numerical results demonstrate that the order of theε-uniform convergence of this wavelet method can reach 5.展开更多
In this paper, the optimal control problem of parabolic integro-differential equations is solved by gradient recovery based two-grid finite element method. Piecewise linear functions are used to approximate state and ...In this paper, the optimal control problem of parabolic integro-differential equations is solved by gradient recovery based two-grid finite element method. Piecewise linear functions are used to approximate state and co-state variables, and piecewise constant function is used to approximate control variables. Generally, the optimal conditions for the problem are solved iteratively until the control variable reaches error tolerance. In order to calculate all the variables individually and parallelly, we introduce a gradient recovery based two-grid method. First, we solve the small scaled optimal control problem on coarse grids. Next, we use the gradient recovery technique to recover the gradients of state and co-state variables. Finally, using the recovered variables, we solve the large scaled optimal control problem for all variables independently. Moreover, we estimate priori error for the proposed scheme, and use an example to validate the theoretical results.展开更多
Accurately approximating higher order derivatives is an inherently difficult problem. It is shown that a random variable shape parameter strategy can improve the accuracy of approximating higher order derivatives with...Accurately approximating higher order derivatives is an inherently difficult problem. It is shown that a random variable shape parameter strategy can improve the accuracy of approximating higher order derivatives with Radial Basis Function methods. The method is used to solve fourth order boundary value problems. The use and location of ghost points are examined in order to enforce the extra boundary conditions that are necessary to make a fourth-order problem well posed. The use of ghost points versus solving an overdetermined linear system via least squares is studied. For a general fourth-order boundary value problem, the recommended approach is to either use one of two novel sets of ghost centers introduced here or else to use a least squares approach. When using either ghost centers or least squares, the random variable shape parameter strategy results in significantly better accuracy than when a constant shape parameter is used.展开更多
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.展开更多
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.展开更多
基金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.
基金supported by the NSFC Grant No.11872210 and Grant No.MCMS-I-0120G01Chi-Wang Shu:Research is supported by the AFOSR Grant FA9550-20-1-0055 and the NSF Grant DMS-2010107Jianxian Qiu:Research is supported by the NSFC Grant No.12071392.
文摘In this paper, we design high-order Runge-Kutta discontinuous Galerkin (RKDG) methods with multi-resolution weighted essentially non-oscillatory (multi-resolution WENO) limiters to compute compressible steady-state problems on triangular meshes. A troubled cell indicator extended from structured meshes to unstructured meshes is constructed to identify triangular cells in which the application of the limiting procedures is required. In such troubled cells, the multi-resolution WENO limiting methods are used to the hierarchical L^(2) projection polynomial sequence of the DG solution. Through using the RKDG methods with multi-resolution WENO limiters, the optimal high-order accuracy can be gradually reduced to first-order in the triangular troubled cells, so that the shock wave oscillations can be well suppressed. In steady-state simulations on triangular meshes, the numerical residual converges to near machine zero. The proposed spatial reconstruction methods enhance the robustness of classical DG methods on triangular meshes. The good results of these RKDG methods with multi-resolution WENO limiters are verified by a series of two-dimensional steady-state problems.
基金The Australian Research Council(DP200101197,DP230101107).
文摘Formalizing complex processes and phenomena of a real-world problem may require a large number of variables and constraints,resulting in what is termed a large-scale optimization problem.Nowadays,such large-scale optimization problems are solved using computing machines,leading to an enormous computational time being required,which may delay deriving timely solutions.Decomposition methods,which partition a large-scale optimization problem into lower-dimensional subproblems,represent a key approach to addressing time-efficiency issues.There has been significant progress in both applied mathematics and emerging artificial intelligence approaches on this front.This work aims at providing an overview of the decomposition methods from both the mathematics and computer science points of view.We also remark on the state-of-the-art developments and recent applications of the decomposition methods,and discuss the future research and development perspectives.
文摘With the development of economic globalization,distributedmanufacturing is becomingmore andmore prevalent.Recently,integrated scheduling of distributed production and assembly has captured much concern.This research studies a distributed flexible job shop scheduling problem with assembly operations.Firstly,a mixed integer programming model is formulated to minimize the maximum completion time.Secondly,a Q-learning-assisted coevolutionary algorithmis presented to solve themodel:(1)Multiple populations are developed to seek required decisions simultaneously;(2)An encoding and decoding method based on problem features is applied to represent individuals;(3)A hybrid approach of heuristic rules and random methods is employed to acquire a high-quality population;(4)Three evolutionary strategies having crossover and mutation methods are adopted to enhance exploration capabilities;(5)Three neighborhood structures based on problem features are constructed,and a Q-learning-based iterative local search method is devised to improve exploitation abilities.The Q-learning approach is applied to intelligently select better neighborhood structures.Finally,a group of instances is constructed to perform comparison experiments.The effectiveness of the Q-learning approach is verified by comparing the developed algorithm with its variant without the Q-learning method.Three renowned meta-heuristic algorithms are used in comparison with the developed algorithm.The comparison results demonstrate that the designed method exhibits better performance in coping with the formulated problem.
基金supported by the Natural Science Foundation of Shandong Province(ZR2021MA019)the National Natural Science Foundation of China(11871312)。
文摘In this paper,a composite numerical scheme is proposed to solve the threedimensional Darcy-Forchheimer miscible displacement problem with positive semi-definite assumptions.A mixed finite element is used for the fow equation.The velocity and pressure are computed simultaneously.The accuracy of velocity is improved one order.The concentration equation is solved by using mixed finite element,multi-step difference and upwind approximation.A multi-step method is used to approximate time derivative for improving the accuracy.The upwind approximation and an expanded mixed finite element are adopted to solve the convection and diffusion,respectively.The composite method could compute the diffusion flux and its gradient.It possibly becomes an eficient tool for solving convection-dominated diffusion problems.Firstly,the conservation of mass holds.Secondly,the multi-step method has high accuracy.Thirdly,the upwind approximation could avoid numerical dispersion.Using numerical analysis of a priori estimates and special techniques of differential equations,we give an error estimates for a positive definite problem.Numerical experiments illustrate its computational efficiency and feasibility of application.
基金Project supported by the Basic Science Research Program through the National Research Foundation(NRF)of Korea funded by the Ministry of Science and ICT(No.RS-2024-00337001)。
文摘Enforcing initial and boundary conditions(I/BCs)poses challenges in physics-informed neural networks(PINNs).Several PINN studies have gained significant achievements in developing techniques for imposing BCs in static problems;however,the simultaneous enforcement of I/BCs in dynamic problems remains challenging.To overcome this limitation,a novel approach called decoupled physics-informed neural network(d PINN)is proposed in this work.The d PINN operates based on the core idea of converting a partial differential equation(PDE)to a system of ordinary differential equations(ODEs)via the space-time decoupled formulation.To this end,the latent solution is expressed in the form of a linear combination of approximation functions and coefficients,where approximation functions are admissible and coefficients are unknowns of time that must be solved.Subsequently,the system of ODEs is obtained by implementing the weighted-residual form of the original PDE over the spatial domain.A multi-network structure is used to parameterize the set of coefficient functions,and the loss function of d PINN is established based on minimizing the residuals of the gained ODEs.In this scheme,the decoupled formulation leads to the independent handling of I/BCs.Accordingly,the BCs are automatically satisfied based on suitable selections of admissible functions.Meanwhile,the original ICs are replaced by the Galerkin form of the ICs concerning unknown coefficients,and the neural network(NN)outputs are modified to satisfy the gained ICs.Several benchmark problems involving different types of PDEs and I/BCs are used to demonstrate the superior performance of d PINN compared with regular PINN in terms of solution accuracy and computational cost.
基金supported by the Scientific Computing Research Innovation Team of Guangdong Province(no.2021KCXTD052)the Science and Technology Development Fund,Macao SAR(no.0096/2022/A,0151/2022/A)+3 种基金University of Macao(no.MYRG2020-00035-FST,MYRG2022-00076-FST)the Guangdong Key Construction Discipline Research Capacity Enhancement Project(no.2022ZDJS049)Technology Planning Project of Shaoguan(no.210716094530390)the ScienceFoundation of Shaoguan University(no.SZ2020KJ01).
文摘In this paper,a two-step iteration method is established which can be viewed as a generalization of the existing modulus-based methods for vertical linear complementarity problems given by He and Vong(Appl.Math.Lett.134:108344,2022).The convergence analysis of the proposed method is established,which can improve the existing results.Numerical examples show that the proposed method is efficient with the two-step technique.
基金the National Science and Tech-nology Council,Taiwan for their financial support(Grant Number NSTC 111-2221-E-019-048).
文摘This study sets up two new merit functions,which are minimized for the detection of real eigenvalue and complex eigenvalue to address nonlinear eigenvalue problems.For each eigen-parameter the vector variable is solved from a nonhomogeneous linear system obtained by reducing the number of eigen-equation one less,where one of the nonzero components of the eigenvector is normalized to the unit and moves the column containing that component to the right-hand side as a nonzero input vector.1D and 2D golden section search algorithms are employed to minimize the merit functions to locate real and complex eigenvalues.Simultaneously,the real and complex eigenvectors can be computed very accurately.A simpler approach to the nonlinear eigenvalue problems is proposed,which implements a normalization condition for the uniqueness of the eigenvector into the eigenequation directly.The real eigenvalues can be computed by the fictitious time integration method(FTIM),which saves computational costs compared to the one-dimensional golden section search algorithm(1D GSSA).The simpler method is also combined with the Newton iterationmethod,which is convergent very fast.All the proposed methods are easily programmed to compute the eigenvalue and eigenvector with high accuracy and efficiency.
基金supported by the National Natural Science Foundation of China(11871312,12131014)the Natural Science Foundation of Shandong Province,China(ZR2023MA086)。
文摘A bicubic B-spline finite element method is proposed to solve optimal control problems governed by fourth-order semilinear parabolic partial differential equations.Its key feature is the selection of bicubic B-splines as trial functions to approximate the state and costate variables in two space dimensions.A Crank-Nicolson difference scheme is constructed for time discretization.The resulting numerical solutions belong to C2in space,and the order of the coefficient matrix is low.Moreover,the Bogner-Fox-Schmit element is considered for comparison.Two numerical experiments demonstrate the feasibility and effectiveness of the proposed method.
基金supported by the National Natural Science Foundation of China (No.12172154)the 111 Project (No.B14044)+1 种基金the Natural Science Foundation of Gansu Province (No.23JRRA1035)the Natural Science Foundation of Anhui University of Finance and Economics (No.ACKYC20043).
文摘In this study,a wavelet multi-resolution interpolation Galerkin method(WMIGM)is proposed to solve linear singularly perturbed boundary value problems.Unlike conventional wavelet schemes,the proposed algorithm can be readily extended to special node generation techniques,such as the Shishkin node.Such a wavelet method allows a high degree of local refinement of the nodal distribution to efficiently capture localized steep gradients.All the shape functions possess the Kronecker delta property,making the imposition of boundary conditions as easy as that in the finite element method.Four numerical examples are studied to demonstrate the validity and accuracy of the proposedwavelet method.The results showthat the use ofmodified Shishkin nodes can significantly reduce numerical oscillation near the boundary layer.Compared with many other methods,the proposed method possesses satisfactory accuracy and efficiency.The theoretical and numerical results demonstrate that the order of theε-uniform convergence of this wavelet method can reach 5.
文摘In this paper, the optimal control problem of parabolic integro-differential equations is solved by gradient recovery based two-grid finite element method. Piecewise linear functions are used to approximate state and co-state variables, and piecewise constant function is used to approximate control variables. Generally, the optimal conditions for the problem are solved iteratively until the control variable reaches error tolerance. In order to calculate all the variables individually and parallelly, we introduce a gradient recovery based two-grid method. First, we solve the small scaled optimal control problem on coarse grids. Next, we use the gradient recovery technique to recover the gradients of state and co-state variables. Finally, using the recovered variables, we solve the large scaled optimal control problem for all variables independently. Moreover, we estimate priori error for the proposed scheme, and use an example to validate the theoretical results.
文摘Accurately approximating higher order derivatives is an inherently difficult problem. It is shown that a random variable shape parameter strategy can improve the accuracy of approximating higher order derivatives with Radial Basis Function methods. The method is used to solve fourth order boundary value problems. The use and location of ghost points are examined in order to enforce the extra boundary conditions that are necessary to make a fourth-order problem well posed. The use of ghost points versus solving an overdetermined linear system via least squares is studied. For a general fourth-order boundary value problem, the recommended approach is to either use one of two novel sets of ghost centers introduced here or else to use a least squares approach. When using either ghost centers or least squares, the random variable shape parameter strategy results in significantly better accuracy than when a constant shape parameter is used.
文摘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.
基金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.
