In view of the fact that impulsive differential equations have the discreteness due to the impulse phenomenon, this article proposes a single hidden layer neural networkmethod-based extreme learning machine and a phys...
详细信息
In view of the fact that impulsive differential equations have the discreteness due to the impulse phenomenon, this article proposes a single hidden layer neural networkmethod-based extreme learning machine and a physics-informed neural network method combined with learning rate attenuation strategy to solve linear impulsive differential equations and nonlinear impulsive differential equations, respectively. For the linear impulsive differential equations, first, the interval is segmented according to the impulse points, and a single hidden layer neural network model is constructed, the weight parameters of the hidden layer are randomly set, the optimal output parameters, and solution of the first segment are obtained by the extreme learning machine algorithm, then we calculate the initial value of the second segment according to the jumping equation and the remaining segments are solved in turn in the same way. Although the single hidden layer neural network method proposed can solve linear equations with high accuracy, it is not suitable for solving nonlinear equations. Therefore, we propose the physics-informed neural network combined with a learning rate attenuation strategy to solve the nonlinear impulsive differential equations, then the Adam algorithm and L-BFGS algorithm are combined to find the optimal approximate solution of each segment. Numerical examples show that the single hidden layer neural network method with Legendre polynomials as the activation function and the physics-informed neural network method combined with learning rate attenuation strategy can solve linear and nonlinear impulsive differential equations with higher accuracy. Impact Statement-It is difficult to obtain the analytical solutions of impulsive differential equations because of the existence of impulse points, and the current numerical methods are complicated and demanding. In recent years, artificial neural network methods have been widely used due to its simplicity and efficie
作者:
GUO YixiaoMING PingbingLSEC
Institute of Computational Mathematics and Scientific/Engineering ComputingAcademy of Mathematics and Systems ScienceChinese Academy of SciencesBeijing 100190China School of Mathematical Sciences
University of Chinese Academy of SciencesBeijing 100049China
The authors present a novel deep learning method for computing eigenvalues of the fractional Schrödinger *** proposed approach combines a newly developed loss function with an innovative neural network architectu...
详细信息
The authors present a novel deep learning method for computing eigenvalues of the fractional Schrödinger *** proposed approach combines a newly developed loss function with an innovative neural network architecture that incorporates prior knowledge of the *** improvements enable the proposed method to handle both high-dimensional problems and problems posed on irregular bounded *** authors successfully compute up to the first 30 eigenvalues for various fractional Schrödinger *** an application,the authors share a conjecture to the fractional order isospectral problem that has not yet been studied.
By combination of iteration methods with the partition of unity method(PUM),some finite element parallel algorithms for the stationary incompressible magnetohydrodynamics(MHD)with different physical parameters are pre...
详细信息
By combination of iteration methods with the partition of unity method(PUM),some finite element parallel algorithms for the stationary incompressible magnetohydrodynamics(MHD)with different physical parameters are presented and *** algorithms are highly *** first,a global solution is obtained on a coarse grid for all approaches by one of the iteration *** parallelized residual schemes,local corrected solutions are calculated on finer meshes with overlapping *** subdomains can be achieved flexibly by a class of *** proposed algorithm is proved to be uniformly stable and ***,one numerical example is presented to confirm the theoretical findings.
The speeding-up and slowing-down(SUSD)direction is a novel direction,which is proved to converge to the gradient descent direction under some *** authors propose the derivative-free optimization algorithm SUSD-TR,whic...
详细信息
The speeding-up and slowing-down(SUSD)direction is a novel direction,which is proved to converge to the gradient descent direction under some *** authors propose the derivative-free optimization algorithm SUSD-TR,which combines the SUSD direction based on the covariance matrix of interpolation points and the solution of the trust-region subproblem of the interpolation model function at the current iteration *** analyze the optimization dynamics and convergence of the algorithm *** of the trial step and structure step are *** results show their algorithm’s efficiency,and the comparison indicates that SUSD-TR greatly improves the method’s performance based on the method that only goes along the SUSD *** algorithm is competitive with state-of-the-art mathematical derivative-free optimization algorithms.
We present a stochastic trust-region model-based framework in which its radius is related to the probabilistic ***,we propose a specific algorithm termed STRME,in which the trust-region radius depends linearly on the ...
详细信息
We present a stochastic trust-region model-based framework in which its radius is related to the probabilistic ***,we propose a specific algorithm termed STRME,in which the trust-region radius depends linearly on the gradient used to define the latest *** complexity results of the STRME method in nonconvex,convex and strongly convex settings are presented,which match those of the existing algorithms based on probabilistic *** addition,several numerical experiments are carried out to reveal the benefits of the proposed methods compared to the existing stochastic trust-region methods and other relevant stochastic gradient methods.
作者:
Xiaodong FengLi ZengTao ZhouLSEC
Institute of Computational Mathematics and Scientific/Engineering ComputingAMSSChinese Academy of SciencesBeijingChina
In this work,we propose an adaptive learning approach based on temporal normalizing flows for solving time-dependent Fokker-Planck(TFP)*** is well known that solutions of such equations are probability density functio...
详细信息
In this work,we propose an adaptive learning approach based on temporal normalizing flows for solving time-dependent Fokker-Planck(TFP)*** is well known that solutions of such equations are probability density functions,and thus our approach relies on modelling the target solutions with the temporal normalizing *** temporal normalizing flow is then trained based on the TFP loss function,without requiring any labeled *** a machine learning scheme,the proposed approach is mesh-free and can be easily applied to high dimensional *** present a variety of test problems to show the effectiveness of the learning approach.
作者:
Xiaoying DaiLiwei ZhangAihui ZhouLSEC
Institute of Computational Mathematics and Scientific/Engineering ComputingAcademy of Mathematics and Systems ScienceChinese Academy of SciencesBeijing 100190China School of Mathematical Sciences
University of Chinese Academy of SciencesBeijing 100049China
To obtain convergent numerical approximations without using any orthogonalization operations is of great importance in electronic structure *** this paper,we propose and analyze a class of iteration schemes for the di...
详细信息
To obtain convergent numerical approximations without using any orthogonalization operations is of great importance in electronic structure *** this paper,we propose and analyze a class of iteration schemes for the discretized Kohn-Sham Density Functional Theory model,with which the iterative approximations are guaranteed to converge to the Kohn-Sham orbitals without any orthogonalization as long as the initial orbitals are orthogonal and the time step sizes are given *** addition,we present a feasible and efficient approach to get suitable time step sizes and report some numerical experiments to validate our theory.
We propose Monte Carlo Nonlocal physics-informed neural networks(MC-Nonlocal-PINNs),which are a generalization of MC-fPINNs in *** et al.(*** ***.400(2022),115523)for solving general nonlocal models such as integral e...
详细信息
We propose Monte Carlo Nonlocal physics-informed neural networks(MC-Nonlocal-PINNs),which are a generalization of MC-fPINNs in *** et al.(*** ***.400(2022),115523)for solving general nonlocal models such as integral equations and nonlocal *** to MC-fPINNs,our MC-Nonlocal-PINNs handle nonlocal operators in a Monte Carlo way,resulting in a very stable approach for high dimensional *** present a variety of test problems,including high dimensional Volterra type integral equations,hypersingular integral equations and nonlocal PDEs,to demonstrate the effectiveness of our approach.
In this work,we develop a stochastic gradient descent method for the computational optimal design of random rough surfaces in thin-film solar *** formulate the design problems as random PDE-constrained optimization pr...
详细信息
In this work,we develop a stochastic gradient descent method for the computational optimal design of random rough surfaces in thin-film solar *** formulate the design problems as random PDE-constrained optimization problems and seek the optimal statistical parameters for the random *** optimizations at fixed frequency as well as at multiple frequencies and multiple incident angles are *** evaluate the gradient of the objective function,we derive the shape derivatives for the interfaces and apply the adjoint state method to perform the *** stochastic gradient descent method evaluates the gradient of the objective function only at a few samples for each iteration,which reduces the computational cost *** numerical experiments are conducted to illustrate the efficiency of the method and significant increases of the absorptance for the optimal random *** also examine the convergence of the stochastic gradient descent algorithm theoretically and prove that the numerical method is convergent under certain assumptions for the random interfaces.
In this paper,an augmented two-scale finite element method is proposed for a class of linear and nonlinear eigenvalue problems on tensor-product *** a correction step,the augmented two-scale finite element solution is...
详细信息
In this paper,an augmented two-scale finite element method is proposed for a class of linear and nonlinear eigenvalue problems on tensor-product *** a correction step,the augmented two-scale finite element solution is obtained by solving an eigenvalue problem on a low-dimensional augmented *** analysis and numerical experiments show that the augmented two-scale finite element solution achieves the same order of accuracy as the standard finite element solution on a fine grid,but the computational cost required by the former solution is much lower than that demanded by the *** augmented two-scale finite element method also improves the approximation accuracy of eigenfunctions in the L^(2)(Ω)norm compared with the two-scale finite element method.
暂无评论