A Matrix Decomposition MFS Algorithm for Problems in Hollow Axisymmetric Domains

Author： Tsangaris Th.   Smyrlis Y.   Karageorghis A.  

Publisher： Springer Publishing Company

ISSN： 0885-7474

Source： Journal of Scientific Computing, Vol.28, Iss.1, 2006-07, pp. : 31-50

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 MFS Algorithms for Problems in Thermoelasticity

By Karageorghis A.  

Journal of Scientific Computing, Vol. 56, Iss. 1, 2013-07 ,pp. : 96-121

Springer Publishing Company

Access to resources Recommend Favorite

Efficient MFS Algorithms for Inhomogeneous Polyharmonic Problems

By Karageorghis A.  

Journal of Scientific Computing, Vol. 46, Iss. 3, 2011-03 ,pp. : 519-541

Springer Publishing Company

Access to resources Recommend Favorite

Solving Variational Inequality Problems with Linear Constraints by a Proximal Decomposition Algorithm

By Han Deren   Lo Hong K.  

Journal of Global Optimization, Vol. 28, Iss. 1, 2004-01 ,pp. : 97-113

Springer Publishing Company

Access to resources Recommend Favorite

Domain Decomposition Spectral Method for Mixed Inhomogeneous Boundary Value Problems of High Order Differential Equations on Unbounded Domains

By Zhang Chao  

Journal of Scientific Computing, Vol. 53, Iss. 2, 2012-11 ,pp. : 451-480

Springer Publishing Company

Access to resources Recommend Favorite

An algorithm for the decomposition of semisimple Lie algebras

By de Graaf W.A.  

Theoretical Computer Science, Vol. 187, Iss. 1, 1997-11 ,pp. : 117-122

Elsevier

Access to resources Recommend Favorite