Sciweavers

2008 search results - page 78 / 402
» Computing with Equations
Sort
View
DAM
2008
102views more  DAM 2008»
13 years 9 months ago
On the computational complexity of partial covers of Theta graphs
By use of elementary geometric arguments we prove the existence of a special integral solution of a certain system of linear equations. The existence of such a solution yields the...
Jirí Fiala, Jan Kratochvíl, Attila P...
JAT
2010
51views more  JAT 2010»
13 years 4 months ago
Optimal adaptive computations in the Jaffard algebra and localized frames
We study the efficient numerical solution of infinite matrix equations Au = f for a matrix A in the Jaffard algebra. These matrices appear naturally via frame discretizations in m...
Stephan Dahlke, Massimo Fornasier, Karlheinz Gr&ou...
IMR
2005
Springer
14 years 2 months ago
Marching Generation of Smooth Structured and Hybrid Meshes Based on Metric Identity
Elliptic differential equations are derived for the generation of structured meshes and difference equations for the generation of smooth hybrid meshes from metric identity. A par...
Jochen Wild, Peter Niederdrenk, Thomas Gerhold
MOC
1998
96views more  MOC 1998»
13 years 8 months ago
A convergence theorem for the fast multipole method for 2 dimensional scattering problems
Abstract. The Fast Multipole Method (FMM) designed by V. Rokhlin rapidly computes the field scattered from an obstacle. This computation consists of solving an integral equation o...
Christophe Labreuche
ICPR
2008
IEEE
14 years 3 months ago
Numerical analysis of Mahalanobis metric in vector space
The Mahalanobis metric was proposed by extending the Mahalanobis distance to provide a probabilistic distance for a non-normal distribution. The Mahalanobis metric equation is a n...
Joken Son, Naoya Inoue, Yukihiko Yamashita