Chebyshevian Multistep Methods for Ordinary Differential Equation.
Checking nonsingularity of tridiagonal matrices.
Checking positive definiteness or stability of symmetric interval matrices is NP-hard
It is proved that checking positive definiteness, stability or nonsingularity of all [symmetric] matrices contained in a symmetric interval matrix is NP-hard.
Checking proportional rates in the two-sample transformation model
Transformation models for two samples of censored data are considered. Main examples are the proportional hazards and proportional odds model. The key assumption of these models is that the ratio of transformation rates (e. g., hazard rates or odds rates) is constant in time. A~method of verification of this proportionality assumption is developed. The proposed procedure is based on the idea of Neyman's smooth test and its data-driven version. The method is suitable for detecting monotonic as well...
Chipman pseudoinverse of matrix, its computation and application in spline theory
Cholesky-like factorizations of skew-symmetric matrices.
Choosing the best -divergence goodness-of-fit statistic in multinomial sampling with linear constraints
In this paper we present a simulation study to analyze the behavior of the -divergence test statistics in the problem of goodness-of-fit for loglinear models with linear constraints and multinomial sampling. We pay special attention to the Rényi’s and -divergence measures.
Chord Techniques and Newton's Method for Discrete Bifurcation Problems.
Chromatic roots of a ring of four cliques.
Circulant preconditioners for convolution-like integral equations with higher-order quadrature rules.
Circular Arithmetic and the Determination of Polynomial Zeros.
Classes of Graphs Which Approximate the Complete Euclidean Graph.
Classical and variational differentiability of BSDEs with quadratic growth.
Classical orthogonal polynomials and Leverrier-Faddeev algorithm for the matrix pencils .
Classification of relative minima singularities
Closed spline curves bounding maximal area.
Closed-form expressions for the approximation of arclength parameterization for Bézier curves
In applications such as CNC machining, highway and railway design, manufacturing industry and animation, there is a need to systematically generate sets of reference points with prescribed arclengths along parametric curves, with sufficient accuracy and real-time performance. Thus, mechanisms to produce a parameter set that yields the coordinates of the reference points along the curve Q(t) = {x(t), y(t)} are sought. Arclength parameterizable expressions usually yield a parameter set that is necessary...
Close-to-optimal algorithm for rectangular decomposition of 3D shapes
In this paper, we propose a novel algorithm for a decomposition of 3D binary shapes to rectangular blocks. The aim is to minimize the number of blocks. Theoretically optimal brute-force algorithm is known to be NP-hard and practically infeasible. We introduce its sub-optimal polynomial heuristic approximation, which transforms the decomposition problem onto a graph-theoretical problem. We compare its performance with the state of the art Octree and Delta methods. We show by extensive experiments...
Coarse-graining schemes and a posteriori error estimates for stochastic lattice systems
The primary objective of this work is to develop coarse-graining schemes for stochastic many-body microscopic models and quantify their effectiveness in terms of a priori and a posteriori error analysis. In this paper we focus on stochastic lattice systems of interacting particles at equilibrium. The proposed algorithms are derived from an initial coarse-grained approximation that is directly computable by Monte Carlo simulations, and the corresponding numerical error is calculated using the...
Coarsening invariance and bucket-sorted independent sets for algebraic multigrid.