Comparison projection method with Adomian's decomposition method for solving system of integral equations.
Comparison Theorems for Compound Quadrature Formulas.
Comparison theorems for weak nonnegative splittings of -monotone matrices.
Comparison theorems for weak splittings of bounded operators.
Comparisons of Regular Splittings of Matrices.
Comparisons of Weak Regular Splittings and Multisplitting Methods.
Compartmental Models of Migratory Dynamics
Compartmentalization is a general principle in biological systems which is observable on all size scales, ranging from organelles inside of cells, cells in histology, and up to the level of groups, herds, swarms, meta-populations, and populations. Compartmental models are often used to model such phenomena, but such models can be both highly nonlinear and difficult to work with.Fortunately, there are many significant biological systems that are amenable to linear compartmental models which are often...
Compatibilité des espaces discrets pour l'approximation spectrale du problème de Stokes périodique/non périodique
Compatibility of systems of linear ordinary differential equations with variable coefficients
Compatible discretization of second-order elliptic problems.
Complementarity - the way towards guaranteed error estimates
This paper presents a review of the complementary technique with the emphasis on computable and guaranteed upper bounds of the approximation error. For simplicity, the approach is described on a numerical solution of the Poisson problem. We derive the complementary error bounds, prove their fundamental properties, present the method of hypercircle, mention possible generalizations and show a couple of numerical examples.
Complete solution of tropical vector inequalities using matrix sparsification
We examine the problem of finding all solutions of two-sided vector inequalities given in the tropical algebra setting, where the unknown vector multiplied by known matrices appears on both sides of the inequality. We offer a solution that uses sparse matrices to simplify the problem and to construct a family of solution sets, each defined by a sparse matrix obtained from one of the given matrices by setting some of its entries to zero. All solutions are then combined to present the result in a...
Complete Spline Smoothing.
Complexity bound of absolute factoring of parametric polynomials.
Complexity issues for the symmetric interval eigenvalue problem
We study the problem of computing the maximal and minimal possible eigenvalues of a symmetric matrix when the matrix entries vary within compact intervals. In particular, we focus on computational complexity of determining these extremal eigenvalues with some approximation error. Besides the classical absolute and relative approximation errors, which turn out not to be suitable for this problem, we adapt a less known one related to the relative error, and also propose a novel approximation error....
Complexity of an algorithm for solving saddle-point systems with singular blocks arising in wavelet-Galerkin discretizations
The paper deals with fast solving of large saddle-point systems arising in wavelet-Galerkin discretizations of separable elliptic PDEs. The periodized orthonormal compactly supported wavelets of the tensor product type together with the fictitious domain method are used. A special structure of matrices makes it possible to utilize the fast Fourier transform that determines the complexity of the algorithm. Numerical experiments confirm theoretical results.
Complexity of computing interval matrix powers for special classes of matrices
Computing powers of interval matrices is a computationally hard problem. Indeed, it is NP-hard even when the exponent is 3 and the matrices only have interval components in one row and one column. Motivated by this result, we consider special types of interval matrices where the interval components occupy specific positions. We show that computing the third power of matrices with only one column occupied by interval components can be solved in cubic time; so the asymptotic time complexity is the...
Complexity of the method of averaging
The general method of averaging for the superapproximation of an arbitrary partial derivative of a smooth function in a vertex of a simplicial triangulation of a bounded polytopic domain in for any is described and its complexity is analysed.
Component mode synthesis and eigenvalues of second order operators : discretization and algorithm
Componentwise Inclusion and Exclusion Sets for Solutions of Quadratic Equations in Finite Dimensional Spaces.