scispace - formally typeset
BookDOI

Numerische Mathematik 1

Josef Stoer
Reads0
Chats0
About
The article was published on 1989-01-01. It has received 2186 citations till now.

read more

Citations
More filters
Book ChapterDOI

Direct solution of linear systems of size 10 9 arising in optimization with interior point methods

TL;DR: A parallel implementation of an interior point method uses object-oriented programming techniques and allows for exploiting different block-structures of matrices and outperforms the industry-standard optimizer, shows very good parallel efficiency on massively parallel architecture and solves problems of unprecedented sizes reaching 109 variables.
Journal ArticleDOI

Validation and Verification of a Numerical Model for Tsunami Propagation and Runup

TL;DR: A robust numerical model to simulate propagation and runup of tsunami waves in the framework of non-linear shallow water theory is developed in this article, which adopts a staggered leapfrog finite-difference scheme to solve the shallow water equations formulated for depth-averaged water fluxes in spherical coordinates.
Journal ArticleDOI

Error rates and resource overheads of repetition cat qubits

TL;DR: In this paper, the error rates and the resource overheads of the repetition cat qubit approach to universal and fault-tolerant quantum computation were analyzed and Monte Carlo simulations of all the circuits implementing the protected logical gates, using a circuit-level error model.

Addressing the Scalability of Ethernet with MOOSE

TL;DR: MOOSE, Multi-level Origin- Organised Scalable Ethernet, is an Ethernet switch architecture that performs in-place rewriting of MAC addresses in order to impose a hierarchy upon the address space without reconfiguration or modification of connected devices.
Journal ArticleDOI

Sampling social networks using shortest paths

TL;DR: The proposed sampling method first finds the shortest paths between several pairs of nodes selected according to some criteria, then the edges in these shortest paths are ranked according to the number of times that each edge has appeared in the set of found shortest paths.