Chun Liu, Department of Mathematics, IIT, Duke University, October 19, 2022. The copyright for this article reverts to public domain 28 years after publication. The proposed method is mesh-free without any spatial discretization and is. HKBU200605 and the United States National Science Foundation grant NSF-DMS-0713848. Additional Notes: This research was supported in part by the Hong Kong Research Grants Council grant HKBU/2009/04P, the HKSAR Research Grants Council Project No.Published electronically: January 9, 2009.Received by editor(s) in revised form: July 29, 2008.Email: Received by editor(s): January 11, 2008.Affiliation: Department of Applied Mathematics, Illinois Institute of Technology, Room E1-208, 10 W.Affiliation: School of Mathematics and Statistics, University of New South Wales, Sydney 2052, Australia.Liu, Mesh Free Methods: Moving beyond the Finite Element Method. element method (BEM) code at Department of Mathematics, IIT Kharagpur for coupled. Affiliation: Department of Mathematics, Hong Kong Baptist University, Kowloon Tong, Hong Kong, People’s Republic of China Chen, Discrete Projection Methods for Integral Equations. Numerical Methods (FEM, XFEM, Meshfree Methods and Boundary Element).Retrieve articles in Mathematics of Computation Peter Zinterhof, Über die schnelle Lösung von hochdimensionalen Fredholm-Gleichungen vom Faltungstyp mit zahlentheoretischen Methoden, Österreich.This article introduces a multivariate fast discrete Walsh transform for data sampled on a digital net that requires only $\mathcal 1 An attractive alternative is to sample on a low discrepancy set, such as an integration lattice or a digital net. 78 (2009), 1573-1591 Request permission Abstract:įor high dimensional problems, such as approximation and integration, one cannot afford to sample on a grid because of the curse of dimensionality. HTML articles powered by AMS MathViewer by A multivariate fast discrete Walsh transform with an application to function interpolation
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |