![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
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 31 matches
- 1989
- Joachim H. Ahrens:
How to avoid logarithms in comparisons with uniform random variables. Computing 41(1-2): 163-166 (1989) - Mansour Al-Zanaidi, Christian Grossmann:
Monotone iteration discretization algorithm for BVP's. Computing 41(1-2): 59-74 (1989) - Klaus Böhmer, Mei Zhen:
Regularization and computation of a bifurcation problem with corank 2. Computing 41(4): 307-316 (1989) - Tibor Csendes:
An interval method for bounding level sets of parameter estimation problems. Computing 41(1-2): 75-86 (1989) - Ljiljana Cvetkovic
, Dragoslav Herceg:
The AOR method for solving linear interval equations. Computing 41(4): 359-364 (1989) - Asen L. Dontchev
, Elza M. Farkhi
:
Error estimates for discretized differential inclusions. Computing 41(4): 349-358 (1989) - David J. Evans, Changjun Li:
Numerical aspects of the generalized CG-method applied to least squares problems. Computing 41(1-2): 171-178 (1989) - Herbert Fischer:
Fast method to compute the scalar product of gradient and given vector. Computing 41(3): 261-265 (1989) - Andreas Frommer:
Implementing Brown's method for systems of nonlinear equations with dense banded Jacobian. Computing 41(1-2): 123-129 (1989) - Wolfgang Hackbusch:
On first and second order box schemes. Computing 41(4): 277-296 (1989) - Jürgen Herzberger:
On the convergence of an iterative method for bounding the inverses of an interval matrix. Computing 41(1-2): 153-162 (1989) - Walter Hoffmann:
Iterative algorithms for Gram-Schmidt orthogonalization. Computing 41(4): 335-348 (1989) - Annegret Hoy:
An efficiently implementable Gauss-Newton-like method for solving singular nonlinear equations. Computing 41(1-2): 107-122 (1989) - Martin Kiehl, Christoph Zenger:
An improved starting step of the G-B-S-method for the solution of ordinary differential equations. Computing 41(1-2): 131-136 (1989) - Christian Lécot:
A direct simulation Monte Carlo scheme and uniformly distributed sequences for solving the Boltzmann equation. Computing 41(1-2): 41-57 (1989) - Kam-Moon Liu, Eduardo L. Ortiz:
Numerical solution of ordinary and partial functional-differential eigenvalue problems with the Tau Method. Computing 41(3): 205-217 (1989) - Wolfgang Mackens:
Numerical differentiation of implicitly defined space curves. Computing 41(3): 237-260 (1989) - Abdelmalek Nasraoui:
Parallel coding of binary images. Computing 41(1-2): 1-17 (1989) - Ljiljana D. Petkovic, Miodrag S. Petkovic:
On some applications of circular complex functions. Computing 41(1-2): 141-148 (1989) - Hans-Jürgen Pohle, Thomas Wolf:
Automatic determination of dynamical symmetries of ordinary differential equations. Computing 41(4): 297-306 (1989) - Jiri Rohn:
A two-sequence method for linear interval equations. Computing 41(1-2): 137-140 (1989) - Jiri Rohn:
New condition numbers for matrices and linear systems. Computing 41(1-2): 167-169 (1989) - Siegfried Scholz:
Order barriers for the B-convergence of ROW methods. Computing 41(3): 219-235 (1989) - Zuhe Shen:
A class of componentwise Krawczyk-Moore type iteration methods. Computing 41(1-2): 149-152 (1989) - Gerard L. G. Sleijpen:
Strong stability results for the hopscotch method with applications to bending beam equations. Computing 41(3): 179-203 (1989) - Hiroshi Umeo, Tetsuo Asano:
Systolic algorithms for computational geometry problems - A survey. Computing 41(1-2): 19-40 (1989) - Relja Vulanovic:
A uniform numerical method for quasilinear singular perturbation problems without turning points. Computing 41(1-2): 97-106 (1989) - Xingren Ying, I. Norman Katz:
A simple reliable solver for all the roots of a nonlinear function in a given domain. Computing 41(4): 317-333 (1989) - Mei Zhen:
Splitting iteration method for simple singular points and simple bifurcation points. Computing 41(1-2): 87-96 (1989) - Antanas Zilinskas:
A note on "Extended univariate algorithms" by J. Pinter. Computing 41(3): 275-276 (1989)
skipping 1 more match
loading more results
failed to load more results, please try again later
![](https://dblp1.uni-trier.de/img/cog.dark.24x24.png)
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-06-22 04:38 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