Остановите войну!
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
- 2022
- Junaid Ahmad, Kifayat Ullah, Muhammad Arshad:
Convergence, weak w2 stability, and data dependence results for the F iterative scheme in hyperbolic spaces. Numer. Algorithms 91(4): 1755-1778 (2022) - Sergio Amat, David Levin, Juan Ruiz Álvarez, Juan Carlos Trillo, Dionisio F. Yáñez:
A class of C2 quasi-interpolating splines free of Gibbs phenomenon. Numer. Algorithms 91(1): 51-79 (2022) - Pierluigi Amodio, Luigi Brugnano, Felice Iavernaro:
Arbitrarily high-order energy-conserving methods for Poisson problems. Numer. Algorithms 91(2): 861-894 (2022) - Pedro R. S. Antunes:
A well-conditioned method of fundamental solutions for Laplace equation. Numer. Algorithms 91(3): 1381-1405 (2022) - Gajendra Babu, M. Prithvi, Kapil K. Sharma, V. P. Ramesh:
A robust numerical algorithm on harmonic mesh for parabolic singularly perturbed convection-diffusion problems with time delay. Numer. Algorithms 91(2): 615-634 (2022) - Bernhard Beckermann, Joanna Bisch, Robert Luce:
On the rational approximation of Markov functions, with applications to the computation of Markov functions of Toeplitz matrices. Numer. Algorithms 91(1): 109-144 (2022) - Timo Betcke, Michal Bosy, Erik Burman:
Hybrid coupling of finite element and boundary element methods using Nitsche's method and the Calderon projection. Numer. Algorithms 91(3): 997-1019 (2022) - Bernard Bialecki, Graeme Fairweather, Andreas Karageorghis:
An optimal two-step quadratic spline collocation method for the Dirichlet biharmonic problem. Numer. Algorithms 91(3): 1115-1143 (2022) - Tomasz Bochacik, Pawel Przybylowicz:
On the randomized Euler schemes for ODEs under inexact information. Numer. Algorithms 91(3): 1205-1229 (2022) - Manuel Bogoya, Sven-Erik Ekström, Stefano Serra Capizzano:
Fast Toeplitz eigenvalue computations, joining interpolation-extrapolation matrix-less algorithms and simple-loop theory. Numer. Algorithms 91(4): 1653-1676 (2022) - Kevin Burrage, Pamela M. Burrage, Grant Lythe:
Effective numerical methods for simulating diffusion on a spherical surface in three dimensions. Numer. Algorithms 91(4): 1577-1596 (2022) - Subhash Chandra, Syed Abbas:
Analysis of fractal dimension of mixed Riemann-Liouville integral. Numer. Algorithms 91(3): 1021-1046 (2022) - Faycal Chaouqui, Martin J. Gander, Pratik M. Kumbhar, Tommaso Vanzan:
Linear and nonlinear substructured Restricted Additive Schwarz iterations and preconditioning. Numer. Algorithms 91(1): 81-107 (2022) - Yao Cheng, Li Yan, Yanjie Mei:
Balanced-norm error estimate of the local discontinuous Galerkin method on layer-adapted meshes for reaction-diffusion problems. Numer. Algorithms 91(4): 1597-1626 (2022) - Gabriele Ciaramella, Tommaso Vanzan:
Substructured two-grid and multi-grid domain decomposition methods. Numer. Algorithms 91(1): 413-448 (2022) - Francesco A. Costabile, Maria Italia Gualtieri, Anna Napoli:
Bivariate general Appell interpolation problem. Numer. Algorithms 91(2): 531-556 (2022) - Natalia Czyzewska, Pawel M. Morkisz, Pawel Przybylowicz:
Approximation of solutions of DDEs under nonstandard assumptions via Euler scheme. Numer. Algorithms 91(4): 1829-1854 (2022) - Monica Dessole, Fabio Marcuzzi:
Deviation maximization for rank-revealing QR factorizations. Numer. Algorithms 91(3): 1047-1079 (2022) - Luca Dieci, Alessandra Papini, Alessandro Pugliese:
Decompositions and coalescing eigenvalues of symmetric definite pencils depending on parameters. Numer. Algorithms 91(4): 1879-1910 (2022) - Zdenek Dostál, David Horák, Jakub Kruzík, Tomás Brzobohatý, Oldrich Vlach:
Highly scalable hybrid domain decomposition method for the solution of huge scalar variational inequalities. Numer. Algorithms 91(2): 773-801 (2022) - Guangzhi Du, Liyun Zuo:
Local and parallel partition of unity scheme for the mixed Navier-Stokes-Darcy problem. Numer. Algorithms 91(2): 635-650 (2022) - Lars Eldén, Maryam Dehghan:
A Krylov-Schur-like method for computing the best rank-(r1, r2, r3) approximation of large and sparse tensors. Numer. Algorithms 91(3): 1315-1347 (2022) - Idoia Cortes Garcia, Iryna Kulchytska-Ruchka, Sebastian Schöps:
Parareal for index two differential algebraic equations. Numer. Algorithms 91(1): 389-412 (2022) - Walter Gautschi:
Another look at polynomials orthogonal relative to exponential integral weight functions. Numer. Algorithms 91(4): 1547-1557 (2022) - Tomás Gergelits, Bjørn Fredrik Nielsen, Zdenek Strakos:
Numerical approximation of the spectrum of self-adjoint operators in operator preconditioning. Numer. Algorithms 91(1): 301-325 (2022) - Michael Hanke:
On the sensitivity of implementations of a least-squares collocation method for linear higher-index differential-algebraic equations. Numer. Algorithms 91(4): 1721-1754 (2022) - Gabriel Jarry-Bolduc:
Approximating the diagonal of a Hessian: which sample set of points should be used. Numer. Algorithms 91(3): 1349-1361 (2022) - Xianzhen Jiang, Wei Liao, Jianghua Yin, Jinbao Jian:
A new family of hybrid three-term conjugate gradient methods with applications in image restoration. Numer. Algorithms 91(1): 161-191 (2022) - Bhuwan Chandra Joshi:
Mathematical programs with vanishing constraints involving strongly invex functions. Numer. Algorithms 91(2): 505-530 (2022) - Dongho Kim, Eun-Jae Park, Boyoon Seo:
Error analysis for the pseudostress formulation of unsteady Stokes problem. Numer. Algorithms 91(2): 959-996 (2022)
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-31 23:50 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