On the parametric solution to the second-order Sylvester matrix equation .
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.