Q. T. Le Gia
University of New South Wales
Network
Latest external collaboration on country level. Dive into details by clicking on the dots.
Publication
Featured researches published by Q. T. Le Gia.
SIAM Journal on Numerical Analysis | 2008
Q. T. Le Gia; H. N. Mhaskar
The purpose of this paper is to construct universal, auto-adaptive, localized, linear, polynomial (-valued) operators based on scattered data on the (hyper) sphere
SIAM Journal on Numerical Analysis | 2010
Q. T. Le Gia; Ian H. Sloan; Holger Wendland
\mathbb{S}^q
Journal of Approximation Theory | 2006
Q. T. Le Gia; Francis J. Narcowich; Joseph D. Ward; Holger Wendland
(
Advances in Computational Mathematics | 2005
Q. T. Le Gia
q\ge2
Numerische Mathematik | 2012
Q. T. Le Gia; Ian H. Sloan; Holger Wendland
). The approximation and localization properties of our operators are studied theoretically in deterministic as well as probabilistic settings. Numerical experiments are presented to demonstrate their superiority over traditional least squares and discrete Fourier projection polynomial approximations. An essential ingredient in our construction is the construction of quadrature formulas based on scattered data, exact for integrating spherical polynomials of (moderately) high degree. Our formulas are based on scattered sites; i.e., in contrast to such well-known formulas as Driscoll-Healy formulas, we need not choose the location of the sites in any particular manner. While the previous attempts to construct such formulas have yielded formulas exact for spherical polynomials of degree at most 18, we are able to construct formulas exact for spherical polynomials of degree 178.
Numerische Mathematik | 2006
Q. T. Le Gia; H. N. Mhaskar
We consider a multiscale approximation scheme at scattered sites for functions in Sobolev spaces on the unit sphere
Numerische Mathematik | 2010
Thanh Tran; Q. T. Le Gia; Ian H. Sloan; Ernst P. Stephan
\mathbb{S}^n
Journal of Approximation Theory | 2004
Q. T. Le Gia
. The approximation is constructed using a sequence of scaled, compactly supported radial basis functions restricted to
Mathematics of Computation | 2009
Q. T. Le Gia; Ian H. Sloan; Thanh Tran
\mathbb{S}^n
Mathematics of Computation | 2011
Mahadevan Ganesh; Q. T. Le Gia; Ian H. Sloan
. A convergence theorem for the scheme is proved, and the condition number of the linear system is shown to stay bounded by a constant from level to level, thereby establishing for the first time a mathematical theory for multiscale approximation with scaled versions of a single compactly supported radial basis function at scattered data points.