Page 1 Next

Displaying 1 – 20 of 51

Showing per page

Cálculo rápido de las funciones de Bessel modificadas Kis(X) e Iis(X) y sus derivadas.

Lluís Closas Torrente, Juan Antonio Fernández Rubio (1987)

Stochastica

En este trabajo discutimos la resolución de la ecuación de Besseld2x/dx2 + (1/x)(dy/dx) - (1 - s2/x2)y = 0.Las funciones de Bessel modificadas Kv(x) e Iv(x) son las soluciones a la ecuación anterior cuando v = is. El valor de la función Kis(x) es real y el de la función Iis(x) es complejo, por ello definimos en su lugar una función real Mis(x). La función Iis(x) resultará ser una combinación de las funciones Kis(x) y Mis(x). Daremos algunos desarrollos en serie de Mis(x) y Kis(x) junto con sus derivadas...

Cauchy problems for discrete affine minimal surfaces

Marcos Craizer, Thomas Lewiner, Ralph Teixeira (2012)

Archivum Mathematicum

In this paper we discuss planar quadrilateral (PQ) nets as discrete models for convex affine surfaces. As a main result, we prove a necessary and sufficient condition for a PQ net to admit a Lelieuvre co-normal vector field. Particular attention is given to the class of surfaces with discrete harmonic co-normals, which we call discrete affine minimal surfaces, and the subclass of surfaces with co-planar discrete harmonic co-normals, which we call discrete improper affine spheres. Within this classes,...

Closed-form expressions for the approximation of arclength parameterization for Bézier curves

Mohsen Madi (2004)

International Journal of Applied Mathematics and Computer Science

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

Cyril Höschl IV, Jan Flusser (2019)

Kybernetika

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...

Comparison of explicit and implicit difference schemes for parabolic functional differential equations

Zdzisław Kamont, Karolina Kropielnicka (2012)

Annales Polonici Mathematici

Initial-boundary value problems of Dirichlet type for parabolic functional differential equations are considered. Explicit difference schemes of Euler type and implicit difference methods are investigated. The following theoretical aspects of the methods are presented. Sufficient conditions for the convergence of approximate solutions are given and comparisons of the methods are presented. It is proved that the assumptions on the regularity of the given functions are the same for both methods. It...

Currently displaying 1 – 20 of 51

Page 1 Next