The Pade Approximant Based Network for Variational Problems

03/30/2020
by   Chi-Chun Zhou, et al.
0

In solving the variational problem, the key is to efficiently find the target function that minimizes or maximizes the specified functional. In this paper, by using the Pade approximant, we suggest a methods for the variational problem. By comparing the method with those based on the radial basis function networks (RBF), the multilayer perception networks (MLP), and the Legendre polynomials, we show that the method searches the target function effectively and efficiently.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/19/2021

Quantum radial basis function methods for scattered data fitting

Scattered data fitting is a frequently encountered problem for reconstru...
research
03/21/2023

Computational Electromagnetics with the RBF-FD Method

One of the most popular methods employed in computational electromagneti...
research
01/09/2014

Radial basis function process neural network training based on generalized frechet distance and GA-SA hybrid strategy

For learning problem of Radial Basis Function Process Neural Network (RB...
research
05/19/2021

Modeling of unsaturated flow through porous media using meshless methods

In this study, we focus on the modelling of infiltration process in poro...
research
07/20/2017

Learning to Draw Samples with Amortized Stein Variational Gradient Descent

We propose a simple algorithm to train stochastic neural networks to dra...
research
02/07/2019

Radial and Directional Posteriors for Bayesian Neural Networks

We propose a new variational family for Bayesian neural networks. We dec...
research
03/02/2023

Differentiable Trajectory Generation for Car-like Robots with Interpolating Radial Basis Function Networks

The design of Autonomous Vehicle software has largely followed the Sense...

Please sign up or login with your details

Forgot password? Click here to reset