On properties of spectral approximations
On -iterative methods for solving equations and systems.
On quadratic convergence bounds for the J-symmetric Jacobi method.
On quadrature methods for the double layer potential equation over the boundary of a polyhedron.
On Quasi Degree Quadrature Rules.
On quasi-solution to infeasible linear complementarity problem obtained by Lemke’s method
For a linear complementarity problem with inconsistent system of constraints a notion of quasi-solution of Tschebyshev type is introduced. It’s shown that this solution can be obtained automatically by Lemke’s method if the constraint matrix of the original problem is copositive plus or belongs to the intersection of matrix classes P 0 and Q 0.
On random walk simulation of one-dimensional diffusion processes with discontinuous coefficients.
On rational approximations to the exponential
On rational classical orthogonal polynomials and their application for explicit computation of inverse Laplace transforms.
On real interpolation, finite differences, and estimates depending on a parameter for discretizations of elliptic boundary value problems.
On reducing bandwidth of matrices in the Go-Away algorithm for regular grids.
On regularity of solutions to some problems of mathematical physics
On relations between right and left eigenvectors of nonselfadjoint matrix pencils
On Richardson Extrapolation for Finite Difference Methods on Regular Grids.
On Runge-Kutta, collocation and discontinuous Galerkin methods: Mutual connections and resulting consequences to the analysis
Discontinuous Galerkin (DG) methods are starting to be a very popular solver for stiff ODEs. To be able to prove some more subtle properties of DG methods it can be shown that the DG method is equivalent to a specific collocation method which is in turn equivalent to an even more specific implicit Runge-Kutta (RK) method. These equivalences provide us with another interesting view on the DG method and enable us to employ well known techniques developed already for any of these methods. Our aim will...
On Samelson's Iteration for Factoring Polynomials.
On second order of accuracy difference scheme of the approximate solution of nonlocal elliptic-parabolic problems.
On second–order Taylor expansion of critical values
Studying a critical value function in parametric nonlinear programming, we recall conditions guaranteeing that is a function and derive second order Taylor expansion formulas including second-order terms in the form of certain generalized derivatives of . Several specializations and applications are discussed. These results are understood as supplements to the well–developed theory of first- and second-order directional differentiability of the optimal value function in parametric optimization....
On selecting the best features in a noisy environment
This paper introduces a novel method for selecting a feature subset yielding an optimal trade-off between class separability and feature space dimensionality. We assume the following feature properties: (a) the features are ordered into a sequence, (b) robustness of the features decreases with an increasing order and (c) higher-order features supply more detailed information about the objects. We present a general algorithm how to find under those assumptions the optimal feature subset. Its performance...
On selection of interface weights in domain decomposition methods
Different choices of the averaging operator within the BDDC method are compared on a series of 2D experiments. Subdomains with irregular interface and with jumps in material coefficients are included into the study. Two new approaches are studied along three standard choices. No approach is shown to be universally superior to others, and the resulting recommendation is that an actual method should be chosen based on properties of the problem.