Roland A. Sweet

According to our database, Roland A. Sweet authored at least 9 papers between 1969 and 1991.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

1991

FFTs and three-dimensional Poisson solvers for hypercubes.

Roland A. Sweet, William L. Briggs, Suely Oliveira, Jules L. Porsche, Thomas Turnbull

Parallel Comput., 1991

Bluestein's FFT for arbitrary N on the hypercube.

Paul N. Swarztrauber, Roland A. Sweet, William L. Briggs, Van Emden Henson, James S. Otto

Parallel Comput., 1991

Vectorization and Parallelization of FISHPAK.

Roland A. Sweet

Proceedings of the Fifth SIAM Conference on Parallel Processing for Scientific Computing, 1991

1985

Multiprocessor FFT Methods.

William L. Briggs, Leslie B. Hart, Roland A. Sweet, Abbie O'Gallagher

Proceedings of the Selected Papers from the Second Conference on Parallel Processing for Scientific Computing, 1985

Mathematical software development for super computers (abstract only).

Roland A. Sweet

Proceedings of the 1985 ACM annual conference on The range of computing: mid-80's perspective: mid-80's perspective, 1985

1980

A Survey of Software for Partial Differential Equations.

Marek Machura, Roland A. Sweet

ACM Trans. Math. Softw., 1980

1979

Algorithm 541: Efficient Fortran Subprograms for the Solution of Separable Elliptic Partial Differential Equations [D3].

Paul N. Swarztrauber, Roland A. Sweet

ACM Trans. Math. Softw., 1979

1975

Efficient FORTRAN subprograms for the solution of elliptic partial differential equations.

Paul N. Swarztrauber, Roland A. Sweet

Proceedings of the SIGNUM Meeting on Software for Partial Differential Equations, 1975

1969

A recursive relation for the determinant of a pentadiagonal matrix.

Roland A. Sweet

Commun. ACM, 1969