default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 28 matches
- 1999
- Michael W. Berry, Karen S. Minser:
Algorithm 798: high-dimensional interpolation using the modified Shepard method. ACM Trans. Math. Softw. 25(3): 353-366 (1999) - Luisa D'Amore, Giuliano Laccetti, Almerico Murli:
An implementation of a Fourier series method for the numerical inversion of the Laplace transform. ACM Trans. Math. Softw. 25(3): 279-305 (1999) - Luisa D'Amore, Giuliano Laccetti, Almerico Murli:
Algorithm 796: a Fortran software package for the numerical inversion of the Laplace transform based on a Fourier series method. ACM Trans. Math. Softw. 25(3): 306-315 (1999) - Krister Dackland, Bo Kågström:
Blocked algorithms and software for reduction of a regular matrix pair to generalized Schur form. ACM Trans. Math. Softw. 25(4): 425-454 (1999) - Timothy A. Davis, Iain S. Duff:
A combined unifrontal/multifrontal method for unsymmetric sparse matrices. ACM Trans. Math. Softw. 25(1): 1-20 (1999) - Michel J. Daydé, Iain S. Duff:
The RISC BLAS: a blocked implementation of level 3 BLAS for RISC processors. ACM Trans. Math. Softw. 25(3): 316-340 (1999) - Iain S. Duff, Jennifer A. Scott:
A frontal code for the solution of sparse positive-definite symmetric systems arising from finite-element applications. ACM Trans. Math. Softw. 25(4): 404-424 (1999) - John A. Edwards:
Characteristic spectra of the curvature functional: a numerical study in bifurcation. ACM Trans. Math. Softw. 25(4): 455-475 (1999) - Juan J. Flores:
Complex fans: a representation for vectors in polar form with interval attributes. ACM Trans. Math. Softw. 25(2): 129-156 (1999) - Walter Gautschi:
A note on the recursive calculation of incomplete gamma functions. ACM Trans. Math. Softw. 25(1): 101-107 (1999) - Walter Gautschi:
Algorithm 793: GQRAT - Gauss quadrature for rational functions. ACM Trans. Math. Softw. 25(2): 213-239 (1999) - David M. Gay, Eric Grosse:
Self-adapting Fortran 77 machine constants: comment on Algorithm 528. ACM Trans. Math. Softw. 25(1): 123-126 (1999) - Mark S. Gockenbach, Matthew J. Petro, William W. Symes:
C++ classes for linking optimization with complex simulations. ACM Trans. Math. Softw. 25(2): 191-212 (1999) - Matthias Heinkenschloss, Luís Nunes Vicente:
An interface optimization and application for the numerical solution of optimal control problems. ACM Trans. Math. Softw. 25(2): 157-190 (1999) - Christopher E. Kees, Cass T. Miller:
C++ implementations of numerical methods for solving differential-algebraic equations: design and optimization considerations. ACM Trans. Math. Softw. 25(4): 377-403 (1999) - Pierre L'Ecuyer, Richard J. Simard:
Beware of linear congruential generators with multipliers of the form a = ±2q ±2r. ACM Trans. Math. Softw. 25(3): 367-374 (1999) - John D. Pryce:
A test package for Sturm-Liouville solvers. ACM Trans. Math. Softw. 25(1): 21-57 (1999) - John D. Pryce:
Algorithm 789: SLTSTPAK: : a test package for Sturm-Liouville solvers. ACM Trans. Math. Softw. 25(1): 58-69 (1999) - Robert J. Renka:
Algorithm 790: CSHEP2D: cubic Shepard method for bivariate interpolation of scattered data. ACM Trans. Math. Softw. 25(1): 70-73 (1999) - Robert J. Renka:
Remark on Algorithm 751. ACM Trans. Math. Softw. 25(1): 97-98 (1999) - Robert J. Renka:
Remark on Algorithm 752. ACM Trans. Math. Softw. 25(1): 99-100 (1999) - Robert J. Renka, Ron Brown:
Algorithm 791: TSHEP2D: cosine series Shepard method for bivariate interpolation of scattered data. ACM Trans. Math. Softw. 25(1): 74-77 (1999) - Robert J. Renka, Ron Brown:
Algorithm 792: accuracy test of ACM algorithms for interpolation of scattered data in the plane. ACM Trans. Math. Softw. 25(1): 78-94 (1999) - Celso C. Ribeiro, Mauricio G. C. Resende:
Algorithm 797: Fortran subroutines for approximate solution of graph planarization problems using GRASP. ACM Trans. Math. Softw. 25(3): 341-352 (1999) - F. J. Testa, Robert J. Renka:
Remark on Algorithm 716. ACM Trans. Math. Softw. 25(1): 95-96 (1999) - Jan Verschelde:
Algorithm 795: PHCpack: a general-purpose solver for polynomial systems by homotopy continuation. ACM Trans. Math. Softw. 25(2): 251-276 (1999) - Thomas Wieder:
Algorithm 794: numerical Hankel transform by the Fortran program HANKEL. ACM Trans. Math. Softw. 25(2): 240-250 (1999) - Dexuan Xie, Tamar Schlick:
Remark on Algorithm 702 - the updated truncated Newton minimization package. ACM Trans. Math. Softw. 25(1): 108-122 (1999)
loading more results
failed to load more results, please try again later
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
retrieved on 2024-11-08 09:40 CET from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint