Journal: BIT

Found 11 papers in total
Simultaneous point estimates for Newton's method
Simultaneous point estimates for Newton's method
2002,
Beside the classical Kantorovich theory there exist convergence criteria for the...
A new approach to the algebraic structures for integration methods
A new approach to the algebraic structures for integration methods
2002,
The analysis of compositions of Runge–Kutta methods involves manipulations of...
Numerical solution of the Bagley–Torvik equation
Numerical solution of the Bagley–Torvik equation
2002,
We consider the numerical solution of the Bagley–Torvik equation Ay″(t)...
Convergence aspects of step-parallel iteration of Runge–Kutta methods for delay differential equations
Convergence aspects of step-parallel iteration of Runge–Kutta methods for delay differential equations
2002,
Implicit Runge–Kutta methods are known as highly accurate and stable methods for...
Two-stage stochastic Runge–Kutta methods for stochastic differential equations
Two-stage stochastic Runge–Kutta methods for stochastic differential equations
2002,
In this paper we discuss two-stage diagonally implicit stochastic Runge–Kutta...
Monotone convergence of iterative methods for singular linear systems
Monotone convergence of iterative methods for singular linear systems
2002,
In this paper, monotonicity of iterative methods for solving general solvable singular...
Matrix multilevel methods and preconditioning
Matrix multilevel methods and preconditioning
2002,
The Matrix Multilevel approach is based on a purely matrix dependent description of...
Efficient parallel algorithms for shortest paths in planar diagraphs
Efficient parallel algorithms for shortest paths in planar diagraphs
1992,
Efficient parallel algorithms are presented, on the CREW PRAM model, for generating a...
Finding the k smallest spanning trees
Finding the k smallest spanning trees
1992,
The paper gives improved solutions for the problem of generating the k smallest...
The most vital edges with respect to the number of spanning trees in two-terminal series-parallel graphs
The most vital edges with respect to the number of spanning trees in two-terminal series-parallel graphs
1992,
A set E' of k edges in a multigraph G=(V,E) is said to be a k most vital edge set ( k-...
On the spectra of sums of orthogonal projections with applications to parallel computing
On the spectra of sums of orthogonal projections with applications to parallel computing
1991,
Many parallel iterative algorithms for solving symmetric, positive definite problems...
Papers per page: