Continuous and discrete least-squares approximation by radial basis functions on spheres
Let \(S^n\) be the \(n\)-dimensional sphere in \(\mathbb R^n\) and \(A=\{U_j,\psi_j\}_{j=1}^m\) be an atlas for \(S^n\), i.e. open sets \(U_j\subset S^n\) cover \(S^n\), \(\psi_j\) are homeomorphic from \(U_j\) to the unit ball \(B(0,1)\subset \mathbb R^n\) and \(\psi_i\circ \psi_j^{-1}\) are \(C^{\infty}\) on \(\psi_j(U_j\cap U_i)\). Let \(\{\chi_j\}_{
Le Gia, Q. T. +3 more
openaire +3 more sources
Stable and Accurate Least Squares Radial Basis Function Approximations on Bounded Domains
The computation of global radial basis function (RBF) approximations requires the solution of a linear system which, depending on the choice of RBF parameters, may be ill-conditioned. We study the stability and accuracy of approximation methods using the Gaussian RBF in all scaling regimes of the associated shape parameter.
Ben Adcock, Daan Huybrechs, Cecile Piret
openaire +3 more sources
Numerical Implementation of Meshless Methods for Beam Problems
For solving a partial different equation by a numerical method, a possible alternative may be either to use a mesh method or a meshless method. A flexible computational procedure for solving 1D linear elastic beam problems is presented that currently ...
Rosca V. E., Leitāo V. M. A.
doaj +1 more source
Quantile Regression under Misspecification, with an Application to the U.S. Wage Structure [PDF]
Quantile regression(QR) fits a linear model for conditional quantiles, just as ordinary least squares (OLS) fits a linear model for conditional means. An attractive feature of OLS is that it gives the minimum mean square error linear approximation to the
Ivan Fernandez-Val +2 more
core
The approximation function of bridge deck vibration derived from the measured eigenmodes
This article deals with a method of how to acquire approximate displacement vibration functions. Input values are discrete, experimentally obtained mode shapes.
Sokol Milan +3 more
doaj +1 more source
Fast multi-dimensional scattered data approximation with Neumann boundary conditions
An important problem in applications is the approximation of a function $f$ from a finite set of randomly scattered data $f(x_j)$. A common and powerful approach is to construct a trigonometric least squares approximation based on the set of exponentials
Grishin, Denis, Strohmer, Thomas
core
Efficient least squares approximation and collocation methods using radial basis functions
23 pages, 10 ...
Zhou, Yiqing, Huybrechs, Daan
openaire +2 more sources
On Convex Quadratic Approximation [PDF]
In this paper we prove the counterintuitive result that the quadratic least squares approximation of a multivariate convex function in a finite set of points is not necessarily convex, even though it is convex for a univariate convex function.
Hertog, D. den, Klerk, E. de, Roos, J.
core +1 more source
Semiparametric Estimation of Instrumental Variable Models for Causal Effects [PDF]
This article introduces a new class of instrumental variable (IV) estimators of causal treatment effects for linear and nonlinear models with covariates.
Alberto Abadie
core
Deep reinforcement learning using least‐squares truncated temporal‐difference
Policy evaluation (PE) is a critical sub‐problem in reinforcement learning, which estimates the value function for a given policy and can be used for policy improvement.
Junkai Ren +5 more
doaj +1 more source

