A parallel non-square tiled algorithm for solving a kind of BVP for second-order ODEs

2Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The aim of this paper is to show that a kind of boundary value problem for second-order ordinary differential equations which reduces to the problem of solving tridiagonal system of linear equations with almost Toeplitz structure can be efficiently solved on modern multicore architectures using a parallel tiled algorithm based on the divide and conquer approach for solving linear recurrence systems with constant coefficients and novel data formats for dense matrices. © 2010 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Stpiczyński, P. (2010). A parallel non-square tiled algorithm for solving a kind of BVP for second-order ODEs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6067 LNCS, pp. 87–94). https://doi.org/10.1007/978-3-642-14390-8_10

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free