Остановите войну!
for scientists:
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 26 matches
- 2003
- James Baglama, Daniela Calvetti, Lothar Reichel:
Algorithm 827: irbleigs: A MATLAB program for computing a few eigenpairs of a large sparse Hermitian matrix. ACM Trans. Math. Softw. 29(3): 337-348 (2003) - Emma L. Bradbury, Wayne H. Enright:
Fast contouring of solutions to partial differential equations. ACM Trans. Math. Softw. 29(4): 418-439 (2003) - H. Martin Bücker, Arno Rasch:
Modeling the performance of interface contraction. ACM Trans. Math. Softw. 29(4): 440-457 (2003) - Ronald Cools, Ann Haegemans:
Algorithm 824: CUBPACK: a package for automatic cubature; framework description. ACM Trans. Math. Softw. 29(3): 287-296 (2003) - Annick Dhooge, Willy Govaerts, Yuri A. Kuznetsov:
MATCONT: A MATLAB package for numerical bifurcation analysis of ODEs. ACM Trans. Math. Softw. 29(2): 141-164 (2003) - Ingo Eble, Markus Neher:
ACETAF: A software package for computing validated bounds for Taylor coefficients of analytic functions. ACM Trans. Math. Softw. 29(3): 263-286 (2003) - Mark R. Fahey:
Algorithm 826: A parallel eigenvalue routine for complex Hessenberg matrices. ACM Trans. Math. Softw. 29(3): 326-336 (2003) - Marco Gaviano, Dmitri E. Kvasov, Daniela Lera, Yaroslav D. Sergeyev:
Algorithm 829: Software for generation of classes of test functions with known local and global minima for global optimization. ACM Trans. Math. Softw. 29(4): 469-480 (2003) - Alan Genz, Ronald Cools:
An adaptive numerical cubature algorithm for simplices. ACM Trans. Math. Softw. 29(3): 297-308 (2003) - E. Michael Gertz, Stephen J. Wright:
Object-oriented software for quadratic programming. ACM Trans. Math. Softw. 29(1): 58-81 (2003) - Nicholas I. M. Gould, Dominique Orban, Philippe L. Toint:
GALAHAD, a library of thread-safe Fortran 90 packages for large-scale nonlinear optimization. ACM Trans. Math. Softw. 29(4): 353-372 (2003) - Nicholas I. M. Gould, Dominique Orban, Philippe L. Toint:
CUTEr and SifDec: A constrained and unconstrained testing environment, revisited. ACM Trans. Math. Softw. 29(4): 373-394 (2003) - Didier Henrion, Jean B. Lasserre:
GloptiPoly: Global optimization over polynomials with Matlab and SeDuMi. ACM Trans. Math. Softw. 29(2): 165-194 (2003) - Hee Sun Hong, Fred J. Hickernell:
Algorithm 823: Implementing scrambled digital sequences. ACM Trans. Math. Softw. 29(2): 95-109 (2003) - Tim R. Hopkins:
Remark on Algorithm 769: Fortran subroutines for approximate solution of sparse quadratic assignment problems using GRASP. ACM Trans. Math. Softw. 29(3): 349-351 (2003) - Stephen Joe, Frances Y. Kuo:
Remark on algorithm 659: Implementing Sobol's quasirandom sequence generator. ACM Trans. Math. Softw. 29(1): 49-57 (2003) - Xiaoye S. Li, James Demmel:
SuperLU_DIST: A scalable distributed-memory sparse direct solver for unsymmetric linear systems. ACM Trans. Math. Softw. 29(2): 110-140 (2003) - Joaquim R. R. A. Martins, Peter Sturdza, Juan J. Alonso:
The complex-step derivative approximation. ACM Trans. Math. Softw. 29(3): 245-262 (2003) - Yves Nievergelt:
Scalar fused multiply-add instructions produce floating-point matrix arithmetic provably accurate to the penultimate digit. ACM Trans. Math. Softw. 29(1): 27-48 (2003) - Enrique S. Quintana-Ortí, Robert A. van de Geijn:
Formal derivation of algorithms: The triangular sylvester equation. ACM Trans. Math. Softw. 29(2): 218-243 (2003) - Robert J. Renka:
Algorithm 828: DNSPLIN1: discrete nonlinear spline interpolation. ACM Trans. Math. Softw. 29(4): 458-468 (2003) - Scott A. Sarra:
The spectral signal processing suite. ACM Trans. Math. Softw. 29(2): 195-217 (2003) - Jennifer A. Scott:
Parallel frontal solvers for large sparse linear systems. ACM Trans. Math. Softw. 29(4): 395-417 (2003) - Spencer D. Shellman, Kris Sikorski:
Algorithm 825: A deep-cut bisection envelope algorithm for fixed points. ACM Trans. Math. Softw. 29(3): 309-325 (2003) - Gustaf Söderlind:
Digital filters in adaptive time-stepping. ACM Trans. Math. Softw. 29(1): 1-26 (2003) - Lothar Wenzel, Ram Rajagopal, Dinesh Nair:
Induced well-distributed sets in Riemannian spaces. ACM Trans. Math. Softw. 29(1): 82-94 (2003)
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-05-19 13:28 CEST 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