K jedné metodě užívané při výpočtu hodnot komplexních kořenů algebraické rovnice metodou Graeffeovou
K odhadu nepřesnosti výpočtů na nomogramech
K řešeni celými čísly
Kačanov - Galerkin method and its application
Kellogg's iterations for general complex matrix
Kellogg's iterations with minimizing parameters
Kermack-McKendrick epidemics vaccinated
This paper proposes a deterministic model for the spread of an epidemic. We extend the classical Kermack–McKendrick model, so that a more general contact rate is chosen and a vaccination added. The model is governed by a differential equation (DE) for the time dynamics of the susceptibles, infectives and removals subpopulation. We present some conditions on the existence and uniqueness of a solution to the nonlinear DE. The existence of limits and uniqueness of maximum of infected individuals are...
Kernel-function Based Primal-Dual Algorithms for P*(κ) Linear Complementarity Problems
Recently, [Y.Q. Bai, M. El Ghami and C. Roos, SIAM J. Opt. 15 (2004) 101–128] investigated a new class of kernel functions which differs from the class of self-regular kernel functions. The class is defined by some simple conditions on the growth and the barrier behavior of the kernel function. In this paper we generalize the analysis presented in the above paper for P*(κ) Linear Complementarity Problems (LCPs). The analysis for LCPs deviates significantly from the analysis for linear optimization....
Kloosterman-type sums and the discrepancy of nonoverlapping pairs of inversive congruential pseudorandom numbers
Knowledge-based Green's kernel for support vector regression.
Kolmogorov complexity, pseudorandom generators and statistical models testing
An attempt to formalize heuristic concepts like strings (sequences resp.) “typical” for a probability measure is stated in the paper. Both generating and testing of such strings is considered. Kolmogorov complexity theory is used as a tool. Classes of strings “typical” for a given probability measure are introduced. It is shown that no pseudorandom generator can produce long strings from the classes. The time complexity of pseudorandom generators with oracles capable to recognize “typical” strings...
Kolmogorov problem in and extremal Zolotarev ω-splines [Book]
Konstruktion und algebraische Eigenschaften von M-Spline-Interpolierenden.
Konvergenz eines Differenzverfahrens für quasilineare parabolische Anfangs-Randwertprobleme in Zylindersymmetrie.
Konvergenz optimaler Differentiationsformeln.
Konvergenz und monotone Einschliessung für das Steffensen-Verfahren.
Konvergenzaussagen für Kollokationsverfahren bei elliptischen Randwertaufgaben.
Konvergenzaussagen für Projektionsverfahren bei linearen Operatoren. - Convergence of Projection Methods for Linear Operators.
Konvergenzbeschleunigung durch modifiziertes Picard-Verfahren
Koordinatensystem-invariante Ausgleichskegelschnitte