Results 251 to 260 of about 522,654 (284)
Some of the next articles are maybe not open access.
Maximum entropy based numerical algorithms for approximation of probability density functions
2003 European Control Conference (ECC), 2003This paper describes several fast algorithms for approximation of the maximum entropy estimate of probability density functions on the basis of a finite number of sampled data. The proposed algorithms are compared with the exact maximum entropy estimate in terms of approximation accuracy and computational efficiency. Some application examples are given.
Balestrino, A. +3 more
openaire +2 more sources
Improved Learning Algorithms of SLFN for Approximating Periodic Function
2008In this paper, three improved Extreme Learning Machines (ELMs) are proposed to approximating periodic function. According to Fourier series expansion theory, the hidden neurons activation functions in the improved ELM are a class of sine and cosine functions.
openaire +1 more source
Neural Networks, 2013
Radial basis function (RBF) neural network is constructed of certain number of RBF neurons, and these networks are among the most used neural networks for modeling of various nonlinear problems in engineering. Conventional RBF neuron is usually based on Gaussian type of activation function with single width for each activation function.
Vuković, Najdan, Miljković, Zoran
openaire +3 more sources
Radial basis function (RBF) neural network is constructed of certain number of RBF neurons, and these networks are among the most used neural networks for modeling of various nonlinear problems in engineering. Conventional RBF neuron is usually based on Gaussian type of activation function with single width for each activation function.
Vuković, Najdan, Miljković, Zoran
openaire +3 more sources
A novel iterative algorithm for approximating equivalent circuits of numerical transfer functions
International Journal of Numerical Modelling: Electronic Networks, Devices and Fields, 2016AbstractRecently, we presented a novel method for pole residue equivalent system solver (PRESS). In this work, we provide the exact solution of local fit types 1, 2, and 3. We also modify the original algorithm to conduct parallel search for optimal solution across all frequencies, instead of targeting only the peak error.
Ata Zadehgol, Venkatesh Avula
openaire +1 more source
An Adaptive Algorithm for Weighted Approximation of Singular Functions over $\mathbb{R}$
SIAM Journal on Numerical Analysis, 2013We study the $\omega$-weighted $L^p$ approximation ($1\le p\le\infty$) of piecewise $r$-smooth functions $f:\mathbb{R}\to\mathbb{R}$. Approximations $\mathcal{A}_nf$ are based on $n$ values of $f$ at points that can be chosen adaptively. Assuming that the weight $\omega$ is Riemann integrable on any compact interval and asymptotically decreasing, a ...
Leszek Plaskota +2 more
openaire +1 more source
The convergence rate of the sandwich algorithm for approximating convex functions
Computing, 1992Interval bisection, slope bisection, maximum error rule and chord rule are considered as four natural rules leading to different versions of the sandwich algorithm for approximating a convex function of one variable over an interval by evaluating the function and its derivative at a sequence of points.
openaire +1 more source
An algorithm for constructing a class of Padé approximants of vector functions
Applied Numerical Mathematics, 1997A matrix of polynomials \(Q_{m,n}=\left(\begin{smallmatrix} Q_{(m,n)_1} & 0\\ Q_{(m,n)_2} & Q_{(m,n)_1}\end{smallmatrix}\right)\) is considered. Expressions of the components are given. Algorithms are derived for constructing approximants for \(Q_{m,n}\). Two recurrence relations between the elements of adjacent systems are found.
openaire +2 more sources
Decay bounds and \(O(n)\) algorithms for approximating functions of sparse matrices
2007zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Benzi, Michele, Razouk, Nader
openaire +2 more sources
An optimal algorithm for finding the roots of an approximately computed function
USSR Computational Mathematics and Mathematical Physics, 1968Abstract IN a wide range of practical and computational problems we have to find the roots of a function which can only be computed approximately for given values of its argument. Examples include the boundary value problem for a nonlinear system of differential equations, solved by specifying missing initial conditions (at one end), or the problem ...
openaire +2 more sources
New algorithms for the approximation of fixed points and fractal functions
Chaos, Solitons & FractalsThis article is devoted to explore the abilities of an iterative scheme for the approximation of fixed points of self-maps, called the N-algorithm, defined in a previous paper. In a first part of the article, the algorithm is modified in order to consider operators with asymptotic properties, namely nearly uniform contractions and nearly asymptotically
openaire +3 more sources