[图书][B] Meshfree Approximation Methods with MATLAB
GE Fasshauer - 2007 - books.google.com
Meshfree approximation methods are a relatively new area of research, and there are only a
few books covering it at present. Whereas other works focus almost entirely on theoretical …
few books covering it at present. Whereas other works focus almost entirely on theoretical …
Using NFFT 3---A software library for various nonequispaced fast Fourier transforms
J Keiner, S Kunis, D Potts - ACM Transactions on Mathematical Software …, 2009 - dl.acm.org
NFFT 3 is a software library that implements the nonequispaced fast Fourier transform
(NFFT) and a number of related algorithms, for example, nonequispaced fast Fourier …
(NFFT) and a number of related algorithms, for example, nonequispaced fast Fourier …
Weighted iterative reconstruction for magnetic particle imaging
Magnetic particle imaging (MPI) is a new imaging technique capable of imaging the
distribution of superparamagnetic particles at high spatial and temporal resolution. For the …
distribution of superparamagnetic particles at high spatial and temporal resolution. For the …
A general and fast convolution-based method for peridynamics: applications to elasticity and brittle fracture
A general and fast convolution-based method (FCBM) for peridynamics (PD) is introduced.
Expressing the PD integrals in terms of convolutions and computing them by Fast Fourier …
Expressing the PD integrals in terms of convolutions and computing them by Fast Fourier …
Model-based reconstruction for magnetic particle imaging
T Knopp, TF Sattel, S Biederer… - … on Medical Imaging, 2009 - ieeexplore.ieee.org
Magnetic particle imaging (MPI) is a new imaging modality capable of imaging distributions
of superparamagnetic nanoparticles with high sensitivity, high spatial resolution and, in …
of superparamagnetic nanoparticles with high sensitivity, high spatial resolution and, in …
[PDF][PDF] Meshfree methods
GE Fasshauer - Handbook of theoretical and computational …, 2005 - math.iit.edu
Meshfree methods are the topic of recent research in many areas of computational science
and approximation theory. These methods come in various flavors, most of which can be …
and approximation theory. These methods come in various flavors, most of which can be …
Fast algorithms using orthogonal polynomials
We review recent advances in algorithms for quadrature, transforms, differential equations
and singular integral equations using orthogonal polynomials. Quadrature based on …
and singular integral equations using orthogonal polynomials. Quadrature based on …
Comparison of scalable fast methods for long-range interactions
Based on a parallel scalable library for Coulomb interactions in particle systems, a
comparison between the fast multipole method (FMM), multigrid-based methods, fast Fourier …
comparison between the fast multipole method (FMM), multigrid-based methods, fast Fourier …
Fast computation of kernel estimators
The computational complexity of evaluating the kernel density estimate (or its derivatives) at
m evaluation points given n sample points scales quadratically as O (nm)—making it …
m evaluation points given n sample points scales quadratically as O (nm)—making it …