A s-step Variant of the Double Orthogonal Series Algorithm

J.A. Alvarez-Dios (), J.C. Cabaleiro () and G. Casal ()
Additional contact information
J.A. Alvarez-Dios: Universidade de Santiago de Compostela, Departamento de Matemática Aplicada
J.C. Cabaleiro: Universidade de Santiago de Compostela, Departamento de Electrónica e Computación
G. Casal: Universidade de Santiago de Compostela, Departamento de Matemática Aplicada

A chapter in Numerical Mathematics and Advanced Applications, 2006, pp 937-944 from Springer

Abstract: Abstract We use the s-step technique proposed by Chronopoulos in [2, 3] for creating a s-step variant of the Double Orthogonal Series algorithm (s-DOS). The original Double Orthogonal Series algorithm, proposed by M. Amara and J. C. Nédélec [1], converges for any nonsingular coefficient matrix of the linear system in n iterations at most, where n is the order of the system. We prove the convergence of the new s-DOS method in the integer part of n/s iterations at most.

Date: 2006
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-540-34288-5_93

Ordering information: This item can be ordered from
http://www.springer.com/9783540342885

DOI: 10.1007/978-3-540-34288-5_93

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().