Product
Help
Pricing
About
Jobs
Log in
Get started
Keyword
Add to collection
FORTRAN implementation
Description:
A software implementation uses FORTRAN code to realize numerical methods, algorithms, or computational models.
Related topic:
Matrix Theory and Algorithms (9%)
OpenAlex ID:
keywords/fortran-implementation
A new approach to variable metric algorithms
1970
·
R. Fletcher
·
The Computer Journal
·
5,012
SLINK: An optimally efficient algorithm for the single-link cluster method
1973
·
R. Sibson
·
The Computer Journal
·
1,446
Design and Testing of a Generalized Reduced Gradient Code for Nonlinear Programming
1978
·
L. S. Lasdon
, A. D. Waren
, et al.
·
ACM Transactions on Mathematical Software
·
1,434
Computing Dirichlet tessellations
1981
·
A. Bowyer
·
The Computer Journal
·
1,288
PATRICIA—Practical Algorithm To Retrieve Information Coded in Alphanumeric
1968
·
Donald R. Morrison
·
Journal of the ACM
·
1,141
PDF
Capabilities and limitations of a current FORTRAN implementation of the T-matrix method for randomly oriented, rotationally symmetric scatterers
1998
·
Michael I. Mishchenko
, Larry D. Travis
·
Journal of Quantitative Spectroscopy and Radiative Transfer
·
935
The complex-step derivative approximation
2003
·
Joaquim R. R. A. Martins
, Peter Sturdza
, et al.
·
ACM Transactions on Mathematical Software
·
922
Numerical Inversion of Laplace Transforms by Relating Them to the Finite Fourier Cosine Transform
1968
·
H. Dubner
, J. Abate
·
Journal of the ACM
·
604
PDF
An Algorithm for the Construction of "D-Optimal" Experimental Designs
2000
·
Toby J. Mitchell
·
Technometrics
·
445
Shortest path algorithms
1988
·
Giorgio Gallo
, Stefano Pallottino
·
Annals of Operations Research
·
424
Experimental Survival Curves for Interval-Censored Data
1973
·
Richard Peto
·
Journal of the Royal Statistical Society Series C (Applied Statistics)
·
391
A projected Lagrangian algorithm and its implementation for sparse nonlinear constraints
1982
·
Bruce A. Murtagh
, Michael A. Saunders
·
Mathematical programming studies
·
377
Global sensitivity analysis—a computational implementation of the Fourier Amplitude Sensitivity Test (FAST)
1982
·
Gregory J. McRae
, James W. Tilden
, et al.
·
Computers & Chemical Engineering
·
362
A New Convex Hull Algorithm for Planar Sets
1977
·
William F. Eddy
·
ACM Transactions on Mathematical Software
·
342
PDF
A Procedure to Generate Thiessen Polygons
1979
·
Kurt E. Brassel
, Douglas Reif
·
Geographical Analysis
·
338
PDF
Linear Network Optimization: Algorithms and Codes.
1993
·
Donald K. Wagner
, Dimitri P. Bertsekas
·
Mathematics of Computation
·
321
Algorithm 39 Clusterwise linear regression
1979
·
H. Späth
·
Computing
·
282
An Improved Algorithm for Computing the Singular Value Decomposition
1982
·
Tony F. Chan
·
ACM Transactions on Mathematical Software
·
279
PDF
On computing the split-radix FFT
1986
·
H. Sorensen
, M. Heideman
, et al.
·
IEEE Transactions on Acoustics Speech and Signal Processing
·
262
A fast algorithm for constructing Delaunay triangulations in the plane
1987
·
S.W. Sloan
·
Advances in Engineering Software (1978)
·
258
Rapid computation of the Voigt and complex error functions
1978
·
A.K. Hui
, B.H. Armstrong
, et al.
·
Journal of Quantitative Spectroscopy and Radiative Transfer
·
257
Algorithm 923: Efficient Numerical Computation of the Pfaffian for Dense and Banded Skew-Symmetric Matrices
2012
·
M. Wimmer
·
ACM Transactions on Mathematical Software
·
250
PDF
Data smoothing using low-pass digital filters
1977
·
J. F. Kaiser
, W. A. Reed
·
Review of Scientific Instruments
·
250
An Algorithm for the Construction of “D-Optimal” Experimental Designs
1974
·
Toby J. Mitchell
·
Technometrics
·
248
Solving Large Sparse Nonlinear Programs Using GRG
1992
·
Stuart Smith
, Leon Lasdon
·
INFORMS journal on computing
·
214
Show more works
View as search
Works count:
682
Citation count:
27,260
Year
Topic
Type