Les processus de surveillance. Étude et simulation d'un cas
Level sets of uniform quotient mappings from Rn to R do not need to be locally connected.
We give an example of a uniform quotient map from R2 to R which has non-locally connected level sets.
Lidstone continuous and discrete boundary value problems.
Lie groups and error analysis.
Likelihood ratio rank tests for the two-sample problem with randomly censored data
Limited-memory variable metric methods based on invariant matrices
Limited-memory variable metric methods that use quantities from the preceding iteration
Limites projectives et approximation. Limites inductives
Line Search by Curve Fitting in Minimization Algorithms.
Linear abhängige Punktfunktionale bei zweidimensionalen Interpolations- und Approximationsproblemen.
Linear Acceleration of Picard-Lindelöf Iteration.
Linear Algorithms for Testing the Sign Stability of a Matrix and for Finding Z-Maximum Matchings in Acyclic Graphs.
Linear comparative calibration with correlated measurements
The paper deals with the linear comparative calibration problem, i. e. the situation when both variables are subject to errors. Considered is a quite general model which allows to include possibly correlated data (measurements). From statistical point of view the model could be represented by the linear errors-in-variables (EIV) model. We suggest an iterative algorithm for estimation the parameters of the analysis function (inverse of the calibration line) and we solve the problem of deriving the...
Linear complementarity problem and extremal hyperplanes
Linear convergence in the approximation of rank-one convex envelopes
A linearly convergent iterative algorithm that approximates the rank-1 convex envelope of a given function , i.e. the largest function below which is convex along all rank-1 lines, is established. The proposed algorithm is a modified version of an approximation scheme due to Dolzmann and Walkington.
Linear convergence in the approximation of rank-one convex envelopes
A linearly convergent iterative algorithm that approximates the rank-1 convex envelope of a given function , i.e. the largest function below f which is convex along all rank-1 lines, is established. The proposed algorithm is a modified version of an approximation scheme due to Dolzmann and Walkington.
Linear Coonvergence of the Row Cyclic Jacobi and Kogbetliantz Methods.
Linear differential equations - global theory
Linear discriminant analysis with a generalization of the Moore-Penrose pseudoinverse
The Linear Discriminant Analysis (LDA) technique is an important and well-developed area of classification, and to date many linear (and also nonlinear) discrimination methods have been put forward. A complication in applying LDA to real data occurs when the number of features exceeds that of observations. In this case, the covariance estimates do not have full rank, and thus cannot be inverted. There are a number of ways to deal with this problem. In this paper, we propose improving LDA in this...
Linear distributional differential equations of the second order
The paper deals with the linear differential equation (0.1) with distributional coefficients and solutions from the space of regulated functions. Our aim is to get the basic existence and uniqueness results for the equation (0.1) and to generalize the known results due to F. V. Atkinson [At], J. Ligeza [Li1]-[Li3], R. Pfaff ([Pf1], [Pf2]), A. B. Mingarelli [Mi] as well as the results from the paper [Pe-Tv] concerning the equation (0.1).