Memory efficient adaptive mesh generation and implementation of multigrid algorithms using Sierpinski curves

Author： Bader M.   Schraufstetter S.   Vigh C.A.   Behrens J.  

Publisher： Inderscience Publishers

ISSN： 1742-7185

Source： International Journal of Computational Science and Engineering, Vol.4, Iss.1, 2008-11, pp. : 12-21

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Efficient generation of secure elliptic curves

By Konstantinou Elisavet   Stamatiou Yannis   Zaroliagis Christos  

International Journal of Information Security (IJIS), Vol. 6, Iss. 1, 2007-01 ,pp. : 47-63

Springer Publishing Company

Access to resources Recommend Favorite

Efficient massively parallel implementation of some combinatorial algorithms

By Tsan-sheng H.   Ramachandran V.  

Theoretical Computer Science, Vol. 162, Iss. 2, 1996-08 ,pp. : 297-322

Elsevier

Access to resources Recommend Favorite

Simple, Robust, and Memory-Efficient FastICA Algorithms Using the Huber M-Estimator Cost Function

By Douglas Scott   Chao Jih-Cheng  

Journal of VLSI Signal Processing, Vol. 48, Iss. 1-2, 2007-08 ,pp. : 143-159

Springer Publishing Company

Access to resources Recommend Favorite

Efficient randomized routing algorithms on the two-dimensional mesh of buses

By Iwama  

Theoretical Computer Science, Vol. 261, Iss. 2, 2001-06 ,pp. : 227-239

Elsevier

Access to resources Recommend Favorite

Efficient Adaptive and Dynamic Mesh Refinement Based on a Non-recursive Strategy

By Bo M.   Amor M.   Concheiro R.   Doggett M.  

Computer Journal, Vol. 56, Iss. 7, 2013-07 ,pp. : 843-851

Oxford University Press

Access to resources Recommend Favorite