Japonský projekt piatej generácie počítačov
Kolmogorov problem in and extremal Zolotarev ω-splines [Book]
Konstruktion und algebraische Eigenschaften von M-Spline-Interpolierenden.
Konvergenz optimaler Differentiationsformeln.
Konvergenzaussagen für Projektionsverfahren bei linearen Operatoren. - Convergence of Projection Methods for Linear Operators.
Koordinatensystem-invariante Ausgleichskegelschnitte
Kubaturformeln mit minimaler Knotenzahl. -Minimum-Point Cubature Formulas.
-error estimates for Dirichlet and Neumann problems on anisotropic finite element meshes
An -estimate of the finite element error is proved for a Dirichlet and a Neumann boundary value problem on a three-dimensional, prismatic and non-convex domain that is discretized by an anisotropic tetrahedral mesh. To this end, an approximation error estimate for an interpolation operator that is preserving the Dirichlet boundary conditions is given. The challenge for the Neumann problem is the proof of a local interpolation error estimate for functions from a weighted Sobolev space.
L1-Approximation verallgemeinerter konvexer Funktionen durch Splines mit freien Knoten.
L2-approximation by the translates of a function and related attenuation factors.
La différentiation automatique et son utilisation en optimisation
In this work, we present an introduction to automatic differentiation, its use in optimization software, and some new potential usages. We focus on the potential of this technique in optimization. We do not dive deeply in the intricacies of automatic differentiation, but put forward its key ideas. We sketch a survey, as of today, of automatic differentiation software, but warn the reader that the situation with respect to software evolves rapidly. In the last part of the paper, we present some...
La Formula De Simpson Tridimensional.
Lagrange multipliers and geometric measure theory
L'algorithme SEM : un algorithme d'apprentissage probabiliste pour la reconnaissance de mélange de densités
Lanczos-like algorithm for the time-ordered exponential: The -inverse problem
The time-ordered exponential of a time-dependent matrix is defined as the function of that solves the first-order system of coupled linear differential equations with non-constant coefficients encoded in . The authors have recently proposed the first Lanczos-like algorithm capable of evaluating this function. This algorithm relies on inverses of time-dependent functions with respect to a non-commutative convolution-like product, denoted by . Yet, the existence of such inverses, crucial to...
Least squares fitting of piecewise algebraic curves.
Least Squares with a Quadratic Constraint.
Least-squares fitting of circles and ellipses.
Les coefficients optimaux des formules d'intégration approximative
Limites projectives et approximation. Limites inductives