Idioma:

Schur complement preconditioned conjugate gradient methods for spline collocation equations

Christara, Christina C.

International Conference on Supercomputing: Proceedings of the 4th international conference on Supercomputing : Amsterdam, The Netherlands; 11-15 June 1990, 1990, p.108-120

New York, NY, USA: ACM

Texto completo disponível

Citações Citado por

Enviar para

Título:
Schur complement preconditioned conjugate gradient methods for spline collocation equations
Autor: Christara, Christina C.
Assuntos: Computer systems organization -- Architectures -- Parallel architectures -- Interconnection architectures ; Computer systems organization -- Dependable and fault-tolerant systems and networks ; General and reference -- Cross-computing tools and techniques -- Performance ; Mathematics of computing -- Discrete mathematics ; Mathematics of computing -- Mathematical analysis -- Differential equations -- Partial differential equations ; Networks -- Network performance evaluation
É parte de: International Conference on Supercomputing: Proceedings of the 4th international conference on Supercomputing : Amsterdam, The Netherlands; 11-15 June 1990, 1990, p.108-120
Notas: SourceType-Conference Papers & Proceedings-1
ObjectType-Conference Paper-1
content type line 25
Descrição: We are interested in the efficient solution of linear second order Partial Differential Equation (PDE) problems on rectangular domains. The PDE discretisation scheme used is of Finite Element type and is based on quadratic splines and the collocation methodology. We integrate the Quadratic Spline Collocation (QSC) discretisation scheme with a Domain Decomposition (DD) technique. We develop DD motivated orderings of the QSC equations and unknowns and apply the Preconditioned Conjugate Gradient (PCG) method for the solution of the Schur Complement (SC) system. Our experiments show that the SC-PCG-QSC method in its sequential mode is very efficient compared to standard direct band solvers for the QSC equations. We have implemented the SC-PCG-QSC method on the iPSC/2 hypercube and present performance evaluation results for up to 32 processors configurations. We discuss a type of nearest neighbour communication scheme, in which the amount of data transfer per processor does not grow with the number of processors. The estimated efficiencies are at the order of 90%.
Editor: New York, NY, USA: ACM
Idioma: Inglês

Voltar para lista de resultados

Anterior Resultado 10 Avançar Ir para próxima página

Realização: Logos de Redes Sociais:

Schur complement preconditioned conjugate gradient methods for spline collocation equations

Christara, Christina C.

New York, NY, USA: ACM

Buscando em bases de dados remotas. Favor aguardar.