On the periodic quotient singular value decomposition.
The paper analyses the biconjugate gradient algorithm and its preconditioned version for solving large systems of linear algebraic equations with nonsingular sparse complex matrices. Special emphasis is laid on symmetric matrices arising from discretization of complex partial differential equations by the finite element method.
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.
Based on estimates for the KdV equation in analytic Gevrey classes, a spectral collocation approximation of the KdV equation is proved to converge exponentially fast.
The main objective of this paper is to study the boundedness character, the periodicity character, the convergence and the global stability of positive solutions of the difference equation where the coefficients for and , are positive integers. The initial conditions are arbitrary positive real numbers such that . Some numerical experiments are presented.
2000 Mathematics Subject Classification: 62G07, 62L20.Tsybakov [31] introduced the method of stochastic approximation to construct a recursive estimator of the location q of the mode of a probability density. The aim of this paper is to provide a companion algorithm to Tsybakov's algorithm, which allows to simultaneously recursively approximate the size m of the mode. We provide a precise study of the joint weak convergence rate of both estimators. Moreover, we introduce the averaging principle...