نتایج جستجو برای: fortran

تعداد نتایج: 4224  

Journal: :Journal of Modern Applied Statistical Methods 2002

Journal: :Computer Physics Communications 2014

Journal: :ACM Transactions on Mathematical Software 2014

Journal: :Computer Standards & Interfaces 1996

Journal: :Computer Science and Information Systems 2007

2007
Christian Lefebvre Jean-Luc Dekeyser

Fortran 90 is the actual standard in term of data parallel language for scientiic computing. To develop a data parallel algorithm on a distributed memory machine, programmers generally use the High Performance Fortran extension of Fortran 90, in particular the data mapping directives. HPF-Builder graphical environment goal is to free the HPF programmers of all the syntactic constraints due to t...

2006
Matthew J. Sottile Craig Edward Rasmussen Richard L. Graham

Co-array notation provides a compact syntax for programming parallel programs. Co-array Fortran (CAF) introduced and implements this notation, and CAF is currently proposed as an extension to the Fortran language standard. We believe that co-array notation requires a revised semantic definition beyond that specified by CAF for both pragmatic reasons within Fortran and to make the notation attra...

2006
G. M. von Hippel

We present TaylUR, a Fortran 95 module to automatically compute the numerical values of a complex-valued function's derivatives with respect to several variables up to an arbitrary order in each variable, but excluding mixed derivatives. Arithmetic operators and Fortran intrinsics are overloaded to act correctly on objects of a defined type taylor, which encodes a function along with its first ...

1998
Jan Prins Siddhartha Chatterjee Martin Simons

Modern dialects of Fortran enjoy wide use and good support on highperformance computers as performance-oriented programming languages. By providing the ability to express nested data parallelism in Fortran, we enable irregular computations to be incorporated into existing applications with minimal rewriting and without sacrificing performance within the regular portions of the application. Sinc...

1982
Robert S. Boyer

A new algorithm is presented for determining which, if any, of an arbitrary number of candidates has received a majority of the votes cast in an election. The number of comparisons required is at most twice the number of votes. Furthermore, the algorithm uses storage in a way that permits an eecient use of magnetic tape. A Fortran version of the algorithm is exhibited. The Fortran code has been...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید