Остановите войну!
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 72 matches
- 2019
- Auwal Bala Abubakar, Poom Kumam:
A descent Dai-Liao conjugate gradient method for nonlinear equations. Numer. Algorithms 81(1): 197-210 (2019) - Mark Adams, Connor Tannahill, Paul H. Muir:
Error control Gaussian collocation software for boundary value ODEs and 1D time-dependent PDEs. Numer. Algorithms 81(4): 1505-1519 (2019) - Saghir Ahmad, John C. Butcher, Winston L. Sweatman:
Variable order and stepsize in general linear methods. Numer. Algorithms 81(4): 1403-1421 (2019) - Roberto Andreani, Viviana A. Ramirez, Sandra A. Santos, Leonardo D. Secchin:
Bilevel optimization with a multiobjective problem in the lower level. Numer. Algorithms 81(3): 915-946 (2019) - Neculai Andrei:
A diagonal quasi-Newton updating method for unconstrained optimization. Numer. Algorithms 81(2): 575-590 (2019) - Tran Viet Anh:
Linesearch methods for bilevel split pseudomonotone variational inequality problems. Numer. Algorithms 81(3): 1067-1087 (2019) - Pham Ky Anh, Nguyen The Vinh:
Self-adaptive gradient projection algorithms for variational inequalities involving non-Lipschitz continuous operators. Numer. Algorithms 81(3): 983-1001 (2019) - Rashad M. Asharabi:
The use of the sinc-Gaussian sampling formula for approximating the derivatives of analytic functions. Numer. Algorithms 81(1): 293-312 (2019) - Kendall E. Atkinson, David Da-Kwun Chien, Olaf Hansen:
A spectral method for an elliptic equation with a nonlinear Neumann boundary condition. Numer. Algorithms 81(1): 313-344 (2019) - Fermín S. V. Bazán, J. R. Quiroz:
Galerkin approach for estimating boundary data in Poisson equation on annular domain with application to heat transfer coefficient estimation in coiled tubes. Numer. Algorithms 81(1): 79-98 (2019) - Carolina Vittoria Beccari, Giulio Casciola, Marie-Laurence Mazure:
Design or not design? A numerical characterisation for piecewise Chebyshevian splines. Numer. Algorithms 81(1): 1-31 (2019) - Dario A. Bini, Stefano Massei, Leonardo Robol:
Quasi-Toeplitz matrix arithmetic: a MATLAB toolbox. Numer. Algorithms 81(2): 741-769 (2019) - Luigi Brugnano, Felice Iavernaro, Juan I. Montijano, Luis Rández:
Spectrally accurate space-time solution of Hamiltonian PDEs. Numer. Algorithms 81(4): 1183-1202 (2019) - Luigi Brugnano, Zdzislaw Jackiewicz, Helmut Podhaisky, Yajuan Sun, Caren Tischendorf:
Preface. Numer. Algorithms 81(4): 1181-1182 (2019) - Luigi Brugnano, Juan I. Montijano, Luis Rández:
On the effectiveness of spectral methods for the numerical solution of multi-frequency highly oscillatory Hamiltonian problems. Numer. Algorithms 81(1): 345-376 (2019) - Weiping Bu, Aiguo Xiao:
An h-p version of the continuous Petrov-Galerkin finite element method for Riemann-Liouville fractional differential equation with novel test basis functions. Numer. Algorithms 81(2): 529-545 (2019) - John C. Butcher:
Trees and B-series. Numer. Algorithms 81(4): 1311-1325 (2019) - Mingyuan Cao, Qingdao Huang, Yueting Yang:
A self-adaptive trust region method for extreme ℬ-eigenvalues of symmetric tensors. Numer. Algorithms 81(2): 407-420 (2019) - Patrick L. Combettes, Andrew M. McDonald, Charles A. Micchelli, Massimiliano Pontil:
Learning with optimal interpolation norms. Numer. Algorithms 81(2): 695-717 (2019) - Robert M. Corless, C. Yalçin Kaya, Robert H. C. Moir:
Optimal residuals and the Dahlquist test problem. Numer. Algorithms 81(4): 1253-1274 (2019) - Pratibhamoy Das:
An a posteriori based convergence analysis for a nonlinear singularly perturbed system of delay differential equations on an adaptive mesh. Numer. Algorithms 81(2): 465-487 (2019) - Samer S. Ezz-Eldien, Eid H. Doha:
Fast and precise spectral method for solving pantograph type Volterra integro-differential equations. Numer. Algorithms 81(1): 57-77 (2019) - Yonglei Fang, Yanping Yang, Xiong You, Bin Wang:
A new family of A-stable Runge-Kutta methods with equation-dependent coefficients for stiff problems. Numer. Algorithms 81(4): 1235-1251 (2019) - Antonio Fazzi, Nicola Guglielmi, Ivan Markovsky:
An ODE-based method for computing the approximate greatest common divisor of polynomials. Numer. Algorithms 81(2): 719-740 (2019) - Walter Gautschi:
Correction to: Sub-range Jacobi polynomials. Numer. Algorithms 81(2): 771 (2019) - Silvia Gazzola, Per Christian Hansen, James G. Nagy:
IR Tools: a MATLAB package of iterative regularization methods and large-scale test problems. Numer. Algorithms 81(3): 773-811 (2019) - Robert A. Van Gorder:
Optimal homotopy analysis and control of error for implicitly defined fully nonlinear differential equations. Numer. Algorithms 81(1): 181-196 (2019) - Kevin R. Green, Raymond J. Spiteri:
Gating-enhanced IMEX splitting methods for cardiac monodomain simulation. Numer. Algorithms 81(4): 1443-1457 (2019) - Vijay Gupta, Gancho Tachev, Ana Maria Acu:
Modified Kantorovich operators with better approximation properties. Numer. Algorithms 81(1): 125-149 (2019) - Hanzhang Hu, Yiping Fu, Jie Zhou:
Numerical solution of a miscible displacement problem with dispersion term using a two-grid mixed finite element approach. Numer. Algorithms 81(3): 879-914 (2019)
skipping 42 more matches
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-23 18: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