On Efficient Implementations of Kogbetliantz's Algorithm for Computing the Singular Value Decomposition.
On Lagrange multipliers of trust-region subproblems
On Numerical Solution of the Gardner–Ostrovsky Equation
A simple explicit numerical scheme is proposed for the solution of the Gardner–Ostrovsky equation (ut + cux + α uux + α1u2ux + βuxxx)x = γu which is also known as the extended rotation-modified Korteweg–de Vries (KdV) equation. This equation is used for the description of internal oceanic waves affected by Earth’ rotation. Particular versions of this equation with zero some of coefficients, α, α1, β, or γ are also known in numerous applications....
On parallel two-stage methods for Hermitian positive definite matrices with applications to preconditioning.
On the correctness of some bisection-like parallel eigenvalue algorithms in floating point arithmetic.
On the fourth order root finding methods of Euler's type.
On the improved family of simultaneous methods for the inclusion of multiple polynomial zeros.
On the number of iterations required by Von Neumann addition
We investigate the number of iterations needed by an addition algorithm due to Burks et al. if the input is random. Several authors have obtained results on the average case behaviour, mainly using analytic techniques based on generating functions. Here we take a more probabilistic view which leads to a limit theorem for the distribution of the random number of steps required by the algorithm and also helps to explain the limiting logarithmic periodicity as a simple discretization phenomenon.
On the number of iterations required by Von Neumann addition
We investigate the number of iterations needed by an addition algorithm due to Burks et al. if the input is random. Several authors have obtained results on the average case behaviour, mainly using analytic techniques based on generating functions. Here we take a more probabilistic view which leads to a limit theorem for the distribution of the random number of steps required by the algorithm and also helps to explain the limiting logarithmic periodicity as a simple discretization phenomenon.
On the numerical solution of the diffusion equation with a nonlocal boundary condition.
On the parallel domain decomposition algorithms for time-dependent problems.
On the parallel solution of tridiagonal systems by wrap-around partitioning and incomplete LU factorization.
On the randomized complexity of Banach space valued integration
We study the complexity of Banach space valued integration in the randomized setting. We are concerned with r times continuously differentiable functions on the d-dimensional unit cube Q, with values in a Banach space X, and investigate the relation of the optimal convergence rate to the geometry of X. It turns out that the nth minimal errors are bounded by if and only if X is of equal norm type p.
On uniqueness of a weak solution to the steady Navier-Stokes problem in a profile cascade with a nonlinear boundary condition on the outflow
Original title unknown
Parallel algorithm for solving the Black-Scholes equation
Parallel algorithm for spatially one-and two-dimensional initial-boundary-value problem for a parabolic equation
A generalization of the spatially one-dimensional parallel pipe-line algorithm for solution of the initial-boundary-value problem using explicit difference method to the two-dimensional case is presented. The suggested algorithm has been verified by implementation on a workstation-cluster running under PVM (Parallel Virtual Machine). Theoretical estimates of the speed-up are presented.
Parallel algorithms for initial and boundary value problems for linear ordinary differential equations and their systems
Parallel and superfast algorithms for Hankel systems of equations.
Parallel cyclic odd-even reduction algorithms for solving general tridiagonal periodic systems on parallel computers