Discrete Newton Methods and Iterated Defect Corrections.
Discrete, Nonlinear Approximation Problems in Polyhedral Norms.
Discrete, Nonlinear Approximation Problems in Polyhedral Norms. A Levenberg-Like Algorithm.
Discrete periodic geodesics in a surface.
Discrete quadratic splines.
Discrete Riccati equation solutions: Distributed algorithms.
Discrete smoothing splines and digital filtration. Theory and applications
Two universally applicable smoothing operations adjustable to meet the specific properties of the given smoothing problem are widely used: 1. Smoothing splines and 2. Smoothing digital convolution filters. The first operation is related to the data vector with respect to the operations , and to the smoothing parameter . The resulting function is denoted by . The measured sample is defined on an equally spaced mesh
Discrete Sobolev and Poincaré inequalities for piecewise polynomial functions.
Discrete Sobolev inequalities and error estimates for finite volume solutions of convection diffusion equations
The topic of this work is to obtain discrete Sobolev inequalities for piecewise constant functions, and to deduce error estimates on the approximate solutions of convection diffusion equations by finite volume schemes.
Discrete Sobolev inequalities and Lp error estimates for finite volume solutions of convection diffusion equations
The topic of this work is to obtain discrete Sobolev inequalities for piecewise constant functions, and to deduce Lp error estimates on the approximate solutions of convection diffusion equations by finite volume schemes.
Discrete Sobolev spaces and regularity of elliptic difference schemes
Discrete Variational Green's Function. II. One Dimensional Problem.
Discrete wavelet transforms accelerated sparse preconditioners for dense boundary element systems.
Discrete-time symmetric polynomial equations with complex coefficients
Discrete-time symmetric polynomial equations with complex coefficients are studied in the scalar and matrix case. New theoretical results are derived and several algorithms are proposed and evaluated. Polynomial reduction algorithms are first described to study theoretical properties of the equations. Sylvester matrix algorithms are then developed to solve numerically the equations. The algorithms are implemented in the Polynomial Toolbox for Matlab.
Discrétisation d'une équation différentielle stochastique et calcul approché d'espérances de fonctionnelles de la solution
Discretization and Morse-Smale dynamical systems on planar discs.
Discretization and some qualitative properties of ordinary differential equations about equilibria.
Discretization by Finite Elements of a Model Parameter Dependent Problem.
Discretization errors at free boundaries of the Grad-Schlüter-Shafranov equation.
Discretization methods with analytical characteristic methods for advection-diffusion-reaction equations and 2d applications
Our studies are motivated by a desire to model long-time simulations of possible scenarios for a waste disposal. Numerical methods are developed for solving the arising systems of convection-diffusion-dispersion-reaction equations, and the received results of several discretization methods are presented. We concentrate on linear reaction systems, which can be solved analytically. In the numerical methods, we use large time-steps to achieve long simulation times of about 10 000 years. We propose...